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

Perfect state transfer on hypercubes and its implementation using superconducting qubits

Siddhant Singh, Bibhas Adhikari, Supriyo Dutta, David Zueco

Published Dec 14, 2020• 6 citations
arXivHTMLPDF

Abstract

We propose a protocol for perfect state transfer between any pair of vertices in a hypercube. Given a pair of distinct vertices in the hypercube, we determine a subhypercube that contains the pair of vertices as antipodal vertices. Then a switching process is introduced for determining the subhypercube of a memory-enhanced hypercube that facilitates perfect state transfer between the desired pair of vertices. Furthermore, we propose a physical architecture for the pretty good state transfer implementation of our switching protocol with fidelity arbitrary close to unity, using superconducting transmon qubits with tunable couplings. The switching is realized by the control over the effective coupling between the qubits resulting from the effect of ancilla qubit couplers for the graph edges. We also report an error bound on the fidelity of state transfer due to faulty implementation of our protocol.

DOI
10.1103/physreva.102.062609

Related papers

Switching and partially switching the hypercube while maintaining perfect state transfer

Steve Kirkland, Sarah Plosker, Xiaohong Zhang

A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with respect to inter-qubit interactions of a quantum system. We perform various perturbations to the hypercube graph---a graph that is known to exhibit PST---to create graphs that maintain many of the same properties of the hypercube, including PST as well as the distance for which PST occurs. We show that the sensitivity with respect to readout time errors remains unaffected for the vertices involved in PST. We give motivation for when these perturbations may be physically desirable or even necessary.

arXiv:1802.01531•Quantum Information and Computation•Jun 1, 2019•0 citations

Quantum walk state transfer on a hypercube

M. Štefaňák, S. Skoupý

Abstract We investigate state transfer on a hypercube by means of a quantum walk where the sender and the receiver vertices are marked by a weighted loops. First, we analyze search for a single marked vertex, which can be used for state transfer between arbitrary vertices by switching the weighted loop from the sender to the receiver after one run-time. Next, state transfer between antipodal vertices is considered. We show that one can tune the weight of the loop to achieve state transfer with high fidelity in shorter run-time in comparison to the state transfer with a switch. Finally, we investigate state transfer between vertices of arbitrary distance. It is shown that when the distance between the sender and the receiver is at least 2, the results derived for the antipodes are well applicable. If the sender and the receiver are direct neighbours the evolution follows a slightly different course. Nevertheless, state transfer with high fidelity is achieved in the same run-time.

arXiv:2302.07581•Physica Scripta•Aug 24, 2023•5 citations

Fast and perfect state transfer in superconducting circuit with tunable coupler

Chi 驰 Zhang 张, Tian-Le Wang, Ze-An 泽安 Zhao 赵 +5 more

In quantum computation and quantum information processing, the manipulation and engineering of quantum systems to suit certain purposes are an ongoing task. One such example is quantum state transfer (QST), an essential requirement for both quantum communication and large-scale quantum computation. Here we engineer a chain of four superconducting qubits with tunable couplers to realize the perfect state transfer (PST) protocol originally proposed in quantum spin networks and successfully demonstrate the efficient transfer of an arbitrary single-qubit state from one end of the chain to the other, achieving a high fidelity of 0.986 in just 25 ns. This demonstrated QST is readily to extend to larger chain and multi-node configurations, thus serving as a desirable tool for scalable quantum information processing.

Chinese Physics B•Aug 29, 2023•6 citations

Theoretical analysis of perfect quantum state transfer with superconducting qubits

Frederick W. Strauch, Carl J. Williams

Superconducting quantum circuits, fabricated with multiple layers, are proposed to implement perfect quantum state transfer between nodes of a hypercube network. For tunable devices such as the phase qubit, each node can transmit quantum information to any other node at a constant rate independent of the distance between qubits. The physical limits of quantum state transfer in this network are theoretically analyzed, including the effects of disorder, decoherence, and higher-order couplings.

arXiv:0708.0577•Physical Review B•Sep 24, 2008•43 citations

Parity-dependent state transfer for direct entanglement generation

Federico Roy, João H. Romeiro, L. Koch +19 more

As quantum information technologies advance, challenges in scaling and connectivity persist, particularly the need for long-range qubit connectivity and efficient entanglement generation. Perfect State Transfer enables time-optimal state transfer between distant qubits using only nearest-neighbor couplings, enhancing device connectivity. Moreover, the transfer protocol results in effective parity-dependent non-local interactions, extending its utility to entanglement generation. Here, we experimentally demonstrate Perfect State Transfer and multi-qubit entanglement generation on a chain of six superconducting transmon qubits with tunable couplers, controlled via parametric drives. By simultaneously activating and engineering all couplings, we implement the transfer for up to six qubits, verifying single-excitation dynamics for different initial states. Extending the protocol to multiple excitations, we confirm its parity-dependent nature, where excitation number controls the phase of the transferred state. Finally, leveraging this property, we prepare a Greenberger-Horne-Zeilinger state using a single transfer operation, showcasing potential of Perfect State Transfer for efficient entanglement generation.

arXiv:2405.19408•Nature Communications•Mar 18, 2025•8 citations

Perfect state transfer over distance-regular spin networks

M. A. Jafarizadeh, Rahime Sufiani

