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:0809.1705 · Physical Review A

Implementation of holonomic quantum gates by an isospectral deformation of an Ising dimer chain

Yukihiro Ota, Masamitsu Bando, Yasushi Kondo, Mikio Nakahara

Published Nov 10, 2008• 5 citations
arXivHTMLPDF

Abstract

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-$\frac{1}{2}$ 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.

DOI
10.1103/physreva.78.052315

Related papers

HOLONOMIC QUANTUM GATES USING ISOSPECTRAL DEFORMATION OF ISING MODEL

Masamitsu Bando, Yukihiro Ota, Yasushi Kondo +1 more

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.

•Nov 1, 2009•0 citations

Single-loop realization of universal nonadiabatic holonomic gates in decoherence-free subspaces

Chang Wang, Zhenping Guo

Control errors and decoherence are two main obstacles for realization of quantum computation. Nonadiabatic holonomic quantum computation in decoherence-free subspaces can protect quantum gates from both control errors and decoherence, and, therefore, it has received increasing attention. The original protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces needs two loops in the Grassmann manifold to generate an arbitrary nonadiabatic holonomic one-qubit gate. In this paper, we proposed a protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, where an arbitrary one-qubit gate is generated by only a single loop in the Grassmann manifold and an entangling two-qubit gate assisted by two single-qubit gates can be used to construct a two-qubit controlled unitary gate. In addition, the encoding of our protocol for nonadiabatic holonomic gates requires a lower number of physical qubits compared with previous schemes. Our scheme not only maintains the merits of the original protocol but it also avoids the extra work of combining two gates to realize an arbitrary one-qubit gate.

Europhysics Letters (EPL)•Dec 10, 2018•8 citations

Single-loop multiple-pulse nonadiabatic holonomic quantum gates

Emmi Herterich, Erik Sjöqvist

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.

arXiv:1608.07418•Physical Review A•Nov 9, 2016•97 citations

Nonadiabatic holonomic gates realized by a single-shot implementation

Guofu Xu, C. L. Liu, P. Z. Zhao +1 more

Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors. However, all the previous schemes have to use at least two sequentially implemented gates to realize a general one-qubit gate. In this paper we put forward a scheme by which one can directly realize an arbitrary holonomic one-qubit gate with a single-shot implementation, avoiding the extra work of combining two gates into one. Based on a three-level model driven by laser pulses, we show that any single-qubit holonomic gate can be realized by varying the detuning, amplitude, and phase of lasers. Our scheme is compatible with previously proposed nonadiabatic holonomic two-qubit gates, combining with which the arbitrary holonomic one-qubit gates can play universal nonadiabatic holonomic quantum computation. We also investigate the effects of some unavoidable realistic errors on our scheme.

arXiv:1511.00919•Physical Review A•Nov 2, 2015•107 citations

Optimal holonomic quantum gates

A. O. Niskanen, Mikio Nakahara, M.M. Salomaa

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.

Quantum Information and Computation•Nov 1, 2002•4 citations

Exact solutions for universal holonomic quantum gates

Vahid Karimipour, N. Majd

We show how one can implement any local quantum gate on specific qubits in an array of qubits by carrying adiabatically a Hamiltonian around a closed loop. We find the exact form of the loop and the Hamiltonian for implementing general one and two qubits gates. Our method is analytical and is not based on numerical search in the space of all loops.

arXiv:quant-ph/0404101•Physical Review A•Jul 30, 2004•3 citations
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-12\frac{1}{2}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.
Control errors and decoherence are two main obstacles for realization of quantum computation. Nonadiabatic holonomic quantum computation in decoherence-free subspaces can protect quantum gates from both control errors and decoherence, and, therefore, it has received increasing attention. The original protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces needs two loops in the Grassmann manifold to generate an arbitrary nonadiabatic holonomic one-qubit gate. In this paper, we proposed a protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, where an arbitrary one-qubit gate is generated by only a single loop in the Grassmann manifold and an entangling two-qubit gate assisted by two single-qubit gates can be used to construct a two-qubit controlled unitary gate. In addition, the encoding of our protocol for nonadiabatic holonomic gates requires a lower number of physical qubits compared with previous schemes. Our scheme not only maintains the merits of the original protocol but it also avoids the extra work of combining two gates to realize an arbitrary one-qubit gate.
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.
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors. However, all the previous schemes have to use at least two sequentially implemented gates to realize a general one-qubit gate. In this paper we put forward a scheme by which one can directly realize an arbitrary holonomic one-qubit gate with a single-shot implementation, avoiding the extra work of combining two gates into one. Based on a three-level model driven by laser pulses, we show that any single-qubit holonomic gate can be realized by varying the detuning, amplitude, and phase of lasers. Our scheme is compatible with previously proposed nonadiabatic holonomic two-qubit gates, combining with which the arbitrary holonomic one-qubit gates can play universal nonadiabatic holonomic quantum computation. We also investigate the effects of some unavoidable realistic errors on our scheme.
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.