Break-even point of the quantum repetition code
- URL: http://arxiv.org/abs/2303.17810v1
- Date: Fri, 31 Mar 2023 05:59:12 GMT
- Title: Break-even point of the quantum repetition code
- Authors: \'Aron Rozgonyi, G\'abor Sz\'echenyi
- Abstract summary: We show that the break-even point can be beaten even with the quantum phase-flip repetition code in a dephasing-time-limited system.
Considering current platforms for quantum computing, we identify the gate error probabilities and optimal repetition number of quantum error correction cycles to reach the break-even point.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Enhancing the lifetime of qubits with quantum code-based memories on
different quantum hardware is a significant step towards fault-tolerant quantum
computing. We theoretically show that the break-even point, i.e., preserving
arbitrary quantum information longer than the lifetime of a single idle qubit,
can be beaten even with the quantum phase-flip repetition code in a
dephasing-time-limited system. Applying circuit-based analytical calculation,
we determine the efficiency of the phase-flip code as a quantum memory in the
presence of relaxation, dephasing, and faulty quantum gates. Considering
current platforms for quantum computing, we identify the gate error
probabilities and optimal repetition number of quantum error correction cycles
to reach the break-even point.
Related papers
- 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) - QuBEC: Boosting Equivalence Checking for Quantum Circuits with QEC
Embedding [4.15692939468851]
We propose a Decision Diagram-based quantum equivalence checking approach, QuBEC, that requires less latency compared to existing techniques.
Our proposed methodology reduces verification time on certain benchmark circuits by up to $271.49 times$.
arXiv Detail & Related papers (2023-09-19T16:12:37Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Quantum Routing for Emerging Quantum Networks [0.0]
Quantum routing, the entanglement of an input quantum signal over multiple output paths, will be an important aspect of future quantum networks.
We design a combined circuit for quantum routing and quantum error correction, and carry out the first implementation of such a circuit on a noisy real-world quantum device.
Our experiments validate, for the first time, that error-corrected quantum routing in near-term noisy quantum-computing devices is feasible.
arXiv Detail & Related papers (2022-11-11T08:58:29Z) - Error Correction for Reliable Quantum Computing [0.0]
We study a phenomenon exclusive to the quantum paradigm, known as degeneracy, and its effects on the performance of sparse quantum codes.
We present methods to improve the performance of a specific family of sparse quantum codes in various different scenarios.
arXiv Detail & Related papers (2022-02-17T11:26:52Z) - Mitigating Quantum Errors via Truncated Neumann Series [10.04862322536857]
We propose a unified framework that can mitigate quantum gate and measurement errors in computing quantum expectation values.
The essential idea is to cancel the effect of quantum error by approximating its inverse via linearly combining quantum errors of different orders.
We test this framework for different quantum errors and find that the computation accuracy is substantially improved.
arXiv Detail & Related papers (2021-11-01T04:16:49Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11: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.