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

Bulletin of the American Physical Society

Path-independent gates for error-corrected quantum computing: Theory

Wen-Long Ma, Philip Reinhold, Serge Rosenblum, Robert J. Schoelkopf, Liang Jiang

Published Mar 4, 2020• 0 citations
OpenAlex

Related papers

Path-Independent Gates for Error-Corrected Quantum Computing: Experiment

Serge Rosenblum, Philip Reinhold, Wen-Long Ma +3 more

Bulletin of the American Physical Society•Mar 4, 2020•0 citations

Path-Independent Quantum Gates with Noisy Ancilla

Wen-Long Ma, Mengzhen Zhang, Yat Wong +5 more

Ancilla systems are often indispensable to universal control of a nearly isolated quantum system. However, ancilla systems are typically more vulnerable to environmental noise, which limits the performance of such ancilla-assisted quantum control. To address this challenge of ancilla-induced decoherence, we propose a general framework that integrates quantum control and quantum error correction, so that we can achieve robust quantum gates resilient to ancilla noise. We introduce the path independence criterion for fault-tolerant quantum gates against ancilla errors. As an example, a path-independent gate is provided for superconducting circuits with a hardware-efficient design.

arXiv:1911.12240•Physical Review Letters•Sep 9, 2020•47 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

Error Correction for Quantum Computers

WORLD SCIENTIFIC eBooks•Jul 1, 1998•0 citations

Dust Theory Vol. 8: Gradient Quantum Computing: A Native Quantum Paradigm and Hardware Architecture Based on Gradient-Relational Ontology (Gradient Cosmos Research Series)

Y Cao

All existing quantum computing paradigms take substantial qubits as basic units and realize state evolution through quantum gate operations. Essentially, they simulate quantum effects within the framework of classical architecture, and persistently face three core bottlenecks: extreme decoherence sensitivity, huge error correction overhead, and extremely high scaling difficulty. The root cause lies in the failure to grasp the relational essence of quantum phenomena at the ontological level. Based on the path-rule duality principle of Gradient-Relational Ontology and the path-state essence of quantum states, this paper proposes gradient quantum computing as a native quantum computing paradigm. The basic unit of computation is not binary qubits, but multi-dimensional parallel conductive gradient paths; the computing process is not the sequential operation of quantum gates, but the self-organized evolution of path superposition, interference and condensation; measurement is not a special operation triggering collapse, but the spontaneous condensation of paths into rule states. The study demonstrates that this paradigm possesses endogenous decoherence suppression and native error correction capabilities. It can maintain computational stability through structural steady states without external quantum error correction codes. Its parallelism grows exponentially with path scale, and the scaling bottleneck is far lower than that of traditional qubit architectures. This paper further presents a four-layer hardware system architecture for gradient quantum computers, clarifies the core technical path of physical implementation, and proves its natural computational advantages in combinatorial optimization, quantum simulation and other problems. This study extends relational ontology to the field of quantum computing, providing a brand-new ontological path and architectural scheme for breaking through the engineering bottlenecks of existing quantum computing and realizing large-scale general-purpose quantum computing.

•Jun 27, 2026•0 citations

Measuring and Suppressing Error Correlations in Quantum Circuits

Claire Edmunds, Cornelius Hempel, R. Harris +4 more

Quantum error correction provides a path to large-scale quantum computers, but is built on challenging assumptions about the characteristics of the underlying errors. In particular, the mathematical assumption of independent errors in quantum logic operations is at odds with realistic environments where error-sources may exhibit strong temporal correlations. We present experiments enabling the identification of error correlations between operations in quantum circuits, using only projective measurements at the end of the circuit. Using a single trapped ion qubit and engineered noise with tunable temporal correlations, we identify a clear signature of error correlations between sequential gates in randomly composed quantum circuits, and extract quantitative measures linked to the underlying noise correlation length. By replacing all gates in these circuits with "virtual" dynamically corrected gates (DCGs), we demonstrate that even in the presence of strongly correlated noise the signatures of error correlations between sequential gates appear similar to standard gates exposed to uncorrelated noise. A theoretical model applied to our experiments reveals that common DCGs suppress the correlated error component by over $270\times$ with $95\%$ confidence. Using block-correlated noise, we explore the scaling of the effective error correlation length at the virtual level, and show that DCGs exhibit error correlations indistinguishable from those arising from uncorrelated noise.

arXiv:1712.04954•Dec 13, 2017•5 citations
Ancilla systems are often indispensable to universal control of a nearly isolated quantum system. However, ancilla systems are typically more vulnerable to environmental noise, which limits the performance of such ancilla-assisted quantum control. To address this challenge of ancilla-induced decoherence, we propose a general framework that integrates quantum control and quantum error correction, so that we can achieve robust quantum gates resilient to ancilla noise. We introduce the path independence criterion for fault-tolerant quantum gates against ancilla errors. As an example, a path-independent gate is provided for superconducting circuits with a hardware-efficient design.
All existing quantum computing paradigms take substantial qubits as basic units and realize state evolution through quantum gate operations. Essentially, they simulate quantum effects within the framework of classical architecture, and persistently face three core bottlenecks: extreme decoherence sensitivity, huge error correction overhead, and extremely high scaling difficulty. The root cause lies in the failure to grasp the relational essence of quantum phenomena at the ontological level. Based on the path-rule duality principle of Gradient-Relational Ontology and the path-state essence of quantum states, this paper proposes gradient quantum computing as a native quantum computing paradigm. The basic unit of computation is not binary qubits, but multi-dimensional parallel conductive gradient paths; the computing process is not the sequential operation of quantum gates, but the self-organized evolution of path superposition, interference and condensation; measurement is not a special operation triggering collapse, but the spontaneous condensation of paths into rule states. The study demonstrates that this paradigm possesses endogenous decoherence suppression and native error correction capabilities. It can maintain computational stability through structural steady states without external quantum error correction codes. Its parallelism grows exponentially with path scale, and the scaling bottleneck is far lower than that of traditional qubit architectures. This paper further presents a four-layer hardware system architecture for gradient quantum computers, clarifies the core technical path of physical implementation, and proves its natural computational advantages in combinatorial optimization, quantum simulation and other problems. This study extends relational ontology to the field of quantum computing, providing a brand-new ontological path and architectural scheme for breaking through the engineering bottlenecks of existing quantum computing and realizing large-scale general-purpose quantum computing.
Quantum error correction provides a path to large-scale quantum computers, but is built on challenging assumptions about the characteristics of the underlying errors. In particular, the mathematical assumption of independent errors in quantum logic operations is at odds with realistic environments where error-sources may exhibit strong temporal correlations. We present experiments enabling the identification of error correlations between operations in quantum circuits, using only projective measurements at the end of the circuit. Using a single trapped ion qubit and engineered noise with tunable temporal correlations, we identify a clear signature of error correlations between sequential gates in randomly composed quantum circuits, and extract quantitative measures linked to the underlying noise correlation length. By replacing all gates in these circuits with "virtual" dynamically corrected gates (DCGs), we demonstrate that even in the presence of strongly correlated noise the signatures of error correlations between sequential gates appear similar to standard gates exposed to uncorrelated noise. A theoretical model applied to our experiments reveals that common DCGs suppress the correlated error component by over 270×270\times270× with 95%95\%95% confidence. Using block-correlated noise, we explore the scaling of the effective error correlation length at the virtual level, and show that DCGs exhibit error correlations indistinguishable from those arising from uncorrelated noise.