Senrui Chen
@csenrui.bsky.social
IQIM Postdoctoral Scholar at Caltech / PhD from UChicago PME / Quantum / Homepage: csenrui.github.io
Reposted by Senrui Chen
New paper out ✨
Fault-tolerant Transformation of Spacetime Codes, a collaboration w/ @vasmer.bsky.social, Austin Daniel & Ilan Tzitrin, which started during my internship @xanaduai.bsky.social
scirate.com/arxiv/2509.0...
Let's now see if I can summarize 101 pages (🙈) in a few tweets (and memes!)
Fault-tolerant Transformation of Spacetime Codes, a collaboration w/ @vasmer.bsky.social, Austin Daniel & Ilan Tzitrin, which started during my internship @xanaduai.bsky.social
scirate.com/arxiv/2509.0...
Let's now see if I can summarize 101 pages (🙈) in a few tweets (and memes!)
September 13, 2025 at 11:05 AM
New paper out ✨
Fault-tolerant Transformation of Spacetime Codes, a collaboration w/ @vasmer.bsky.social, Austin Daniel & Ilan Tzitrin, which started during my internship @xanaduai.bsky.social
scirate.com/arxiv/2509.0...
Let's now see if I can summarize 101 pages (🙈) in a few tweets (and memes!)
Fault-tolerant Transformation of Spacetime Codes, a collaboration w/ @vasmer.bsky.social, Austin Daniel & Ilan Tzitrin, which started during my internship @xanaduai.bsky.social
scirate.com/arxiv/2509.0...
Let's now see if I can summarize 101 pages (🙈) in a few tweets (and memes!)
Reposted by Senrui Chen
New arXiv preprint: we show algorithmic versions of the polynomial Freiman–Ruzsa (PFR) theorem of Gowers, Green, Manners, and Tao. Interestingly, our proof draws on quantum information and stabilizer learning algorithms, which we dequantize into classical algorithms.
arxiv.org/pdf/2509.02338
arxiv.org/pdf/2509.02338
September 3, 2025 at 8:48 AM
New arXiv preprint: we show algorithmic versions of the polynomial Freiman–Ruzsa (PFR) theorem of Gowers, Green, Manners, and Tao. Interestingly, our proof draws on quantum information and stabilizer learning algorithms, which we dequantize into classical algorithms.
arxiv.org/pdf/2509.02338
arxiv.org/pdf/2509.02338
Correction: the talk will start at 12:30 ET
Come join the team for ⚛️ Quantum Wednesday!
This week, we'll discuss 𝗟𝗲𝗮𝗿𝗻𝗶𝗻𝗴 𝗮𝗻𝗱 𝗺𝗶𝘁𝗶𝗴𝗮𝘁𝗶𝗻𝗴 𝗣𝗮𝘂𝗹𝗶 𝗻𝗼𝗶𝘀𝗲 𝘀𝗲𝗹𝗳-𝗰𝗼𝗻𝘀𝗶𝘀𝘁𝗲𝗻𝘁𝗹𝘆 lead by our guest speaker 𝗦𝗲𝗻𝗿𝘂𝗶 𝗖𝗵𝗲𝗻.
🔗 Discord: buff.ly/GFRk4B9
📚 Paper: buff.ly/nlT3Ljg
This week, we'll discuss 𝗟𝗲𝗮𝗿𝗻𝗶𝗻𝗴 𝗮𝗻𝗱 𝗺𝗶𝘁𝗶𝗴𝗮𝘁𝗶𝗻𝗴 𝗣𝗮𝘂𝗹𝗶 𝗻𝗼𝗶𝘀𝗲 𝘀𝗲𝗹𝗳-𝗰𝗼𝗻𝘀𝗶𝘀𝘁𝗲𝗻𝘁𝗹𝘆 lead by our guest speaker 𝗦𝗲𝗻𝗿𝘂𝗶 𝗖𝗵𝗲𝗻.
🔗 Discord: buff.ly/GFRk4B9
📚 Paper: buff.ly/nlT3Ljg
August 20, 2025 at 3:14 PM
Correction: the talk will start at 12:30 ET
Reposted by Senrui Chen
come listen to @csenrui.bsky.social talk about his recent work at tomorrows seminar on the UF discord. It's open to anyone to attend :)
Come join the team for ⚛️ Quantum Wednesday!
This week, we'll discuss 𝗟𝗲𝗮𝗿𝗻𝗶𝗻𝗴 𝗮𝗻𝗱 𝗺𝗶𝘁𝗶𝗴𝗮𝘁𝗶𝗻𝗴 𝗣𝗮𝘂𝗹𝗶 𝗻𝗼𝗶𝘀𝗲 𝘀𝗲𝗹𝗳-𝗰𝗼𝗻𝘀𝗶𝘀𝘁𝗲𝗻𝘁𝗹𝘆 lead by our guest speaker 𝗦𝗲𝗻𝗿𝘂𝗶 𝗖𝗵𝗲𝗻.
🔗 Discord: buff.ly/GFRk4B9
📚 Paper: buff.ly/nlT3Ljg
This week, we'll discuss 𝗟𝗲𝗮𝗿𝗻𝗶𝗻𝗴 𝗮𝗻𝗱 𝗺𝗶𝘁𝗶𝗴𝗮𝘁𝗶𝗻𝗴 𝗣𝗮𝘂𝗹𝗶 𝗻𝗼𝗶𝘀𝗲 𝘀𝗲𝗹𝗳-𝗰𝗼𝗻𝘀𝗶𝘀𝘁𝗲𝗻𝘁𝗹𝘆 lead by our guest speaker 𝗦𝗲𝗻𝗿𝘂𝗶 𝗖𝗵𝗲𝗻.
🔗 Discord: buff.ly/GFRk4B9
📚 Paper: buff.ly/nlT3Ljg
August 19, 2025 at 2:56 PM
come listen to @csenrui.bsky.social talk about his recent work at tomorrows seminar on the UF discord. It's open to anyone to attend :)
Reposted by Senrui Chen
It took me a while, but I (finally) wrote a "short" (erm) note on the "polynomial+moments method" to prove testing or indistinguishability sample complexity lower bounds. Including the infamous Ω(k/log k) tolerant uniformity testing one.
Comments and feedback welcome!
📝 github.com/ccanonne/pro...
Comments and feedback welcome!
📝 github.com/ccanonne/pro...
August 17, 2025 at 11:56 AM
It took me a while, but I (finally) wrote a "short" (erm) note on the "polynomial+moments method" to prove testing or indistinguishability sample complexity lower bounds. Including the infamous Ω(k/log k) tolerant uniformity testing one.
Comments and feedback welcome!
📝 github.com/ccanonne/pro...
Comments and feedback welcome!
📝 github.com/ccanonne/pro...
Reposted by Senrui Chen
The QEC25 conference hosted by @yaleqi.bsky.social was really excellent, and videos of all talks are available. So much recent progress on quantum error correction!
qec25.yalepages.org
qec25.yalepages.org
QEC25
qec25.yalepages.org
August 17, 2025 at 5:32 PM
The QEC25 conference hosted by @yaleqi.bsky.social was really excellent, and videos of all talks are available. So much recent progress on quantum error correction!
qec25.yalepages.org
qec25.yalepages.org
Reposted by Senrui Chen
UChicago PME Quantum Engineering PhD student Su-un Lee is spending the summer interning with the #quantum algorithms team at IBM.
Read his Q&A in UChicago PME’s Engineering the Summer series: pme.uchicago.edu/news/enginee...
Read his Q&A in UChicago PME’s Engineering the Summer series: pme.uchicago.edu/news/enginee...
Engineering the summer: Advancing quantum computing at IBM
pme.uchicago.edu
July 23, 2025 at 7:28 PM
UChicago PME Quantum Engineering PhD student Su-un Lee is spending the summer interning with the #quantum algorithms team at IBM.
Read his Q&A in UChicago PME’s Engineering the Summer series: pme.uchicago.edu/news/enginee...
Read his Q&A in UChicago PME’s Engineering the Summer series: pme.uchicago.edu/news/enginee...
Reposted by Senrui Chen
What is the min depth you need for a random unitary?
In this work w/ Tommy Schuster, @RobertHuangHY, Fernando Brandão (arxiv.org/abs/2507.06216) we glue random unitary blocks w/ only random phases on log n qubits (fns on log n bits) to get designs in d = log k log log n 🧩
1/8
In this work w/ Tommy Schuster, @RobertHuangHY, Fernando Brandão (arxiv.org/abs/2507.06216) we glue random unitary blocks w/ only random phases on log n qubits (fns on log n bits) to get designs in d = log k log log n 🧩
1/8
July 9, 2025 at 4:13 AM
What is the min depth you need for a random unitary?
In this work w/ Tommy Schuster, @RobertHuangHY, Fernando Brandão (arxiv.org/abs/2507.06216) we glue random unitary blocks w/ only random phases on log n qubits (fns on log n bits) to get designs in d = log k log log n 🧩
1/8
In this work w/ Tommy Schuster, @RobertHuangHY, Fernando Brandão (arxiv.org/abs/2507.06216) we glue random unitary blocks w/ only random phases on log n qubits (fns on log n bits) to get designs in d = log k log log n 🧩
1/8
Reposted by Senrui Chen
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...
🪇Disambiguating Pauli noise in quantum computers
scirate.com/arxiv/2505.2...
Quantum noise characterization suffers from "gauge ambiguity" due to noisy initialization and measurements. We show this does not stop us from correctly mitigating errors, both in theory and in up to 92-qubit experiments
scirate.com/arxiv/2505.2...
Quantum noise characterization suffers from "gauge ambiguity" due to noisy initialization and measurements. We show this does not stop us from correctly mitigating errors, both in theory and in up to 92-qubit experiments
May 31, 2025 at 7:18 PM
🪇Disambiguating Pauli noise in quantum computers
scirate.com/arxiv/2505.2...
Quantum noise characterization suffers from "gauge ambiguity" due to noisy initialization and measurements. We show this does not stop us from correctly mitigating errors, both in theory and in up to 92-qubit experiments
scirate.com/arxiv/2505.2...
Quantum noise characterization suffers from "gauge ambiguity" due to noisy initialization and measurements. We show this does not stop us from correctly mitigating errors, both in theory and in up to 92-qubit experiments
Reposted by Senrui Chen
I'm hiring a postdoc! If you'd like to work with me on quantum learning, error correction, quantum algorithms, and FTQC at Virginia Tech in the Washington, DC metro area, please apply here: careers.pageuppeople.com/968/cw/en-us...
Details | Postdoctoral Associate - Computer Science | Careers | Division of Human Resources | Virginia Tech
careers.pageuppeople.com
April 28, 2025 at 7:43 PM
I'm hiring a postdoc! If you'd like to work with me on quantum learning, error correction, quantum algorithms, and FTQC at Virginia Tech in the Washington, DC metro area, please apply here: careers.pageuppeople.com/968/cw/en-us...
I defended my PhD dissertation today!! 🍾🎓⚛️
Thank you to everyone who supported me along this wonderful journey!
Thank you to everyone who supported me along this wonderful journey!
April 15, 2025 at 10:11 PM
I defended my PhD dissertation today!! 🍾🎓⚛️
Thank you to everyone who supported me along this wonderful journey!
Thank you to everyone who supported me along this wonderful journey!
Reposted by Senrui Chen
Excited to share our first major result from our IARPA Entangled Logical Qubits team!
arxiv.org/abs/2504.07258
@benbrown.bsky.social @universal-soup.bsky.social @evanhockings.bsky.social @georgianixon.bsky.social
arxiv.org/abs/2504.07258
@benbrown.bsky.social @universal-soup.bsky.social @evanhockings.bsky.social @georgianixon.bsky.social
April 11, 2025 at 1:06 AM
Excited to share our first major result from our IARPA Entangled Logical Qubits team!
arxiv.org/abs/2504.07258
@benbrown.bsky.social @universal-soup.bsky.social @evanhockings.bsky.social @georgianixon.bsky.social
arxiv.org/abs/2504.07258
@benbrown.bsky.social @universal-soup.bsky.social @evanhockings.bsky.social @georgianixon.bsky.social
Reposted by Senrui Chen
1/n I'm excited to share our latest work, Demonstration of robust and efficient quantum property learning with shallow shadows, published in Nature Communications! 🎉
📝 Authors: Hong-Ye Hu, Andi Gu, Swarnadeep Majumder, Hang Ren, Yipei Zhang, Derek S. Wang, Yi-Zhuang You, Zlatko Minev,
📝 Authors: Hong-Ye Hu, Andi Gu, Swarnadeep Majumder, Hang Ren, Yipei Zhang, Derek S. Wang, Yi-Zhuang You, Zlatko Minev,
March 26, 2025 at 5:49 PM
1/n I'm excited to share our latest work, Demonstration of robust and efficient quantum property learning with shallow shadows, published in Nature Communications! 🎉
📝 Authors: Hong-Ye Hu, Andi Gu, Swarnadeep Majumder, Hang Ren, Yipei Zhang, Derek S. Wang, Yi-Zhuang You, Zlatko Minev,
📝 Authors: Hong-Ye Hu, Andi Gu, Swarnadeep Majumder, Hang Ren, Yipei Zhang, Derek S. Wang, Yi-Zhuang You, Zlatko Minev,
Won APS ducks at #APSSummit25 #apsmarch with Su-un Lee and Kento Tsubouchi
March 22, 2025 at 5:18 PM
Won APS ducks at #APSSummit25 #apsmarch with Su-un Lee and Kento Tsubouchi
Reposted by Senrui Chen
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!
Heading to Anaheim for #APSSummit25 #apsmarch.
I will be giving two talks, both on Monday:
1⃣ Efficient self-consistent learning of gate set Pauli noise, 10:24 – 11:00, 258A
2⃣ Generalized cycle benchmarking algorithm for characterizing mid-circuit measurements, 3:36 - 3:48, 256B
I will be giving two talks, both on Monday:
1⃣ Efficient self-consistent learning of gate set Pauli noise, 10:24 – 11:00, 258A
2⃣ Generalized cycle benchmarking algorithm for characterizing mid-circuit measurements, 3:36 - 3:48, 256B
March 16, 2025 at 4:05 PM
Heading to Anaheim for #APSSummit25 #apsmarch.
I will be giving two talks, both on Monday:
1⃣ Efficient self-consistent learning of gate set Pauli noise, 10:24 – 11:00, 258A
2⃣ Generalized cycle benchmarking algorithm for characterizing mid-circuit measurements, 3:36 - 3:48, 256B
I will be giving two talks, both on Monday:
1⃣ Efficient self-consistent learning of gate set Pauli noise, 10:24 – 11:00, 258A
2⃣ Generalized cycle benchmarking algorithm for characterizing mid-circuit measurements, 3:36 - 3:48, 256B
Reposted by Senrui Chen
Why characterise noise in syndrome extraction circuits? One reason: directly improving quantum error correction!
In simulations of the surface code, we find that noise-aware decoding—calibrating the decoder with noise estimates—improves the code's error suppression factor.
In simulations of the surface code, we find that noise-aware decoding—calibrating the decoder with noise estimates—improves the code's error suppression factor.
March 3, 2025 at 7:32 AM
Why characterise noise in syndrome extraction circuits? One reason: directly improving quantum error correction!
In simulations of the surface code, we find that noise-aware decoding—calibrating the decoder with noise estimates—improves the code's error suppression factor.
In simulations of the surface code, we find that noise-aware decoding—calibrating the decoder with noise estimates—improves the code's error suppression factor.
Reposted by Senrui Chen
1/n I am stepping away from IBM Quantum after nearly 7 years. This was an unforgettable chapter of my life where I was blessed with the best of colleagues, on a joint mission to bring useful quantum computing to the world, and to help bring up the next generation of young scientists.
Stepping away
Stepping away
March 1, 2025 at 4:49 PM
1/n I am stepping away from IBM Quantum after nearly 7 years. This was an unforgettable chapter of my life where I was blessed with the best of colleagues, on a joint mission to bring useful quantum computing to the world, and to help bring up the next generation of young scientists.
Stepping away
Stepping away
Reposted by Senrui Chen
If qubits only talk to 1D neighbors, is constant rate fault tolerance possible?
Last year I referee'd a paper claiming it wasn't. My review was "this is wrong but the constructive disproof is too large for this review".
Clearly a reviewer 2 move. Sorry. But I was right! scirate.com/arxiv/2502.1...
Last year I referee'd a paper claiming it wasn't. My review was "this is wrong but the constructive disproof is too large for this review".
Clearly a reviewer 2 move. Sorry. But I was right! scirate.com/arxiv/2502.1...
A Constant Rate Quantum Computer on a Line
We prove by construction that the Bravyi-Poulin-Terhal bound on the spatial density of stabilizer codes does not generalize to stabilizer circuits. To do so, we construct a fault tolerant quantum comp...
scirate.com
February 25, 2025 at 9:08 AM
If qubits only talk to 1D neighbors, is constant rate fault tolerance possible?
Last year I referee'd a paper claiming it wasn't. My review was "this is wrong but the constructive disproof is too large for this review".
Clearly a reviewer 2 move. Sorry. But I was right! scirate.com/arxiv/2502.1...
Last year I referee'd a paper claiming it wasn't. My review was "this is wrong but the constructive disproof is too large for this review".
Clearly a reviewer 2 move. Sorry. But I was right! scirate.com/arxiv/2502.1...
Reposted by Senrui Chen
Check out our recent pre-print: arxiv.org/abs/2502.01864
In this work, we construct the first quantum codes which support transversal and addressable non-Clifford gates!
In this work, we construct the first quantum codes which support transversal and addressable non-Clifford gates!
Quantum Codes with Addressable and Transversal Non-Clifford Gates
The development of quantum codes with good error correction parameters and useful sets of transversal gates is a problem of major interest in quantum error-correction. Abundant prior works have studie...
arxiv.org
February 5, 2025 at 3:44 AM
Check out our recent pre-print: arxiv.org/abs/2502.01864
In this work, we construct the first quantum codes which support transversal and addressable non-Clifford gates!
In this work, we construct the first quantum codes which support transversal and addressable non-Clifford gates!
Reposted by Senrui Chen
When in Canada, use a hockey stick! @markwilde.bsky.social delivers his talk on quantum hypothesis exclusion at the Perimeter Institute with a true Canadian twist 🏒
January 17, 2025 at 8:12 PM
When in Canada, use a hockey stick! @markwilde.bsky.social delivers his talk on quantum hypothesis exclusion at the Perimeter Institute with a true Canadian twist 🏒
Reposted by Senrui Chen
Submissions for QEC 2025 are now open through March 28.
This will easily be the most exciting conference on quantum error correction yet!
Conference homepage:
qec25.yalepages.org
EasyChair submission page:
easychair.org/my/conferenc...
This will easily be the most exciting conference on quantum error correction yet!
Conference homepage:
qec25.yalepages.org
EasyChair submission page:
easychair.org/my/conferenc...
QEC25
qec25.yalepages.org
January 11, 2025 at 1:23 AM
Submissions for QEC 2025 are now open through March 28.
This will easily be the most exciting conference on quantum error correction yet!
Conference homepage:
qec25.yalepages.org
EasyChair submission page:
easychair.org/my/conferenc...
This will easily be the most exciting conference on quantum error correction yet!
Conference homepage:
qec25.yalepages.org
EasyChair submission page:
easychair.org/my/conferenc...
Reposted by Senrui Chen
I'm thrilled to announce my latest work with Marcus Appleby and Gene Kopp, scirate.com/arxiv/2501.0....
In this paper, we attacked the notorious Zauner (SICPOVM) conjecture:
"There exist d^2 equiangular lines in ℂ^d"
It's deceptively simple, but has been open for 25+ years.
🧵 1/9
In this paper, we attacked the notorious Zauner (SICPOVM) conjecture:
"There exist d^2 equiangular lines in ℂ^d"
It's deceptively simple, but has been open for 25+ years.
🧵 1/9
A Constructive Approach to Zauner's Conjecture via the Stark Conjectures
We propose a construction of $d^2$ complex equiangular lines in $\mathbb{C}^d$, also known as SICPOVMs, which were conjectured by Zauner to exist for all d. The construction gives a putatively complet...
scirate.com
January 8, 2025 at 7:30 PM
I'm thrilled to announce my latest work with Marcus Appleby and Gene Kopp, scirate.com/arxiv/2501.0....
In this paper, we attacked the notorious Zauner (SICPOVM) conjecture:
"There exist d^2 equiangular lines in ℂ^d"
It's deceptively simple, but has been open for 25+ years.
🧵 1/9
In this paper, we attacked the notorious Zauner (SICPOVM) conjecture:
"There exist d^2 equiangular lines in ℂ^d"
It's deceptively simple, but has been open for 25+ years.
🧵 1/9