We study variants of Shor's code that are adept at handling single-axis correlated idling errors, which are commonly observed in many quantum systems. By using the repetition code structure of the Shor's code basis states, we calculate the logical channel applied to the encoded information when subjected to coherent and correlated single qubit idling errors, followed by stabilizer measurement. Changing the signs of the stabilizer generators allows us to change how the coherent errors interfere, leading to a quantum error-correcting code which performs as well as a classical repetition code of equivalent distance against these errors. We demonstrate a factor of 3.78±1.20 improvement of the logical T2^{*} in a distance-3 logical qubit implemented on a trapped-ion quantum computer. Even-distance versions of our Shor-code variants are decoherence-free subspaces and fully robust to identical and independent coherent idling noise.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1103/PhysRevLett.127.240501 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Quantum-resilient software security: A fuzzy AHP-based assessment framework in the era of quantum computing.
PLoS One
January 2025
Cybersecurity Department, College of Computers, Umm Al-Qura University, Makkah City, Kingdom of Saudi Arabia.
The introduction of quantum computing has transformed the setting of information technology, bringing both unprecedented opportunities and significant challenges. As quantum technologies continue to evolve, addressing their implications for software security has become an essential area of research. This paradigm change provides an unprecedented chance to strengthen software security from the start, presenting a plethora of novel alternatives.
View Article and Find Full Text PDFQuantum Error-Correcting Codes with a Covariant Encoding.
Phys Rev Lett
December 2024
Inria Paris, Quandela, 7 Rue Léonard de Vinci, 91300 Massy, France.
Given some group G of logical gates, for instance the Clifford group, what are the quantum encodings for which these logical gates can be implemented by simple physical operations, described by some physical representation of G? We study this question by constructing a general form of such encoding maps. For instance, we recover that the ⟦5,1,3⟧ and Steane codes admit transversal implementations of the binary tetrahedral and binary octahedral groups, respectively. For bosonic encodings, we show how to obtain the GKP and cat qudit encodings by considering the appropriate groups, and essentially the simplest physical implementations.
View Article and Find Full Text PDFCorrelated Decoding of Logical Algorithms with Transversal Gates.
Phys Rev Lett
December 2024
Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA.
Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation of logical qubits using transversal gates [Bluvstein et al., Nature (London) 626, 58 (2024)NATUAS0028-083610.
View Article and Find Full Text PDFQuantum memory at nonzero temperature in a thermodynamically trivial system.
Nat Commun
January 2025
Department of Physics and Center for Theory of Quantum Matter, University of Colorado, Boulder, CO, USA.
Passive error correction protects logical information forever (in the thermodynamic limit) by updating the system based only on local information and few-body interactions. A paradigmatic example is the classical two-dimensional Ising model: a Metropolis-style Gibbs sampler retains the sign of the initial magnetization (a logical bit) for thermodynamically long times in the low-temperature phase. Known models of passive quantum error correction similarly exhibit thermodynamic phase transitions to a low-temperature phase wherein logical qubits are protected by thermally stable topological order.
View Article and Find Full Text PDFQuantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!