A correspondence between quantum error correcting codes and quantum reference frames
- URL: http://arxiv.org/abs/2412.15317v1
- Date: Thu, 19 Dec 2024 18:52:38 GMT
- Title: A correspondence between quantum error correcting codes and quantum reference frames
- Authors: Sylvain Carrozza, Aidan Chatwin-Davies, Philipp A. Hoehn, Fabio M. Mele,
- Abstract summary: In a gauge theory, a collection of kinematical degrees of freedom is used to redundantly describe a smaller amount of gauge-invariant information.
We elaborate this clear parallel in terms of quantum reference frames (QRFs), which are a universal toolkit for quantization in the presence of symmetries.
The result is a precise dictionary between QECCs and QRFs within the perspective-neutral framework for constrained systems.
- Score: 0.0
- License:
- Abstract: In a gauge theory, a collection of kinematical degrees of freedom is used to redundantly describe a smaller amount of gauge-invariant information. In a quantum error correcting code (QECC), a collection of computational degrees of freedom that make up a device's physical layer is used to redundantly encode a smaller amount of logical information. We elaborate this clear parallel in terms of quantum reference frames (QRFs), which are a universal toolkit for quantization in the presence of symmetries. The result is a precise dictionary between QECCs and QRFs within the perspective-neutral framework for constrained systems. Concepts from quantum error correction like error sets and correctability translate to novel insights into the informational architecture of gauge theories. Conversely, the dictionary provides a systematic procedure for constructing symmetry-based QECCs and characterizing their error correcting properties. In this initial work, we scrutinize the dictionary between Pauli stabilizer codes and their corresponding QRF setups, which possess symmetry groups that are isomorphic to the stabilizer group. We show that there is a one-to-one correspondence between maximal correctable error sets and tensor factorizations splitting system from frame degrees of freedom, relative to which errors corrupt only redundant frame data. When passed through the dictionary, standard Pauli errors from the code essentially behave as electric excitations that are exactly dual, via Pontryagin duality, to magnetic excitations related to gauge-fixing. We comprehensively illustrate our findings in surface codes, which themselves manifestly connect quantum error correction with gauge systems. The exploratory investigations in this article pave the way for deeper foundational applications to quantum gauge theories and for eventual practical applications to quantum simulation.
Related papers
- Single-shot and measurement-based quantum error correction via fault complexes [0.0]
Photonics provides a viable path to a scalable fault-tolerant quantum computer.
Foliation is the construction of fault-tolerant graph states.
We introduce the fault complex, a representation of dynamic quantum error correction protocols.
arXiv Detail & Related papers (2024-10-16T18:52:24Z) - Reliable Quantum Communications based on Asymmetry in Distillation and Coding [35.693513369212646]
We address the problem of reliable provision of entangled qubits in quantum computing schemes.
We combine indirect transmission based on teleportation and distillation; (2) direct transmission, based on quantum error correction (QEC)
Our results show that ad-hoc asymmetric codes give, compared to conventional QEC, a performance boost and codeword size reduction both in a single link and in a quantum network scenario.
arXiv Detail & Related papers (2023-05-01T17:13:23Z) - 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) - Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and
Cycle Benchmarking [50.8020641352841]
We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application.
We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor.
This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
arXiv Detail & Related papers (2022-01-08T23:12:55Z) - Near-optimal covariant quantum error-correcting codes from random
unitaries with symmetries [1.2183405753834557]
We analytically study the most essential cases of $U(1)$ and $SU(d)$ symmetries.
We show that for both symmetry groups the error of the covariant codes generated by Haar-random symmetric unitaries, typically scale as $O(n-1)$ in terms of both the average- and worst-case distances against erasure noise.
arXiv Detail & Related papers (2021-12-02T18:46:34Z) - Performance of teleportation-based error correction circuits for bosonic
codes with noisy measurements [58.720142291102135]
We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit.
We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
arXiv Detail & Related papers (2021-08-02T16:12:13Z) - Charge-conserving unitaries typically generate optimal covariant quantum
error-correcting codes [1.2183405753834557]
We consider the quantum error correction capability of random covariant codes.
In particular, we show that $U(1)$-covariant codes generated by Haar random $U(1)$-symmetric unitaries saturate the fundamental limits to leading order.
Our results hold for symmetric variants of unitary 2-designs, and comment on the convergence problem of charge-conserving random circuits.
arXiv Detail & Related papers (2021-02-23T18:11:15Z) - Fusion-based quantum computation [43.642915252379815]
Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states.
We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes.
This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
arXiv Detail & Related papers (2021-01-22T20:00:22Z) - Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs.
Coded Systems [69.33243249411113]
We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels.
We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
arXiv Detail & Related papers (2020-12-15T15:51:27Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z) - Deterministic correction of qubit loss [48.43720700248091]
Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors.
We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
arXiv Detail & Related papers (2020-02-21T19:48:53Z)
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.