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

Optical Fiber Communication Conference

Double helix quantum computer

Richard W. Ziolkowski, Edwin A. Marengo

Published Jan 1, 2001• 1 citation
Publisher

Abstract

A new, “double helix” quantum computer architecture is proposed wherein the qubits are stored in two, dual physical worlds corresponding to the target versus the control qubit roles of controlled-not and other universal quantum gates.
DOI
10.1364/icqi.2001.pb2

Related papers

How NOT to build control-target gates in semiconductor quantum dots and beyond

Roman Korol, John Nichol, Ignacio Franco

Universal quantum computation requires single-qubit control together with at least one entangling two-qubit gate. CNOT and CROT gates are two famous examples of such gates, wherein the state of one qubit (control) dictates the transformation applied to the other (target). By using a simple derivation motivated by symmetry, we show that current device architectures of semiconductor-based quantum dot devices prevent efficient implementation of a CNOT and other asymmetric control-target gates via Heisenberg exchange, Coulomb repulsion, or other interaction that is invariant under spin exchange. Guided by this general principle, we propose a heterogeneous blueprint of double quantum dot devices that enables efficient implementation of the CNOT by breaking the spin exchange symmetry. Crucially, our numerical simulations predict that this novel device blueprint can enable a single-pulse fault-tolerant 100-ns CNOT gate in isotopically purified silicon.

cond-mat.mes-hallCross-listedarXiv:2608.00733•Aug 4, 2026•0 citations

Experimental validation of a compact fault-tolerant architecture for trapped ions

Noah Berthusen, Ali Lavasani, Asmae Benhemou +11 more

Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require more than low-error quantum memory. An effective architecture must orchestrate efficient logical encoding, low-overhead logical operations, and access to the non-Clifford resources required for universal computation. Here, we introduce and experimentally validate such an architecture based on the $[[20,2,6]]$ $C_4$-Helix code, designed for the early fault-tolerant regime. Using Quantinuum Helios, a 98-qubit trapped-ion quantum processor, we experimentally demonstrate the principal components of this architecture: we perform repeated quantum error correction with an error of $4.6^{+6.2}_{-2.6}\times10^{-5}$ per logical qubit per QEC cycle. We benchmark the complete Clifford group on the two logical qubits of a single codeblock under active error correction, obtaining an error of $2.8^{+1.0}_{-1.6}\times 10^{-4}$ per two-qubit logical Clifford. We further demonstrate a fault-tolerant chain-map interface between $C_4$-Helix and a distance-5 surface code, preparing a heterogeneous three-logical-qubit GHZ state with a fidelity lower bound of $99.925^{+0.068}_{-0.245}\%$. In each case, the encoded implementation outperforms its corresponding unencoded physical baseline without relying on postselection. Circuit-level simulations indicate that improvements in physical fidelity bring the same architecture into the $10^{-6}$-$10^{-8}$ logical-error regime targeted for early fault-tolerant computation. Together, these results establish $C_4$-Helix as a hardware-validated fault-tolerant architecture rather than a bare quantum memory.

quant-pharXiv:2609.03194•Sep 4, 2026•0 citations

The art of quantum computing

Miya Knights

This paper presents a different kind of computer that will exploit the peculiarities of the quantum world to accomplish number-crunching feats that are currently impossible. The principles by which a quantum computer would work are quite different from those governing today's classical computers. Despite current processor and memory designs already having to take quantum mechanical effects into account, quantum computing is something far stranger.

Engineering & Technology•Jan 1, 2007•5 citations

Far Fewer Qubits Required for “Quantum Memory” Quantum Computers

Erika K. Carlson

Incorporating storage units for quantum information into quantum computers may allow researchers to build such devices with several orders of magnitude fewer qubits in their processors.

Physics•Sep 28, 2021•0 citations

A blueprint for building a quantum computer

Rodney Van Meter, Dominic C. Horsman

Quantum computer architecture holds the key to building commercially viable systems.

Communications of the ACM•Sep 26, 2013•115 citations

Quantum Cryptography Technique Using Multi-Qubit Control Gates

Bayram Ashyrmyradovich Jumayev

