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:1201.4822 · Physical Review Letters

Number-Theoretic Nature of Communication in Quantum Spin Systems

Chris D. Godsil, Stephen J. Kirkland, Simone Severini B, Jamie Smith

Published Aug 1, 2012• 109 citations
arXivHTMLPDF

Abstract

The last decade has witnessed substantial interest in protocols for transferring information on networks of quantum mechanical objects. A variety of control methods and network topologies have been proposed, on the basis that transfer with perfect fidelity-i.e., deterministic and without information loss-is impossible through unmodulated spin chains with more than a few particles. Solving the original problem formulated by Bose [Phys. Rev. Lett. 91, 207901 (2003)], we determine the exact number of qubits in unmodulated chains (with an XY Hamiltonian) that permit transfer with a fidelity arbitrarily close to 1, a phenomenon called pretty good state transfer. We prove that this happens if and only if the number of nodes is n = p - 1, 2p - 1, where p is a prime, or n = 2(m) - 1. The result highlights the potential of quantum spin system dynamics for reinterpreting questions about the arithmetic structure of integers and, in this case, primality.

DOI
10.1103/physrevlett.109.050502

Related papers

Pretty good state transfer in qubit chains—The Heisenberg Hamiltonian

Leonardo Banchi, Gabriel Coutinho, Chris D. Godsil +1 more

Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a Heisenberg chain with n qubits, there is pretty good state transfer between the nodes at the jth and (n − j + 1)th positions if n is a power of 2. Moreover, this condition is also necessary for j = 1. We obtain this result by applying a theorem due to Kronecker about Diophantine approximations, together with techniques from algebraic graph theory.

arXiv:1608.04722•Journal of Mathematical Physics•Mar 1, 2017•46 citations

Pretty good state transfer in qubit chains-The Heisenberg Hamiltonian

Leonardo Banchi, Coutinho, G, Godsil, C +1 more

Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a Heisenberg chain with n qubits, there is pretty good state transfer between the nodes at the jth and (n − j + 1)th positions if n is a power of 2. Moreover, this condition is also necessary for j = 1. We obtain this result by applying a theorem due to Kronecker about Diophantine approximations, together with techniques from algebraic graph theory.

•Mar 1, 2017•48 citations

Pretty good state transfer of entangled states through quantum spin chains

Rúben Sousa, Yasser Omar

The XX model with uniform couplings represents the most natural choice for quantum state transfer through spin chains. Given that it has long been established that single-qubit states cannot be transferred with perfect fidelity in this model, the notion of pretty good state transfer has been recently introduced as a relaxation of the constraints on fidelity. In this paper, we study the transfer of multi-qubit entangled and unentangled states through unmodulated spin chains, and we prove that it is possible to have pretty good state transfer of any multi-particle state. This significantly generalizes the previous results on single-qubit state transfer and opens the way to using uniformly coupled spin chains as short-distance quantum channels for the transfer of arbitrary states of any dimension. Our results could be tested with current technology.

arXiv:1405.1296•New Journal of Physics•Dec 2, 2014•32 citations

Quantum Walks and Pretty Good State transfer on Paths

van Bommel, Christopher Martin

Quantum computing is believed to provide many advantages over traditional computing, particularly considering the speed at which computations can be performed. One of the challenges that needs to be resolved in order to construct a quantum computer is the transmission of information from one part of the computer to another. Quantum walks, the quantum analogues of classical random walks, provide one potential method for resolving this challenge. \n \nIn this thesis, we use techniques from algebraic graph theory and number theory to analyze the mathematical model for continuous time quantum walks on graphs. For the continuous time quantum walk model, we define a transition operator, which is a function of a Hamiltonian. We focus on the cases where the adjacency matrix or the Laplacian of a graph act as the Hamiltionian. We mainly consider quantum walks on paths as a model for spin chains, which are the underlying basis of a quantum communication protocol. \n \nFor communication to be efficient, we desire states to be transferred with high fidelity, a measure of the amount of similarity between the transmitted state and the received state. At the maximum fidelity of 1, we say we have achieved perfect state transfer. Examples of perfect state transfer are relatively rare, so the concept of pretty good state transfer was introduced as a natural relaxation, which exists if fidelities arbitrarily close to 1 are obtained. \n \nOur first main result is to characterize pretty good state transfer on paths. Previously, pretty good state transfer on paths was considered mainly for the end vertices, though results for both models indicated that if there was pretty good state transfer between the end vertices, then there was pretty good state transfer between internal vertices equidistant from each end. We complete the characterization by demonstrating, for the adjacency matrix model, a family of paths where pretty good state transfer exists between internal vertices but not between end vertices, and verifying that no other example exists. For the Laplacian model, we show that there are no paths with pretty good state transfer between internal vertices but not between the end vertices. \n \nOur second main result considers initial states involving multiple vertices. Under the adjacency matrix model, we provide necessary and sufficient conditions for pretty good state transfer in a particular family of paths in terms of the eigenvalue support of the initial state. We also discuss recent results on fractional revival, which is another form of multiple qubit state transfer.

