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

Cambridge University Press eBooks

Fault tolerance for holonomic quantum computation

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

Published Sep 5, 2013• 1 citation
Publisher

Abstract

In Chapter 16 it was shown how holonomic quantum computation (HQC) can be combined with the method of decoherence-free subspaces (DFSs), leading to passive protection against certain types of correlated errors. However, this is not enough for fault tolerance since other types of errors can accumulate detrimentally unless corrected. Scalability of HQC therefore requires going beyond that scheme, e.g., by combining the holonomic approach with active error correction. One way of combining HQC with active quantum error-correcting codes, which is similar to the way HQC is combined with DFSs, was also mentioned in Chapter 16. This approach, however, is not scalable since it requires Hamiltonians that commute with the stabilizer elements, and when the code increases in size, this necessitates couplings that become increasingly nonlocal. In this chapter, we will show how HQC can be made fault tolerant by combining it with the techniques for fault-tolerant quantum error correction (FTQEC) on stabilizer codes using Hamiltonians of finite locality. The fact that the holonomic method can be mapped directly to the circuit model allows us to construct procedures that resort almost entirely to these techniques. We will discuss an approach that makes use of the encoding already present in a stabilizer code and does not require additional qubits [O08, OBL08]. An alternative approach, which requires ancillary qubits for implementing transversal operations between qubits in the code, can be found in [O09].

DOI
10.1017/cbo9781139034807.019

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•18 citations

Towards efficient fault-tolerant quantum computation

Yi-Cong Zheng

The threshold theorem indicates that if errors are all local and their rates are below a certain threshold, it is possible to implement large scale quantum computation with arbitrarily small error based on active quantum error correction (QEC). However, most fault-tolerant quantum computation (FTQC) schemes require enormous overhead to achieve this rate by increasing either the concatenation levels for concatenated codes or the distance (hence the size) for topological codes. As a result, a logical qubit is usually encoded in more than thousands of physical qubits, even when the error rate is below the threshold. In this thesis, we try to reduce the resource overhead of FTQC. We first study a quantum computation scheme using clouds of atoms trapped on atomic chips. It suggests that this scheme is robust to noise to some extent and has potential to be scalable. Secondly, we propose a FTQC scheme of encoding many logical qubits into large code blocks. The error performance of such scheme is numerically studied. Preparation of various ancilla states necessary for computation is also explored. Thirdly, we explore the idea of introducing energy gap to suppress thermal noise on each qubit. We show that fault-tolerant holonomic quantum computation (HQC) can be implemented in stabilizer codes with the existence of such energy protection. Especially, we studied fault-tolerant HQC in surface codes in detail. This scheme opens the possibility for self-correcting quantum computation in 2D lattice.

•Aug 6, 2015•0 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•13 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•73 citations

Holonomic Quantum Computation in Subsystems

Ognyan Oreshkov

We introduce a generalized method of holonomic quantum computation (HQC) based on encoding in subsystems. As an application, we propose a scheme for applying holonomic gates to unencoded qubits by the use of a noisy ancillary qubit. This scheme does not require initialization in a subspace since all dynamical effects factor out as a transformation on the ancilla. We use this approach to show how fault-tolerant HQC can be realized via 2-local Hamiltonians with perturbative gadgets.

arXiv:0905.1249•Physical Review Letters•Aug 25, 2009•24 citations

Concatenating quantum error-correcting codes with decoherence-free subspaces and vice versa

Nihar Ranjan Dash, Sanjoy Dutta, R. Srikanth +1 more

