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

Efficient quantum computation within a disordered Heisenberg spin chain

Chiu Fan Lee, Neil F. Johnson

Published Nov 22, 2004• 13 citations
arXivHTMLPDF

Abstract

We show that efficient quantum computation is possible using a disordered Heisenberg spin-chain with ``always-on'' couplings. Such disorder occurs naturally in nanofabricated systems. Considering a simple chain setup, we show that an arbitrary two-qubit gate can be implemented using just three relaxations of a controlled qubit, which amounts to switching the on-site energy terms at most 21 times.

DOI
10.1103/physreva.70.052322

Related papers

Quantum Computing with an Always-On Heisenberg Interaction

Simon C. Benjamin, Sougato Bose

Many promising schemes for quantum computing (QC) involve switching "on" and "off" a physical coupling between qubits. This may prove extremely difficult to achieve experimentally. Here we show that systems with a constant Heisenberg coupling can be employed for QC if we actively "tune" the transition energies of individual qubits. Moreover, we can collectively tune the qubits to obtain an exceptionally simple scheme: computations are controlled via a single "switch" of only six settings. Our schemes are applicable to a wide range of physical implementations, from excitons and spins in quantum dots through to bulk magnets.

arXiv:quant-ph/0210157•Physical Review Letters•Jun 19, 2003•190 citations

Multi-qubit gates in arrays coupled by always-on interactions

Simon C Benjamin

Recently, there has been interest in the idea of quantum computing without control of the physical interactions between component qubits. This is highly appealing since the 'switching' of such interactions is a principal difficulty in creating real devices. It has been established that one can employ 'always-on' interactions in a one-dimensional Heisenberg chain, provided that one can tune the Zeeman energies of the individual (pseudo-)spins. It is important to generalize this scheme to higher-dimensional networks, since a real device would probably be of that kind. Such generalizations have been proposed, but only at the severe cost that the efficiency of qubit storage must fall . Here we propose the use of multi-qubit gates within such higher-dimensional arrays, finding a novel three-qubit gate that can in fact increase the efficiency beyond the linear model. Thus, we are able to propose higher-dimensional networks that can constitute a better embodiment of the 'always-on' concept—a substantial step towards bringing this novel idea to full fruition.

arXiv:quant-ph/0403077•New Journal of Physics•Jun 15, 2004•15 citations

Multi-Qubit Gates in Arrays Coupled by 'Always On' Interactions

Benjamin, S C

Recently there has been interest in the idea of quantum computing without control of the physical interactions between component qubits. This is highly appealing since the switching of such interactions is a principle difficulty in creating real devices. It has been established that one can employ 'always on' interactions in a one-dimensional Heisenberg chain, provided that one can tune the Zeeman energies of the individual (pseudo-)spins. It is important to generalize this scheme to higher dimensional networks, since a real device would probably be of that kind. Such generalisations have been proposed, but only at the serve cost that the efficiency of qubit storage must *fall*. Here we propose the use of multi-qubit gates within such higher-dimensional arrays, finding a novel three-qubit gate that can in fact increase the efficiency beyond the linear model. Thus we are able to propose higher dimensional networks that can constitute a better embodiment of the 'always on' concept - a substantial step toward bringing this novel concept to full fruition.

•Jan 1, 2004•14 citations

Many-particle confinement by constructed disorder and quantum computing

M. I. Dykman, L F Santos, M Shapiro

Many-particle confinement (localization) is studied for a 1D system of spinless fermions with nearest-neighbor hopping and interaction, or equivalently, for an anisotropic Heisenberg spin-1/2 chain. This system is frequently used to model quantum computers with perpetually coupled qubits. We construct a bounded sequence of site energies that leads to strong single-particle confinement of all states on individual sites. We show that this sequence also leads to a confinement of all many-particle states in an infinite system for a time that scales as a high power of the reciprocal hopping integral. The confinement is achieved for strong interaction between the particles while keeping the overall bandwidth of site energies comparatively small. The results show viability of quantum computing with time-independent qubit coupling.

arXiv:cond-mat/0507493•Journal of Optics B Quantum and Semiclassical Optics•Sep 21, 2005•7 citations

Quantum Computing with Spin Cluster Qubits

Florian Meier, Jeremy Levy, Daniel Loss

We study the low energy states of finite spin chains with isotropic (Heisenberg) and anisotropic (XY and Ising-like) antiferromagnetic exchange interaction with uniform and nonuniform coupling constants. We show that for an odd number of sites a spin cluster qubit can be defined in terms of the ground state doublet. This qubit is remarkably insensitive to the placement and coupling anisotropy of spins within the cluster. One- and two-qubit quantum gates can be generated by magnetic fields and intercluster exchange, and leakage during quantum gate operation is small. Spin cluster qubits inherit the long decoherence times and short gate operation times of single spins. Control of single spins is hence not necessary for the realization of universal quantum gates.

arXiv:cond-mat/0206310•Physical Review Letters•Jan 27, 2003•260 citations

Superconducting qutrit-qubit circuit: A toolbox for efficient quantum gates

Thomas Bækkegaard, Lasse Bjørn Kristensen, Niels Jakob Søe Loft +3 more

