Quantum computation from dynamic automorphism codes
- URL: http://arxiv.org/abs/2307.10353v2
- Date: Wed, 25 Oct 2023 01:03:19 GMT
- Title: Quantum computation from dynamic automorphism codes
- Authors: Margarita Davydova, Nathanan Tantivasadakarn, Shankar Balasubramanian,
David Aasen
- Abstract summary: We propose a new model of quantum computation comprised of low-weight measurement sequences.
The measurement sequences simultaneously encode logical information, enable error correction, and apply logical gates.
We show that a non-Clifford logical gate can be realized by adaptive two-qubit measurements.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose a new model of quantum computation comprised of low-weight
measurement sequences that simultaneously encode logical information, enable
error correction, and apply logical gates. These measurement sequences
constitute a new class of quantum error-correcting codes generalizing Floquet
codes, which we call dynamic automorphism (DA) codes. We construct an explicit
example, the DA color code, which is assembled from short measurement sequences
that can realize all 72 automorphisms of the 2D color code. On a stack of $N$
triangular patches, the DA color code encodes $N$ logical qubits and can
implement the full logical Clifford group by a sequence of two- and, more
rarely, three-qubit Pauli measurements. We also make the first step towards
universal quantum computation with DA codes by introducing a 3D DA color code
and showing that a non-Clifford logical gate can be realized by adaptive
two-qubit measurements.
Related papers
- Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes [1.8416014644193066]
Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computation with constant overhead.
Recent advancements have shown that qLDPC codes can outperform the quantum memory capability of surface codes even with near-term hardware.
arXiv Detail & Related papers (2024-07-04T14:49:35Z) - Facilitating Practical Fault-tolerant Quantum Computing Based on Color Codes [0.6963971634605797]
In this work, we address several key issues to facilitate practical fault-tolerant quantum computing based on color codes.
First, by introducing decoding graphs with error-rate-related weights, we obtained the threshold of $0.57%$ of the triangular color code.
Second, our work firstly investigates the circuit-level decoding of color code lattice surgery, and gives an efficient decoding algorithm.
Third, a new state injection protocol of the triangular color code is proposed, reducing the output magic state error rate in one round of 15 to 1 distillation by two orders of magnitude compared to a previous rough protocol.
arXiv Detail & Related papers (2023-09-11T03:56:18Z) - Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors [0.0]
Top color codes are widely acknowledged as promising candidates for fault-tolerant quantum computing.
Top color codes can provide a universal gate set $$H, T, C$$, with the T-gate missing in the T-dimensional and the H-gate in the three-dimensional case.
We construct resource-optimized deterministic and non-deterministic code switching protocols for two- and three-dimensional distance-three color codes.
arXiv Detail & Related papers (2023-06-30T14:16:52Z) - Quantum error-correcting codes with a covariant encoding [2.532202013576547]
Given some group $G$ of logical gates, what are the quantum encodings for which these logical gates can be implemented by simple physical operations?
We study this question by constructing a general form of such encoding maps.
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.
arXiv Detail & Related papers (2023-06-20T15:48:30Z) - Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.
We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
arXiv Detail & Related papers (2023-03-24T00:29:15Z) - Quantum spherical codes [55.33545082776197]
We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes.
We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
arXiv Detail & Related papers (2023-02-22T19:00:11Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Morphing quantum codes [77.34726150561087]
We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate.
We construct a family of hybrid color-toric codes by morphing the color code.
arXiv Detail & Related papers (2021-12-02T17:43:00Z) - Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete.
We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes.
Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z) - Dynamically Generated Logical Qubits [0.30458514384586394]
We present a quantum error correcting code with dynamically generated logical qubits.
Our measurement patterns generate logical qubits, allowing the code to act as a fault-tolerant quantum memory.
arXiv Detail & Related papers (2021-07-05T18:00:15Z) - The cost of universality: A comparative study of the overhead of state
distillation and code switching with color codes [63.62764375279861]
We compare two leading FT implementations of the T gate in 2D color codes under circuit noise.
We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting.
arXiv Detail & Related papers (2021-01-06T19:00:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.