Quantum error-correcting codes (QECCs) and decoherence-free subspace (DFS) codes provide active and passive means, respectively, to address certain types of errors that arise during quantum computation. The latter technique is suitable to correct correlated errors with certain symmetries and the former to correct independent errors. The concatenation of a QECC and a DFS code results in a degenerate code that splits into actively and passively correcting parts, with the degeneracy impacting either part, leading to degenerate errors as well as degenerate stabilizer operators. The concatenation of the two types of code can aid universal fault-tolerant quantum computation when a mix of correlated and independent errors is encountered. In particular, we show that for sufficiently strongly correlated errors, the concatenation with the DFS as the inner code provides better entanglement fidelity, whereas for sufficiently independent errors, the concatenation with the QECC as the inner code is preferable. As illustrative examples, we examine in detail the concatenation of a two-qubit DFS code and a three-qubit repetition code or five-qubit Knill-Laflamme code, under independent and correlated errors.

arXiv:2312.08322•Physical Review A•Jun 10, 2024•6 citations
In Chapter 16 it was shown how holonomic quantum computation (HQC) can be combined with the method of decoherence-free subspaces (DFSs), leading to passive protection against certain types of correlated errors. However, this is not enough for fault tolerance since other types of errors can accumulate detrimentally unless corrected. Scalability of HQC therefore requires going beyond that scheme, e.g., by combining the holonomic approach with active error correction. One way of combining HQC with active quantum error-correcting codes, which is similar to the way HQC is combined with DFSs, was also mentioned in Chapter 16. This approach, however, is not scalable since it requires Hamiltonians that commute with the stabilizer elements, and when the code increases in size, this necessitates couplings that become increasingly nonlocal. In this chapter, we will show how HQC can be made fault tolerant by combining it with the techniques for fault-tolerant quantum error correction (FTQEC) on stabilizer codes using Hamiltonians of finite locality. The fact that the holonomic method can be mapped directly to the circuit model allows us to construct procedures that resort almost entirely to these techniques. We will discuss an approach that makes use of the encoding already present in a stabilizer code and does not require additional qubits [O08, OBL08]. An alternative approach, which requires ancillary qubits for implementing transversal operations between qubits in the code, can be found in [O09].
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.
The threshold theorem indicates that if errors are all local and their rates are below a certain threshold, it is possible to implement large scale quantum computation with arbitrarily small error based on active quantum error correction (QEC). However, most fault-tolerant quantum computation (FTQC) schemes require enormous overhead to achieve this rate by increasing either the concatenation levels for concatenated codes or the distance (hence the size) for topological codes. As a result, a logical qubit is usually encoded in more than thousands of physical qubits, even when the error rate is below the threshold. In this thesis, we try to reduce the resource overhead of FTQC. We first study a quantum computation scheme using clouds of atoms trapped on atomic chips. It suggests that this scheme is robust to noise to some extent and has potential to be scalable. Secondly, we propose a FTQC scheme of encoding many logical qubits into large code blocks. The error performance of such scheme is numerically studied. Preparation of various ancilla states necessary for computation is also explored. Thirdly, we explore the idea of introducing energy gap to suppress thermal noise on each qubit. We show that fault-tolerant holonomic quantum computation (HQC) can be implemented in stabilizer codes with the existence of such energy protection. Especially, we studied fault-tolerant HQC in surface codes in detail. This scheme opens the possibility for self-correcting quantum computation in 2D lattice.
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.
Quantum error-correcting codes (QECCs) and decoherence-free subspace (DFS) codes provide active and passive means, respectively, to address certain types of errors that arise during quantum computation. The latter technique is suitable to correct correlated errors with certain symmetries and the former to correct independent errors. The concatenation of a QECC and a DFS code results in a degenerate code that splits into actively and passively correcting parts, with the degeneracy impacting either part, leading to degenerate errors as well as degenerate stabilizer operators. The concatenation of the two types of code can aid universal fault-tolerant quantum computation when a mix of correlated and independent errors is encountered. In particular, we show that for sufficiently strongly correlated errors, the concatenation with the DFS as the inner code provides better entanglement fidelity, whereas for sufficiently independent errors, the concatenation with the QECC as the inner code is preferable. As illustrative examples, we examine in detail the concatenation of a two-qubit DFS code and a three-qubit repetition code or five-qubit Knill-Laflamme code, under independent and correlated errors.