The contribution of a geometric phase factor originates from the very heart of the structure of quantum mechanics. An interest in geometric phenomena in quantum physics has been recently motivated by the proposal of using geometric phases for quantum computation. Geometric (or “Berry") phases depend only on the geometry of the path executed, and are therefore resilient to certain types of errors. The idea is to exploit this inherent robustness provided by the topological properties of some quantum systems as a means of constructing built-in fault tolerant quantum logic gates. Various strategies have been proposed to reach this goal, some of them making use of purely geometric evolutions, that is, non-Abelian holonomies. This chapter discusses the non-Abelian generalization of the geometric phase, or holonomy. It then discusses the implementation of holonomic quantum computation, and summarizes the potential advantages of using geometrical evolution to implement quantum gates.
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].
Among the many proposals for the realization of a quantum computer, holonomic quantum computation is distinguished from the rest as it is geometrical in nature and thus expected to be robust against decoherence. Here we analyze the realization of various quantum gates by solving the inverse problem: Given a unitary matrix, we develop a formalism by which we find loops in the parameter space generating this matrix as a holonomy. We demonstrate that such a one-qubit gate as the Hadamard gate and such two-qubit gates as the controlled-NOT gate and the SWAP gate, and the discrete Fourier transformation can be obtained with a single loop.
Holonomic quantum computation (HQC) is materialized here with quantum optics components. Holonomies are the generalization of the Berry phases to unitary matrices. In a nonlinear Kerr medium the degenerate states of a laser beams are interpreted as qubits. Control manipulations with displacers, squeezers and two-mode interfering devices in a cyclic, adiabatic fashion produces holonomies. Hence, they are employed as logical gates for our HQC proposal. The effects of errors from imperfect control of classical parameters, the looping variation of which builds up holonomic gates, are also investigated. Additionally, the influence of quantum decoherence on holonomic tele-portation used as a computational primitive is studied, and particular features of control error resilience are discussed.