Christandl et al. have noted that the $d$-dimensional hypercube can be projected to a linear chain with $d+1$ sites so that, by considering fixed but different couplings between the qubits assigned to the sites, the perfect state transfer (PST) can be achieved over arbitrarily long distances in the chain [Phys. Rev. Lett. 92, 187902 (2004); Phys. Rev. A 71, 032312 (2005)]. In this work we consider distance-regular graphs as spin networks and note that any such network (not just the hypercube) can be projected to a linear chain and so can allow PST over long distances. We consider some particular spin Hamiltonians which are the extended version of those of Christandl et al. Then, by using techniques such as stratification of distance-regular graphs and spectral analysis methods, we give a procedure for finding a set of coupling constants in the Hamiltonians so that a particular state initially encoded on one site will evolve freely to the opposite site without any dynamical control, i.e., we show how to derive the parameters of the system so that PST can be achieved. It is seen that PST is only allowed in distance-regular spin networks for which, starting from an arbitrary vertex as reference vertex (prepared in the initial state which we wish to transfer), the last stratum of the networks with respect to the reference state contains only one vertex; i.e., stratification of these networks plays an important role which determines in which kinds of networks and between which vertices of them, PST can be allowed. As examples, the cycle network with even number of vertices and $d$-dimensional hypercube are considered in details and the method is applied for some important distance-regular networks.

arXiv:0709.0755•Physical Review A•Feb 13, 2008•44 citations
We propose a protocol for perfect state transfer between any pair of vertices in a hypercube. Given a pair of distinct vertices in the hypercube, we determine a subhypercube that contains the pair of vertices as antipodal vertices. Then a switching process is introduced for determining the subhypercube of a memory-enhanced hypercube that facilitates perfect state transfer between the desired pair of vertices. Furthermore, we propose a physical architecture for the pretty good state transfer implementation of our switching protocol with fidelity arbitrary close to unity, using superconducting transmon qubits with tunable couplings. The switching is realized by the control over the effective coupling between the qubits resulting from the effect of ancilla qubit couplers for the graph edges. We also report an error bound on the fidelity of state transfer due to faulty implementation of our protocol.
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with respect to inter-qubit interactions of a quantum system. We perform various perturbations to the hypercube graph---a graph that is known to exhibit PST---to create graphs that maintain many of the same properties of the hypercube, including PST as well as the distance for which PST occurs. We show that the sensitivity with respect to readout time errors remains unaffected for the vertices involved in PST. We give motivation for when these perturbations may be physically desirable or even necessary.
Abstract We investigate state transfer on a hypercube by means of a quantum walk where the sender and the receiver vertices are marked by a weighted loops. First, we analyze search for a single marked vertex, which can be used for state transfer between arbitrary vertices by switching the weighted loop from the sender to the receiver after one run-time. Next, state transfer between antipodal vertices is considered. We show that one can tune the weight of the loop to achieve state transfer with high fidelity in shorter run-time in comparison to the state transfer with a switch. Finally, we investigate state transfer between vertices of arbitrary distance. It is shown that when the distance between the sender and the receiver is at least 2, the results derived for the antipodes are well applicable. If the sender and the receiver are direct neighbours the evolution follows a slightly different course. Nevertheless, state transfer with high fidelity is achieved in the same run-time.
In quantum computation and quantum information processing, the manipulation and engineering of quantum systems to suit certain purposes are an ongoing task. One such example is quantum state transfer (QST), an essential requirement for both quantum communication and large-scale quantum computation. Here we engineer a chain of four superconducting qubits with tunable couplers to realize the perfect state transfer (PST) protocol originally proposed in quantum spin networks and successfully demonstrate the efficient transfer of an arbitrary single-qubit state from one end of the chain to the other, achieving a high fidelity of 0.986 in just 25 ns. This demonstrated QST is readily to extend to larger chain and multi-node configurations, thus serving as a desirable tool for scalable quantum information processing.
As quantum information technologies advance, challenges in scaling and connectivity persist, particularly the need for long-range qubit connectivity and efficient entanglement generation. Perfect State Transfer enables time-optimal state transfer between distant qubits using only nearest-neighbor couplings, enhancing device connectivity. Moreover, the transfer protocol results in effective parity-dependent non-local interactions, extending its utility to entanglement generation. Here, we experimentally demonstrate Perfect State Transfer and multi-qubit entanglement generation on a chain of six superconducting transmon qubits with tunable couplers, controlled via parametric drives. By simultaneously activating and engineering all couplings, we implement the transfer for up to six qubits, verifying single-excitation dynamics for different initial states. Extending the protocol to multiple excitations, we confirm its parity-dependent nature, where excitation number controls the phase of the transferred state. Finally, leveraging this property, we prepare a Greenberger-Horne-Zeilinger state using a single transfer operation, showcasing potential of Perfect State Transfer for efficient entanglement generation.
Christandl et al. have noted that the ddd-dimensional hypercube can be projected to a linear chain with d+1d+1d+1 sites so that, by considering fixed but different couplings between the qubits assigned to the sites, the perfect state transfer (PST) can be achieved over arbitrarily long distances in the chain [Phys. Rev. Lett. 92, 187902 (2004); Phys. Rev. A 71, 032312 (2005)]. In this work we consider distance-regular graphs as spin networks and note that any such network (not just the hypercube) can be projected to a linear chain and so can allow PST over long distances. We consider some particular spin Hamiltonians which are the extended version of those of Christandl et al. Then, by using techniques such as stratification of distance-regular graphs and spectral analysis methods, we give a procedure for finding a set of coupling constants in the Hamiltonians so that a particular state initially encoded on one site will evolve freely to the opposite site without any dynamical control, i.e., we show how to derive the parameters of the system so that PST can be achieved. It is seen that PST is only allowed in distance-regular spin networks for which, starting from an arbitrary vertex as reference vertex (prepared in the initial state which we wish to transfer), the last stratum of the networks with respect to the reference state contains only one vertex; i.e., stratification of these networks plays an important role which determines in which kinds of networks and between which vertices of them, PST can be allowed. As examples, the cycle network with even number of vertices and ddd-dimensional hypercube are considered in details and the method is applied for some important distance-regular networks.