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/0504061 · Physical Review A

Exact solutions for a universal set of quantum gates on a family of isospectral spin chains

Vahid Karimipour, N. Majd

Published Nov 4, 2005• 3 citations
arXivHTMLPDF

Abstract

We find exact solutions for a universal set of quantum gates on a scalable candidate for quantum computers, namely an array of two-level systems. The gates are constructed by a combination of dynamical and geometrical (non-Abelian) phases. Previously these gates have been constructed mostly on nonscalable systems and by numerical searches among the loops in the manifold of control parameters of the Hamiltonian.

DOI
10.1103/physreva.72.052305

Related papers

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

Solutions for a Universal Set of Quantum Gates on a Heisenberg XXZ Spin Chain

Jing Xu

We find solutions for a universal set of quantum gates on a Heisenberg XXZ spin chain.A universal set of quantum gates are constructed by a combination of dynamical and geometrical phases,because geometrical phase gates have fault-tolerant features,which will contribute to improve the ability of quantum information processing.

Journal of Yanbian University•Jan 1, 2010•0 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

Criteria for exact qudit universality

Gavin K. Brennen, Dianne Prost O’Leary, Stephen S. Bullock

We describe criteria for implementation of quantum computation in qudits. A qudit is a -dimensional system whose Hilbert space is spanned by states \ensuremath{\mid}0⟩, \ensuremath{\mid}1⟩, \dots{}, . An important earlier work [] describes how to exactly simulate an arbitrary unitary on multiple qudits using a parameter family of single qudit and two qudit gates. That technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The technique is related to the -matrix decomposition of numerical linear algebra. We consider a generic physical system in which the single qudit Hamiltonians are a small collection of and . A coupling graph results taking nodes 0, \dots{}, and edges are allowed Hamiltonians. One qudit exact universality follows iff this graph is connected, and complete universality results if the two-qudit Hamiltonian is also allowed. We discuss implementation in the eight dimensional ground electronic states of and construct an optimal gate sequence using Raman laser pulses.

arXiv:quant-ph/0407223•Physical Review A•May 16, 2005•101 citations

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

Yukihiro Ota, Masamitsu Bando, Yasushi Kondo +1 more

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.

arXiv:0809.1705•Physical Review A•Nov 10, 2008•5 citations

Designing Robust Quantum Gates

Yuanxing Hao, Marin Bukov

For given control channels, quantum control theory determines whether quantum gates can be realized, but not their resilience to errors. We address this problem by establishing existence criteria for robust gate implementation in $d$-level systems. Our criteria reveal that implementability of all gates is not enough: a universal family of robust gates exists if and only if the driven Hamiltonians share no common symmetry. When these criteria hold, we can make gates resilient to any combination of static perturbations, uniform Hamiltonian rescaling, perturbations at a finite set of selected frequencies, and perturbations with arbitrary selected waveforms. We can impose robustness conditions broadly with limited information about errors, e.g., against any static perturbations; we can also tailor these conditions to the platform, e.g., against environment-induced noise with dominant spectral peaks, requiring no spectral details beyond the peak frequencies. We numerically construct explicit protocols for robust gates, reducing average gate infidelity by approximately two to seven orders of magnitude under Hamiltonian perturbations and environment-induced noise. Together, our existence criteria and numerical constructions provide practical guidance for evaluating the potential of quantum platforms and designing robust quantum gates.

quant-pharXiv:2610.24039•Oct 19, 2026•0 citations
We find exact solutions for a universal set of quantum gates on a scalable candidate for quantum computers, namely an array of two-level systems. The gates are constructed by a combination of dynamical and geometrical (non-Abelian) phases. Previously these gates have been constructed mostly on nonscalable systems and by numerical searches among the loops in the manifold of control parameters of the Hamiltonian.
We describe criteria for implementation of quantum computation in qudits. A qudit is a -dimensional system whose Hilbert space is spanned by states \ensuremath{\mid}0⟩, \ensuremath{\mid}1⟩, \dots{}, . An important earlier work [] describes how to exactly simulate an arbitrary unitary on multiple qudits using a parameter family of single qudit and two qudit gates. That technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The technique is related to the -matrix decomposition of numerical linear algebra. We consider a generic physical system in which the single qudit Hamiltonians are a small collection of and . A coupling graph results taking nodes 0, \dots{}, and edges are allowed Hamiltonians. One qudit exact universality follows iff this graph is connected, and complete universality results if the two-qudit Hamiltonian is also allowed. We discuss implementation in the eight dimensional ground electronic states of and construct an optimal gate sequence using Raman laser pulses.
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.
For given control channels, quantum control theory determines whether quantum gates can be realized, but not their resilience to errors. We address this problem by establishing existence criteria for robust gate implementation in ddd-level systems. Our criteria reveal that implementability of all gates is not enough: a universal family of robust gates exists if and only if the driven Hamiltonians share no common symmetry. When these criteria hold, we can make gates resilient to any combination of static perturbations, uniform Hamiltonian rescaling, perturbations at a finite set of selected frequencies, and perturbations with arbitrary selected waveforms. We can impose robustness conditions broadly with limited information about errors, e.g., against any static perturbations; we can also tailor these conditions to the platform, e.g., against environment-induced noise with dominant spectral peaks, requiring no spectral details beyond the peak frequencies. We numerically construct explicit protocols for robust gates, reducing average gate infidelity by approximately two to seven orders of magnitude under Hamiltonian perturbations and environment-induced noise. Together, our existence criteria and numerical constructions provide practical guidance for evaluating the potential of quantum platforms and designing robust quantum gates.