Quantum information processing and information exchange in the world of quantum computing demands novel methods, strategies and techniques based on quantum gates. Due to the facts that quantum computing is becoming more powerful and there are impactful scientific developments that would make quantum computers practical, post-quantum cryptography would require novel methods. In this sense, the paper presents a new approach or tool to be used in ciphering and deciphering information using multi-qubit control gates. This technique would be beneficial in terms of transforming information to another form and rebuilding it through asymmetric methods by the help of previously developed multi-qubit quantum gates. The underlying methodology of the technique is based on unitary transformations which may be divided into two parts: ciphering and deciphering parts. Moreover, controlling target qubits in accordance with the control qubit was also benefited within the methodology. In this sense, multi-qubit control gates, derived from mathematical model of universal control gates, play important role. Post-quantum cryptographic methods and strategies would be improved through this kind of methodologies.

International Conference on Computer Systems and Technologies (CompSysTech)•Jun 27, 2025•0 citations
Universal quantum computation requires single-qubit control together with at least one entangling two-qubit gate. CNOT and CROT gates are two famous examples of such gates, wherein the state of one qubit (control) dictates the transformation applied to the other (target). By using a simple derivation motivated by symmetry, we show that current device architectures of semiconductor-based quantum dot devices prevent efficient implementation of a CNOT and other asymmetric control-target gates via Heisenberg exchange, Coulomb repulsion, or other interaction that is invariant under spin exchange. Guided by this general principle, we propose a heterogeneous blueprint of double quantum dot devices that enables efficient implementation of the CNOT by breaking the spin exchange symmetry. Crucially, our numerical simulations predict that this novel device blueprint can enable a single-pulse fault-tolerant 100-ns CNOT gate in isotopically purified silicon.
Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require more than low-error quantum memory. An effective architecture must orchestrate efficient logical encoding, low-overhead logical operations, and access to the non-Clifford resources required for universal computation. Here, we introduce and experimentally validate such an architecture based on the [[20,2,6]][[20,2,6]][[20,2,6]] C4C_4C4​-Helix code, designed for the early fault-tolerant regime. Using Quantinuum Helios, a 98-qubit trapped-ion quantum processor, we experimentally demonstrate the principal components of this architecture: we perform repeated quantum error correction with an error of 4.6−2.6+6.2×10−54.6^{+6.2}_{-2.6}\times10^{-5}4.6−2.6+6.2​×10−5 per logical qubit per QEC cycle. We benchmark the complete Clifford group on the two logical qubits of a single codeblock under active error correction, obtaining an error of 2.8−1.6+1.0×10−42.8^{+1.0}_{-1.6}\times 10^{-4}2.8−1.6+1.0​×10−4 per two-qubit logical Clifford. We further demonstrate a fault-tolerant chain-map interface between C4C_4C4​-Helix and a distance-5 surface code, preparing a heterogeneous three-logical-qubit GHZ state with a fidelity lower bound of 99.925−0.245+0.068%99.925^{+0.068}_{-0.245}\%99.925−0.245+0.068​%. In each case, the encoded implementation outperforms its corresponding unencoded physical baseline without relying on postselection. Circuit-level simulations indicate that improvements in physical fidelity bring the same architecture into the 10−610^{-6}10−6-10−810^{-8}10−8 logical-error regime targeted for early fault-tolerant computation. Together, these results establish C4C_4C4​-Helix as a hardware-validated fault-tolerant architecture rather than a bare quantum memory.
Quantum information processing and information exchange in the world of quantum computing demands novel methods, strategies and techniques based on quantum gates. Due to the facts that quantum computing is becoming more powerful and there are impactful scientific developments that would make quantum computers practical, post-quantum cryptography would require novel methods. In this sense, the paper presents a new approach or tool to be used in ciphering and deciphering information using multi-qubit control gates. This technique would be beneficial in terms of transforming information to another form and rebuilding it through asymmetric methods by the help of previously developed multi-qubit quantum gates. The underlying methodology of the technique is based on unitary transformations which may be divided into two parts: ciphering and deciphering parts. Moreover, controlling target qubits in accordance with the control qubit was also benefited within the methodology. In this sense, multi-qubit control gates, derived from mathematical model of universal control gates, play important role. Post-quantum cryptographic methods and strategies would be improved through this kind of methodologies.