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

Journal of Physics A Mathematical and Theoretical

Eigenvalue degeneracy relations for a fully connected isotropic spin network

Mark W. Coffey, Grant Allen

Published Sep 7, 2011• 0 citations
Publisher

Abstract

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.

DOI
10.1088/1751-8113/44/39/395303

Related papers

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

Greenberger-Horne-Zeilinger state protocols for fully connected qubit networks

Andrei Galiautdinov, Mark W. Coffey, Ron Deiotte

We generalize the recently proposed Greenberger-Horne-Zeilinger tripartite protocol [A. Galiautdinov and J. M. Martinis, Phys. Rev. A 78, 010305(R) (2008)] to fully connected networks of weakly coupled qubits interacting by way of anisotropic Heisenberg exchange $g(XX+YY)+\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{g}ZZ$. Our model differs from the more familiar Ising-Heisenberg chain in that here every qubit interacts with every other qubit in the circuit. The assumption of identical couplings on all qubit pairs allows an elegant proof of the protocol for arbitrary $N$. In order to further make contact with experiment, we study fidelity degradation due to coupling imperfections by numerically simulating the $N=3$ and 4 cases. Our simulations indicate that the best fidelity at unequal couplings is achieved when (a) the system is initially prepared in the uniform superposition state (similarly to how it is done in the ideal case) and (b) the entangling time and the final rotations on each of the qubits are appropriately adjusted.

arXiv:0907.2225•Physical Review A•Dec 2, 2009•12 citations

Computing Spin Networks

Annalisa Marzuoli, Mario Rasetti

We expand a set of notions recently introduced providing the general setting for a universal representation of the quantum structure on which quantum information stands. The dynamical evolution process associated with generic quantum information manipulation is based on the (re)coupling theory of SU(2) angular momenta. Such scheme automatically incorporates all the essential features that make quantum information encoding much more efficient than classical: it is fully discrete; it deals with inherently entangled states, naturally endowed with a tensor product structure; it allows for generic encoding patterns. The model proposed can be thought of as the non-Boolean generalization of the quantum circuit model, with unitary gates expressed in terms of 3nj coefficients connecting inequivalent binary coupling schemes of n+1 angular momentum variables, as well as Wigner rotations in the eigenspace of the total angular momentum. A crucial role is played by elementary j-gates (6j symbols) which satisfy algebraic identities that make the structure of the model similar to "state sum models", employed in discretizing Topological Quantum Field Theories and quantum gravity. The spin network simulator can thus be viewed also as a Combinatorial QFT model for computation. The semiclassical limit (large j's) is discussed.

•Jan 1, 2004•46 citations

Number theoretic application of a spin network model

Mark W. Coffey, Ron Deiotte

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.

Europhysics Letters (EPL)•May 1, 2010•1 citation

On the $$R$$-matrix identities related to elliptic anisotropic spin Ruijsenaars–Macdonald operators

Mariya Georgievna Matushko, Andrei Vladimirovich Zotov

We propose and prove a set of identities for the elliptic $$GL_M$$ $$R$$ -matrix (in the fundamental representation). In the scalar case ( $$M=1$$ ), these are elliptic function identities derived by Ruijsenaars as necessary and sufficient conditions for his kernel identity underlying the construction of integral solutions of quantum spinless Ruijsenaars–Schneider model. In this respect, our result can be regarded as a first step toward constructing solutions of the quantum eigenvalue problem for the anisotropic spin Ruijsenaars model.

arXiv:2211.08529•Theoretical and Mathematical Physics•Nov 1, 2022•1 citation

Surface entanglement in quantum spin networks

Stefano Zippilli, S. M. Giampaolo, Fabrizio Illuminati

We study the ground-state entanglement in systems of spins forming the boundary of a quantum spin network in arbitrary geometries and dimensionality. We show that as long as they are weakly coupled to the bulk of the network, the surface spins are strongly entangled, even when distant and not directly interacting, thereby generalizing the phenomenon of long-distance entanglement occurring in quantum spin chains. Depending on the structure of the couplings between surface and bulk spins, we discuss in detail how the patterns of surface entanglement can range from multipair bipartite to fully multipartite. In the context of quantum information and communication, these results find immediate application to the implementation of quantum routers, that is, devices able to distribute quantum correlations on demand among multiple network nodes.

arXiv:1302.1205•Physical Review A•Apr 3, 2013•6 citations
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.
We generalize the recently proposed Greenberger-Horne-Zeilinger tripartite protocol [A. Galiautdinov and J. M. Martinis, Phys. Rev. A 78, 010305(R) (2008)] to fully connected networks of weakly coupled qubits interacting by way of anisotropic Heisenberg exchange $g(XX+YY)+\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{g}ZZ$. Our model differs from the more familiar Ising-Heisenberg chain in that here every qubit interacts with every other qubit in the circuit. The assumption of identical couplings on all qubit pairs allows an elegant proof of the protocol for arbitrary NNN. In order to further make contact with experiment, we study fidelity degradation due to coupling imperfections by numerically simulating the N=3N=3N=3 and 4 cases. Our simulations indicate that the best fidelity at unequal couplings is achieved when (a) the system is initially prepared in the uniform superposition state (similarly to how it is done in the ideal case) and (b) the entangling time and the final rotations on each of the qubits are appropriately adjusted.
We expand a set of notions recently introduced providing the general setting for a universal representation of the quantum structure on which quantum information stands. The dynamical evolution process associated with generic quantum information manipulation is based on the (re)coupling theory of SU(2) angular momenta. Such scheme automatically incorporates all the essential features that make quantum information encoding much more efficient than classical: it is fully discrete; it deals with inherently entangled states, naturally endowed with a tensor product structure; it allows for generic encoding patterns. The model proposed can be thought of as the non-Boolean generalization of the quantum circuit model, with unitary gates expressed in terms of 3nj coefficients connecting inequivalent binary coupling schemes of n+1 angular momentum variables, as well as Wigner rotations in the eigenspace of the total angular momentum. A crucial role is played by elementary j-gates (6j symbols) which satisfy algebraic identities that make the structure of the model similar to "state sum models", employed in discretizing Topological Quantum Field Theories and quantum gravity. The spin network simulator can thus be viewed also as a Combinatorial QFT model for computation. The semiclassical limit (large j's) is discussed.
On the RRR-matrix identities related to elliptic anisotropic spin Ruijsenaars–Macdonald operators
We propose and prove a set of identities for the elliptic GLMGL_MGLM​ RRR -matrix (in the fundamental representation). In the scalar case ( M=1M=1M=1 ), these are elliptic function identities derived by Ruijsenaars as necessary and sufficient conditions for his kernel identity underlying the construction of integral solutions of quantum spinless Ruijsenaars–Schneider model. In this respect, our result can be regarded as a first step toward constructing solutions of the quantum eigenvalue problem for the anisotropic spin Ruijsenaars model.
We study the ground-state entanglement in systems of spins forming the boundary of a quantum spin network in arbitrary geometries and dimensionality. We show that as long as they are weakly coupled to the bulk of the network, the surface spins are strongly entangled, even when distant and not directly interacting, thereby generalizing the phenomenon of long-distance entanglement occurring in quantum spin chains. Depending on the structure of the couplings between surface and bulk spins, we discuss in detail how the patterns of surface entanglement can range from multipair bipartite to fully multipartite. In the context of quantum information and communication, these results find immediate application to the implementation of quantum routers, that is, devices able to distribute quantum correlations on demand among multiple network nodes.