Bulletin of the American Physical Society
APS March Meeting 2022
Volume 67, Number 3
Monday–Friday, March 14–18, 2022; Chicago
Session Z40: Towards Fault Tolerance and Realization of Quantum Error CorrectionFocus Recordings Available
|
Hide Abstracts |
Sponsoring Units: DQI Chair: Kevin Satzinger, Google Room: McCormick Place W-196B |
Friday, March 18, 2022 11:30AM - 11:42AM |
Z40.00001: Towards Demonstrating Fault Tolerance in Small Circuits Using Bacon-Shor Codes Ariel Shlosberg, Anthony M Polloreno, Graeme Smith Quantum error correction is necessary to perform large-scale quantum computations in the presence of noise and decoherence. As a result, several aspects of quantum error correction have already been explored. These have been primarily studies of quantum memory, an important first step towards quantum computation, where the objective is to increase the lifetime of the encoded quantum information. Additionally, several works have explored the implementation of logical gates. In this work we study a next step - fault-tolerantly implementing quantum circuits. We choose the $[[4, 1, 2]]$ Bacon-Shor subsystem code, which has a particularly simple error-detection circuit. Through both numerics and site-counting arguments, we compute pseudo-thresholds for the Pauli error rate $p$ in a depolarizing noise model, below which the encoded circuits outperform the unencoded circuits. These pseudo-threshold values are shown to be as high as $p=3\%$ for short circuits, and $p=0.6\%$ for circuits of moderate depth. Additionally, we see that multiple rounds of stabilizer measurements give an improvement over performing a single round at the end. This provides a concrete suggestion for a small-scale fault-tolerant demonstration of a quantum algorithm that could be accessible with existing hardware. |
Friday, March 18, 2022 11:42AM - 11:54AM |
Z40.00002: High threshold fault-tolerant measurement-based quantum computing with biased noise qubits Jahan Claes, Eli Bourassa, Shruti Puri Measurement-based quantum computing (MBQC) is an alternative model of quantum computation that is equivalent to the standard gate-based model and is the preferred approach for several optical quantum computing architectures. In MBQC, a quantum computation is executed by preparing an entangled cluster state and then selectively measuring qubits. MBQC can be made fault-tolerant by creating an MBQC computation that executes the standard surface code, an approach known as "foliation." |
Friday, March 18, 2022 11:54AM - 12:06PM |
Z40.00003: Fault-tolerant logical gates in holographic stabilizer codes are severely restricted Sam Cree We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We treat them as subsystem codes and show that the set of transversally implementable logical operations is contained in the Clifford group for sufficiently localized logical subsystems. As well as proving this concretely for several specific codes, we argue that this restriction naturally arises in any stabilizer subsystem code that comes close to capturing certain properties of holography. We extend these results to approximate encodings, locality-preserving gates, certain codes whose logical algebras have non-trivial centers, and discuss cases where restrictions can be made to other levels of the Clifford hierarchy. A few auxiliary results may also be of interest, including a general definition of entanglement wedge map for any subsystem code, and a thorough classification of different correctability properties for regions in a subsystem code. |
Friday, March 18, 2022 12:06PM - 12:18PM |
Z40.00004: Tailored rotated Toric codes for biased noise Qian Xu, Nam Mannucci, Alireza Seif, Aleksander Kubica, Steve T Flammia, Qian Xu, Liang Jiang Quantum error correction lies at the heart of fault-tolerant quantum computing. The performance of error-correcting codes can be greatly boosted when tailored for realistic types of noise, such as noise biased towards dephasing. We consider a family of generalized rotated toric codes (RTCs) that are defined on a square lattice whose plaquettes represent the XZZX type of check operators, with periodic boundary conditions specified by two (not necessarily orthogonal) periodicity vectors. We show that by adaptively choosing the code layout and tailoring the decoder, the RTCs exhibit high threshold and favorable sub-threshold resource scaling in the biased-noise regime. With perfect measurements, the code threshold saturates the hashing bound. Furthermore, the RTCs have a remarkable fault-tolerant threshold using practical decoders under a phenomenological noise model. We show that the optimally-chosen RTCs, encoding a single logical qubit, can outperform the planar surface codes when using the same amount of qubit resource across different bias regimes, therefore enabling more efficient quantum error correction. |
Friday, March 18, 2022 12:18PM - 12:30PM |
Z40.00005: Mitigating leakage-induced correlated errors for superconducting quantum error correction Kevin Miao, Matthew J McEwen, Juan Atalaya, Yu Chen, Andre Petukhov, Alexander N Korotkov, Rami Barends Leakage into non-computational states threatens the stability of quantum error correction. We present the operation of a multilevel reset protocol [1] in the context of quantum error correction, and discuss how the removal of otherwise long-lived leakage-induced correlated errors improves error correction performance. The multilevel reset protocol prepares the qubit ground state with high fidelity after starting in any of the first three excited states, thereby providing an efficient sink for leakage states. By reducing the reset error of this protocol and optimizing the gate duration, we position this gate to be highly compatible with superconducting quantum error correction codes. |
Friday, March 18, 2022 12:30PM - 1:06PM |
Z40.00006: Progress with stabilized cat qubits towards hardware-efficient fault-tolerance Invited Speaker: Mazyar Mirrahimi Cat qubits are bosonic encodings of quantum information that promise a significant reduction in hardware overhead towards fault-tolerance. By confining the state of a quantum harmonic oscillator — a superconducting cavity mode for instance — to the 2D manifold of the Schrödinger cat states, one obtains a biased noise qubit where one error component (bit-flips) is exponentially suppressed with the cat size. It is then possible to perform an extensive set of bias-preserving gates paving the way towards a hardware-efficient concatenation with another encoding for suppressing the other error component (phase-flips). So far, two types of confinements have been considered for such cat qubits each with its own advantages: a dissipative confinement based on an engineered nonlinear dissipation, and a Hamiltonian confinement based on a driven Kerr nonlinearity. In this work, we analyze the possibility of combining these two types of confinements and the benefits of such a combination. We also discuss the optimization of the phase-flip error correction process in view of simplifying the experimental requirements to reach the fault-tolerance threshold. |
Friday, March 18, 2022 1:06PM - 1:18PM |
Z40.00007: Distance-four quantum codes with combined postselection and error correction Prithviraj Prabhu, Ben Reichardt When storing encoded qubits, if single faults can be corrected and double faults postselected against, logical errors only occur due to at least three faults. At current noise rates, having to restart when two errors are detected prevents very long-term storage, but this should not be an issue for low-depth computations. We consider distance-four, efficient encodings of multiple qubits into a modified planar patch of the 16-qubit surface code. We simulate postselected error correction for up to 12000 rounds of parallel stabilizer measurements, and subsequently estimate the cumulative probability of logical error for up to twelve encoded qubits. |
Friday, March 18, 2022 1:18PM - 1:30PM |
Z40.00008: Quantum Error Correction in the Surface Code (Part I): Stabilizer Measurements and State Initialization Nathan Lacroix, Sebastian Krinner, Ants Remm, Christoph Hellings, Stefania Lazar, Christian Kraglund Andersen, Francois Swiadek, Johannes Herrmann, Graham J Norris, Elie Genois, Agustin Di Paolo, Catherine Leroux, Markus Müller, Alexandre Blais, Christopher Eichler, Andreas Wallraff Quantum error correction codes offer ways to compensate errors in quantum systems to a level which enables solving classically intractable problems. The surface code [A. G. Fowler, et al., Phys. Rev. A 86, 032324 (2012)] is one of the major candidates for a scalable quantum computing architecture because of its high tolerance to errors and its simple 2D-grid qubit-arrangement. In this talk, we discuss our progress towards the experimental realization of a distance-3 surface code on a 17-qubit superconducting qubit device. We verify the performance of essential components of the surface code including the realization of weight-2 stabilizers and weight-4 stabilizers, and the initialization of logical-qubit states. We discuss which type of errors are most prominent and whether or not they are correctable. |
Friday, March 18, 2022 1:30PM - 1:42PM |
Z40.00009: Quantum Error Correction in the Surface Code (Part II): Logical State Preservation Experiments Sebastian Krinner, Nathan Lacroix, Ants Remm, Christoph Hellings, Stefania Lazar, Christian Kraglund Andersen, Francois Swiadek, Johannes Herrmann, Graham J Norris, Elie Genois, Agustin Di Paolo, Catherine Leroux, Markus Muller, Alexandre Blais, Christopher Eichler, Andreas Wallraff Quantum error correction is an approach for preserving quantum information in the presence of decoherence and control errors. The surface code is unique in its high tolerance to errors. However, so far only error detection has been demonstrated in the surface code. Here, we report on progress towards realizing a distance-3 surface code, capable of correcting any single-qubit error on its 17 physical qubit constituents. We repeatedly measure all stabilizers of the code, extract bit- and phase-flip error syndromes, and characterize the overall performance in terms of the probability with which errors occur. Furthermore, we present a leakage detection scheme, allowing us to identify sequences in which any of the qubits was measured in a leakage state. Error correction is expected to be an essential ingredient in the realization of fault-tolerant universal quantum information processing. |
Friday, March 18, 2022 1:42PM - 1:54PM |
Z40.00010: Quantum Error Correction in the Surface Code (Part III): Realistic Simulation of the Experimental Code Performance Elie Genois, Agustin Di Paolo, Catherine Leroux, Sebastian Krinner, Nathan Lacroix, Ants Remm, Christoph Hellings, Stefania Lazar, Christian Kraglund Andersen, Francois Swiadek, Johannes Herrmann, Graham J Norris, Markus Muller, Christopher Eichler, Andreas Wallraff, Alexandre Blais The surface code is a prominent candidate for the realization of quantum error correction with superconducting qubits due to its suitable 2D-grid qubit-arrangement and its relatively high error tolerance. To guide efforts in improving the code ability to preserve logical states, it is necessary to perform realistic modeling of the system based on experimentally informative device characteristics such as individual qubit coherence times, cross-Kerr interactions, and gate fidelities. Here, we solve the complete time-evolution of a 17-qubit device implementing a distance-3 surface code using a Monte Carlo wave function approach. We also implement an effective model that captures all the desired dynamics while significantly reducing the computational requirements. Using this approach, we analyze the expected code performance as a function of experimentally relevant qubit parameters and their non-uniform distribution on the device. We also investigate the optimal parameter improvements needed to enhance logical state preservation and to reach the threshold. |
Friday, March 18, 2022 1:54PM - 2:06PM |
Z40.00011: Fault-tolerance for a universal non-Abelian topological quantum computer at finite temperature Alexis Schotte, Lander Burgelman, Guanyu Zhu We study a quantum memory constructed as a two-dimensional phenomenological model of Fibonacci anyons on a torus, in the presence of thermal noise represented by pair-creation processes and measurement errors. The correction procedure is based on the cellular automaton decoders originating in the works of Gács and Harrington. Through numerical simulations, we obtain a fault-tolerant threshold for this code and hence provide strong evidence for the existence of fault-tolerant universal non-Abelian codes. |
Follow Us |
Engage
Become an APS Member |
My APS
Renew Membership |
Information for |
About APSThe American Physical Society (APS) is a non-profit membership organization working to advance the knowledge of physics. |
© 2024 American Physical Society
| All rights reserved | Terms of Use
| Contact Us
Headquarters
1 Physics Ellipse, College Park, MD 20740-3844
(301) 209-3200
Editorial Office
100 Motor Pkwy, Suite 110, Hauppauge, NY 11788
(631) 591-4000
Office of Public Affairs
529 14th St NW, Suite 1050, Washington, D.C. 20045-2001
(202) 662-8700