As classical computers struggle to keep up with Moore's law, quantum computing may represent a big step in technology and yield significant improvement over classical computing for many important tasks. Building a quantum computer, however, is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations as possible, to reduce the amount of required control and operation time and thus improve the quantum state coherence. Here we propose a superconducting circuit for implementing a tunable spin chain consisting of a qutrit (three-level system analogous to spin-1) coupled to two qubits (spin-1/2). Our system can efficiently accomplish various quantum information tasks, including generation of entanglement of the two qubits and conditional three-qubit quantum gates, such as the Toffoli and Fredkin gates, which are universal for reversible classical computations. Furthermore, our system realizes a conditional geometric gate which may be used for holonomic (non-adiabatic) quantum computing. The efficiency, robustness and universality of our circuit makes it a promising candidate to serve as a building block for larger spin networks capable of performing involved quantum computational tasks.

•Feb 12, 2018•3 citations
We show that efficient quantum computation is possible using a disordered Heisenberg spin-chain with ``always-on'' couplings. Such disorder occurs naturally in nanofabricated systems. Considering a simple chain setup, we show that an arbitrary two-qubit gate can be implemented using just three relaxations of a controlled qubit, which amounts to switching the on-site energy terms at most 21 times.
Many promising schemes for quantum computing (QC) involve switching "on" and "off" a physical coupling between qubits. This may prove extremely difficult to achieve experimentally. Here we show that systems with a constant Heisenberg coupling can be employed for QC if we actively "tune" the transition energies of individual qubits. Moreover, we can collectively tune the qubits to obtain an exceptionally simple scheme: computations are controlled via a single "switch" of only six settings. Our schemes are applicable to a wide range of physical implementations, from excitons and spins in quantum dots through to bulk magnets.
Recently, there has been interest in the idea of quantum computing without control of the physical interactions between component qubits. This is highly appealing since the 'switching' of such interactions is a principal difficulty in creating real devices. It has been established that one can employ 'always-on' interactions in a one-dimensional Heisenberg chain, provided that one can tune the Zeeman energies of the individual (pseudo-)spins. It is important to generalize this scheme to higher-dimensional networks, since a real device would probably be of that kind. Such generalizations have been proposed, but only at the severe cost that the efficiency of qubit storage must fall . Here we propose the use of multi-qubit gates within such higher-dimensional arrays, finding a novel three-qubit gate that can in fact increase the efficiency beyond the linear model. Thus, we are able to propose higher-dimensional networks that can constitute a better embodiment of the 'always-on' concept—a substantial step towards bringing this novel idea to full fruition.
Recently there has been interest in the idea of quantum computing without control of the physical interactions between component qubits. This is highly appealing since the switching of such interactions is a principle difficulty in creating real devices. It has been established that one can employ 'always on' interactions in a one-dimensional Heisenberg chain, provided that one can tune the Zeeman energies of the individual (pseudo-)spins. It is important to generalize this scheme to higher dimensional networks, since a real device would probably be of that kind. Such generalisations have been proposed, but only at the serve cost that the efficiency of qubit storage must *fall*. Here we propose the use of multi-qubit gates within such higher-dimensional arrays, finding a novel three-qubit gate that can in fact increase the efficiency beyond the linear model. Thus we are able to propose higher dimensional networks that can constitute a better embodiment of the 'always on' concept - a substantial step toward bringing this novel concept to full fruition.
Many-particle confinement (localization) is studied for a 1D system of spinless fermions with nearest-neighbor hopping and interaction, or equivalently, for an anisotropic Heisenberg spin-1/2 chain. This system is frequently used to model quantum computers with perpetually coupled qubits. We construct a bounded sequence of site energies that leads to strong single-particle confinement of all states on individual sites. We show that this sequence also leads to a confinement of all many-particle states in an infinite system for a time that scales as a high power of the reciprocal hopping integral. The confinement is achieved for strong interaction between the particles while keeping the overall bandwidth of site energies comparatively small. The results show viability of quantum computing with time-independent qubit coupling.
We study the low energy states of finite spin chains with isotropic (Heisenberg) and anisotropic (XY and Ising-like) antiferromagnetic exchange interaction with uniform and nonuniform coupling constants. We show that for an odd number of sites a spin cluster qubit can be defined in terms of the ground state doublet. This qubit is remarkably insensitive to the placement and coupling anisotropy of spins within the cluster. One- and two-qubit quantum gates can be generated by magnetic fields and intercluster exchange, and leakage during quantum gate operation is small. Spin cluster qubits inherit the long decoherence times and short gate operation times of single spins. Control of single spins is hence not necessary for the realization of universal quantum gates.
As classical computers struggle to keep up with Moore's law, quantum computing may represent a big step in technology and yield significant improvement over classical computing for many important tasks. Building a quantum computer, however, is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations as possible, to reduce the amount of required control and operation time and thus improve the quantum state coherence. Here we propose a superconducting circuit for implementing a tunable spin chain consisting of a qutrit (three-level system analogous to spin-1) coupled to two qubits (spin-1/2). Our system can efficiently accomplish various quantum information tasks, including generation of entanglement of the two qubits and conditional three-qubit quantum gates, such as the Toffoli and Fredkin gates, which are universal for reversible classical computations. Furthermore, our system realizes a conditional geometric gate which may be used for holonomic (non-adiabatic) quantum computing. The efficiency, robustness and universality of our circuit makes it a promising candidate to serve as a building block for larger spin networks capable of performing involved quantum computational tasks.