8 research outputs found
Optimization tools for distance-preserving flag fault-tolerant error correction
Lookup table decoding is fast and distance preserving, making it attractive
for near-term quantum computer architectures with small-distance quantum error
correcting codes. In this work, we develop several optimization tools which can
potentially reduce the space and time overhead required for flag fault-tolerant
error correction (FTEC) with lookup table decoding on Calderbank-Shor-Steane
(CSS) codes. Our techniques include the compact lookup table construction, the
Meet-in-the-Middle technique, the adaptive time decoding for flag FTEC, the
classical processing technique for flag information, and the separated and
counting technique. We evaluate the performance of our tools using
numerical simulation of hexagonal color codes of distances 3, 5, 7, and 9 under
circuit-level noise. Combining all tools can result in more than an order of
magnitude increase in pseudothreshold for the hexagonal color code of distance
9, from to .Comment: 28 pages, 16 figure
Recommended from our members
Exponential suppression of bit or phase errors with cyclic error correction
Realizing the potential of quantum computing requires sufficiently low logical error rates1. Many applications call for error rates as low as 10-15 (refs. 2-9), but state-of-the-art quantum platforms typically have physical error rates near 10-3 (refs. 10-14). Quantum error correction15-17 promises to bridge this divide by distributing quantum logical information across many physical qubits in such a way that errors can be detected and corrected. Errors on the encoded logical qubit state can be exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold and stable over the course of a computation. Here we implement one-dimensional repetition codes embedded in a two-dimensional grid of superconducting qubits that demonstrate exponential suppression of bit-flip or phase-flip errors, reducing logical error per round more than 100-fold when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analysing error correlations with high precision, allowing us to characterize error locality while performing quantum error correction. Finally, we perform error detection with a small logical qubit using the 2D surface code on the same device18,19 and show that the results from both one- and two-dimensional codes agree with numerical simulations that use a simple depolarizing error model. These experimental demonstrations provide a foundation for building a scalable fault-tolerant quantum computer with superconducting qubits
Time-crystalline eigenstate order on a quantum processor
Quantum many-body systems display rich phase structure in their low-temperature equilibrium states1. However, much of nature is not in thermal equilibrium. Remarkably, it was recently predicted that out-of-equilibrium systems can exhibit novel dynamical phases2-8 that may otherwise be forbidden by equilibrium thermodynamics, a paradigmatic example being the discrete time crystal (DTC)7,9-15. Concretely, dynamical phases can be defined in periodically driven many-body-localized (MBL) systems via the concept of eigenstate order7,16,17. In eigenstate-ordered MBL phases, the entire many-body spectrum exhibits quantum correlations and long-range order, with characteristic signatures in late-time dynamics from all initial states. It is, however, challenging to experimentally distinguish such stable phases from transient phenomena, or from regimes in which the dynamics of a few select states can mask typical behaviour. Here we implement tunable controlled-phase (CPHASE) gates on an array of superconducting qubits to experimentally observe an MBL-DTC and demonstrate its characteristic spatiotemporal response for generic initial states7,9,10. Our work employs a time-reversal protocol to quantify the impact of external decoherence, and leverages quantum typicality to circumvent the exponential cost of densely sampling the eigenspectrum. Furthermore, we locate the phase transition out of the DTC with an experimental finite-size analysis. These results establish a scalable approach to studying non-equilibrium phases of matter on quantum processors