Sign in

Senrui Chen

@csenrui.bsky.social
515 followers 321 following 15 posts

IQIM Postdoctoral Scholar at Caltech / PhD from UChicago PME / Quantum / Homepage: csenrui.github.io

PostsRepliesMedia
Reposted by Senrui Chen
Francesco Anna Mele @francescoannamele.bsky.social · 27/09/2026
How does classical behaviour emerge from quantum mechanics? In our new paper, we answer this question through the lens of Gaussian state learning. arxiv.org/pdf/2609.26705
162
Reposted by Senrui Chen
Clément Canonne @ccanonne.github.io · 25/04/2026
Call for Workshops, Tutorials, and Community Events at #COLT2026: submit ypur proposal by ⏰ May 7 (AoE)! Details: learningtheory.org/colt2026/wor... (from Lydia Zakynthinou, Workshops and Tutorials chair)
learningtheory.org
COLT 2026 - Call for Workshop Proposals
054
Reposted by Senrui Chen
Francesco Anna Mele @francescoannamele.bsky.social · 20/03/2026
In today’s paper, we make important advances in our understanding of tomography of CV Gaussian states! arxiv.org/pdf/2603.18136 1/
191
Reposted by Senrui Chen
Arthur Pesah @arthurpesah.bsky.social · 13/09/2025
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!)
1344
Reposted by Senrui Chen
Tom Gur @tomgur.bsky.social · 03/09/2025
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
2273
Senrui Chen @csenrui.bsky.social · 20/08/2025
Correction: the talk will start at 12:30 ET
030
Reposted by Senrui Chen
nate @loglog.wtf · 19/08/2025
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 :)
031
Reposted by Senrui Chen
Clément Canonne @ccanonne.github.io · 17/08/2025
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...
One framed box from the note, which states that matching enough moments of a pair of suitable univariate random variables implies a sample complexity lower bound for the yes and no instances they correspond to.
3246
Reposted by Senrui Chen
John Preskill @preskill.bsky.social · 17/08/2025
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
1267
Reposted by Senrui Chen
UChicago Pritzker Molecular Engineering @uchicagopme.bsky.social · 23/07/2025
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...
pme.uchicago.edu
Engineering the summer: Advancing quantum computing at IBM
051
Reposted by Senrui Chen
laura cui @reionize.bsky.social · 09/07/2025
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
Title: Unitary designs in nearly optimal depth, Abstract: We construct ε-approximate unitary k-designs on n qubits in circuit depth O(log k log log nk/ε). The depth is exponentially improved over all known results in all three parameters n, k, ε. We further show that each dependence is optimal up to exponentially smaller factors. Our construction uses Õ(nk) ancilla qubits and O(nk) bits of randomness, which are also optimal up to log(nk) factors. An alternative construction achieves a smaller ancilla count Õ(n) with circuit depth O(k log log nk/ε). To achieve these efficient unitary designs, we introduce a highly-structured random unitary ensemble that leverages long-range two-qubit gates and low-depth implementations of random classical hash functions. We also develop a new analytical framework for bounding errors in quantum experiments involving many queries to random unitaries. As an illustration of this framework's versatility, we provide a succinct alternative proof of the existence of pseudorandom unitaries.
1353
Reposted by Senrui Chen
John Preskill @preskill.bsky.social · 21/06/2025
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
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...
08421
Senrui Chen @csenrui.bsky.social · 31/05/2025
🪇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
1120
Reposted by Senrui Chen
Steve Flammia @sflammia.bsky.social · 28/04/2025
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...
careers.pageuppeople.com
Details | Postdoctoral Associate - Computer Science | Careers | Division of Human Resources | Virginia Tech
03413
Senrui Chen @csenrui.bsky.social · 15/04/2025
I defended my PhD dissertation today!! 🍾🎓⚛️ Thank you to everyone who supported me along this wonderful journey!
5461
Reposted by Senrui Chen
Stephen Bartlett @bartlettquantum.bsky.social · 11/04/2025
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
1215
Reposted by Senrui Chen
Zlatko Minev @zlatko-minev.bsky.social · 26/03/2025
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,
191
Senrui Chen @csenrui.bsky.social · 22/03/2025
Won APS ducks at #APSSummit25 #apsmarch with Su-un Lee and Kento Tsubouchi
030
Reposted by Senrui Chen
Steve Flammia @sflammia.bsky.social · 21/03/2025
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
QEC25
12311
Senrui Chen @csenrui.bsky.social · 16/03/2025
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
040
Reposted by Senrui Chen
Evan Hockings @evanhockings.bsky.social · 03/03/2025
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.
1132
Reposted by Senrui Chen
Zlatko Minev @zlatko-minev.bsky.social · 01/03/2025
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
2502
Reposted by Senrui Chen
Craig Gidney @craiggidney.bsky.social · 25/02/2025
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...
scirate.com
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...
3202
Reposted by Senrui Chen
Adam Wills @adamwills1.bsky.social · 05/02/2025
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!
arxiv.org
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...
1272
Reposted by Senrui Chen
Farzin Salek @fsalek.bsky.social · 17/01/2025
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 🏒
3242
Reposted by Senrui Chen
Steve Flammia @sflammia.bsky.social · 11/01/2025
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...
qec25.yalepages.org
QEC25
05019
Reposted by Senrui Chen
Steve Flammia @sflammia.bsky.social · 08/01/2025
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
scirate.com
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...
2544
Reposted by Senrui Chen
John Preskill @preskill.bsky.social · 14/12/2024
I created a transcript of my talk at the Q2B Conference: "Beyond NISQ: The Megaquop Machine." You can read it here: quantumfrontiers.com/2024/12/14/b...
quantumfrontiers.com
Beyond NISQ: The Megaquop Machine
On December 11, I gave a keynote address at the Q2B 2024 Conference in Silicon Valley. This is a transcript of my remarks. The slides I presented are here. NISQ and beyond I’m honored to be back at…
03111
Reposted by Senrui Chen
Felix Leditzky 🏳️‍🌈🏳️‍⚧️ @felixled.bsky.social · 09/12/2024
List of accepted talks for #QIP2025 rsvp.duke.edu/event/qip202...
rsvp.duke.edu
28th Quantum Information Processing Conference (QIP2025).
This description will appear on the summary page of your event website..
24210
Senrui Chen @csenrui.bsky.social · 09/12/2024
Waterloo Park in autumn and winter
Photo of Waterloo Park in autumnPhoto of Waterloo Park in winter
080
Reposted by Senrui Chen
Peyman Milanfar @docmilanfar.bsky.social · 29/11/2024
The Gaussian is a nice bumpy shape, but sometimes we hope for a smooth (i.e. C∞) function like the Gaussian that is 𝒂𝒍𝒔𝒐 compactly supported. One such class of functions is called "Bump functions" 1/6
413718
Reposted by Senrui Chen
Kartik @k4rtik.bsky.social · 12/11/2024
Just created a Quantum Computing Starter Pack. Please reach out if I missed to add you. go.bsky.app/KBgRwmZ
374023