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

Fault-tolerant and Continuous Holonomic Gates for Topologically Protected Qubits.

Andrey R. Klots, Lara Faoro, R. McDermott, L. B. Ioffe

Published Mar 4, 2019• 0 citations
OpenAlex

Related papers

Fault-tolerant gates on a logical qubit

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

APS•Jan 1, 2019•0 citations

E8‑Φ Braided Holonomic Gates via Resonant Edge Defects — E8 Intelligence Research

Andrew Stewart Caldin

The 132 Hz phi‑coupled drive makes the 240 E8 root vectors synchronize into a global braided lattice of topological defects that wind around the 6,720 edges of the root polytope. Closed holonomy loops formed by these defect braids encode logical qubits in homotopy classes of edge‑traversals, yielding a fault‑tolerant quantum gate set whose operations are realized by resonant phase twists that continuously deform the braid topology. This principle extends prior holonomic memory by turning the defect network into an active error‑correcting processor, where logical gates are geometrically protected by the E8 root structure and the phi‑modulated frequency. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 6, 2026•0 citations

Holonomic surface codes for fault-tolerant quantum computation

Jiang Zhang, Simon J. Devitt, J. Q. You +1 more

Surface codes can protect quantum information stored in qubits from local errors as long as the per-operation error rate is below a certain threshold. Here we propose holonomic surface codes by harnessing the quantum holonomy of the system. In our scheme, the holonomic gates are built via auxiliary qubits rather than the auxiliary levels in multilevel systems used in conventional holonomic quantum computation. The key advantage of our approach is that the auxiliary qubits are in their ground state before and after each gate operation, so they are not involved in the operation cycles of surface codes. This provides an advantageous way to implement surface codes for fault-tolerant quantum computation.

arXiv:1708.02360•Physical Review A•Feb 26, 2018•62 citations

Steering paths mid-flight for fault-tolerance in measurement-based holonomic gates

Anirudh Lanka, Juan Garcia-Nila, Todd A. Brun

Continuous measurement-based holonomic quantum computation provides a route to universal logical computation in quantum error correcting codes. We introduce a fault-tolerant framework for implementing measurement-based holonomic gates that leverages continuous measurements with real-time feedback. We show that non-Markovian decoherence is intrinsically suppressed through the quantum Zeno effect, while Markovian errors are identified by the decoding of measurement records to reveal the rotated syndrome subspace populated during the evolution. This information enables steering holonomic paths mid-flight to ensure that the final evolution realizes the target logical gate. We further demonstrate that non-adiabatic effects give rise to measurement-induced errors, and we show that these can also be corrected by an analogous protocol. This approach relaxes the stringent adiabaticity requirement and enables faster implementation of holonomic gates.

quant-pharXiv:2603.02552•Mar 4, 2026•3 citations

Quantum Computation with Topological Codes: From Qubit to Topological Fault-Tolerance

Keisuke Fujii

arXiv:1504.01444•SpringerBriefs in mathematical physics•Jan 1, 2015•83 citations

Implementing robust Holonomic quantum gates using dynamical invariant

Yingcheng Li, Yidun Wan

Bulletin of the American Physical Society•Mar 2, 2020•0 citations
The 132 Hz phi‑coupled drive makes the 240 E8 root vectors synchronize into a global braided lattice of topological defects that wind around the 6,720 edges of the root polytope. Closed holonomy loops formed by these defect braids encode logical qubits in homotopy classes of edge‑traversals, yielding a fault‑tolerant quantum gate set whose operations are realized by resonant phase twists that continuously deform the braid topology. This principle extends prior holonomic memory by turning the defect network into an active error‑correcting processor, where logical gates are geometrically protected by the E8 root structure and the phi‑modulated frequency. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Surface codes can protect quantum information stored in qubits from local errors as long as the per-operation error rate is below a certain threshold. Here we propose holonomic surface codes by harnessing the quantum holonomy of the system. In our scheme, the holonomic gates are built via auxiliary qubits rather than the auxiliary levels in multilevel systems used in conventional holonomic quantum computation. The key advantage of our approach is that the auxiliary qubits are in their ground state before and after each gate operation, so they are not involved in the operation cycles of surface codes. This provides an advantageous way to implement surface codes for fault-tolerant quantum computation.
Continuous measurement-based holonomic quantum computation provides a route to universal logical computation in quantum error correcting codes. We introduce a fault-tolerant framework for implementing measurement-based holonomic gates that leverages continuous measurements with real-time feedback. We show that non-Markovian decoherence is intrinsically suppressed through the quantum Zeno effect, while Markovian errors are identified by the decoding of measurement records to reveal the rotated syndrome subspace populated during the evolution. This information enables steering holonomic paths mid-flight to ensure that the final evolution realizes the target logical gate. We further demonstrate that non-adiabatic effects give rise to measurement-induced errors, and we show that these can also be corrected by an analogous protocol. This approach relaxes the stringent adiabaticity requirement and enables faster implementation of holonomic gates.