Quantum computation has been shown to be superior to classical computation in solving some problems, and therefore can substantially change our life. However, the realization of quantum computation is still challenging, even if quantum technologies have been improved significantly. Two main obstacles to the realization of practical quantum computation are control errors and decoherence. Control errors are caused by inaccurate manipulations of quantum systems and decoherence is caused by the inevitable interaction between the system and its environment. Geometric phases are only dependent on evolution paths of quantum systems but independent of the evolution details and therefore quantum computation based on geometric phases, i.e., geometric quantum computation, is robust against control errors, benefiting the realization of practical quantum computation. The early proposals of geometric quantum computation are based on adiabatic geometric phases. These proposals require quantum systems to undergo adiabatic evolution, which makes quantum systems evolve for a long time. To circumvent this, nonadiabatic geometric quantum computation based on nonadiabatic Abelian geometric phases was proposed soon after. In 2012, nonadiabatic holonomic quantum computation based on nonadiabatic non-Abelian geometric phases was proposed, which also circumvents long-time evolutions. Moreover, compared with nonadiabatic geometric quantum computation that uses the geometric phase as one parameter of a quantum gate, nonadiabatic holonomic quantum computation uses the holonomic matrix itself as a quantum gate. This makes nonadiabatic holonomic quantum computation possess whole-geometric property. Due to the merits of both geometric robustness and high-speed implementation without the limit of adiabatic evolution, nonadiabatic holonomic quantum computation has been attracting much attention. Until now, much progress has been achieved in the field of nonadiabatic holonomic quantum computation. On one hand, various methods have been proposed to design more efficient nonadiabatic holonomic gates. Nonadiabatic holonomic gates were first realized by using resonant laser fields to drive a three-level system. After this, the single-shot proposal and the single-loop proposal were proposed, allowing us to realize one-qubit gates by a shorter path and thereby reducing the exposure time of nonadiabatic holonomic gates to the environment. To further shorten the exposure time, the path-shortening protocol was put forward, where nonadiabatic holonomic gates can be realized based on a class of extended evolution paths that are shorter than the former ones. Recently, a general approach of constructing Hamiltonians for nonadiabatic holonomic quantum computation was put forward, by using which one can easily find a Hamiltonian making the quantum system evolve along a desired path so that nonadiabatic holonomic gates can be realized with an economical evolution time. On the other hand, various methods have been proposed to combine nonadiabatic holonomic gates and various decoherence-resilient methods, making the resulting schemes robust against both control errors and decoherence. The first proposal in this aspect is combining nonadiabatic holonomic gates and decoherence-free subspaces. Gradually, proposals combining nonadiabatic holonomic gates with noiseless subsystems, dynamical decoupling and surface codes were put forward. Last but not least, various proposals suitable for specific physical systems have been proposed and particularly various experimental platforms have been used to demonstrate nonadiabatic holonomic gates. This also significantly improves the development of nonadiabatic holonomic quantum computation. In this paper, we review the above research advances on nonadiabatic holonomic quantum computation, aiming to help readers understand the main developments of nonadiabatic holonomic quantum computation.
Besides standard dynamical schemes to realize a quantum computer, there are particular approaches which are based on intrinsic properties of quantum systems, leading to the definition of topological computation and holonomic, or geometric, computation. The holonomic approach can be viewed as the application of non-Abelian geometric phases to quantum information processing, it is believed to be fault-tolerant with respect of certain kind of parametric noise. Here we discuss the issue of robustness of holonomic quantum gates under parametric noise: we distinguish between geometric and dynamical effects of cancelation, which can appear in different contexts. A so-called standard argument in favor of the stability of noisy holonomic quantum gates is reviewed and extended to more general settings. New geometric effects that describe the behavior of noisy holonomic gates are presented. These effects lead to a refining of the optimal strategy to achieve a robust computation.
Geometric quantum phases enable the construction geometric quantum gates, whose action only depend on the evolution path in state space. Geometric gates may offer increased robustness to control parameter noise. In this report, the conditions under which non-adiabatic geometric and holonomic quantum gates preserve their geometric character under sequential composition are analysed. Grover’s search algorithm requiring non-commuting operations is used as a representative example. The basic concepts of qubits, quantum gates and quantum circuits are explained. The concept of geometric phases is introduced and derivations of Abelian and non-Abelian non-adiabatic geometric phases are provided (Aharonov-Anandan and Anandan phase respectively). Construction of geometric and holonomic universal quantum gate sets with the aforementioned geometric phases are briefly described.Explicit calculation of two non-commuting Abelian and non-adiabatic geometric time evolutions show that the successively combined operation is not geometric. A proof of successive combinations of non-Abelian and non-adiabatic geometric time evolutions preserving their non-adiabatic Abelian and geometric properties is given. The report concludes that it is in general not possible to perform quantum circuits completely geometrically with a geometric universal quantum gate set. However, performing quantum computations with gates from a holonomic universal gate set is geometric and holonomic throughout the computation.
Holonomic quantum computation exploits a quantum state's nontrivial, matrix-valued geometric phase (holonomy) to perform fault-tolerant computation. Holonomies arising from systems where the Hamiltonian traces a continuous path through parameter space have been well researched. Discrete holonomies, on the other hand, where the state jumps from point to point in state space, have had little prior investigation. Using a sequence of incomplete projective measurements of the spin operator, we build an explicit approach to universal quantum computation. We show that quantum error correction codes integrate naturally in our scheme, providing a model for measurement-based quantum computation that combines the passive error resilience of holonomic quantum computation and active error correction techniques. In the limit of dense measurements we recover known continuous-path holonomies.
Implementing quantum gates as non-Abelian holonomies, a class of topologically protected unitary operators, is a particularly promising paradigm for the design of intrinsically stable quantum computers [1]. In contrast to dynamic phases, the geometric phase accumulated by a quantum system propagating through a Hilbert space
Hdepends exclusively on its path. In general, geometric phases can exhibit arbitrary dimensionality. Wilczek and Zee introduced the idea of multi-dimensional, non-Abelian geometric phases - so called holonomies [2]. Anandan later dropped the requirement of adiabaticity to create holonomies, that are truly time-independent [3]. Non-adiabatic holonomies rely on a subspace
Hgeoof the Hilbert-space that is spanned by states
{∣Φk⟩}kthat fulfill
(Φk∣H^∣Φj⟩=0, where
H^is the system's Hamiltonian. Restricting the propagation to
Hgeoensures parallel transport and, thus, a purely geometric phase (see Fig. 1a) [4], [5]. Quantum optics constitutes a particularly versatile platform for quantum information processing, and in particular for the construction of non-adiabatic holonomic quantum computers: In addition to integration and miniaturization provided by the platform, the bosonic nature of photons also conveniently allows for multiple excitations of the same mode, readily expanding
Hgeoand enabling the synthesis of holonomies from higher symmetry groups
U(N)as larger and more capable computational units [6], [7].