•Aug 23, 2019•3 citations

Transfer of arbitrary two-qubit states via a spin chain

Salvatore Lorenzo, Tony J. G. Apollaro, Simone Paganelli +2 more

We investigate the fidelity of the quantum state transfer (QST) of two qubits by means of an arbitrary spin-$\frac{1}{2}$ network, on a lattice of any dimensionality. Under the assumptions that the network Hamiltonian preserves the magnetization and that a fully polarized initial state is taken for the lattice, we obtain a general formula for the average fidelity of the two qubits QST, linking it to the one- and two-particle transfer amplitudes of the spin excitations among the sites of the lattice. We then apply this formalism to a 1D spin chain with $XX$-Heisenberg type nearest-neighbour interactions adopting a protocol that is a generalization of the single qubit one proposed in Paganelli et al. [Phys. Rev. A 87, 062309 (2013)]. We find that a high-quality two qubit QST can be achieved provided one can control the local fields at sites near the sender and receiver. Under such conditions, we obtain an almost perfect transfer in a time that scales either linearly or, depending on the spin number, quadratically with the length of the chain.

arXiv:1502.02458•Physical Review A•Apr 16, 2015•56 citations

Effect of Spin Dimensionality in the Fidelity of Spin Chain Quantum Communication

Art Graeson Briones Dumigpe, Eric A. Galapon

We consider an unmodulated linear spin chain composed of two qubits at the ends, which undergo nearest-neighbor interactions, with an arbitrary spin between them. The state of the qubit on one end is to be transmitted through the arbitrary spin and is received by the qubit on the other end with some fidelity. We look at the behavior of the average f idelity of state transfer through time as affected by the spin quantum number of the arbitrary spin in between the qubits. We f ind that the higher the spin quantum number becomes, the earlier it takes to achieve perfect or nearly perfect state transfer. Moreover, when the channel with arbitrary spin is subjected to environment interaction, results from the calculation of average fidelity suggest that increasing the spin quantum number of the channel provides a countermeasure to the effects of decoherence induced by the environment.

