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:0705.1560 · Journal of Physics B Atomic Molecular and Optical Physics

Spin star as a switch for quantum networks

Man‐Hong Yung

Published Jun 17, 2011• 23 citations
arXivHTMLPDF

Abstract

Quantum state transfer is an important task in quantum information processing. It is known that one can engineer the couplings of a one-dimensional spin chain to achieve the goal of perfect state transfer. To leverage the value of these spin chains, a spin star is potentially useful for connecting different parts of a quantum network. In this work, we extend the spin-chain engineering problem to the problems with a topology of a star network. We show that a permanently coupled spin star can function as a network switch for transferring quantum states selectively from one node to another by varying the local potentials only. Together with one-dimensional chains, this result allows applications of quantum state transfer to be applied to more general quantum networks.

DOI
10.1088/0953-4075/44/13/135504

Related papers

Encoded State Transfer: Beyond the Uniform Chain

Alastair Kay

In a recent work (arXiv:2207.01954), we showed that a uniformly coupled chain could be symmetrically extended by engineered spin chains in such a way that we could choose part of the spectrum of the overall system. When combined with an encoding that avoids the uncontrolled eigenvalues, this resulted in the possibility of achieving a range of tasks such as perfect quantum state transfer. In this paper, we apply the same strategy to a much broader range of initial systems - arbitrary chains, and even coupled networks of spins - while providing guarantees on the existence of solutions.

arXiv:2207.12189•Jul 25, 2022•2 citations

Perfect transfer of arbitrary states in quantum spin networks

Matthias Christandl, Nilanjana Datta, T. C. Dorlas +3 more

We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher-dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to $N$-qubit spin networks of identical qubit couplings, we show that $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{3}N$ is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done by Christandl et al., Phys. Rev. Lett. 92, 187902 (2004).

arXiv:quant-ph/0411020•Physical Review A•Mar 14, 2005•527 citations

Perfect State Transfer in Quantum Spin Networks

Matthias Christandl, Nilanjana Datta, ARTUR K. EKERT +1 more

We propose a class of qubit networks that admit the perfect state transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2log3N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits, then perfect state transfer can be achieved over arbitrarily long distances in a linear chain.

arXiv:quant-ph/0309131•Physical Review Letters•May 4, 2004•1,214 citations

Robustness of spin-coupling distributions for perfect quantum state transfer

Analía Zwick, Gonzalo A. Álvarez, Joachim Stolze +1 more

The transmission of quantum information between different parts of a quantum computer is of fundamental importance. Spin chains have been proposed as quantum channels for transferring information. Different configurations for the spin couplings were proposed in order to optimize the transfer. As imperfections in the creation of these specific spin-coupling distributions can never be completely avoided, it is important to find out which systems are optimally suited for information transfer by assessing their robustness against imperfections or disturbances. We analyze different spin coupling distributions of spin chain channels designed for perfect quantum state transfer. In particular, we study the transfer of an initial state from one end of the chain to the other end. We quantify the robustness of different coupling distributions against perturbations and we relate it to the properties of the energy eigenstates and eigenvalues. We find that the localization properties of the systems play an important role for robust quantum state transfer.

arXiv:1105.0071•Physical Review A•Aug 8, 2011•88 citations

Hamiltonian Engineering in Quantum Spin Networks

Ieshan Vaidya

Quantum simulation presents itself as one of the biggest advantages of developing quantum computers. Simulating a quantum system classically is almost impossible beyond a certain system size whereas a controllable quantum system inherently has the resources and computing space to simulate another system. Analog quantum simulation is one of the ways of quantum simulation through which a known system mimics an unknown system. A key aspect of this is the ability to generate the target Hamiltonian using control operations which is referred to as Hamiltonian engineering. One way of doing this is to apply pulse sequences over a length of time such that the average Hamiltonian over this period is the desired one. In this thesis, we discuss the method of filtered Hamiltonian engineering which works in a similar fashion. Using this technique, we create a star topology from a general network of spins. Quantum communication between two parties is an important task for its applications in information theory as well as for its use in a quantum computer. A typical solution to this is using teleportation through the means of shared entangled qubits. Teleportation is not ideal for short-range communication such as between two units in a quantum computer. It has been shown that information can be transported from one node of a quantum spin network to another by natural evolution of the system over time. Such networks are better suited for solid-state based computing architectures as well as for short-range communication. The Hamiltonian that permits such transport however places stringent requirements on the parameters of the network. While individual control of spins cannot be avoided in most cases, excess control can introduce noise. In this thesis, we work on a few models of spin networks that permit information transport with minimal requirements on the parameters of the network.

arXiv:1806.02752•Jun 7, 2018•1 citation

Quantum state transfer in disordered spin chains: How much engineering is reasonable?

Analía Zwick, Gonzalo A. Álvarez, Joachim Stolze +1 more

