Adaptive quantum codes: constructions, applications and fault tolerance
- URL: http://arxiv.org/abs/2203.03247v2
- Date: Sat, 26 Mar 2022 02:53:01 GMT
- Title: Adaptive quantum codes: constructions, applications and fault tolerance
- Authors: Akshaya Jayashankar
- Abstract summary: A perfect quantum code requires atleast five physical qubits to observe a noticeable improvement over the no-QEC scenario.
We propose an adaptive QEC protocol that allows transmission of quantum information from one site to the other over a 1-d spin chain with high fidelity.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: A major obstacle towards realizing a practical quantum computer is the noise
that arises due to system-environment interactions. While it is very well known
that quantum error correction (QEC) provides a way to protect against errors
that arise due to the noise affecting the system, a perfect quantum code
requires atleast five physical qubits to observe a noticeable improvement over
the no-QEC scenario. However, in cases where the noise structure in the system
is already known, it might be more useful to consider quantum codes that are
adapted to specific noise models. It is already known in the literature that
such codes are resource efficient and perform on par with the standard codes.
In this spirit, we address the following questions concerning such adaptive
quantum codes in this thesis. (a) Construction: Given a noise model, we propose
a simple and fast numerical optimization algorithm to search for good quantum
codes. (b) Application: As a simple application of noise-adapted codes, we
propose an adaptive QEC protocol that allows transmission of quantum
information from one site to the other over a 1-d spin chain with high
fidelity. (c) Fault-tolerance: Finally, we address the question of whether such
noise-adapted QEC protocols can be made fault-tolerant starting with a [[4,1]]
code and obtain a rigorous lower bound on threshold.
Related papers
- Unconditionally decoherence-free quantum error mitigation by density matrix vectorization [4.2630430280861376]
We give a new paradigm of quantum error mitigation based on the vectorization of density matrices.
Our proposal directly changes the way of encoding information and maps the density matrices of noisy quantum states to noiseless pure states.
Our protocol requires no knowledge of the noise model, no ability to tune the noise strength, and no ancilla qubits for complicated controlled unitaries.
arXiv Detail & Related papers (2024-05-13T09:55:05Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations.
We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes.
Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
arXiv Detail & Related papers (2023-12-21T17:40:18Z) - 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) - Entanglement recovery in noisy binary quantum information protocols via
three-qubit quantum error correction codes [0.0]
In this paper we investigate the effects of the simple three-qubit QEC codes to restore entanglement and nonlocality in a two-qubit system.
We show that they can avoid the sudden death of entanglement and improve the performance of the addressed protocols also for larger noise amplitudes.
arXiv Detail & Related papers (2022-11-21T09:37:31Z) - Quantum Error Correction via Noise Guessing Decoding [0.0]
Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation.
This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
arXiv Detail & Related papers (2022-08-04T16:18:20Z) - NISQ: Error Correction, Mitigation, and Noise Simulation [0.39146761527401414]
Error-correcting codes were invented to correct errors on noisy communication channels.
Quantum error correction (QEC) may have a wider range of uses, including information transmission, quantum simulation/computation, and fault-tolerance.
This work examines the task of Quantum Error Mitigation (QEM) from several perspectives.
arXiv Detail & Related papers (2021-11-03T16:55:47Z) - Efficient and robust certification of genuine multipartite entanglement
in noisy quantum error correction circuits [58.720142291102135]
We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME)
We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME.
We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
arXiv Detail & Related papers (2020-10-06T18:00:07Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Efficiently computing logical noise in quantum error correcting codes [0.0]
We show that measurement errors on readout qubits manifest as a renormalization on the effective logical noise.
We derive general methods for reducing the computational complexity of the exact effective logical noise by many orders of magnitude.
arXiv Detail & Related papers (2020-03-23T19:40:56Z)
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.