We outline the theory of holonomic quantum computing and implementation of a holonomic quantum gate. Then we analyze an isospectral deformation of the Ising-type model Hamiltonian as an example of holonomic quantum computing and construct a few holonomic quantum gates using this system.
We exactly construct one- and two-qubit holonomic quantum gates in terms of isospectral deformations of an Ising model Hamiltonian. A single logical qubit is constructed out of two spin-21 particles; the qubit is a dimer. We find that the holonomic gates obtained are discrete but dense in the unitary group. Therefore an approximate gate for a desired one can be constructed with arbitrary accuracy.
Holonomic quantum computer uses a non-Abelian adiabatic phase associated with a control-parameter loop as a unitary gate. Holonomic computation should be processed slowly for keeping adiabaticity. On the other hand, holonomic computation should be executed in a short time for avoiding decoherence. These two requests, the slow process and the quick execution, seem contradictory each other and lead to a kind of optimization problem, which is called the isoholonomic problem. In this lecture we review the formulation of the holonomy in quantum mechanics and the solution of the optimal control problem of the holonomy. We also discuss possible implementations of the holonomic quantum computer.
The main challenges in achieving high-fidelity quantum gates are to reduce the influence of control errors caused by imperfect Hamiltonians and the influence of decoherence caused by environment noise. To overcome control errors, a promising proposal is nonadiabatic holonomic quantum computation, which has attracted much attention in both theories and experiments. While the merit of holonomic operations resisting control errors has been well exploited, an important issue following is how to shorten the evolution time needed for realizing a holonomic gate so as to avoid the influence of environment noise as much as possible. In this paper, we put forward a general approach of constructing Hamiltonians for nonadiabatic holonomic quantum computation, which makes it possible to minimize the evolution time and might open a new horizon for the realistic implementation of nonadiabatic holonomic quantum computation.
We study the construction of holonomy loops numerically in a realization-independent model of holonomic quantum computation. The aim is twofold. First, we present our technique of finding the suitable loop in the control manifold for any one-qubit and two-qubit unitary gates. Second, we develop the formalism further and add a penalty term for the length of the loop, thereby aiming to minimize the execution time for the quantum computation. Our method provides a general means by which holonomy loops can be realized in an experimental setup. Since holonomic quantum computation is adiabatic, optimizing with respect to the length of the loop may prove crucial.
Nonadiabatic holonomic quantum computation provides the means to perform fast and robust quantum gates by utilizing the resilience of non-Abelian geometric phases to fluctuations of the path in state space. While the original scheme [E. Sj\"oqvist et al., New J. Phys. 14, 103035 (2012)] needs two loops in the Grassmann manifold (i.e., the space of computational subspaces of the full state space) to generate an arbitrary holonomic one-qubit gate, we propose single-loop one-qubit gates that constitute an efficient universal set of holonomic gates when combined with an entangling holonomic two-qubit gate. Our one-qubit gate is realized by dividing the loop into path segments, each of which is generated by a $\mathrm{\ensuremath{\Lambda}}$-type Hamiltonian. We demonstrate that two path segments are sufficient to realize arbitrary single-loop holonomic one-qubit gates. We describe how our scheme can be implemented experimentally in a generic atomic system exhibiting a three-level $\mathrm{\ensuremath{\Lambda}}$-coupling structure by utilizing carefully chosen laser pulses.