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:1305.4205

Quantum Computation with Magnetic Clusters

Daniel D. Dorroh, Serkay Ölmez, Jianping Wang

Published May 17, 2013• 1 citation
arXivHTMLPDF

Abstract

We propose a complete, quantitative quantum computing system which satisfies the five DiVincenzo criteria. The model is based on magnetic clusters with uniaxial anisotropy, where standard, two-state qubits are formed utilizing the two lowest-lying states of an anisotropic potential energy. We outline the quantum dynamics required by quantum computing for single qubit structures, and then define a novel measurement scheme in which qubit sates can be measured by sharp changes in current as voltage across the cluster is varied. We then extend the single qubit description to multiple qubit interactions, facilitated specifically by a new entanglement method which propagates the controlled-NOT (C-NOT) quantum gate.

DOI
10.48550/arxiv.1305.4205

Related papers

Theory of Quantum Computation With Magnetic Clusters

Daniel D. Dorroh, Serkay Ölmez, Jian‐Ping Wang

We propose a complete, quantitative quantum computing system that satisfies the five DiVincenzo criteria. The model is based on magnetic clusters with uniaxial anisotropy, where two-state qubits are formed utilizing the two lowest lying states of an anisotropic potential energy. We outline the quantum dynamics required by quantum computing for single-qubit structures, and then define a measurement scheme in which qubit states can be measured by sharp changes in current as voltage across the cluster is varied. We then extend the single-qubit description to multiple qubit interactions, facilitated specifically by an entanglement method that propagates the controlled-not quantum gate.

IEEE Transactions on Quantum Engineering•Jan 1, 2020•3 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 logic gates for spin cluster qubits

Jian-Li Huo, Shun-Jin Wang

We study the low energy states of one-dimensional spin chain clusters consisting of three spin-1/2 Heisenberg particles. When applying an external magnetic field on the spin chain cluster, the ground state doublet will generate Zeeman splitting. As a two-level quantum system, the split ground state doublet can be defined as a new 'spin cluster qubit'. The cluster quibit is shown to be more robust with a smaller decoherence rate. We realize universal single-qubit gates with the algebraic dynamical method, by applying a time-dependent magnetic field on the spin cluster. We also investigate a two-qubit system made up of two such Heisenberg spin chain clusters which interact through a tunable Heisenberg coupling. In the two-qubit product basis, the controlled quantum phase gates can be generated by applying a magnetic field along the z-axis on the system of the two clusters. One can realize the controlled-NOT gate through a three-step time evolution by adjusting the corresponding physical parameters. Our scheme involves two kinds of dynamically distinct operations, which is much simpler and more feasible.

Journal of Physics B Atomic Molecular and Optical Physics•Jun 1, 2010•0 citations

Cluster state quantum computation for many-level systems

W. Hall

