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:quant-ph/0008056

Approximation Errors

Nathan W. Panike

Published Aug 11, 2000• 2 citations
arXivHTMLPDF

Abstract

A bound on the error introduced by truncating a quantum addition is given. This bound shows that only a few controlled rotation gates will be necessary to get a reliable computation.
DOI
10.48550/arxiv.quant-ph/0008056

Related papers

Hamiltonian phase error in resonantly driven CNOT gate above the fault-tolerant threshold

Yi-Hsien Wu, Leon C. Camenzind, Akito Noiri +8 more

Abstract Because of their long coherence time and compatibility with industrial foundry processes, electron spin qubits are a promising platform for scalable quantum processors. A full-fledged quantum computer will need quantum error correction, which requires high-fidelity quantum gates. Analyzing and mitigating gate errors are useful to improve gate fidelity. Here, we demonstrate a simple yet reliable calibration procedure for a high-fidelity controlled-rotation gate in an exchange-always-on Silicon quantum processor, allowing operation above the fault-tolerance threshold of quantum error correction. We find that the fidelity of our uncalibrated controlled-rotation gate is limited by coherent errors in the form of controlled phases and present a method to measure and correct these phase errors. We then verify the improvement in our gate fidelities by randomized benchmark and gate-set tomography protocols. Finally, we use our phase correction protocol to implement a virtual, high-fidelity, controlled-phase gate.

arXiv:2307.09031•npj Quantum Information•Jan 11, 2024•14 citations

On Rounding Errors in the Simulation of Quantum Circuits

Jonas Klamroth, Bernhard Beckert

Lecture notes in computer science•Jan 1, 2024•0 citations

Approximate Sparse State Preparation with the Grover-Rudolph Algorithm

Debora Ramacciotti, Martin Steinbach, Bence Temesi +2 more

Sparse quantum state preparation is a common subroutine in quantum algorithms, where classical data with few nonzero entries must be loaded into a quantum state. In this work, we consider the Grover-Rudolph algorithm, which has recently been shown to efficiently prepare sparse states, and we propose two improvements. First, we extend an existing gate-merging procedure by allowing rotations to merge with virtual zero-angle gates on unreachable branches of the preparation tree, reducing the number of CNOTs and control qubits. Second, we introduce an approximate variant in which rotations with similar but not identical angles are merged at the cost of a small, controllable error in the prepared state. We derive a classically computable estimate of the resulting overlap with the target state, which is used to guide the merging decisions.

quant-pharXiv:2604.24973•Apr 29, 2026•1 citation

Influences of Gate Operation Errors in the Quantum Counting Algorithm

Qing Ai, Yansong Li, Gui‐Lu Long

Journal of Computer Science and Technology•Nov 1, 2006•15 citations

Suppressing Counter-Rotating Errors for Fast Single-Qubit Gates with Fluxonium

David A. Rower, Leon Ding, Helin Zhang +12 more

Qubit decoherence unavoidably degrades the fidelity of quantum logic gates. Accordingly, realizing gates that are as fast as possible is a guiding principle for qubit control, necessitating protocols for mitigating error channels that become significant as gate time is decreased. One such error channel arises from the counter-rotating component of strong, linearly polarized drives. This error channel is particularly important when gate times approach the qubit Larmor period and represents the dominant source of infidelity for sufficiently fast single-qubit gates with low-frequency qubits such as fluxonium. In this work, we develop and demonstrate two complementary protocols for mitigating this error channel. The first protocol realizes circularly polarized driving in circuit QED through simultaneous charge and flux control. The second protocol—commensurate pulses—leverages the coherent and periodic nature of counter-rotating fields to regularize their contributions to gates, enabling single-qubit gate fidelities reliably exceeding 99.997%. This protocol is platform independent and requires no additional calibration overhead. This work establishes straightforward strategies for mitigating counter-rotating effects from strong drives in circuit QED and other platforms, which we expect to be helpful in the effort to realize high-fidelity control for fault-tolerant quantum computing. Published by the American Physical Society 2024

arXiv:2406.08295•PRX Quantum•Dec 13, 2024•62 citations

Thresholds for reliable quantum computation

Isaac L. Chuang

APS•Mar 1, 2005•0 citations
Abstract Because of their long coherence time and compatibility with industrial foundry processes, electron spin qubits are a promising platform for scalable quantum processors. A full-fledged quantum computer will need quantum error correction, which requires high-fidelity quantum gates. Analyzing and mitigating gate errors are useful to improve gate fidelity. Here, we demonstrate a simple yet reliable calibration procedure for a high-fidelity controlled-rotation gate in an exchange-always-on Silicon quantum processor, allowing operation above the fault-tolerance threshold of quantum error correction. We find that the fidelity of our uncalibrated controlled-rotation gate is limited by coherent errors in the form of controlled phases and present a method to measure and correct these phase errors. We then verify the improvement in our gate fidelities by randomized benchmark and gate-set tomography protocols. Finally, we use our phase correction protocol to implement a virtual, high-fidelity, controlled-phase gate.
Sparse quantum state preparation is a common subroutine in quantum algorithms, where classical data with few nonzero entries must be loaded into a quantum state. In this work, we consider the Grover-Rudolph algorithm, which has recently been shown to efficiently prepare sparse states, and we propose two improvements. First, we extend an existing gate-merging procedure by allowing rotations to merge with virtual zero-angle gates on unreachable branches of the preparation tree, reducing the number of CNOTs and control qubits. Second, we introduce an approximate variant in which rotations with similar but not identical angles are merged at the cost of a small, controllable error in the prepared state. We derive a classically computable estimate of the resulting overlap with the target state, which is used to guide the merging decisions.
Qubit decoherence unavoidably degrades the fidelity of quantum logic gates. Accordingly, realizing gates that are as fast as possible is a guiding principle for qubit control, necessitating protocols for mitigating error channels that become significant as gate time is decreased. One such error channel arises from the counter-rotating component of strong, linearly polarized drives. This error channel is particularly important when gate times approach the qubit Larmor period and represents the dominant source of infidelity for sufficiently fast single-qubit gates with low-frequency qubits such as fluxonium. In this work, we develop and demonstrate two complementary protocols for mitigating this error channel. The first protocol realizes circularly polarized driving in circuit QED through simultaneous charge and flux control. The second protocol—commensurate pulses—leverages the coherent and periodic nature of counter-rotating fields to regularize their contributions to gates, enabling single-qubit gate fidelities reliably exceeding 99.997%. This protocol is platform independent and requires no additional calibration overhead. This work establishes straightforward strategies for mitigating counter-rotating effects from strong drives in circuit QED and other platforms, which we expect to be helpful in the effort to realize high-fidelity control for fault-tolerant quantum computing. Published by the American Physical Society 2024