The transmission of quantum states through spin chains is an important element in the implementation of quantum information technologies. Speed and fidelity of transfer are the main objectives which have to be achieved by the devices even in the presence of imperfections which are unavoidable in any manufacturing process. To reach these goals, several kinds of spin chains have been suggested, which differ in the degree of fine-tuning, or engineering, of the system parameters. In this work we present a systematic study of two important classes of such chains. In one class only the spin couplings at the ends of the chain have to be adjusted to a value different from the bulk coupling constant, while in the other class every coupling has to have a specific value. We demonstrate that configurations from the two different classes may perform similarly when subjected to the same kind of disorder in spite of the large difference in the engineering effort necessary to prepare the system. We identify the system features responsible for these similarities and we perform a detailed study of the transfer fidelity as a function of chain length and disorder strength, yielding empirical scaling laws for the fidelity which are similar for all kinds of chain and all disorder models. These results are helpful in identifying the optimal spin chain for a given quantum information transfer task. In particular, they help in judging whether it is worthwhile to engineer all couplings in the chain as compared to adjusting only the boundary couplings.

arXiv:1306.1695•Quantum Information and Computation•May 1, 2015•27 citations
Quantum state transfer is an important task in quantum information processing. It is known that one can engineer the couplings of a one-dimensional spin chain to achieve the goal of perfect state transfer. To leverage the value of these spin chains, a spin star is potentially useful for connecting different parts of a quantum network. In this work, we extend the spin-chain engineering problem to the problems with a topology of a star network. We show that a permanently coupled spin star can function as a network switch for transferring quantum states selectively from one node to another by varying the local potentials only. Together with one-dimensional chains, this result allows applications of quantum state transfer to be applied to more general quantum networks.
In a recent work (arXiv:2207.01954), we showed that a uniformly coupled chain could be symmetrically extended by engineered spin chains in such a way that we could choose part of the spectrum of the overall system. When combined with an encoding that avoids the uncontrolled eigenvalues, this resulted in the possibility of achieving a range of tasks such as perfect quantum state transfer. In this paper, we apply the same strategy to a much broader range of initial systems - arbitrary chains, and even coupled networks of spins - while providing guarantees on the existence of solutions.
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher-dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to NNN-qubit spin networks of identical qubit couplings, we show that 2log3N2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{3}N2log3​N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done by Christandl et al., Phys. Rev. Lett. 92, 187902 (2004).
We propose a class of qubit networks that admit the perfect state transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2log3N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits, then perfect state transfer can be achieved over arbitrarily long distances in a linear chain.
The transmission of quantum information between different parts of a quantum computer is of fundamental importance. Spin chains have been proposed as quantum channels for transferring information. Different configurations for the spin couplings were proposed in order to optimize the transfer. As imperfections in the creation of these specific spin-coupling distributions can never be completely avoided, it is important to find out which systems are optimally suited for information transfer by assessing their robustness against imperfections or disturbances. We analyze different spin coupling distributions of spin chain channels designed for perfect quantum state transfer. In particular, we study the transfer of an initial state from one end of the chain to the other end. We quantify the robustness of different coupling distributions against perturbations and we relate it to the properties of the energy eigenstates and eigenvalues. We find that the localization properties of the systems play an important role for robust quantum state transfer.
Quantum simulation presents itself as one of the biggest advantages of developing quantum computers. Simulating a quantum system classically is almost impossible beyond a certain system size whereas a controllable quantum system inherently has the resources and computing space to simulate another system. Analog quantum simulation is one of the ways of quantum simulation through which a known system mimics an unknown system. A key aspect of this is the ability to generate the target Hamiltonian using control operations which is referred to as Hamiltonian engineering. One way of doing this is to apply pulse sequences over a length of time such that the average Hamiltonian over this period is the desired one. In this thesis, we discuss the method of filtered Hamiltonian engineering which works in a similar fashion. Using this technique, we create a star topology from a general network of spins. Quantum communication between two parties is an important task for its applications in information theory as well as for its use in a quantum computer. A typical solution to this is using teleportation through the means of shared entangled qubits. Teleportation is not ideal for short-range communication such as between two units in a quantum computer. It has been shown that information can be transported from one node of a quantum spin network to another by natural evolution of the system over time. Such networks are better suited for solid-state based computing architectures as well as for short-range communication. The Hamiltonian that permits such transport however places stringent requirements on the parameters of the network. While individual control of spins cannot be avoided in most cases, excess control can introduce noise. In this thesis, we work on a few models of spin networks that permit information transport with minimal requirements on the parameters of the network.
The transmission of quantum states through spin chains is an important element in the implementation of quantum information technologies. Speed and fidelity of transfer are the main objectives which have to be achieved by the devices even in the presence of imperfections which are unavoidable in any manufacturing process. To reach these goals, several kinds of spin chains have been suggested, which differ in the degree of fine-tuning, or engineering, of the system parameters. In this work we present a systematic study of two important classes of such chains. In one class only the spin couplings at the ends of the chain have to be adjusted to a value different from the bulk coupling constant, while in the other class every coupling has to have a specific value. We demonstrate that configurations from the two different classes may perform similarly when subjected to the same kind of disorder in spite of the large difference in the engineering effort necessary to prepare the system. We identify the system features responsible for these similarities and we perform a detailed study of the transfer fidelity as a function of chain length and disorder strength, yielding empirical scaling laws for the fidelity which are similar for all kinds of chain and all disorder models. These results are helpful in identifying the optimal spin chain for a given quantum information transfer task. In particular, they help in judging whether it is worthwhile to engineer all couplings in the chain as compared to adjusting only the boundary couplings.