# Basics of perfect communication through quantum networks

@article{Kay2011BasicsOP,
title={Basics of perfect communication through quantum networks},
author={A. Kay},
journal={Physical Review A},
year={2011},
volume={84},
pages={022337}
}
• A. Kay
• Published 2011
• Mathematics, Physics
• Physical Review A
Perfect transfer of a quantum state through a one-dimensional chain is now well understood, allowing one not only to decide whether a fixed Hamiltonian achieves perfect transfer but to design a suitable one. We are particularly interested in being able to design, or understand the limitations imposed upon, Hamiltonians subject to various naturally arising constraints such as a limited coupling topology with low connectivity (specified by a graph) and type of interaction. In this paper, we… Expand

#### Figures from this paper

Number-theoretic nature of communication in quantum spin systems.
• Physics, Medicine
• Physical review letters
• 2012
This work determines 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 and highlights the potential of quantum spin system dynamics for reinterpreting questions about the arithmetic structure of integers and primality. Expand
No Laplacian Perfect State Transfer in Trees
• Mathematics, Physics
• SIAM J. Discret. Math.
• 2015
It is conjecture that perfect state transfer does not happen in trees with more than three vertices, and the model based on the $XY$-Hamiltonian, whose action is equivalent to the action of the adjacency matrix of the graph, is considered. Expand
Quantum Walks and Pretty Good State transfer on Paths
• Physics
• 2019
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 beExpand
Perfect quantum state transfer using Hadamard diagonalizable graphs
• Mathematics, Physics
• 2017
Abstract Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on theExpand
Two-Excitation Routing via Linear Quantum Channels
• Computer Science, Physics
• Entropy
• 2021
It is found that the perturbative transfer scheme allows for efficient two-excitation routing on a fermionic network, although for a spin-$\frac{1}{2}$ network only a limited region of the network is suitable for high-quality routing. Expand
Universality in perfect state transfer
• Mathematics, Physics
• 2017
Abstract A continuous-time quantum walk on a graph is a matrix-valued function exp ⁡ ( − i A t ) over the reals, where A is the adjacency matrix of the graph. Such a quantum walk has universalExpand
Combinatorial and algebraic aspects of quantum state transfer
Reliably transferring a quantum state from one location to another, as well as generating entangled states, are important tasks to achieve in quantum spin systems. The fidelity or probability ofExpand
Quantum State Transfer in Graphs
Let X be a graph, A its adjacency matrix, and t ∈ R≥0. The matrix exp(itA) determines the evolution in time of a certain quantum system defined on the graph. It represents a continuous-time quantumExpand
Communication in Engineered Quantum Networks
• Computer Science
• 2014
We review the engineering of passive quantum networks for performing fundamental quantum communications tasks, such as the transfer, routing, and splitting of signals that are associated with quantumExpand
Pretty Good State Transfer in Qubit Chains - The Heisenberg Hamiltonian
• Mathematics, Physics
• 2016
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 arbitrarilyExpand

#### References

SHOWING 1-10 OF 27 REFERENCES
Combinatorial and graph-theoretical problems in linear algebra
• Mathematics
• 1993
This volume aims to gather information from both those who work on linear algebra problems in which combinatorial or graph-theoretical analysis is a major component, and those that work onExpand
Optics and Spectroscopy
• Physics
• Nature
• 1960
i. The need to solve such important problems as heavy plasma diagnostics, the creation of short-wave lasers on multiply-charged ions, etc., has stimulated interest in the study of the spectroscopicExpand
"J."
however (for it was the literal soul of the life of the Redeemer, John xv. io), is the peculiar token of fellowship with the Redeemer. That love to God (what is meant here is not God’s love to men)Expand
Int
• J. Quantum Inform. 8, 641
• 2010
Phys
• Rev. A 75, 042319
• 2007
Phys
• Rev. A 71, 032312
• 2005
Phys
• Rev. Lett. 106, 020503
• 2011
Phys
• Rev. Lett. 102, 070503 (2009); F. Pastawski, A. Kay, N. Schuch, and I. Cirac, Quantum Inf. Comput. 10, 580
• 2010
Phys
• Rev. A 82, 042322
• 2010
Quant
• Inform. Comput. 10, 325
• 2010