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:1908.02046 · Physical Review A

Designing pretty good state transfer via isospectral reductions

Malte Röntgen, Nikolaos E. Palaiodimopoulos, Christian V. Morfonios, Ioannis Brouzos, Maxim Pyzh, F. Κ. Diakonos, Peter Schmelcher

Published Apr 1, 2020• 21 citations
arXivHTMLPDF

Abstract

We present an algorithm to design networks that feature pretty good state transfer (PGST), which is of interest for high-fidelity transfer of information in quantum computing. Realizations of PGST networks have so far mostly relied either on very special network geometries or imposed conditions such as transcendental on-site potentials. However, it was recently shown that PGST generally arises when a network's eigenvectors and the factors ${P}_{\ifmmode\pm\else\textpm\fi{}}$ of its characteristic polynomial $P$ fulfill certain conditions, where ${P}_{\ifmmode\pm\else\textpm\fi{}}$ correspond to eigenvectors which have $\ifmmode\pm\else\textpm\fi{}1$ parity on the input and target sites. We combine this result with the so-called isospectral reduction of a network to obtain ${P}_{\ifmmode\pm\else\textpm\fi{}}$ from a dimensionally reduced form of the Hamiltonian. Equipped with the knowledge of the factors ${P}_{\ifmmode\pm\else\textpm\fi{}}$, we show how a variety of setups can be equipped with PGST by proper tuning of ${P}_{\ifmmode\pm\else\textpm\fi{}}$. Having demonstrated a method of designing networks featuring pretty good state transfer of single site excitations, we further show how the obtained networks can be manipulated such that they allow for robust storage of qubits. We hereby rely on the concept of compact localized states, which are eigenstates of a Hamiltonian localized on a small subdomain, and whose amplitudes completely vanish outside of this domain. Such states are natural candidates for the storage of quantum information, and we show how certain Hamiltonians featuring pretty good state transfer of single site excitation can be equipped with compact localized states such that their transfer is made possible.

DOI
10.1103/physreva.101.042304

Related papers

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

Quantum Network Transfer and Storage with Compact Localized States Induced by Local Symmetries

Malte Röntgen, Christian V. Morfonios, Ioannis Brouzos +2 more

We propose modulation protocols designed to generate, store, and transfer compact localized states in a quantum network. Induced by parameter tuning or local reflection symmetries, such states vanish outside selected domains of the complete system and are therefore ideal for information storage. Their creation and transfer is here achieved either via amplitude phase flips or via optimal temporal control of intersite couplings. We apply the concept to a decorated, locally symmetric Lieb lattice where one sublattice is dimerized, and also demonstrate it for more complex setups. The approach allows for a flexible storage and transfer of states along independent paths in lattices supporting flat energetic bands. We further demonstrate a method to equip any network featuring static perfect state transfer of single-site excitations with compact localized states, thus increasing the storage ability of these networks. We show that these compact localized states can likewise be perfectly transferred through the corresponding network by suitable, time-dependent modifications. The generic network and protocols proposed can be utilized in various physical setups such as atomic or molecular spin lattices, photonic waveguide arrays, and acoustic setups.

arXiv:1811.02950•Physical Review Letters•Aug 23, 2019•32 citations

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•61 citations

Pretty good state transfer among large sets of vertices

Ada Chan, Peter Sin

In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1. We construct families of graphs to demonstrate that there is no bound on the size of a set of vertices that admits pretty good state transfer between any two vertices of the set.Mathematics Subject Classifications: 05C50, 05C38Keywords: Continuous-time quantum walks, pretty good state transfer

arXiv:2305.14276•Combinatorial Theory•Sep 27, 2024•3 citations

Pretty Good State Transfer and Minimal Polynomials

Christopher M. van Bommel

We examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good state transfer can be ruled out. We also provide new examples of simple, unweighted graphs exhibiting pretty good state transfer. Finally, we consider modifying paths by adding symmetric weighted edges, and apply these results to this case.

arXiv:2010.06779•Oct 14, 2020•9 citations

Pretty good quantum state transfer via transcendental edge weights

Addison Ballif, Mark Kempton, James B. Larsen +3 more

We prove that if we take a rooted product of a circulant graph with universal perfect state transfer with a path of fixed length whose end edge is weighted with a transcendental number, then there is pretty good state transfer between any pair of endpoints of these paths. As a consequence, in a path with an even number of vertices with transcendental weights on the two edges incident to the endpoints, there is pretty good state transfer.

quant-pharXiv:2609.16549•Sep 16, 2026•0 citations
We present an algorithm to design networks that feature pretty good state transfer (PGST), which is of interest for high-fidelity transfer of information in quantum computing. Realizations of PGST networks have so far mostly relied either on very special network geometries or imposed conditions such as transcendental on-site potentials. However, it was recently shown that PGST generally arises when a network's eigenvectors and the factors P\ifmmode±\else\textpm\fi{P}_{\ifmmode\pm\else\textpm\fi{}}P\ifmmode±\else\textpm\fi​ of its characteristic polynomial PPP fulfill certain conditions, where P\ifmmode±\else\textpm\fi{P}_{\ifmmode\pm\else\textpm\fi{}}P\ifmmode±\else\textpm\fi​ correspond to eigenvectors which have \ifmmode±\else\textpm\fi1\ifmmode\pm\else\textpm\fi{}1\ifmmode±\else\textpm\fi1 parity on the input and target sites. We combine this result with the so-called isospectral reduction of a network to obtain P\ifmmode±\else\textpm\fi{P}_{\ifmmode\pm\else\textpm\fi{}}P\ifmmode±\else\textpm\fi​ from a dimensionally reduced form of the Hamiltonian. Equipped with the knowledge of the factors P\ifmmode±\else\textpm\fi{P}_{\ifmmode\pm\else\textpm\fi{}}P\ifmmode±\else\textpm\fi​, we show how a variety of setups can be equipped with PGST by proper tuning of P\ifmmode±\else\textpm\fi{P}_{\ifmmode\pm\else\textpm\fi{}}P\ifmmode±\else\textpm\fi​. Having demonstrated a method of designing networks featuring pretty good state transfer of single site excitations, we further show how the obtained networks can be manipulated such that they allow for robust storage of qubits. We hereby rely on the concept of compact localized states, which are eigenstates of a Hamiltonian localized on a small subdomain, and whose amplitudes completely vanish outside of this domain. Such states are natural candidates for the storage of quantum information, and we show how certain Hamiltonians featuring pretty good state transfer of single site excitation can be equipped with compact localized states such that their transfer is made possible.
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 propose modulation protocols designed to generate, store, and transfer compact localized states in a quantum network. Induced by parameter tuning or local reflection symmetries, such states vanish outside selected domains of the complete system and are therefore ideal for information storage. Their creation and transfer is here achieved either via amplitude phase flips or via optimal temporal control of intersite couplings. We apply the concept to a decorated, locally symmetric Lieb lattice where one sublattice is dimerized, and also demonstrate it for more complex setups. The approach allows for a flexible storage and transfer of states along independent paths in lattices supporting flat energetic bands. We further demonstrate a method to equip any network featuring static perfect state transfer of single-site excitations with compact localized states, thus increasing the storage ability of these networks. We show that these compact localized states can likewise be perfectly transferred through the corresponding network by suitable, time-dependent modifications. The generic network and protocols proposed can be utilized in various physical setups such as atomic or molecular spin lattices, photonic waveguide arrays, and acoustic setups.
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.