Sunny He
@sunnyhe.bsky.social
Grad student at MIT, looking for logical qubits. sunnyzhiyanghe.github.io
Reposted by Sunny He
Fault-tolerant logical measurement just got a lot faster!
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
October 17, 2025 at 5:36 AM
Fault-tolerant logical measurement just got a lot faster!
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
Quantum code surgery, but get them for constant time a piece if you run many of them.
arxiv.org/abs/2510.14895
Joint work with Alex Cowtan, Dom Williamson and Ted Yoder.
arxiv.org/abs/2510.14895
Joint work with Alex Cowtan, Dom Williamson and Ted Yoder.
Fast and fault-tolerant logical measurements: Auxiliary hypergraphs and transversal surgery
Quantum code surgery is a promising technique to perform fault-tolerant computation on quantum low-density parity-check codes. Recent developments have significantly reduced the space overhead of surg...
arxiv.org
October 17, 2025 at 3:47 AM
Quantum code surgery, but get them for constant time a piece if you run many of them.
arxiv.org/abs/2510.14895
Joint work with Alex Cowtan, Dom Williamson and Ted Yoder.
arxiv.org/abs/2510.14895
Joint work with Alex Cowtan, Dom Williamson and Ted Yoder.
Reposted by Sunny He
Have you heard of high-density parity-check codes before? Anyways, layer codes with random HDPC input codes have provable and numerical partial self-correction properties.
arxiv.org/abs/2510.06659
Joint work with Shouzhen Gu, Libor Caha, Shin Ho Choe, Aleksander Kubica, and Eugene Tang.
arxiv.org/abs/2510.06659
Joint work with Shouzhen Gu, Libor Caha, Shin Ho Choe, Aleksander Kubica, and Eugene Tang.
Layer codes as partially self-correcting quantum memories
We investigate layer codes, a family of three-dimensional stabilizer codes that can achieve optimal scaling of code parameters and a polynomial energy barrier, as candidates for self-correcting quantu...
arxiv.org
October 9, 2025 at 11:43 AM
Have you heard of high-density parity-check codes before? Anyways, layer codes with random HDPC input codes have provable and numerical partial self-correction properties.
arxiv.org/abs/2510.06659
Joint work with Shouzhen Gu, Libor Caha, Shin Ho Choe, Aleksander Kubica, and Eugene Tang.
arxiv.org/abs/2510.06659
Joint work with Shouzhen Gu, Libor Caha, Shin Ho Choe, Aleksander Kubica, and Eugene Tang.
Check it out: permutation unitaries in the 3rd level of the Clifford hierarchy whose inverses escape any fixed, finite level of the hierarchy.
arxiv.org/abs/2510.04993
Joint work with Luke Robitaille and Xinyu (Norah) Tan.
arxiv.org/abs/2510.04993
Joint work with Luke Robitaille and Xinyu (Norah) Tan.
Characterization of permutation gates in the third level of the Clifford hierarchy
The Clifford hierarchy is a fundamental structure in quantum computation whose mathematical properties are not fully understood. In this work, we characterize permutation gates -- unitaries which perm...
arxiv.org
October 7, 2025 at 2:27 AM
Check it out: permutation unitaries in the 3rd level of the Clifford hierarchy whose inverses escape any fixed, finite level of the hierarchy.
arxiv.org/abs/2510.04993
Joint work with Luke Robitaille and Xinyu (Norah) Tan.
arxiv.org/abs/2510.04993
Joint work with Luke Robitaille and Xinyu (Norah) Tan.
Reposted by Sunny He
Can ChatGPT help with research? Maybe not yet for finding new results, but it can certainly speed up some tedious tasks.
An example about quantum Tanner codes #qLDPC
Working with qudits (d=5) lets you use nice local codes [4,2,3]_5. Then the idea is simply to enumerate small groups and (1/4)
An example about quantum Tanner codes #qLDPC
Working with qudits (d=5) lets you use nice local codes [4,2,3]_5. Then the idea is simply to enumerate small groups and (1/4)
September 18, 2025 at 2:40 PM
Can ChatGPT help with research? Maybe not yet for finding new results, but it can certainly speed up some tedious tasks.
An example about quantum Tanner codes #qLDPC
Working with qudits (d=5) lets you use nice local codes [4,2,3]_5. Then the idea is simply to enumerate small groups and (1/4)
An example about quantum Tanner codes #qLDPC
Working with qudits (d=5) lets you use nice local codes [4,2,3]_5. Then the idea is simply to enumerate small groups and (1/4)
Reposted by Sunny He
Very exciting announcement, the next Quantum Error Correction conference QEC26 will be hosted by Google 7-12 June 2026 in Santa Barbara. See you there! @dripto.bsky.social @mattmcewen.bsky.social
August 12, 2025 at 9:54 PM
Very exciting announcement, the next Quantum Error Correction conference QEC26 will be hosted by Google 7-12 June 2026 in Santa Barbara. See you there! @dripto.bsky.social @mattmcewen.bsky.social
Fault-tolerance is, at its core, a combinatorial study.
arxiv.org/abs/2508.08246
arxiv.org/abs/2508.08246
Composable Quantum Fault-Tolerance
Proving threshold theorems for fault-tolerant quantum computation is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways. It is difficult and rare ...
arxiv.org
August 12, 2025 at 3:17 AM
Fault-tolerance is, at its core, a combinatorial study.
arxiv.org/abs/2508.08246
arxiv.org/abs/2508.08246
Reposted by Sunny He
The QIP 2026 call for papers is out! QIP 2026 will be held in Riga, Latvia from January 24–30, 2026. See you there!
qip2026.lu.lv
qip2026.lu.lv
August 6, 2025 at 12:44 AM
The QIP 2026 call for papers is out! QIP 2026 will be held in Riga, Latvia from January 24–30, 2026. See you there!
qip2026.lu.lv
qip2026.lu.lv
In May I gave a talk at Simons about our recent work on extractors architectures, which is a surgery-powered proposal to perform universal Pauli-based computation on any QLDPC codes, with reasonable overheads.
arxiv.org/abs/2503.10390
The talk recording is here:
www.youtube.com/watch?v=L6cDAbaW2Zs
arxiv.org/abs/2503.10390
The talk recording is here:
www.youtube.com/watch?v=L6cDAbaW2Zs
Extractors: Building a Quantum Computer with QLDPC Codes
YouTube video by Simons Institute for the Theory of Computing
www.youtube.com
July 17, 2025 at 2:14 AM
In May I gave a talk at Simons about our recent work on extractors architectures, which is a surgery-powered proposal to perform universal Pauli-based computation on any QLDPC codes, with reasonable overheads.
arxiv.org/abs/2503.10390
The talk recording is here:
www.youtube.com/watch?v=L6cDAbaW2Zs
arxiv.org/abs/2503.10390
The talk recording is here:
www.youtube.com/watch?v=L6cDAbaW2Zs
Our paper on logical magic state distillation was just published in Nature! www.nature.com/articles/s41...
Experimental demonstration of logical magic state distillation - Nature
Nature - Experimental demonstration of logical magic state distillation
www.nature.com
July 17, 2025 at 2:08 AM
Our paper on logical magic state distillation was just published in Nature! www.nature.com/articles/s41...
Reposted by Sunny He
New preprint out!!
scirate.com/arxiv/2507.0...
Here, we follow up our previous work by constructing the first asymptotically good quantum codes to have transversally addressable non-Clifford gates.
scirate.com/arxiv/2507.0...
Here, we follow up our previous work by constructing the first asymptotically good quantum codes to have transversally addressable non-Clifford gates.
Asymptotically Good Quantum Codes with Addressable and Transversal Non-Clifford Gates
Constructing quantum codes with good parameters and useful transversal gates is a central problem in quantum error correction. In this paper, we continue our work in arXiv:2502.01864 and construct the...
scirate.com
July 9, 2025 at 2:33 AM
New preprint out!!
scirate.com/arxiv/2507.0...
Here, we follow up our previous work by constructing the first asymptotically good quantum codes to have transversally addressable non-Clifford gates.
scirate.com/arxiv/2507.0...
Here, we follow up our previous work by constructing the first asymptotically good quantum codes to have transversally addressable non-Clifford gates.
Reposted by Sunny He
Raymond Laflamme 1960-2025. A great scientist, renowned for his pioneering contributions to quantum error correction. A great leader, founding director of the Institute for Quantum Computing. A great colleague and teacher whose legacy continues to inspire us.
uwaterloo.ca/institute-fo...
uwaterloo.ca/institute-fo...
IQC and Waterloo mourn the loss of Raymond Laflamme | Institute for Quantum Computing | University of Waterloo
Raymond Laflamme, a trailblazer in quantum information processing and pioneer of the Institute for Quantum Computing (IQC) at the University of Waterloo, died on June 19 after a lengthy battle with ca...
uwaterloo.ca
June 21, 2025 at 10:41 PM
Raymond Laflamme 1960-2025. A great scientist, renowned for his pioneering contributions to quantum error correction. A great leader, founding director of the Institute for Quantum Computing. A great colleague and teacher whose legacy continues to inspire us.
uwaterloo.ca/institute-fo...
uwaterloo.ca/institute-fo...
Amazing work from the IBM Quantum team on the bicycle architecture, a proposal for a modular quantum computer built using bivariate bicycle codes as memory and code surgery + automorphisms + T state factory for universal computation. arxiv.org/abs/2506.03094
Tour de gross: A modular quantum computer based on bivariate bicycle codes
We present the bicycle architecture, a modular quantum computing framework based on high-rate, low-overhead quantum LDPC codes identified in prior work. For two specific bivariate bicycle codes with d...
arxiv.org
June 5, 2025 at 1:49 AM
Amazing work from the IBM Quantum team on the bicycle architecture, a proposal for a modular quantum computer built using bivariate bicycle codes as memory and code surgery + automorphisms + T state factory for universal computation. arxiv.org/abs/2506.03094
Reposted by Sunny He
It's a thrill to announce names of the amazing set of theory people joining NYU CS+CSE this year: @aineshbakshi.bsky.social, Allen Liu, @fermima.bsky.social, Sanjeev Khanna, Tony Metger, and Juan Perdomo.
@nyucourant.bsky.social
@nyutandon.bsky.social
@nyucourant.bsky.social
@nyutandon.bsky.social
June 3, 2025 at 9:20 PM
It's a thrill to announce names of the amazing set of theory people joining NYU CS+CSE this year: @aineshbakshi.bsky.social, Allen Liu, @fermima.bsky.social, Sanjeev Khanna, Tony Metger, and Juan Perdomo.
@nyucourant.bsky.social
@nyutandon.bsky.social
@nyucourant.bsky.social
@nyutandon.bsky.social
Reposted by Sunny He
Great work by the IBM Quantum team on Relay-BP, a BP-only heuristic decoder for general qLDPC codes. From a first look, the performance seems strong and further supports qLDPC architectures from a decoding-focused perspective.
arxiv.org/abs/2506.01779
arxiv.org/abs/2506.01779
Improved belief propagation is sufficient for real-time decoding of quantum memory
We introduce a new heuristic decoder, Relay-BP, targeting real-time quantum circuit decoding for large-scale quantum computers. Relay-BP achieves high accuracy across circuit-noise decoding problems: ...
arxiv.org
June 3, 2025 at 8:28 AM
Great work by the IBM Quantum team on Relay-BP, a BP-only heuristic decoder for general qLDPC codes. From a first look, the performance seems strong and further supports qLDPC architectures from a decoding-focused perspective.
arxiv.org/abs/2506.01779
arxiv.org/abs/2506.01779
Reposted by Sunny He
I'm often asked if I'll redo the 2019 quantum factoring estimate. Denser storage by yokes, smaller magic factories by cultivation, slimmer approx arithmetic by Chevignard et al… surely the cost is lower now?
Yes, it's lower now.
security.googleblog.com/2025/05/trac...
arxiv.org/abs/2505.15917
Yes, it's lower now.
security.googleblog.com/2025/05/trac...
arxiv.org/abs/2505.15917
May 23, 2025 at 1:25 PM
I'm often asked if I'll redo the 2019 quantum factoring estimate. Denser storage by yokes, smaller magic factories by cultivation, slimmer approx arithmetic by Chevignard et al… surely the cost is lower now?
Yes, it's lower now.
security.googleblog.com/2025/05/trac...
arxiv.org/abs/2505.15917
Yes, it's lower now.
security.googleblog.com/2025/05/trac...
arxiv.org/abs/2505.15917
Reposted by Sunny He
Mike finally paid for the "pro" version of sketchup, so we owned the 3d models attached to the paper, meaning the yoked surface codes paper is now published! www.nature.com/articles/s41...
The message of this paper is: anytime someone says they're 10x better than surface codes, actually it's 4x.
The message of this paper is: anytime someone says they're 10x better than surface codes, actually it's 4x.
May 14, 2025 at 10:14 PM
Mike finally paid for the "pro" version of sketchup, so we owned the 3d models attached to the paper, meaning the yoked surface codes paper is now published! www.nature.com/articles/s41...
The message of this paper is: anytime someone says they're 10x better than surface codes, actually it's 4x.
The message of this paper is: anytime someone says they're 10x better than surface codes, actually it's 4x.
Reposted by Sunny He
Happy to share that some previous work with @krishnanirudh.bsky.social and @preskill.bsky.social that we call hierarchical codes (2303.04798) was recently published in Quantum! 1/9
May 9, 2025 at 8:20 PM
Happy to share that some previous work with @krishnanirudh.bsky.social and @preskill.bsky.social that we call hierarchical codes (2303.04798) was recently published in Quantum! 1/9
Reposted by Sunny He
For sigbovik, I factored all 8 bit ints (up to 255) with a quantum computer github.com/strilanc/fal...
I did it as legit as I possibly could. I ran a correct circuit with no optimization shenanigans. I did correct pre/postprocessing.
It took 121 quantum samples to finish the entire task.
But...
I did it as legit as I possibly could. I ran a correct circuit with no optimization shenanigans. I did correct pre/postprocessing.
It took 121 quantum samples to finish the entire task.
But...
April 1, 2025 at 10:26 PM
For sigbovik, I factored all 8 bit ints (up to 255) with a quantum computer github.com/strilanc/fal...
I did it as legit as I possibly could. I ran a correct circuit with no optimization shenanigans. I did correct pre/postprocessing.
It took 121 quantum samples to finish the entire task.
But...
I did it as legit as I possibly could. I ran a correct circuit with no optimization shenanigans. I did correct pre/postprocessing.
It took 121 quantum samples to finish the entire task.
But...
Reposted by Sunny He
Only one week left to submit a contributed talk to QEC 25!
qec25.yalepages.org
August 11 - 15, 2025, hosted at Yale University.
This promises to be the best QEC yet!
Please repost!
qec25.yalepages.org
August 11 - 15, 2025, hosted at Yale University.
This promises to be the best QEC yet!
Please repost!
QEC25
qec25.yalepages.org
March 21, 2025 at 10:54 PM
Only one week left to submit a contributed talk to QEC 25!
qec25.yalepages.org
August 11 - 15, 2025, hosted at Yale University.
This promises to be the best QEC yet!
Please repost!
qec25.yalepages.org
August 11 - 15, 2025, hosted at Yale University.
This promises to be the best QEC yet!
Please repost!
Reposted by Sunny He
QLDPC codes are a promising approach to efficient quantum memory. However, performing computation on such high-density memory is notoriously difficult.
In a new work, we introduce extractors, which can be attached to any code block to augment it into a quantum processor.
arxiv.org/abs/2503.10390
In a new work, we introduce extractors, which can be attached to any code block to augment it into a quantum processor.
arxiv.org/abs/2503.10390
Extractors: QLDPC Architectures for Efficient Pauli-Based Computation
In pursuit of large-scale fault-tolerant quantum computation, quantum low-density parity-check (LPDC) codes have been established as promising candidates for low-overhead memory when compared to conve...
arxiv.org
March 14, 2025 at 6:22 AM
QLDPC codes are a promising approach to efficient quantum memory. However, performing computation on such high-density memory is notoriously difficult.
In a new work, we introduce extractors, which can be attached to any code block to augment it into a quantum processor.
arxiv.org/abs/2503.10390
In a new work, we introduce extractors, which can be attached to any code block to augment it into a quantum processor.
arxiv.org/abs/2503.10390