Asked Fable 5.2 to make an animation for our "Quantum Jumps of Sound" result for a presentation I'm giving. Not exactly one-shot, more like ~four-shot. But the result is an HTML file that's about 40kB, captures my intent very well, and looks really nice :)
What we believe might be a world record in optical switch loss! 7mdB!
Quantum hardware that is both manufacturable and scalable, that is what is needed for utility-scale quantum computing and that is what we are building at Xanadu.
This 7 mdB optical switch loss achievement is a clear proof point for our leading photonics technology and a critical step forward on the path to commercialization.
Learn more: globenewswire.com/news-relea…
Xanadu and HyperLight have set a new performance benchmark of 7 mdB optical switch loss using a high-volume manufacturing platform.
By minimizing loss across the system, this milestone enables more practical and scalable photonic quantum hardware and accelerates Xanadu's path to commercialization.
Learn more: globenewswire.com/news-relea…
My dog decided I wasn’t taking him seriously on only playing fetch with toys other than balls so he got a ball and maintained eye contact with me as he destroyed it.
#BurnTheShips
Breaking RSA-2048 with 23,000 cat qubits. 🐈 In 3.14 days
This is the finding of our new paper, the latest resource estimate for Shor’s algorithm, the benchmark the whole field uses to compare quantum hardware 📄
The results are a record low for total quantum resources at this speed of execution, about 40 times fewer physical qubits than @GoogleQuantumAI 's Craig Gidney 2025 estimate. 🏁
RSA-2048 is the lock behind secure websites, banking and software updates 🔐 Shor's algorithm has been able to break it, on paper since 1994. Nobody has built the machine yet, but every year the estimate of how big it needs to be gets a little smaller.
In 2019, the best estimate was 20 million qubits. In 2024, ours was just under 100,000. Now 22,593, in 3.14 days. Yes, pi 🥧
Small isn't enough. Fast isn't enough. The new study optimizes for both. 😼
Bitcoin, Ethereum and most blockchains aren't secure either, about 30,000 qubits would be needed to crack a Bitcoin key in about an hour ₿ ⏳
How we got here, what it means for cryptography, and when it all converges, our CEO Théau Peronnin talks about it in the blog 👇
📝 Blog - alice-bob.com/blog/our-estim…
📄 Paper - eprint.iacr.org/2026/2665
Stay curious, more info coming soon 👀
#QuantumComputing#CatQubits#ShorsAlgorithm#PostQuantumCryptography#Cryptography#FaultTolerance#DeepTech
Congratulations to our founder and Chief Science Officer, Dr. Dana Z. Anderson, who was formally inducted into the National Academy of Engineering (@theNAEng) this weekend in Washington, D.C.
NAE membership is one of the highest honors in engineering, with new members elected by their peers. Dana was recognized for "contributions to optical quantum engineering of ultracold atoms."
Behind those words are decades of work connecting fundamental science with practical technology. Through his research at the University of Colorado Boulder (@CUBoulder) and JILA (@JILAscience) and his founding of ColdQuanta, now @infleqtion, Dana helped bring atom-based quantum technology to life. That work laid the groundwork for much of what we build today.
Those of us who work alongside Dana see his conviction every day: that extraordinary science can solve real problems. He is relentless about making that happen.
This is a well-deserved honor. Thank you, Dana, for the vision that started Infleqtion and the determination that continues to move us forward.
The US government will give your startup up to $1.55M and take 0% equity.
@NSF's America's Seed Fund is open again after Congress reauthorized it in April.
Three tracks:
- Phase I: up to $305K to prove the idea
- Phase II: up to $1.25M to build it
- Fast-Track: up to $1.55M, both phases in one go
Who can apply:
- US-based startups with 500 or fewer employees
- 51%+ owned by US citizens or permanent residents
- Not majority owned by VCs
- All the work done in the US
How it works:
- Send a 3-page Project Pitch first
- NSF invites the best ones to submit a full proposal
- Next full proposal deadline: Nov 4
Phase I funding rates have run about 10 to 20%. It's work, but nobody takes your cap table.
Application link 👉 seedfund.nsf.gov
Bookmark and tag a tech founder who needs this.
A new postdoc fellowship worth passing along: the MIT Quantum Initiative (QMIT) fellowship, supported by the Moore Foundation.
Up to 17 fellows, across physics, chemistry, materials, and the bio and Earth sciences. For PhDs from Jan 2025 on, starting in 2027. Due October 23.
ANNOUNCING THE 2026 WOLF PRIZE LAUREATES IN PHYSICS
The 2026 Wolf Prize in Physics is awarded to Immanuel F. Bloch and Jun Ye “for transformative, widely applicable advances in the control of ultracold atomic systems.”
Their work has pushed experimental physics into realms that were once almost impossible to control.
Bloch established ultracold atoms trapped in optical lattices as a powerful platform for studying complex quantum systems. His work helped define the modern field of quantum simulation, revealing new insights into many-body quantum states and laying foundations for emerging quantum technologies.
Ye, meanwhile, led the development of the world’s most accurate and stable optical atomic clocks, achieving levels of precision that have reshaped how time and frequency can be measured. His work has also opened new ways to test fundamental physics, from relativity to searches for variations in nature’s fundamental constants.
From controlling quantum matter to measuring time with unprecedented precision, their discoveries have expanded what physicists can observe, test, and engineer.
Congratulations to Immanuel F. Bloch and Jun Ye, the 2026 Wolf Prize Laureates in Physics.
@NIST@maxplanckpress
Jun Ye has been named a 2026 Wolf Prize laureate in Physics! 🏆
Ye shares the prize with Immanuel Bloch, Max Planck Institute for "transformative, widely applicable advances in the control of ultracold atomic systems."
Read more: colorado.edu/physics/2026/10…@CUBoulderPhys@NIST@CUBoulder
A provable quantum advantage for approximate optimization via decoded quantum interferometry
scirate.com/arxiv/2610.02145
This is a piece of work I am particularly happy with. We prove a quantum advantage for approximate #optimization: in an oracle setting, a quantum algorithm achieves a strictly better approximation ratio than any polynomial-time classical algorithm.
Our problem is folded optimal polynomial intersection: find a low-degree polynomial whose grouped evaluations pass as many acceptance tests as possible. The folded Reed–Solomon code is given explicitly. Independently sampled acceptance sets, each containing half the block alphabet, are accessed through separate membership oracles. Each query tests whether a proposed symbol is accepted in one classically chosen block. Quantum algorithms can query that block’s membership predicate coherently, over a superposition of input symbols.
#Decodedquantuminterferometry (DQI) connects optimization and coding theory through Fourier interference and decoding. At code rate 0.3, it achieves an asymptotic expected score of approximately 0.857 using one coherent query per block.
Exceeding the classical threshold of 0.65 by any fixed amount, with constant probability on sampled instances, requires super-polynomially many classical membership queries—even with unlimited computation between queries. A modified quantum algorithm reaches a score of 0.95 with constant success probability on typical sampled instances.
For me, the particularly satisfying point is that the classical lower bound covers every algorithm in this oracle model, including algorithms we have not yet discovered. Warm thanks to Maximilian Johannes Kramer, @EliesMiquel, Benjamin D.M. Jones and @FJSchreiber.
Attention arXiv authors. Because of the exponential increase in submissions, arXiv is limiting the number of papers that a person can submit each month to two. 1/
arXiv has updated our policy on rate limiting for all submitters.
This update was made to fairly distribute moderator time & support the arXiv community of staff, volunteers, readers & authors.
Please read our announcement to learn more: blog.arxiv.org/2026/10/01/up…
Quantum coding schemes typically rely on knowing the underlying state or channel. In “Universal quantum coding,” we show how to distil entanglement and communicate quantum information without this prior knowledge.
scirate.com/arxiv/2609.38038
The key is the good old Schur–Weyl duality, but with a new twist: the symmetry structure of many identical copies provides quantum code spaces whose errors can be identified and corrected through representation theory.
The resulting protocols require no tomography and achieve coherent-information rates, with exponentially vanishing error and optimal second-order corrections. Their sample complexity depends on relevant spectral ranks rather than the full Hilbert-space dimensions. Symmetry thus provides a common mechanism for entanglement distillation, quantum error correction and quantum communication—even when the state or channel is unknown.
Thanks to the dream team of @jacoporz, @LamiLudovico, and @lorenzo_leone_ for the wonderful collaboration.
How much does a quantum algorithm gain from access to the circuit that prepares its input, rather than just copies of the resulting state? How does the oracle access matter?
scirate.com/arxiv/2609.35656
In our new work on the state hidden subgroup problem, we give a sharp answer for finite abelian groups. We establish optimal bounds in both settings and find a quadratic improvement when the algorithm can coherently use the preparation circuit and its inverse. Even the most general collective measurement on state copies cannot match it.
The result also gives faster ways to learn stabilizer groups, locate unentanglement, and identify hidden translation symmetries. It is a concrete example of how the way we access an input can change the complexity of a quantum problem.
Warm thanks to Yuhan Liu, Jose Carrasco, and @ikiga1 for this wonderful @FU_Berlin-@maxplanckpress-collaboration.