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

Europhysics Letters (EPL)

Number theoretic application of a spin network model

Mark W. Coffey, Ron Deiotte

Published May 1, 2010• 1 citation
Publisher

Abstract

We present a scalable spin-1/2 network capable of performing calculations of interest to number theory. Among these computations are primality testing and factoring. The fully connected network model is realizable with superconducting phase qubits, and very probably with other solid-state spin implementations. The spin network model offers the prospect to perform interesting calculations in quantum information processing with a modest number of qubits.

DOI
10.1209/0295-5075/90/40006

Related papers

Fully connected network of superconducting qubits in a cavity

Dimitris I. Tsomokos, Sahel Ashhab, Franco Nori

A fully connected qubit network is considered, where every qubit interacts with every other one. When the interactions between the qubits are homogeneous, the system is a special case of the finite Lipkin–Meshkov–Glick (LMG) model. We propose a natural implementation of this model using superconducting qubits in state-of-the-art circuit QED. The ground state, the low-lying energy spectrum and the dynamical evolution are investigated. We find that, under realistic conditions, highly entangled states of Greenberger–Horne–Zeilinger (GHZ) and W types can be generated. We also comment on the influence of disorder on the system and discuss the possibility of simulating complex quantum systems, such as Sherrington–Kirkpatrick (SK) spin glasses, with superconducting qubit networks.

arXiv:0802.1469•New Journal of Physics•Nov 14, 2008•50 citations

Quantum networks for elementary arithmetic operations

Vlatko Vedral, Adriano Barenco, ARTUR K. EKERT

Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most difficult (time and space consuming) part of Shor's quantum factorizing algorithm. We show that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorized. \textcopyright{} 1996 The American Physical Society.

arXiv:quant-ph/9511018•Physical Review A•Jul 1, 1996•811 citations

Eigenvalue degeneracy relations for a fully connected isotropic spin network

Mark W. Coffey, Grant Allen

We present and prove identities for the eigenvalue degeneracy of a fully connected spin network with isotropic spin coupling. Such a network has application to quantum information processing, especially for solid-state implementations, and in fact the qubit case with anisotropic coupling has been recently realized. One set of proofs and other relations for the case of qubits is given in the context of hypergeometric summation. We then generalize to arbitrary spin, using combinatorial arguments.

Bulletin of the American Physical Society•Mar 7, 2014•0 citations

Eigenvalue degeneracy relations for a fully connected isotropic spin network

Mark W. Coffey, Grant Allen

We present and prove identities for the eigenvalue degeneracy of a fully connected spin network with isotropic spin coupling.Such a network has application to quantum information processing, especially for solid-state implementations, and in fact the qubit case with anisotropic coupling has been recently realized.One set of proofs and other relations for the case of qubits is given in the context of hypergeometric summation.We then generalize to arbitrary spin, using combinatorial arguments.

Journal of Physics A Mathematical and Theoretical•Sep 7, 2011•0 citations

Number theory in quantum computing

Sebastian Schönnenbeck

Algorithms are mathematical procedures developed to solve a problem. When encoded on a computer, algorithms must be "translated" to a series of simple steps, each of which the computer knows how to do. This task is relatively easy to do on a classical computer and we witness the benefits of this success in our everyday life. Quantum mechanics, the physical theory of the very small, promises to enable completely novel architectures of our machines, which will provide specific tasks with higher computing power. Translating and implementing algorithms on quantum computers is hard. However, we will show that solutions to this problem can be found and yield surprising applications to number theory.

•Jan 1, 2018•0 citations

Theoretical proposal for superconducting spin qubits

Ciprian Padurariu, Yuli V. Nazarov

We propose and theoretically investigate superconducting spin qubits. Superconducting spin qubit consists of a single spin confined in a Josephson junction. We show that owing to spin-orbit interaction, superconducting phase difference across the junction can polarize this spin. We demonstrate that this enables single-qubit operations and more complicated quantum gates, where spins of different qubits interact via a mutual inductance of the superconducting loop where the junctions are embedded. Recent experimental realizations of Josephson junctions made of semiconductor quantum dots in contact with superconducting leads have shown that the number of electrons in the quantum dot can be tuned by a gate voltage. Superconducting spin qubit is realized when the number of electrons is odd. We discuss the qubit properties at phenomenological level. We present a microscopic theory that enables us to make accurate estimations of the qubit parameters by evaluating the spin-dependent Josephson energy in the framework of fourth-order perturbation theory.

arXiv:0912.3910•Physical Review B•Apr 29, 2010•108 citations
We present a scalable spin-1/2 network capable of performing calculations of interest to number theory. Among these computations are primality testing and factoring. The fully connected network model is realizable with superconducting phase qubits, and very probably with other solid-state spin implementations. The spin network model offers the prospect to perform interesting calculations in quantum information processing with a modest number of qubits.
A fully connected qubit network is considered, where every qubit interacts with every other one. When the interactions between the qubits are homogeneous, the system is a special case of the finite Lipkin–Meshkov–Glick (LMG) model. We propose a natural implementation of this model using superconducting qubits in state-of-the-art circuit QED. The ground state, the low-lying energy spectrum and the dynamical evolution are investigated. We find that, under realistic conditions, highly entangled states of Greenberger–Horne–Zeilinger (GHZ) and W types can be generated. We also comment on the influence of disorder on the system and discuss the possibility of simulating complex quantum systems, such as Sherrington–Kirkpatrick (SK) spin glasses, with superconducting qubit networks.
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most difficult (time and space consuming) part of Shor's quantum factorizing algorithm. We show that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorized. \textcopyright{} 1996 The American Physical Society.
Algorithms are mathematical procedures developed to solve a problem. When encoded on a computer, algorithms must be "translated" to a series of simple steps, each of which the computer knows how to do. This task is relatively easy to do on a classical computer and we witness the benefits of this success in our everyday life. Quantum mechanics, the physical theory of the very small, promises to enable completely novel architectures of our machines, which will provide specific tasks with higher computing power. Translating and implementing algorithms on quantum computers is hard. However, we will show that solutions to this problem can be found and yield surprising applications to number theory.
We propose and theoretically investigate superconducting spin qubits. Superconducting spin qubit consists of a single spin confined in a Josephson junction. We show that owing to spin-orbit interaction, superconducting phase difference across the junction can polarize this spin. We demonstrate that this enables single-qubit operations and more complicated quantum gates, where spins of different qubits interact via a mutual inductance of the superconducting loop where the junctions are embedded. Recent experimental realizations of Josephson junctions made of semiconductor quantum dots in contact with superconducting leads have shown that the number of electrons in the quantum dot can be tuned by a gate voltage. Superconducting spin qubit is realized when the number of electrons is odd. We discuss the qubit properties at phenomenological level. We present a microscopic theory that enables us to make accurate estimations of the qubit parameters by evaluating the spin-dependent Josephson energy in the framework of fourth-order perturbation theory.