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:quant-ph/0312079 · Physics Letters A

Exact solutions of holonomic quantum computation

Shogo Tanimura, Daisuke Hayashi, Mikio Nakahara

Published Apr 9, 2004• 17 citations
arXivHTMLPDF
DOI
10.1016/j.physleta.2004.03.057

Related papers

Exact solutions for universal holonomic quantum gates (5 pages)

Vahid Karimipour

Physical Review A•Jan 1, 2004•0 citations

Holonomic quantum computation

Paolo Zanardi, Mario Rasetti

arXiv:quant-ph/9904011•Physics Letters A•Dec 1, 1999•1,012 citations

Universal Holonomic Quantum Computation on Spin Chains

Vahid Karimipour, N. Majd

We find exact solutions for a universal set of holonomic quantum gates on a scalable candidate for quantum computers, namely an array of two level systems. Previously these gates have been constructed mostly on non-scalable systems and by numerical searches in the space of loops in the space of control parameters of the Hamiltonian.

•Apr 8, 2005•0 citations

Geometric and holonomic quantum computation

Jiang Zhang, Thi Ha Kyaw, Stefan Filipp +3 more

arXiv:2110.03602•Physics Reports•Jul 1, 2023•108 citations

Exact solutions of the isoholonomic problem and the optimal control problem in holonomic quantum computation

Shogo Tanimura, Mikio Nakahara, Daisuke Hayashi

The isoholonomic problem in a homogeneous bundle is formulated and solved exactly. The problem takes a form of a boundary value problem of a variational equation. The solution is applied to the optimal control problem in holonomic quantum computer. We provide a prescription to construct an optimal controller for an arbitrary unitary gate and apply it to a k-dimensional unitary gate which operates on an N-dimensional Hilbert space with N⩾2k. Our construction is applied to several important unitary gates such as the Hadamard gate, the CNOT gate, and the two-qubit discrete Fourier transformation gate. Controllers for these gates are explicitly constructed.

arXiv:quant-ph/0406038•Journal of Mathematical Physics•Jan 14, 2005•33 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•23 citations
The isoholonomic problem in a homogeneous bundle is formulated and solved exactly. The problem takes a form of a boundary value problem of a variational equation. The solution is applied to the optimal control problem in holonomic quantum computer. We provide a prescription to construct an optimal controller for an arbitrary unitary gate and apply it to a k-dimensional unitary gate which operates on an N-dimensional Hilbert space with N⩾2k. Our construction is applied to several important unitary gates such as the Hadamard gate, the CNOT gate, and the two-qubit discrete Fourier transformation gate. Controllers for these gates are explicitly constructed.