The cluster state model for quantum computation [Phys. Rev. Lett. \textbf{86}, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum computations. The model itself and many works dedicated to it involve using entangled qubits. In this paper we consider the issue of using entangled qudits instead. We present a complete framework for cluster state quantum computation using qudits, which not only contains the features of the original qubit model but also contains the new idea of adaptive computation: via a change in the classical computation that helps to correct the errors that are inherent in the model, the implemented quantum computation can be changed. This feature arises through the extra degrees of freedom that appear when using qudits. Finally, for prime dimensions, we give a very explicit description of the model, making use of mutually unbiased bases.

arXiv:quant-ph/0512130•Quantum Information and Computation•Mar 1, 2007•9 citations

Quantum computing via measurements only

Robert Raussendorf, Hans J. Briegel

A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of quantum logic gates. Here we propose a different model of a scalable quantum computer. In our model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits. Information is then written onto the cluster, processed, and read out form the cluster by one-particle measurements only. The entangled state of the cluster thus serves as a universal substrate for any quantum computation. Cluster states can be created efficiently in any system with a quantum Ising-type interaction (at very low temperatures) between two-state particles in a lattice configuration.

arXiv:quant-ph/0010033•Oct 7, 2000•57 citations

Quantum computing with antiferromagnetic spin clusters

Florian Meier, Jeremy Levy, Daniel Loss

We show that a wide range of spin clusters with antiferromagnetic intracluster exchange interaction allows one to define a qubit. For these spin cluster qubits, initialization, quantum gate operation, and readout are possible using the same techniques as for single spins. Quantum gate operation for the spin cluster qubit does not require control over the intracluster exchange interaction. Electric and magnetic fields necessary to effect quantum gates need only be controlled on the length scale of the spin cluster rather than the scale for a single spin. Here, we calculate the energy gap separating the logical qubit states from the next excited state and the matrix elements which determine quantum gate operation times. We discuss spin cluster qubits formed by one- and two-dimensional arrays of $s=1/2$ spins as well as clusters formed by spins $s>1/2.$ We illustrate the advantages of spin cluster qubits for various suggested implementations of spin qubits and analyze the scaling of decoherence time with spin cluster size.

arXiv:cond-mat/0304296•Physical review. B, Condensed matter•Oct 10, 2003•165 citations
We propose a complete, quantitative quantum computing system which satisfies the five DiVincenzo criteria. The model is based on magnetic clusters with uniaxial anisotropy, where standard, two-state qubits are formed utilizing the two lowest-lying states of an anisotropic potential energy. We outline the quantum dynamics required by quantum computing for single qubit structures, and then define a novel measurement scheme in which qubit sates can be measured by sharp changes in current as voltage across the cluster is varied. We then extend the single qubit description to multiple qubit interactions, facilitated specifically by a new entanglement method which propagates the controlled-NOT (C-NOT) quantum gate.
We propose a complete, quantitative quantum computing system that satisfies the five DiVincenzo criteria. The model is based on magnetic clusters with uniaxial anisotropy, where two-state qubits are formed utilizing the two lowest lying states of an anisotropic potential energy. We outline the quantum dynamics required by quantum computing for single-qubit structures, and then define a measurement scheme in which qubit states can be measured by sharp changes in current as voltage across the cluster is varied. We then extend the single-qubit description to multiple qubit interactions, facilitated specifically by an entanglement method that propagates the controlled-not quantum gate.
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.
We study the low energy states of one-dimensional spin chain clusters consisting of three spin-1/2 Heisenberg particles. When applying an external magnetic field on the spin chain cluster, the ground state doublet will generate Zeeman splitting. As a two-level quantum system, the split ground state doublet can be defined as a new 'spin cluster qubit'. The cluster quibit is shown to be more robust with a smaller decoherence rate. We realize universal single-qubit gates with the algebraic dynamical method, by applying a time-dependent magnetic field on the spin cluster. We also investigate a two-qubit system made up of two such Heisenberg spin chain clusters which interact through a tunable Heisenberg coupling. In the two-qubit product basis, the controlled quantum phase gates can be generated by applying a magnetic field along the z-axis on the system of the two clusters. One can realize the controlled-NOT gate through a three-step time evolution by adjusting the corresponding physical parameters. Our scheme involves two kinds of dynamically distinct operations, which is much simpler and more feasible.
The cluster state model for quantum computation [Phys. Rev. Lett. \textbf{86}, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum computations. The model itself and many works dedicated to it involve using entangled qubits. In this paper we consider the issue of using entangled qudits instead. We present a complete framework for cluster state quantum computation using qudits, which not only contains the features of the original qubit model but also contains the new idea of adaptive computation: via a change in the classical computation that helps to correct the errors that are inherent in the model, the implemented quantum computation can be changed. This feature arises through the extra degrees of freedom that appear when using qudits. Finally, for prime dimensions, we give a very explicit description of the model, making use of mutually unbiased bases.
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of quantum logic gates. Here we propose a different model of a scalable quantum computer. In our model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits. Information is then written onto the cluster, processed, and read out form the cluster by one-particle measurements only. The entangled state of the cluster thus serves as a universal substrate for any quantum computation. Cluster states can be created efficiently in any system with a quantum Ising-type interaction (at very low temperatures) between two-state particles in a lattice configuration.
We show that a wide range of spin clusters with antiferromagnetic intracluster exchange interaction allows one to define a qubit. For these spin cluster qubits, initialization, quantum gate operation, and readout are possible using the same techniques as for single spins. Quantum gate operation for the spin cluster qubit does not require control over the intracluster exchange interaction. Electric and magnetic fields necessary to effect quantum gates need only be controlled on the length scale of the spin cluster rather than the scale for a single spin. Here, we calculate the energy gap separating the logical qubit states from the next excited state and the matrix elements which determine quantum gate operation times. We discuss spin cluster qubits formed by one- and two-dimensional arrays of s=1/2s=1/2s=1/2 spins as well as clusters formed by spins s>1/2.s>1/2.s>1/2. We illustrate the advantages of spin cluster qubits for various suggested implementations of spin qubits and analyze the scaling of decoherence time with spin cluster size.