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:1312.0165

Fault tolerance for holonomic quantum computation

Ognyan Oreshkov, Todd A. Brun, Daniel A. Lidar

Published Dec 1, 2013• 1 citation
arXivHTMLPDF

Abstract

We review an approach to fault-tolerant holonomic quantum computation on stabilizer codes. We explain its workings as based on adiabatic dragging of the subsystem containing the logical information around suitable loops along which the information remains protected.
DOI
10.48550/arxiv.1312.0165

Related papers

Scheme for fault-tolerant holonomic computation on stabilizer codes

Ognyan Oreshkov, Todd A. Brun, Daniel A. Lidar

This paper generalizes and expands upon the work [O. Oreshkov, T. A. Brun, and D. A. Lidar, Phys. Rev. Lett. 102, 070502 (2009)] where we introduced a scheme for fault-tolerant holonomic quantum computation (HQC) on stabilizer codes. HQC is an all-geometric strategy based on non-Abelian adiabatic holonomies, which is known to be robust against various types of errors in the control parameters. The scheme we present shows that HQC is a scalable method of computation and opens the possibility for combining the benefits of error correction with the inherent resilience of the holonomic approach. We show that with the Bacon-Shor code the scheme can be implemented using Hamiltonian operators of weights 2 and 3.

arXiv:0904.2143•Physical Review A•Aug 19, 2009•16 citations

Fault-Tolerant Holonomic Quantum Computation

Ognyan Oreshkov, Todd A. Brun, Daniel A. Lidar

We explain how to combine holonomic quantum computation (HQC) with fault-tolerant quantum error correction. This establishes the scalability of HQC, putting it on equal footing with other models of computation, while retaining the inherent robustness the method derives from its geometric nature.

arXiv:0806.0875•Physical Review Letters•Feb 20, 2009•71 citations

Fault-tolerant scheme of holonomic quantum computation on stabilizer codes with robustness to low-weight thermal noise

Yi-Cong Zheng, Todd A. Brun

We show an equivalence relation between fault-tolerant circuits for a stabilizer code and fault-tolerant adiabatic processes for holonomic quantum computation (HQC), in the case where quantum information is encoded in the degenerate ground space of the system Hamiltonian. By this equivalence, we can systematically construct a fault-tolerant HQC scheme, which can geometrically implement a universal set of encoded quantum gates by adiabatically deforming the system Hamiltonian. During this process, quantum information is protected from low-weight thermal excitations by an energy gap that does not change with the problem size.

arXiv:1309.1534•Physical Review A•Mar 12, 2014•12 citations

Fault-tolerent Holonomic Quantum Computation Based on Stabilizer Codes

Yi-Cong Zheng, Todd A. Brun

Bulletin of the American Physical Society•Mar 19, 2013•0 citations

Fault-tolerant holonomic quantum computation in surface codes

Yi-Cong Zheng, Todd A. Brun

We show that universal holonomic quantum computation can be achieved fault tolerantly by adiabatically deforming the gapped stabilizer Hamiltonian of the surface code, where quantum information is encoded in the degenerate ground space of the system Hamiltonian. We explicitly propose procedures to perform each logical operation, including logical state initialization, logical state measurement, logical controlled-not (cnot), state injection, distillation, etc. In particular, adiabatic braiding of different types of holes on the surface leads to a topologically protected, non-Abelian geometric logical cnot. Throughout the computation, quantum information is protected from both small perturbations and low-weight thermal excitations by a constant energy gap and is independent of the system size. Also, the Hamiltonian terms have weight at most four during the whole process. The effect of thermal error propagation is considered during the adiabatic code deformation. With the help of active error correction, this scheme is fault tolerant, in the sense that the computation time can be arbitrarily long for large-enough lattice size. It is shown that the frequency of error correction and the physical resources needed can be greatly reduced by the constant energy gap.

arXiv:1411.4248•Physical Review A•Feb 4, 2015•17 citations

Towards Fault Tolerant Adiabatic Quantum Computation

Daniel A. Lidar

I show how to protect adiabatic quantum computation (AQC) against decoherence and certain control errors, using a hybrid methodology involving dynamical decoupling, subsystem and stabilizer codes, and energy gaps. Corresponding error bounds are derived. As an example, I show how to perform decoherence-protected AQC against local noise using at most two-body interactions.

arXiv:0707.0021•Physical Review Letters•Apr 25, 2008•132 citations
This paper generalizes and expands upon the work [O. Oreshkov, T. A. Brun, and D. A. Lidar, Phys. Rev. Lett. 102, 070502 (2009)] where we introduced a scheme for fault-tolerant holonomic quantum computation (HQC) on stabilizer codes. HQC is an all-geometric strategy based on non-Abelian adiabatic holonomies, which is known to be robust against various types of errors in the control parameters. The scheme we present shows that HQC is a scalable method of computation and opens the possibility for combining the benefits of error correction with the inherent resilience of the holonomic approach. We show that with the Bacon-Shor code the scheme can be implemented using Hamiltonian operators of weights 2 and 3.
We show an equivalence relation between fault-tolerant circuits for a stabilizer code and fault-tolerant adiabatic processes for holonomic quantum computation (HQC), in the case where quantum information is encoded in the degenerate ground space of the system Hamiltonian. By this equivalence, we can systematically construct a fault-tolerant HQC scheme, which can geometrically implement a universal set of encoded quantum gates by adiabatically deforming the system Hamiltonian. During this process, quantum information is protected from low-weight thermal excitations by an energy gap that does not change with the problem size.
We show that universal holonomic quantum computation can be achieved fault tolerantly by adiabatically deforming the gapped stabilizer Hamiltonian of the surface code, where quantum information is encoded in the degenerate ground space of the system Hamiltonian. We explicitly propose procedures to perform each logical operation, including logical state initialization, logical state measurement, logical controlled-not (cnot), state injection, distillation, etc. In particular, adiabatic braiding of different types of holes on the surface leads to a topologically protected, non-Abelian geometric logical cnot. Throughout the computation, quantum information is protected from both small perturbations and low-weight thermal excitations by a constant energy gap and is independent of the system size. Also, the Hamiltonian terms have weight at most four during the whole process. The effect of thermal error propagation is considered during the adiabatic code deformation. With the help of active error correction, this scheme is fault tolerant, in the sense that the computation time can be arbitrarily long for large-enough lattice size. It is shown that the frequency of error correction and the physical resources needed can be greatly reduced by the constant energy gap.