Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1109.4796 · Annals of Physics

Error correction in short time steps during the application of quantum gates

L.A. de Castro, Reginaldo de Jesus Napolitano

Published Jan 28, 2016• 1 citation
arXivHTMLPDF
DOI
10.1016/j.aop.2016.01.014

Related papers

The Qubit Fidelity Under Different Error Mechanisms Based on Error Correction Threshold

Kai Li

Quantum error correction is a crucial step to realize large-scale universal quantum computing, and the condition for realizing quantum error correction is that the error probability of each operation step must below some threshold. This requires that the qubits’ quality and the quantum gates precision can reach a certain level experimentally. We firstly discuss the mechanism of quantum errors: the precision of quantum gates corresponds to unitary operator errors, and the quality of qubits is attributed to decoherence. Then, according to the threshold of the surface code error correction, we proved the minimum of quantum gate fidelity should not be less than 1 − p with the error probability p, and found the natural decoherence time of qubits that can be used for error correction. This provides some kind of theoretical supports for qubits preparation and performing quantum operations experimentally.

Frontiers in Physics•Apr 29, 2022•5 citations

Error Correction in Quantum Computing

Jesús Yaljá Montiel-Pérez, Jordi Fabián González-Contreras, Erik Zamora +1 more

Studies in computational intelligence•Jan 1, 2025•0 citations

Significant improvement of fidelity for encoded quantum bell pairs at long and short-distance communication along with generalized circuit

Syed Emad Uddin Shubha, Md. Saifur Rahman, M. R. C. Mahdy

Quantum entanglement is a unique criterion of the quantum realm and an essential tool to secure quantum communication. Ensuring high-fidelity entanglement has always been a challenging task owing to interaction with the hostile channel environment created due to quantum noise and decoherence. Though several methods have been proposed, correcting almost all arbitrary errors is still a gigantic task. As one of the main contributions of this work, a new model for 'large distance communication' has been proposed, which may correct all bit flip errors or other errors quite extensively if proper encoding and subspace measurements are used. To achieve this purpose, at the very first step, the idea of differentiating the 'long-distance communication' and 'short-distance applications' has been introduced. Short-distance is determined by the maximum range of applying unitary control gates by the qubit technology. How the error correcting ability of Quantum codes change for short and long-distance application is investigated in this work, which was not explored in previous literatures as far as we know. At the beginning, we have applied stabilizer formalism and Repetition Code for decoding to distinguish the error correcting ability in long and short distance communication. Particularly for short-distance communication, it has been demonstrated that a 'properly encoded' bell state can identify all the bit flip, or phase flip errors with 100% accuracy theoretically. In contrast, if the bell states are used in long-distance communication, the error-detecting and correcting ability reduces at huge amounts. To increase the fidelity significantly and correct the errors quite extensively for long-distance communication, a new model based on classical communication protocol has been suggested. All the required circuits in these processes have been generalized for arbitrary (even) numbers of ancilla qubits during encoding. Proposed analytical results have also been verified with the Simulation results of IBM QISKIT QASM.

arXiv:2303.07425•Heliyon•Aug 31, 2023•1 citation

Error Correction for Quantum Computers

WORLD SCIENTIFIC eBooks•Jul 1, 1998•0 citations

Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors

Jan-Michael Reiner, Frank K. Wilhelm, Gerd Schön +1 more

Abstract A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of reach. Hence, the finite error rate limits the use of quantum computers to algorithms with a low number of gates. The variational Hamiltonian ansatz (VHA) has been shown to produce the ground state in good approximation in a manageable number of steps. Here we study explicitly the effect of gate errors on its performance. The VHA is inspired by the adiabatic quantum evolution under the influence of a time-dependent Hamiltonian, where the—ideally short—fixed Trotter time steps are replaced by variational parameters. The method profits substantially from quantum variational error suppression, e.g. unitary quasi-static errors are mitigated within the algorithm. We test the performance of the VHA when applied to the Hubbard model in the presence of unitary control errors on quantum computers with realistic gate fidelities.

arXiv:1811.04476•Quantum Science and Technology•May 1, 2019•49 citations

Quantum Error Correction with Imperfect Gates

Alexei Kitaev

Springer eBooks•Jan 1, 1997•212 citations
Quantum error correction is a crucial step to realize large-scale universal quantum computing, and the condition for realizing quantum error correction is that the error probability of each operation step must below some threshold. This requires that the qubits’ quality and the quantum gates precision can reach a certain level experimentally. We firstly discuss the mechanism of quantum errors: the precision of quantum gates corresponds to unitary operator errors, and the quality of qubits is attributed to decoherence. Then, according to the threshold of the surface code error correction, we proved the minimum of quantum gate fidelity should not be less than 1 − p with the error probability p, and found the natural decoherence time of qubits that can be used for error correction. This provides some kind of theoretical supports for qubits preparation and performing quantum operations experimentally.
Quantum entanglement is a unique criterion of the quantum realm and an essential tool to secure quantum communication. Ensuring high-fidelity entanglement has always been a challenging task owing to interaction with the hostile channel environment created due to quantum noise and decoherence. Though several methods have been proposed, correcting almost all arbitrary errors is still a gigantic task. As one of the main contributions of this work, a new model for 'large distance communication' has been proposed, which may correct all bit flip errors or other errors quite extensively if proper encoding and subspace measurements are used. To achieve this purpose, at the very first step, the idea of differentiating the 'long-distance communication' and 'short-distance applications' has been introduced. Short-distance is determined by the maximum range of applying unitary control gates by the qubit technology. How the error correcting ability of Quantum codes change for short and long-distance application is investigated in this work, which was not explored in previous literatures as far as we know. At the beginning, we have applied stabilizer formalism and Repetition Code for decoding to distinguish the error correcting ability in long and short distance communication. Particularly for short-distance communication, it has been demonstrated that a 'properly encoded' bell state can identify all the bit flip, or phase flip errors with 100% accuracy theoretically. In contrast, if the bell states are used in long-distance communication, the error-detecting and correcting ability reduces at huge amounts. To increase the fidelity significantly and correct the errors quite extensively for long-distance communication, a new model based on classical communication protocol has been suggested. All the required circuits in these processes have been generalized for arbitrary (even) numbers of ancilla qubits during encoding. Proposed analytical results have also been verified with the Simulation results of IBM QISKIT QASM.
Abstract A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of reach. Hence, the finite error rate limits the use of quantum computers to algorithms with a low number of gates. The variational Hamiltonian ansatz (VHA) has been shown to produce the ground state in good approximation in a manageable number of steps. Here we study explicitly the effect of gate errors on its performance. The VHA is inspired by the adiabatic quantum evolution under the influence of a time-dependent Hamiltonian, where the—ideally short—fixed Trotter time steps are replaced by variational parameters. The method profits substantially from quantum variational error suppression, e.g. unitary quasi-static errors are mitigated within the algorithm. We test the performance of the VHA when applied to the Hubbard model in the presence of unitary control errors on quantum computers with realistic gate fidelities.