Science Diliman•Jun 16, 2017•0 citations
The last decade has witnessed substantial interest in protocols for transferring information on networks of quantum mechanical objects. A variety of control methods and network topologies have been proposed, on the basis that transfer with perfect fidelity-i.e., deterministic and without information loss-is impossible through unmodulated spin chains with more than a few particles. Solving the original problem formulated by Bose [Phys. Rev. Lett. 91, 207901 (2003)], we determine the exact number of qubits in unmodulated chains (with an XY Hamiltonian) that permit transfer with a fidelity arbitrarily close to 1, a phenomenon called pretty good state transfer. We prove that this happens if and only if the number of nodes is n = p - 1, 2p - 1, where p is a prime, or n = 2(m) - 1. The result highlights the potential of quantum spin system dynamics for reinterpreting questions about the arithmetic structure of integers and, in this case, primality.
Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a Heisenberg chain with n qubits, there is pretty good state transfer between the nodes at the jth and (n − j + 1)th positions if n is a power of 2. Moreover, this condition is also necessary for j = 1. We obtain this result by applying a theorem due to Kronecker about Diophantine approximations, together with techniques from algebraic graph theory.
Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a Heisenberg chain with n qubits, there is pretty good state transfer between the nodes at the jth and (n − j + 1)th positions if n is a power of 2. Moreover, this condition is also necessary for j = 1. We obtain this result by applying a theorem due to Kronecker about Diophantine approximations, together with techniques from algebraic graph theory.
The XX model with uniform couplings represents the most natural choice for quantum state transfer through spin chains. Given that it has long been established that single-qubit states cannot be transferred with perfect fidelity in this model, the notion of pretty good state transfer has been recently introduced as a relaxation of the constraints on fidelity. In this paper, we study the transfer of multi-qubit entangled and unentangled states through unmodulated spin chains, and we prove that it is possible to have pretty good state transfer of any multi-particle state. This significantly generalizes the previous results on single-qubit state transfer and opens the way to using uniformly coupled spin chains as short-distance quantum channels for the transfer of arbitrary states of any dimension. Our results could be tested with current technology.
Quantum computing is believed to provide many advantages over traditional computing, particularly considering the speed at which computations can be performed. One of the challenges that needs to be resolved in order to construct a quantum computer is the transmission of information from one part of the computer to another. Quantum walks, the quantum analogues of classical random walks, provide one potential method for resolving this challenge. \n \nIn this thesis, we use techniques from algebraic graph theory and number theory to analyze the mathematical model for continuous time quantum walks on graphs. For the continuous time quantum walk model, we define a transition operator, which is a function of a Hamiltonian. We focus on the cases where the adjacency matrix or the Laplacian of a graph act as the Hamiltionian. We mainly consider quantum walks on paths as a model for spin chains, which are the underlying basis of a quantum communication protocol. \n \nFor communication to be efficient, we desire states to be transferred with high fidelity, a measure of the amount of similarity between the transmitted state and the received state. At the maximum fidelity of 1, we say we have achieved perfect state transfer. Examples of perfect state transfer are relatively rare, so the concept of pretty good state transfer was introduced as a natural relaxation, which exists if fidelities arbitrarily close to 1 are obtained. \n \nOur first main result is to characterize pretty good state transfer on paths. Previously, pretty good state transfer on paths was considered mainly for the end vertices, though results for both models indicated that if there was pretty good state transfer between the end vertices, then there was pretty good state transfer between internal vertices equidistant from each end. We complete the characterization by demonstrating, for the adjacency matrix model, a family of paths where pretty good state transfer exists between internal vertices but not between end vertices, and verifying that no other example exists. For the Laplacian model, we show that there are no paths with pretty good state transfer between internal vertices but not between the end vertices. \n \nOur second main result considers initial states involving multiple vertices. Under the adjacency matrix model, we provide necessary and sufficient conditions for pretty good state transfer in a particular family of paths in terms of the eigenvalue support of the initial state. We also discuss recent results on fractional revival, which is another form of multiple qubit state transfer.
We investigate the fidelity of the quantum state transfer (QST) of two qubits by means of an arbitrary spin-12\frac{1}{2}21​ network, on a lattice of any dimensionality. Under the assumptions that the network Hamiltonian preserves the magnetization and that a fully polarized initial state is taken for the lattice, we obtain a general formula for the average fidelity of the two qubits QST, linking it to the one- and two-particle transfer amplitudes of the spin excitations among the sites of the lattice. We then apply this formalism to a 1D spin chain with XXXXXX-Heisenberg type nearest-neighbour interactions adopting a protocol that is a generalization of the single qubit one proposed in Paganelli et al. [Phys. Rev. A 87, 062309 (2013)]. We find that a high-quality two qubit QST can be achieved provided one can control the local fields at sites near the sender and receiver. Under such conditions, we obtain an almost perfect transfer in a time that scales either linearly or, depending on the spin number, quadratically with the length of the chain.
We consider an unmodulated linear spin chain composed of two qubits at the ends, which undergo nearest-neighbor interactions, with an arbitrary spin between them. The state of the qubit on one end is to be transmitted through the arbitrary spin and is received by the qubit on the other end with some fidelity. We look at the behavior of the average f idelity of state transfer through time as affected by the spin quantum number of the arbitrary spin in between the qubits. We f ind that the higher the spin quantum number becomes, the earlier it takes to achieve perfect or nearly perfect state transfer. Moreover, when the channel with arbitrary spin is subjected to environment interaction, results from the calculation of average fidelity suggest that increasing the spin quantum number of the channel provides a countermeasure to the effects of decoherence induced by the environment.