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

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

Benjamin, S C

Published Jan 1, 2004• 14 citations
OpenAlex

Abstract

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.

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

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

Simon C. Benjamin, Sougato Bose

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.

arXiv:quant-ph/0401071•Physical Review A•Sep 17, 2004•54 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

Scalable and robust quantum computing on qubit arrays with fixed coupling

Nguyen H. Le, Max Cykiert, Eran Ginossar

Abstract We propose a scheme for scalable and robust quantum computing on two-dimensional arrays of qubits with fixed longitudinal coupling. This opens the possibility for bypassing the device complexity associated with tunable couplers required in conventional quantum computing hardware. Our approach is based on driving a subarray of qubits such that the total multi-qubit Hamiltonian can be decomposed into a sum of commuting few-qubit blocks, and efficient optimisation of the unitary evolution within each block. The driving pulses are optimised to implement a target gate on the driven qubits, and at the same time identity gates on the neighbouring undriven qubits, cancelling any unwanted evolution due to the constant qubit-qubit interaction. We show that it is possible to realise a universal set of quantum gates with high fidelity on the basis blocks, and by shifting the driving pattern one can realise an arbitrary quantum circuit on the array. Allowing for imperfect Hamiltonian characterisation, we use robust optimal control to obtain fidelities around 99.99% despite 1% uncertainty in the qubit-qubit and drive-qubit couplings, and a detuning uncertainty at 0.1% of the qubit-qubit coupling strength. This robust feature is crucial for scaling up as parameter uncertainty is significant in large devices.

arXiv:2110.07737•npj Quantum Information•Jan 5, 2023•31 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 computation and communication in strongly interacting systems

RG Antonio

Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of experimental ingenuity and ever simpler theoretical schemes. This thesis comes from the latter perspective, aiming to find new, simpler ways in which components of a quantum computer could be built. We first search for ways to create quantum gates, the primitive building blocks of a quantum computer. We find a novel, low-control way of performing a two-qubit gate on qubits encoded in a decoherence-free subspace, making use of many-body interactions that may already be present. This includes an analysis of the effect of control errors and magnetic field fluctuations on the gate. We then present novel ways to create three-qubit Toffoli and Fredkin gates in a single step using linear arrays of qubits, including an assessment of how well these gates could perform, for quantum or classical computation, using state-of-the-art ion trap and silicon donor technology. We then focus on a very different model from the normal circuit model, combining ideas from measurement-based quantum computation (MBQC) and holonomic quantum computation. We generalise an earlier model to show that all MBQC patterns with a property called gflow can be converted into a holonomic computation. The manifestation of the properties of MBQC in this adiabatically driven model is then explored. Finally, we investigate ways in which quantum information can be communicated between distant parties, using minimally engineered spin chains. The viability of using 1D Wigner crystals as a quantum channel is analysed, as well as schemes using ideal uniform spin chains with nextneighbour interactions, and edge-locking effects.

•Jul 28, 2015•0 citations
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.
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.
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.
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.
Abstract We propose a scheme for scalable and robust quantum computing on two-dimensional arrays of qubits with fixed longitudinal coupling. This opens the possibility for bypassing the device complexity associated with tunable couplers required in conventional quantum computing hardware. Our approach is based on driving a subarray of qubits such that the total multi-qubit Hamiltonian can be decomposed into a sum of commuting few-qubit blocks, and efficient optimisation of the unitary evolution within each block. The driving pulses are optimised to implement a target gate on the driven qubits, and at the same time identity gates on the neighbouring undriven qubits, cancelling any unwanted evolution due to the constant qubit-qubit interaction. We show that it is possible to realise a universal set of quantum gates with high fidelity on the basis blocks, and by shifting the driving pattern one can realise an arbitrary quantum circuit on the array. Allowing for imperfect Hamiltonian characterisation, we use robust optimal control to obtain fidelities around 99.99% despite 1% uncertainty in the qubit-qubit and drive-qubit couplings, and a detuning uncertainty at 0.1% of the qubit-qubit coupling strength. This robust feature is crucial for scaling up as parameter uncertainty is significant in large devices.
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.
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of experimental ingenuity and ever simpler theoretical schemes. This thesis comes from the latter perspective, aiming to find new, simpler ways in which components of a quantum computer could be built. We first search for ways to create quantum gates, the primitive building blocks of a quantum computer. We find a novel, low-control way of performing a two-qubit gate on qubits encoded in a decoherence-free subspace, making use of many-body interactions that may already be present. This includes an analysis of the effect of control errors and magnetic field fluctuations on the gate. We then present novel ways to create three-qubit Toffoli and Fredkin gates in a single step using linear arrays of qubits, including an assessment of how well these gates could perform, for quantum or classical computation, using state-of-the-art ion trap and silicon donor technology. We then focus on a very different model from the normal circuit model, combining ideas from measurement-based quantum computation (MBQC) and holonomic quantum computation. We generalise an earlier model to show that all MBQC patterns with a property called gflow can be converted into a holonomic computation. The manifestation of the properties of MBQC in this adiabatically driven model is then explored. Finally, we investigate ways in which quantum information can be communicated between distant parties, using minimally engineered spin chains. The viability of using 1D Wigner crystals as a quantum channel is analysed, as well as schemes using ideal uniform spin chains with nextneighbour interactions, and edge-locking effects.