Sunny He
@sunnyhe.bsky.social
π€ 84
π₯ 69
π 18
Grad student at MIT, looking for logical qubits. sunnyzhiyanghe.github.io
reposted by
Sunny He
Harry Zhou
18 days ago
Excited to share our paper
arxiv.org/abs/2604.16209
on ultra-high-rate codes co-designed for atom arrays! We co-design qLDPC codes with rates around 1/2, showing that they can reach good logical error rates under a circuit-level noise model. This was a fun project with Chen, Nishad, Casey and Andi.
loading . . .
Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
Quantum error correction is widely believed to be essential for large-scale quantum computation, but the required qubit overhead remains a central challenge. Quantum low-density parity-check codes can...
https://arxiv.org/abs/2604.16209
1
15
1
Great program this year!
add a skeleton here at some point
20 days ago
0
1
0
reposted by
Sunny He
Dripto Debroy
20 days ago
Accepted submissions for QEC26 are out:
qec-conference.org/2026/accepte...
. Congratulations! If you are attending QEC, a few reminders below:
loading . . .
Accepted Papers
Invited Speakers Natalie C. Brown (Quantinuum) Vedika Khemani (Stanford University) Anthony Leverrier (Inria) Yue Wu (Microsoft) List of Accepted Contributed Talks (presented in order of submission) T...
https://qec-conference.org/2026/accepted-papers/
1
6
4
reposted by
Sunny He
Chris Pattison
28 days ago
This is a good example of why you should be cautious when extrapolating to the low logical error rate regime
arxiv.org/abs/2604.08358
0
8
1
reposted by
Sunny He
Craig Gidney
about 1 month ago
I would bet against Q day by 2030, but I wouldn't bet against it at 10:1 odds. ~10% risk is unacceptably high here, so I'm very in favor of transitioning to quantum-safe cryptography by 2029:
blog.google/innovation-a...
Yes this means I 90% expect to be made fun of in 2030. Oh well.
loading . . .
Quantum frontiers may be closer than they appear
An overview of how Google is accelerating its timeline for post-quantum cryptography migration.
https://blog.google/innovation-and-ai/technology/safety-security/cryptography-migration-timeline/
1
22
7
Don't know what Quantum Youtube is, but π
add a skeleton here at some point
2 months ago
0
2
0
Good old code surgery, now more parsimonious than ever.
arxiv.org/abs/2603.05082
Joint work with amazing collaborators Andrew Yuan, Alex Cowtan, David Lin, and Dom Williamson.
loading . . .
Parsimonious Quantum Low-Density Parity-Check Code Surgery
Quantum code surgery offers a flexible, low-overhead framework for executing logical measurements within quantum error-correcting codes. It encompasses several fault-tolerant logical computation schem...
https://arxiv.org/abs/2603.05082
2 months ago
0
9
2
reposted by
Sunny He
3 months ago
Gave a talk recently at Coogee on constructing and analysing spacetime volumes of LDPC codes & surgeries thereof. Thanks to
@sunnyhe.bsky.social
@domwilliamson.bsky.social
and Ted Yoder for the wonderful collaboration.
www.youtube.com/watch?v=Lxzw...
loading . . .
Coogee '26 Talks - Alex Cowtan (Xanadu)
YouTube video by Quantum @ Sydney
https://www.youtube.com/watch?v=LxzwhhbG71M
0
6
2
Quantum code surgery: fast, addressable, parallel, (almost) constant space overhead, all at once on your favorite hypergraph product codes.
arxiv.org/abs/2603.021...
loading . . .
Constant-Time Surgery on 2D Hypergraph Product Codes with Near-Constant Space Overhead
Generalized code surgery is a versatile and low-overhead technique for performing fault-tolerant computation on quantum low-density parity-check (qLDPC) codes. In many settings, surgery exhibits pract...
https://arxiv.org/abs/2603.02157v1
2 months ago
1
16
1
reposted by
Sunny He
Harry Zhou
5 months ago
Excited to share our perspective article, written with Maddie Cain and Misha Lukin, on designing low-overhead fault-tolerant architectures:
rdcu.be/eVTiB
. The landscape is rapidly evolving, and excited to see where the field goes next!
loading . . .
Opportunities in full-stack design of low-overhead fault-tolerant quantum computation
Nature Computational Science - Quantum error correction is vital for scalable quantum computing, but it incurs high resource overheads. This Perspective outlines recent breakthroughs and explores...
https://rdcu.be/eVTiB
1
10
2
reposted by
Sunny He
Dom Williamson
7 months ago
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
1
27
8
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.
loading . . .
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...
https://arxiv.org/abs/2510.14895
7 months ago
0
8
0
reposted by
Sunny He
Markus Heinrich
7 months ago
0
34
3
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.
loading . . .
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...
https://arxiv.org/abs/2510.06659
7 months ago
0
3
0
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.
loading . . .
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...
https://arxiv.org/abs/2510.04993
7 months ago
0
3
0
reposted by
Sunny He
8 months ago
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)
7
14
3
reposted by
Sunny He
Error Correction Zoo
9 months ago
Peter Shor receives a small gift on the 30th anniversary of his QEC paper at
#QEC2025
.
0
24
3
reposted by
Sunny He
Stephen Bartlett
9 months ago
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
0
47
9
Fault-tolerance is, at its core, a combinatorial study.
arxiv.org/abs/2508.08246
loading . . .
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 ...
https://arxiv.org/abs/2508.08246
9 months ago
0
4
0
reposted by
Sunny He
Robin Kothari
9 months ago
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
0
28
16
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
loading . . .
Extractors: Building a Quantum Computer with QLDPC Codes
YouTube video by Simons Institute for the Theory of Computing
https://www.youtube.com/watch?v=L6cDAbaW2Zs
10 months ago
1
4
0
Our paper on logical magic state distillation was just published in Nature!
www.nature.com/articles/s41...
loading . . .
Experimental demonstration of logical magic state distillation - Nature
Nature - Experimental demonstration of logical magic state distillation
https://www.nature.com/articles/s41586-025-09367-3
10 months ago
1
4
0
reposted by
Sunny He
Adam Wills
10 months ago
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.
loading . . .
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...
https://scirate.com/arxiv/2507.05392
1
22
2
reposted by
Sunny He
John Preskill
11 months ago
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...
loading . . .
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...
https://uwaterloo.ca/institute-for-quantum-computing/news/legacy-quantum-research-excellence
1
84
29
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
loading . . .
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...
https://arxiv.org/abs/2506.03094
11 months ago
1
6
0
reposted by
Sunny He
Anupam Gupta
11 months ago
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
5
47
8
reposted by
Sunny He
Timo Hillmann
11 months ago
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
loading . . .
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: ...
https://arxiv.org/abs/2506.01779
1
15
1
reposted by
Sunny He
Craig Gidney
12 months ago
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
2
73
18
reposted by
Sunny He
Craig Gidney
12 months ago
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.
0
21
3
reposted by
Sunny He
Chris Pattison
12 months ago
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
1
12
2
reposted by
Sunny He
Craig Gidney
about 1 year ago
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...
2
63
12
reposted by
Sunny He
Steve Flammia
about 1 year ago
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!
loading . . .
QEC25
https://qec25.yalepages.org
1
23
11
reposted by
Sunny He
Dom Williamson
about 1 year ago
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
loading . . .
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...
https://arxiv.org/abs/2503.10390
1
14
1
you reached the end!!
feeds!
log in