QEC25 marks the 7th International Conference on Quantum Error Correction, a prestigious biennial event that has been a cornerstone of the quantum research community since its inception in 2007. Previous editions have been hosted in leading international cities, including Los Angeles, California; Zurich, Switzerland; Washington, District of Columbia; London, UK; and Sydney, Australia. For the 2025 edition, the conference returns to the United States, proudly hosted by the Yale Quantum Institute.
This conference will convene distinguished experts from academia and industry to explore cutting-edge research in theoretical, experimental, and technological advancements towards achieving robust quantum computation. Key topics will include quantum control, error correction, fault tolerance, and their intersection with physics, computer science, and technology.
Scheduled from Monday, August 11 to Friday, August 15, 2025, QEC25 will take place at the Yale Quantum Institute in New Haven, with an anticipated attendance of 400 quantum researchers. A tutorial session will be offered for students and anyone interested the day before, on Sunday, August 10, 2025.
The following scientists will give invited talks during the conference, listed by alphabetical order.
Update June 3, 2025: To accommodate the very large number of submissions to the conference, we have added a 3rd poster session.
All attendees, speakers, poster presenters, and sponsors should register to attend the conference. To ensure a safe and enjoyable conference to all attendees, the registration is capped at 483 persons, due to the auditorium maximal capacity. Register early to ensure your seat (the registration will close completely should we reach 483 attendees), and benefit from the preferential rate.
To allow QEC23 attendees a stress-free (and car-free!) conference, we offer a preferential rate of $189/night at the Omni Hotel, located in downtown New Haven, 1.5 blocks from the Yale University campus. This early bird rate is available for attendees until June 9. All rooms offer free cancellation before August 8.
Thank you to our sponsors for making this conference possible
and keeping our registration fee low and accessible to all the QEC community.
Yale University has been at the forefront of quantum science and engineering since the early 1990s, serving as the birthplace of significant quantum breakthroughs, particularly in circuit quantum electrodynamics. Recognizing the critical importance of quantum error correction early on, the Yale Quantum Institute has cultivated a vibrant ecosystem of experimental and theoretical researchers dedicated to advancing fault-tolerant quantum computing.
Sponsoring the QEC25 conference at Yale offers a unique opportunity to engage with the next generation of quantum researchers and contribute to discussions on quantum error correction at the very site where some of the field’s most significant breakthroughs have occurred.
Sponsored content by Nord Quantique
Lead the development and implementation
of advanced quantum control protocols for bosonic qubits
Lead the development and integration
of multi-cavity superconducting quantum processors
Draft v. July 1 - Times and sessions are subject to changes
This tutorial sessions is offered for students and anyone interested in the following topics, as a preparation for the conference. Space is limited to 120 people, please indicate your interest in the registration form.
Shruti Puri (Professor of Applied Physics, Yale University)
Megan Dahlhauser (Associate Editor, PRX Quantum)
Peer review: insights on how to participate and benefit
Peer review is a crucial part of science. Effective engagement with peer review, both as author and referee, is an important part of being a successful scientist. In this tutorial, you will learn more about how to be an active participant in the peer review process from editors at PRX Quantum.
The tutorial consists of informative tips and a short practice/Q&A. Participants will learn the benefits of being a referee, how to act as one, and how to successfully interact with editors and referees for the manuscripts they author.
Liz Durst (VP QEC Community, Riverlane)
Why you should care about doing quantum error correction experiments?
Noah Shutty & Laleh Beni (Software Engineers, Google Quantum AI)
Tesseract: A Search-Based Decoder for Quantum Error Correction
Tesseract is a high-performance decoder designed to support a broad class of quantum error correction codes and fault-tolerant protocols. It enables researchers to quickly prototype, simulate, and benchmark decoding strategies under realistic circuit-level noise, making it a practical tool for both theoretical and experimental QEC work.
Aleksander Kubica (Professor of Applied Physics, Yale University)
Recent progress in QEC
Check in at the Yale Science Building (260 Whitney Ave, New Haven, CT 06511) in the hall outside of OC Marsh & Breakfast.
Opening by the QEC25 Committee.
9:15 AM: KEYNOTE - Andreas Walraff - ETH Zurich
Title TBA
10:15 AM: Coffee break sponsored by Q-CTRL
10:30 AM: Dripto Debroy - Google Quantum AI & Catherine Leroux - AWS Center for Quantum Computing
MERGED: LUCI in the Surface Code with Defects (#7)
Snakes and Ladders: Adapting the surface code to defects (#105)
11 AM: Alexis Morvan - Google Quantum AI
Implementing the surface code using time-dynamic circuits (#44)
11:30 AM: Michael Newman - Google Quantum AI
Yoked surface codes (#110)
12 PM: Discussion period
2 PM: KEYNOTE - Margarita Davydova - California Institute of Technology
A local automaton for the 2D toric code.
3 PM: Andreas Bauer - Massachusetts Institute of Technology
Universal fault tolerant quantum computation in 2D without getting tied in knots (#30)
We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose codespace is stabilized by Clifford operators. We formulate a path integral framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits. We also show an equivalence between our approach and prior proposals where a 2D array of qubits reproduces the action of a transversal gate in a 3D stabilizer code over time, thus, establishing a new connection between 3D codes and 2D non-Abelian topological phases. We prove a threshold theorem for our protocols under local stochastic circuit noise using a just-in-time decoder to correct the non-Abelian code.
Recent advances in quantum error-correction (QEC), such as the discovery of Floquet codes, have shown that it is often beneficial to understand fault-tolerance as a dynamical process---a circuit with redundant measurements that help correct errors---rather than as a static code coming along a syndrome extraction circuit. Spacetime codes have emerged as a natural framework to understand error-correction at the level of circuit while leveraging the traditional QEC toolbox. This work introduces a framework based on chain complexes and chain maps to model spacetime codes and transformations between them. We show that stabilizer codes, quantum circuits, and decoding problems can all be described using chain complexes, and that the equivalence of two spacetime codes can be characterized by specific chain maps, the fault-tolerant maps, that preserve the number of encoded qubits, fault distance, and minimum-weight decoding problem. As an application of this framework, we extend the foliated cluster state construction from stabilizer codes to any spacetime code, showing that any Clifford circuit can be transformed into a measurement-based protocol with the same fault-tolerant properties. To this protocol, we associate a chain complex which encodes the underlying decoding problem, generalizing previous cluster state complex constructions. Notably, our complex can be non-bipartite and incorporate Y measurement. This method enables the construction of cluster states from non-CSS, subsystem, and Floquet codes, as well as from logical operations on a given code.
We introduce a model for a stacked quantum memory made with multi-qubit cells, inspired by multi-level flash cells in classical solid-state drive, and we design quantum error correction codes for this model by generalizing rank-metric codes to the quantum setting. Rank-metric codes are used to correct faulty links in classical communication networks. We propose a quantum generalization of Gabidulin codes, which is one of the most popular family of rank-metric codes, and we design a protocol to correct faults in Clifford circuits applied to a stacked quantum memory based on these codes. We envision potential applications to the optimization of stabilizer states and magic states factories, and to variational quantum algorithms. Further work is needed to make this protocol practical. It requires a hardware platform capable of hosting multi-qubit cells with low crosstalk between cells, a fault-tolerant syndrome extraction circuit for rank-metric codes and an associated efficient decoder.
Proving fault-tolerant threshold theorems is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways. However, it is difficult and rare to combine elements from multiple papers into a single formal threshold proof. We introduce a new framework that we call composable fault-tolerance that allows for simple proofs of fault-tolerant computation that can borrow from a "library" of standard gadgets used before (e.g. state injection, distillation, error-correction gadgets, etc). This framework heavily relies on the weight enumerator formalism previously introduced in a recent fault-tolerance threshold proof. We expect that new fault-tolerance proofs may focus on the novel pieces while leaving the standard parts to the composable fault-tolerance framework with the formal proof following the "napkin math" exactly. To unify standard results in the literature, we give pedagogically relevant applications of our formalism to some standard fault-tolerant gadget constructions.
YQI Artist-in-Residence Stewart Smith, Yale CS graduate student Yue Wu, and YQI Managing Director Florian Carle propose you to experience an in-person real-time quantum error correction in the auditorium!
This will also be the occasion to take a QEC25 group photo.
Presented by APS PRX Quantum.
Presenters can set up their posters on Monday starting at 8 am, and can leave them on display until Tuesday at noon to ensure enough time for conversations. See the full list of poster here.
9 AM: KEYNOTE - Michael Gullans - University of Maryland
Title TBA
10 AM: Coffee break
10:30 AM: Benedikt Placke - University of Oxford
Topological Quantum Spin Glass Order and its realization in qLDPC codes (#169)
11 AM: James Mills - University of Edinburgh
Efficient certification for early fault-tolerant quantum devices (#253)
11:30 AM: Daniel Miller - Freie Universität Berlin
Experimental measurement and a physical interpretation of quantum shadow enumerators (#1)
12 PM: Discussion period
2 PM: KEYNOTE - James Teoh - Quantum Circuits
Quantum error correction with dual-rail cavity qubits
3 PM: Kevin Chou - Quantum Circuits
Demonstrating error-corrected erasure qubits with superconducting dual-rail cavities (#188)
3:30 PM: Vladislav Kurilovich - Google Quantum AI
Correlated Error Bursts in a Gap-Engineered Superconducting Qubit Array (#157)
4 PM: Coffee break sponsored by Q-CTRL
4:15 PM: Guoding Liu - Tsinghua University
Approximate Quantum Error Correction with 1D Log-Depth Circuits (#51)
Presented by APS PRX Quantum.
Presenters can set up their posters on Tuesday starting at 12 pm, and can leave them on display until Wednesday 6 pm to ensure enough time for conversations. See the full list of poster here.
9 AM: KEYNOTE - Andrew Cross - IBM
qLDPC codes and architectures
10:15 AM: Coffee break
10:30 AM: Mackenzie Shaw - TU Delft
Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits, and More (#56)
11 AM: Alexander Cowtan - University of Oxford
Parallel Logical Measurements via Quantum Code Surgery (#180)
11:30 AM: Zhiyang He - Massachusetts Institute of Technology
Extractors: QLDPC Architectures for Efficient Pauli-Based Computation (#199)
12 PM: Discussion period
2 PM: KEYNOTE - Christophe Vuillot - Alice & Bob
"Tiger codes' or 'Rotor codes' and implementations of such codes
3 PM: Benjamin Brock - Yale University
Quantum error correction of qudits beyond break-even (#18)
3:30 PM: Hayata Yamasaki - The University of Tokyo
Continuous-Variable Fault-Tolerant Quantum Computation under General Noise (#94)
4 PM: Coffee break sponsored by Q-CTRL
4:30 PM: Yijia Xu - University of Maryland
Letting the tiger out of its cage: bosonic coding without concatenation (#100)
5 PM: KEYNOTE - Oskar Painter - California Institute of Technology
Scalable approaches to concatenated bosonic qubit error correction: current and future directions
Presented by Economic Development Administration of the City of New Haven
The Yale Peabody Museum is the home for over 14 million specimens and objects from 10 curated collections that tell the story of our Earth, its life, history, and cultures. Steps away from the auditorium, the entire museum will be open for QEC25 attendees. You might be particularly interested in the History of Science & Technology gallery.
6:30 pm: Food and drinks provided throughout the museum (except sepcial galleries)
7 pm: Toasts and speeches in the Burke Hall of Dinosaurs & Central Gallery
7:30 pm: Dessert served in the David Friend Hall of Minerals
9 AM: KEYNOTE - David Hayes - Quantinuum
Quantum Error Correction in QCCD computers
10 AM: Coffee break
10:30 AM: Ciaran Ryan-Anderson - Quantinuum
High-fidelity Teleportation of a Logical Qubit using Transversal Gates and Lattice Surgery (#149)
11 AM: Adam Paetznick - Microsoft Quantum
Logical computation demonstrated with a neutral atom quantum processor (#158)
11:30 AM: Adam Paetznick - Microsoft Quantum
Exceeding tenfold improvement in logical error rate with a quantum processor (#189)
12 PM: Discussion period
2 PM: KEYNOTE - Harry Zhou - Harvard University
Transversal Architectures for Neutral Atom Logical Quantum Computation.
3 PM: M. Sohaib Alam - NASA Ames Research Center
Bacon-Shor Code Revisited (#73)
3:30 PM: Coffee break
4 PM: Rachel Yun Zhang - MIT
Quantum Codes with Addressable and Transversal Non-Clifford Gates (#183)
4:30 PM: Louis Golowich - UC Berkeley
Quantum Locally Recoverable Codes (#191)
Presented by APS PRX Quantum
Presenters can set up their posters on Thursday starting at 8 am, and can leave them on display until Friday at 12 pm to ensure enough time for conversations. See the full list of poster here.
All attendees are invited to a special toast to celebrate for the 5th anniversary of the PRX Quantum journal, and presentation of the QEC25 Award for the Best Poster (overall for the 3 poster sessions) presented by APS PRX Quantum.
9 AM: KEYNOTE - Noah Shutty - Google Quantum AI
Codes and Decoders for Near-Term Quantum Computers
10 AM: Coffee break sponsored by Q-CTRL
10:30 AM: Michael Newman - Google Quantum AI
Quantum error correction below the surface code threshold (#109)
11 AM: Ivan Pogorelov - University of Innsbruck
Experimental fault-tolerant code switching (#131)
11:30 AM: Abraham Jacob - University College London
Single-Shot Decoding and Fault-tolerant logic with Tri-variate Tricycle Codes (#244)
12 PM: Discussion period
2 PM: KEYNOTE - Priya Nadkarni - Xanadu
Fault-tolerant logical measurements via homological measurement
3 PM: Christopher Pattison - Caltech & Shiro Tamiya - Nanofiber Quantum Technologies
MERGED: Quantum fault tolerance with constant-space and logarithmic-time overheads (#107)
Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes (#148)
3:30 PM: Coffee break
4 PM: Adam Wills - MIT & Louis Golowich - UC Berkeley
MERGED - Constant-Overhead Magic State Distillation (#50)
Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates (#125)"
4:30 PM: KEYNOTE - Roffe Joschka - University of Edinburgh
Decoding Quantum LDPC Codes
Stephen Bartlett (Chair), The University of Sydney
Kenneth Brown, Duke
Earl Campbell, University of Sheffield & Riverlane
Keisuke Fujii, Osaka University
Liang Jiang, University of Chicago
Daniel Lidar, University of Southern California
Markus Mueller, IQOQI
Naomi Nickerson, PsiQuantum
Maika Takita, IBM
Barbara Terhal, Delft University of Technology
Jeff Thompson, Princeton University
Steve Girvin (Chair)
Amy Badner
Florian Carle
Aleksander Kubica
Shruti Puri
Steve Flammia (Chair), Virginia Tech
Barbara Terhal (Co-Chair), Delft University of Technology
Nouédyn Baspin, University of Sydney
Niko Breuckmann, University of Bristol
Natalie Brown, Quantinuum
Ken Brown, Duke University
Ben Brown, IBM
Earl Campbell, Riverlane
Margarita Davydova, Caltech
Nicolas Delfosse, IonQ
Daniel Gottesman, University of Maryland
Arne Grimsmo, AWS
Michael Gullans, University of Maryland / NIST
David Hayes, Quantinuum
Min-Hsiu Hsieh, Foxconn
Shilin Huang, Hong Kong University of Science and Technology
Vadym Kliuchnikov, Microsoft
Anirudh Krishna, IBM
Aleksander Kubica, Yale University
Anthony Leverrier, INRIA
Harry Levine, UC Berkeley
Matthew McEwen, Google
Markus Müller, RWTH Aachen University
Quynh Nguyen, Harvard University
Christopher A. Pattison, Caltech
Shruti Puri, Yale University
Armanda Quintavalle, Freie Universität Berlin
Baptiste Royer, Université de Sherbrooke
Marcus da Silva, Microsoft
Qian Xu, Caltech
Hayata Yamasaki, University of Tokyo
Yale is located in New Haven, Connecticut, one of the best small cities in America, situated two-and-a-half hours south of Boston and one-and-a-half hours north of New York City. New Haven has many attractions including a thriving downtown district with parks, shops, museums, hotels, and restaurants. Its neighborhoods are home to historic buildings and diverse communities. Beyond the city limits lie beautiful beaches, peaceful lakes, charming New England towns, and pastoral suburbs. New Haven is easily accessible by car, train, bus, and airplane.
If coming from abroad, the easiest way to travel to Yale University is by air. There are a number of nearby airports serviced by international airlines.
Bradley International Airport (BDL) in Windsor Locks, Connecticut
John F. Kennedy International Airport (JFK) in New York City
LaGuardia International Airport (LGA) in New York City
Newark Liberty International Airport (EWR) in Newark, New Jersey
Tweed New Haven Airport (HVN) in New Haven, Connecticut
Amtrak provides services from Newark airport to New Haven’s Union Station. For all other airports, private shuttle services are available through Connecticut Limousine (800.472.5466) and GO Airport Shuttle (866.284.3247). Please be sure to make reservations for shuttle services well in advance. Taking a taxi from any of these airports except for Tweed is not recommended.
If traveling from within the United States, it is convenient to take a train to New Haven Union Station, minutes from Yale’s campus.
Metro-North Railways (800.638.7647) offers frequent train service between New Haven and New York City.
Amtrak (800.872.7245) provides train service to New Haven from Vermont, Providence, Boston, and Washington DC.
Once you reach the station, we suggest that you use a local taxi service to reach campus. There is a taxi stand at the station; a taxi ride costs approximately $10. Alternatively, local shuttles and bus services are also available for travel between Union Station and Yale.
If traveling from within the United States, it is also possible to take a bus to New Haven Union Station, which also serves as a bus terminal.
Greyhound (203.772.2470)
Peter Pan (800.343.9999)
There are multiple driving routes that you can take to arrive on campus. We recommend entering “OC Marsh Lecture Hall, 260 Whitney Ave, New Haven, CT 06511” into your GPS.
Please apply for travel visas well in advance of the conference. For visa letters or other information, please email florian.carle@yale.edu with subject heading "QEC 2025 Visa Inquiry”.
