Henry Yuen

Associate Professor of Computer Science at Columbia University. Quantum information, computation, and cryptography.

[Henry Yuen @henryquantum]

@awsTO 🤣

[Henry Yuen @henryquantum]

@awsTO Conjecture?

[Toby Ord @tobyordoxford]

Apollo & Artemis (a thread for Earth Day)
I spent years poring over all 18,000 photos taken by the Apollo program, finding the very best photos of Earth from space and restoring them.
So how do the Artemis photos compare?
🧵

[Henry Yuen @henryquantum]

We thank Air Force Office of Scientific Research (@AFOSR ) for their enthusiastic support of basic, fundamental research. @SEASColumbia @ColumbiaQuantum @Yale_QI @UCSD

[Henry Yuen @henryquantum]

In this MURI project with @sebalexwill (Columbia), @Yongshan_Ding (Yale), @ShrutiPuri11 (Yale), and @danielgrier_ (UCSD), we will explore the potential uses and benefits (and limitations!) of using quantum gates that can act on many qubits at a time.

[The Data Science Institute at Columbia University @DataSciColumbia]

Led by @DataSciColumbia member @henryquantum, a new multi-university grant from @AFOSR will examine whether larger quantum operations could reduce errors & make future quantum computers more practical.

@Columbia @CUSEAS @ColumbiaQuantum @Yale @UCSanDiego
https://t.co/sHeIbAyaBg

[Henry Yuen @henryquantum]

Could there be algorithmic or fault tolerance benefits to using such higher order quantum operations? We'll be looking at this from a theory, systems, and experimental angle. This is a great opportunity to explore unconventional approaches to designing quantum computers.

[Henry Yuen @henryquantum]

@nhaghtal @Berkeley_EECS Congrats!

[Lakshmi Chandrasekaran, PhD (she/her) @science_eye]

Are quantum proofs (solutions) stronger than classical proofs? I cover this in my latest blog- https://t.co/lylau4jguo
Thanks @somechinanigans, @JohnBostanci, Andrew Huang, John Wright, Fermi Ma & Anand Natarajan for the engaging chat! #quantum #theoreticalcomplexity

[Columbia Physics Department @PhysicsColumbia]

Turing Award Goes to Quantum Science
"Bennett and Brassard pioneered the field of quantum information theory... inspired by the ideas of Stephen Wiesner, a graduate student in the Columbia physics department in the 1960s."
https://t.co/mD5l7IqrBq
https://t.co/PMRo92ujtD

[Guanyu Zhu @ZhuGuanyu]

@letonyo After computer scientists won the Nobel Physics prize, physicists now won the Turing Award. What an amazing time!

[John Preskill @preskill]

I'm thrilled that Charlie Bennett and Gilles Brassard have received the A. M. Turing Award for “their essential role in establishing the foundations of quantum information science and transforming secure communication and computing.” Congratulations!
https://t.co/aL25SGiabe

[Tom Gur @TomGur]

Happy days! A perfect excuse to share my favourite quantum cryptography origin story, as recounted in Brassard’s paper:
https://t.co/Nka8ZHdkRM

[Henry Yuen @henryquantum]

@YFilmus Sanjeev Khanna says: will open next week!

[Henry Yuen @henryquantum]

FOCS 2026 will be held in New York City Nov 8 - 11! CFP is up (link below). Submit your best work in theoretical computer science by April 1, 5pm ET.

[Henry Yuen @henryquantum]

@or_sattath I guess I consider high min-entropy "pretty random" :)

[Henry Yuen @henryquantum]

Casper, Nehoran, and Sattath's new paper constructs cryptographically-secure proofs that a given number was randomly generated by a quantum computer, and furthermore the proofs are *publicly verifiable*: you don't have to interact with the quantum computer to believe the proof.

[Or Sattath @or_sattath]

R.I.P. Dilbert’s RNG monster. With a quantum computer, you *can* be sure.

TL;DR: A publicly verifiable witness that a number really came from a distribution with high min-entropy.

Paper: https://t.co/TJyB2SZ1sO

Joint work with Ofer Casper and Barak Nehoran.

[Nirmalya Kajuri @Kaju_Nut]

Ravi Vakil on learning via osmosis from seminars. The backfilling part, where your vague semi-understanding becomes sharp, is very satisfactory.

[Henry Yuen @henryquantum]

@thesasho I guess if everything compiles, assuming no soundness bugs, then in principle the only thing you have to check is whether the final statement is properly formalized (rather than having to check a long proof).

[Henry Yuen @henryquantum]

@benbenbrubaker Transforming quantum data may be less like solving a hard math problem, and more like doing an intricate dance.

[Henry Yuen @henryquantum]

I discuss "fully quantum" complexity theory with @benbenbrubaker. Although we don't know for sure, it seems like understanding the complexity of computing on quantum data needs new foundations.

[Quanta Magazine @QuantaMagazine]

Traditional complexity theory can't accommodate problems with quantum inputs and outputs. Henry Yuen wants to build a new theory that can. @benbenbrubaker reports: https://t.co/O1U1aQdxEz