Henry Yuen
@henryyuen.bsky.social
Complexity, in all its forms.
Associate Professor of Computer Science at Columbia University.
http://www.henryyuen.net
Associate Professor of Computer Science at Columbia University.
http://www.henryyuen.net
Reposted by Henry Yuen
How to turn off Gmail's ability to read your emails to train its bots: www.malwarebytes.com/blog/news/20...
Gmail can read your emails and attachments to train its AI, unless you opt out
A new Gmail update may allow Google to use your private messages and attachments for AI training. Here's how to turn it off.
www.malwarebytes.com
November 22, 2025 at 2:03 PM
How to turn off Gmail's ability to read your emails to train its bots: www.malwarebytes.com/blog/news/20...
My student @johnbostanci.bsky.social, Chinmay Nirkhe, Jonas Haferkamp, and Mark Zhandry have put out a tour-de-force paper that shows, relative to a classical oracle, QMA is stronger than QCMA -- i.e., quantum proofs >> classical proofs. Congratulations to the authors! arxiv.org/abs/2511.09551
Separating QMA from QCMA with a classical oracle
We construct a classical oracle proving that, in a relativized setting, the set of languages decidable by an efficient quantum verifier with a quantum witness (QMA) is strictly bigger than those decid...
arxiv.org
November 13, 2025 at 2:59 AM
My student @johnbostanci.bsky.social, Chinmay Nirkhe, Jonas Haferkamp, and Mark Zhandry have put out a tour-de-force paper that shows, relative to a classical oracle, QMA is stronger than QCMA -- i.e., quantum proofs >> classical proofs. Congratulations to the authors! arxiv.org/abs/2511.09551
Reposted by Henry Yuen
The list of accepted papers for #QIP2026 is now online at qip2026.lu.lv/programme/ac...
Accepted papers
qip2026.lu.lv
November 11, 2025 at 1:28 PM
The list of accepted papers for #QIP2026 is now online at qip2026.lu.lv/programme/ac...
Reposted by Henry Yuen
You could also work with Debbie Leung, Richard Cleve, David Gosset, Luke Schaefer, Ashwin Nayak, Norbert Lutkenhaus, Mike Mosca, Christine Muschik or some combination of us if you do theory.
If you are interested in doing a postdoc with me, please apply to the IQC postdoctoral fellowship here: iqc-uwaterloo.slideroom.com#/login/progr...
University of Waterloo
Attn: Institute for Quantum Computing - SlideRoom
Apply to University of Waterloo
Attn: Institute for Quantum Computing. Powered by SlideRoom.
iqc-uwaterloo.slideroom.com
November 7, 2025 at 2:32 AM
You could also work with Debbie Leung, Richard Cleve, David Gosset, Luke Schaefer, Ashwin Nayak, Norbert Lutkenhaus, Mike Mosca, Christine Muschik or some combination of us if you do theory.
Reposted by Henry Yuen
I do phase estimation without QFT in my undergrad course. youtu.be/CMqPutlG59c?...
It's just Hadamard test plus binary search.
It's just Hadamard test plus binary search.
#60/100: 1-qubit Rotation Estimation: Overview || Quantum Computer Programming in 100 Easy Lessons
YouTube video by Ryan O'Donnell
youtu.be
October 28, 2025 at 7:13 AM
I do phase estimation without QFT in my undergrad course. youtu.be/CMqPutlG59c?...
It's just Hadamard test plus binary search.
It's just Hadamard test plus binary search.
Reposted by Henry Yuen
Academics in Assyria in the 7th c BC complain that admin is preventing them from doing research and teaching
November 3, 2025 at 10:04 AM
Academics in Assyria in the 7th c BC complain that admin is preventing them from doing research and teaching
Tomorrow I am teaching quantum phase estimation in my Intro to Quantum Computing Class for the seventh time. I was prepared to teach it the standard, textbook, Nielsen and Chuang way: applied controlled unitaries and their powers thereof, apply inverse QFT to the ancillas.
October 28, 2025 at 12:50 AM
Tomorrow I am teaching quantum phase estimation in my Intro to Quantum Computing Class for the seventh time. I was prepared to teach it the standard, textbook, Nielsen and Chuang way: applied controlled unitaries and their powers thereof, apply inverse QFT to the ancillas.
Reposted by Henry Yuen
Dr. Jane Goodall filmed an interview with Netflix in March 2025 that she understood would only be released after her death.
October 5, 2025 at 9:08 AM
Dr. Jane Goodall filmed an interview with Netflix in March 2025 that she understood would only be released after her death.
Reposted by Henry Yuen
The submission server for #ITCS2026 (which will take place at Bocconi University, Milan, in January 2026) is open!
Submission deadline: Sep 4 (abstracts), Sep 6 (papers)
itcs-conf.org
Submission deadline: Sep 4 (abstracts), Sep 6 (papers)
itcs-conf.org
ITCS 2025 Call for Papers
ITCS 2025 CFP
itcs-conf.org
August 24, 2025 at 10:33 PM
The submission server for #ITCS2026 (which will take place at Bocconi University, Milan, in January 2026) is open!
Submission deadline: Sep 4 (abstracts), Sep 6 (papers)
itcs-conf.org
Submission deadline: Sep 4 (abstracts), Sep 6 (papers)
itcs-conf.org
How fast can (pseudo)random unitaries be implemented on a quantum computer? O(1) time suffices (provided you can do things like intermediate measurements)! This -and more- is thanks to a superfun collaboration with Ben Foxman, @nat-parham.bsky.social, and @franvasco.bsky.social (all PhD students!).
In exciting new work with Ben Foxman, @nat-parham.bsky.social , and @henryyuen.bsky.social we show that t-designs and pseudorandom unitaries are implementable in constant (quantum) time!
arxiv.org/abs/2508.11487
arxiv.org/abs/2508.11487
Random Unitaries in Constant (Quantum) Time
Random unitaries are a central object of study in quantum information, with applications to quantum computation, quantum many-body physics, and quantum cryptography. Recent work has constructed unitar...
arxiv.org
August 19, 2025 at 12:54 AM
How fast can (pseudo)random unitaries be implemented on a quantum computer? O(1) time suffices (provided you can do things like intermediate measurements)! This -and more- is thanks to a superfun collaboration with Ben Foxman, @nat-parham.bsky.social, and @franvasco.bsky.social (all PhD students!).
Donation link here: www.ipam.ucla.edu/news/nsf-fun...
August 8, 2025 at 1:04 AM
Donation link here: www.ipam.ucla.edu/news/nsf-fun...
Reposted by Henry Yuen
the scenario we all feared
August 5, 2025 at 6:33 PM
the scenario we all feared
Come for the iconic papers and eye-wateringly beautiful textbooks, stay for the stories "from the trenches" (of which I hope John posts more of!). Keep writing, @johnwatrous.bsky.social !
Bluehost seems to be holding my domain name hostage, I gather in an effort to sell me more products and services. Avoid them at all costs.
But see if I care. Hereafter you can find my web page at jhwatrous.github.io in case you're looking for it.
But see if I care. Hereafter you can find my web page at jhwatrous.github.io in case you're looking for it.
I ditched my old website and created a new one on GitHub Pages:
johnwatrous.com
It's a great option for a static web page, particularly if you like to do your own CSS styling rather than flipping through pre-built templates that are never quite right.
johnwatrous.com
It's a great option for a static web page, particularly if you like to do your own CSS styling rather than flipping through pre-built templates that are never quite right.
August 2, 2025 at 7:10 PM
Come for the iconic papers and eye-wateringly beautiful textbooks, stay for the stories "from the trenches" (of which I hope John posts more of!). Keep writing, @johnwatrous.bsky.social !
Reposted by Henry Yuen
Out today in @quantamagazine.bsky.social: a new path toward building quantum cryptography on much harder problems than the ones used for classical encryption. Fascinating stuff!
Quantum Scientists Have Built a New Math of Cryptography | Quanta Magazine
In theory, quantum physics can bypass the hard mathematical problems at the root of modern encryption. A new proof shows how.
www.quantamagazine.org
July 25, 2025 at 2:37 PM
Out today in @quantamagazine.bsky.social: a new path toward building quantum cryptography on much harder problems than the ones used for classical encryption. Fascinating stuff!
Reposted by Henry Yuen
From our very thoughtful law school colleague, David Pozen, a first take on the Columbia deal.
balkin.blogspot.com/2025/07/regu...
balkin.blogspot.com/2025/07/regu...
Balkinization: Regulation by Deal Comes to Higher Ed
A group blog on constitutional law, theory, and politics
balkin.blogspot.com
July 24, 2025 at 1:44 AM
From our very thoughtful law school colleague, David Pozen, a first take on the Columbia deal.
balkin.blogspot.com/2025/07/regu...
balkin.blogspot.com/2025/07/regu...
One of the great joys of 2025 (so far) has been learning about nonlocal quantum computation. It's an astonishingly interesting playground of ideas. In this fun collaboration with @hippoquantus.bsky.social, Simon, Alex, Mikka, and Philip, we uncover some hidden structure in this playground.
We have a new preprint out on the topic of quantum position verification and non-local quantum computation (NLQC): scirate.com/arxiv/2505.2.... We are comparing different NLQC tasks and find reductions between them (in the sense of if I can do task 1, then I can do task 2 with an extra EPR pair).
A complexity theory for non-local quantum computation
Non-local quantum computation (NLQC) replaces a local interaction between two systems with a single round of communication and shared entanglement. Despite many partial results, it is known that a cha...
scirate.com
June 2, 2025 at 1:42 PM
One of the great joys of 2025 (so far) has been learning about nonlocal quantum computation. It's an astonishingly interesting playground of ideas. In this fun collaboration with @hippoquantus.bsky.social, Simon, Alex, Mikka, and Philip, we uncover some hidden structure in this playground.
Reposted by Henry Yuen
As seen in Prospect Park, Brooklyn. Peter Carr was a great mathematician with an expertise in finance. I had the honor of being a colleague of his at Cornell before he moved to NYU, where he became a legendary teacher and a professor, much beloved.
June 1, 2025 at 10:55 AM
As seen in Prospect Park, Brooklyn. Peter Carr was a great mathematician with an expertise in finance. I had the honor of being a colleague of his at Cornell before he moved to NYU, where he became a legendary teacher and a professor, much beloved.
Reposted by Henry Yuen
The first rule of the One-Way Communication Complexity club is that Bob doesn't talk about the One-Way Communication Complexity club
May 27, 2025 at 8:49 PM
The first rule of the One-Way Communication Complexity club is that Bob doesn't talk about the One-Way Communication Complexity club
Reposted by Henry Yuen
Space and time are the most fundamental resources in computation, and researchers have long sought to understand how they’re related. A recent breakthrough by Ryan Williams marks the first progress on that question in 50 years. Read more in @quantamagazine.bsky.social!
For Algorithms, a Little Memory Outweighs a Lot of Time | Quanta Magazine
One computer scientist’s “stunning” proof is the first progress in 50 years on one of the most famous questions in computer science.
www.quantamagazine.org
May 21, 2025 at 3:07 PM
Space and time are the most fundamental resources in computation, and researchers have long sought to understand how they’re related. A recent breakthrough by Ryan Williams marks the first progress on that question in 50 years. Read more in @quantamagazine.bsky.social!
Reposted by Henry Yuen
First there was MATH POPE
Then there was MATH PRESIDENT
Then there was MATH PRESIDENT
Math professor wins in Romania - against a pro-Putin pro-Trump opponent. A victory for logic and reason.
Breaking News: Nicusor Dan, Bucharest’s centrist mayor, won Romania’s presidential election, defeating a hard-right candidate who is aligned with President Trump and has opposed military aid to Ukraine.
May 18, 2025 at 11:13 PM
First there was MATH POPE
Then there was MATH PRESIDENT
Then there was MATH PRESIDENT
On Friday I made my first-ever calls to congress to oppose funding cuts to NSF. It was super easy — it took just a couple minutes, and I read off a script provided by Save NSF (www.savensf.com). Afterwards, I felt good. The pervasive sense of powerlessness was held at bay, at least temporarily.(1/8)
Home | Save NSF
Save NSF is a coalition of concerned scientists and allies who are working to save funding for scientific grants through the U.S. National Science Foundation.
Our mission is to support the science...
www.savensf.com
May 18, 2025 at 3:30 AM
On Friday I made my first-ever calls to congress to oppose funding cuts to NSF. It was super easy — it took just a couple minutes, and I read off a script provided by Save NSF (www.savensf.com). Afterwards, I felt good. The pervasive sense of powerlessness was held at bay, at least temporarily.(1/8)
Reposted by Henry Yuen
New: We have the list of ~190 Harvard NSF grant terminations from internal agency sources. About $148 million intended funds killed. Over 1/3 are from the MPS directorate—roughly 75 math and physics grants.
May 15, 2025 at 7:07 PM
New: We have the list of ~190 Harvard NSF grant terminations from internal agency sources. About $148 million intended funds killed. Over 1/3 are from the MPS directorate—roughly 75 math and physics grants.
Reposted by Henry Yuen
Accepted papers at TQC 2025. tqc-conference.org/accepted-tal.... Many interesting-looking titles!
Accepted talks | TQC Conference 2025
tqc-conference.org
May 10, 2025 at 4:23 PM
Accepted papers at TQC 2025. tqc-conference.org/accepted-tal.... Many interesting-looking titles!
Reposted by Henry Yuen
Prakash Murali and I are seeking to jointly recruit a postdoctoral researcher (Dowling postdoctoral fellow) at Cambridge focused on quantum algorithms, complexity, error correction, and architecture.
Further details: www.jobs.cam.ac.uk/job/50485/
Deadline: 7 April 2025
Further details: www.jobs.cam.ac.uk/job/50485/
Deadline: 7 April 2025
Dowling Fellowship Research Associate (Fixed Term) - Job Opportunities - University of Cambridge
Dowling Fellowship Research Associate (Fixed Term) in the Department of Computer Science and Technology at the University of Cambridge.
www.jobs.cam.ac.uk
March 21, 2025 at 6:29 PM
Prakash Murali and I are seeking to jointly recruit a postdoctoral researcher (Dowling postdoctoral fellow) at Cambridge focused on quantum algorithms, complexity, error correction, and architecture.
Further details: www.jobs.cam.ac.uk/job/50485/
Deadline: 7 April 2025
Further details: www.jobs.cam.ac.uk/job/50485/
Deadline: 7 April 2025