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

Quantum computing in arrays coupled by “always-on” interactions

Simon C. Benjamin, Sougato Bose

Published Sep 17, 2004• 54 citations
arXivHTMLPDF

Abstract

It has recently been shown that one can perform quantum computation in a Heisenberg chain in which the interactions are always on, provided that one can abruptly tune the Zeeman energies of the individual (pseudo)spins. Here we provide a more complete analysis of this scheme, including several generalizations. We generalize the interaction to an anisotropic form (incorporating the $XY$ interaction as a limit), providing a proof that a chain coupled in this fashion tends to an effective Ising chain in the limit of far off-resonant spins. We derive the primitive two-qubit gate that results from exploiting abrupt Zeeman tuning with such an interaction. We also demonstrate, via numerical simulation, that the same basic scheme functions in the case of smoothly shifted Zeeman energies. We conclude with some remarks regarding generalizations to two- and three-dimensional arrays.

DOI
10.1103/physreva.70.032314

Related papers

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

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

Time-independent quantum circuits with local interactions

Sahand Seifnashri, Farzad Kianvash, Nobakht Jahangir +1 more

Heisenberg spin chains can act as quantum wires transferring quantum states either perfectly or with high fidelity. Gaussian packets of excitations passing through dual rails can encode the two states of a logical qubit, depending on which rail is empty and which rail is carrying the packet. With extra interactions in one or between different chains, one can introduce interaction zones in arrays of such chains, where specific one- or two-qubit gates act on any qubit which passes through these interaction zones. Therefore, universal quantum computation is made possible in a static way where no external control is needed. This scheme will then pave the way for a scalable way of quantum computation where specific hardware can be connected to make large quantum circuits. Our scheme is an improvement of a recent scheme where we borrowed an idea from quantum electrodynamics to replace nonlocal interactions between spin chains with local interactions mediated by an ancillary chain.

arXiv:1602.06362•Physical Review A•Jun 27, 2016•7 citations

Quantum information processing in a spin-bus system of coupled chains

Xiang Hao, Shiqun Zhu

The effective Heisenberg interaction is generated by weakly interacting qubits with two strongly coupled chains. The system of two coupled chains can be regarded as a quantum bus. Universal quantum computation is enabled by restricting the bus to its ground state. The effective interaction is primarily determined by the energy spectrum of the bus. The interactions alternate between antiferromagnetic and ferromagnetic ones. The long-range interaction can also be attained in coupled chains with infinite size. The quantum gate operations with high precision can be realized when the quantum fluctuations are taken into account.

arXiv:0803.0768•Physical Review A•Oct 29, 2008•9 citations

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
It has recently been shown that one can perform quantum computation in a Heisenberg chain in which the interactions are always on, provided that one can abruptly tune the Zeeman energies of the individual (pseudo)spins. Here we provide a more complete analysis of this scheme, including several generalizations. We generalize the interaction to an anisotropic form (incorporating the XYXYXY interaction as a limit), providing a proof that a chain coupled in this fashion tends to an effective Ising chain in the limit of far off-resonant spins. We derive the primitive two-qubit gate that results from exploiting abrupt Zeeman tuning with such an interaction. We also demonstrate, via numerical simulation, that the same basic scheme functions in the case of smoothly shifted Zeeman energies. We conclude with some remarks regarding generalizations to two- and three-dimensional arrays.
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.
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.
Heisenberg spin chains can act as quantum wires transferring quantum states either perfectly or with high fidelity. Gaussian packets of excitations passing through dual rails can encode the two states of a logical qubit, depending on which rail is empty and which rail is carrying the packet. With extra interactions in one or between different chains, one can introduce interaction zones in arrays of such chains, where specific one- or two-qubit gates act on any qubit which passes through these interaction zones. Therefore, universal quantum computation is made possible in a static way where no external control is needed. This scheme will then pave the way for a scalable way of quantum computation where specific hardware can be connected to make large quantum circuits. Our scheme is an improvement of a recent scheme where we borrowed an idea from quantum electrodynamics to replace nonlocal interactions between spin chains with local interactions mediated by an ancillary chain.
The effective Heisenberg interaction is generated by weakly interacting qubits with two strongly coupled chains. The system of two coupled chains can be regarded as a quantum bus. Universal quantum computation is enabled by restricting the bus to its ground state. The effective interaction is primarily determined by the energy spectrum of the bus. The interactions alternate between antiferromagnetic and ferromagnetic ones. The long-range interaction can also be attained in coupled chains with infinite size. The quantum gate operations with high precision can be realized when the quantum fluctuations are taken into account.
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.