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:1511.05656 · New Journal of Physics

Time independent universal computing with spin chains: quantum plinko machine

K F Thompson, C Gokler, Seth Lloyd, Peter W. Shor

Published Jul 25, 2016• 27 citations
arXivHTMLPDF

Abstract

We present a scheme for universal quantum computing using XY Heisenberg spin chains. Information is encoded into packets propagating down these chains, and they interact with each other to perform universal quantum computation. A circuit using g gate blocks on m qubits can be encoded into chains of length O ( g 3 + δ m 3 + δ ) for all δ > 0 with vanishingly small error.

DOI
10.1088/1367-2630/18/7/073044

Related papers

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

Exact gate sequences for universal quantum computation using the XY interaction alone

Julia Kempe, K. Birgitta Whaley

In a previous publication [J. Kempe et al., Quantum Computation and Information (Rinton Press, Princeton, NJ, 2001), Vol. 1, special issue, p. 33] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the computation into a larger Hilbert space. This proof is nonconstructive, however, and did not explicitly give the trade-offs in time that are required to implement encoded single-qubit operations and encoded two-qubit gates. Here we explicitly give the gate sequences needed to simulate these operations on encoded qubits and qutrits (three-level systems) and analyze the trade-offs involved. We also propose a possible layout for the qubits in a triangular arrangement.

arXiv:quant-ph/0112014•Physical Review A•May 14, 2002•55 citations

Simple pulses for universal quantum computation with a Heisenberg ABAB chain

Simon C. Benjamin

Recently, Levy has shown that quantum computation may be performed using an $\mathrm{ABAB}\dots{}$ chain of spin-1/2 systems with nearest-neighbor Heisenberg interactions. Levy notes that all necessary elementary computational ``gates'' may be achieved purely by manipulating the spin-spin interaction: he proposes using ``spin-resonance'' techniques involving modulating the interaction strength at high frequency. Here, we establish an alternative: it is possible to perform the elementary gates via simple, nonoscillatory switching of the interaction strength. This approach removes a time ``bottle neck'' in Levy's scheme, so that all elementary operations may now be performed within a time scale of order $\ensuremath{\Elzxh}{/(E}_{A}\ensuremath{-}{E}_{B}).$

arXiv:quant-ph/0104034•Physical Review A•Oct 18, 2001•49 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

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

Remote quantum gates mediated by spin chains

Rebecca Ronke, Irene D’Amico, Timothy P. Spiller

There has been much recent study on the application of spin chains to quantum state transfer and communication. Here we demonstrate that spin chains set up for perfect quantum state transfer can be utilised to generate remote quantum gates, between spin qubits injected at the ends of the chain. The natural evolution of the system across different excitation number sectors generates a maximally-entangling and universal gate between the injected qubits, independent of the length of the chain.

arXiv:1003.0869•Mar 3, 2010•0 citations
We present a scheme for universal quantum computing using XY Heisenberg spin chains. Information is encoded into packets propagating down these chains, and they interact with each other to perform universal quantum computation. A circuit using g gate blocks on m qubits can be encoded into chains of length O ( g 3 + δ m 3 + δ ) for all δ > 0 with vanishingly small error.
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.
In a previous publication [J. Kempe et al., Quantum Computation and Information (Rinton Press, Princeton, NJ, 2001), Vol. 1, special issue, p. 33] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the computation into a larger Hilbert space. This proof is nonconstructive, however, and did not explicitly give the trade-offs in time that are required to implement encoded single-qubit operations and encoded two-qubit gates. Here we explicitly give the gate sequences needed to simulate these operations on encoded qubits and qutrits (three-level systems) and analyze the trade-offs involved. We also propose a possible layout for the qubits in a triangular arrangement.
Recently, Levy has shown that quantum computation may be performed using an ABAB…\mathrm{ABAB}\dots{}ABAB… chain of spin-1/2 systems with nearest-neighbor Heisenberg interactions. Levy notes that all necessary elementary computational ``gates'' may be achieved purely by manipulating the spin-spin interaction: he proposes using ``spin-resonance'' techniques involving modulating the interaction strength at high frequency. Here, we establish an alternative: it is possible to perform the elementary gates via simple, nonoscillatory switching of the interaction strength. This approach removes a time ``bottle neck'' in Levy's scheme, so that all elementary operations may now be performed within a time scale of order $\ensuremath{\Elzxh}{/(E}_{A}\ensuremath{-}{E}_{B}).$
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.
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.