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

Acta Applicandae Mathematicae

Quantum Perfect State Transfer in a 2D Lattice

Sarah Post

Published Jun 17, 2014• 12 citations
Publisher
DOI
10.1007/s10440-014-9953-5

Related papers

Quantum state transfer on 2D lattices: A low-energy effective Hamiltonian approach

Chandrima B. Pushpan, K J Harikrishnan, Amit Kumar Pal

arXiv:2306.08440•Physics Letters A•Apr 30, 2024•3 citations

Perfect state transfer in quantum photonic networks based on Fourier modes

Sunita Meena, Sugar Singh Meena, Paulo A Brandão +1 more

We propose a quantum network consisting of optical waveguides in the linear regime for quantum state transfer. The circular topology of our network introduces novel functionalities that enable us to analytically identify the conditions under which perfect state transfer (PST) is achievable. We utilize the properties of the Fourier modes, in particular the zero Fourier modes, which provide a protected subspace for the efficient propagation of quantum states, resulting in PST to the diametrically opposite site in a network with any number of sites $N = 4n$. The coupling profiles in the photonic network modulate the number of zero-energy eigenmodes, with uniform couplings yielding more than evanescent ones, confirming that the expedition of observed PST originates from the collapse of the eigenvalue spectrum into three distinct eigenvalue blocks, including $N/2$ manifolds of zero Fourier modes. We investigate PST in both discrete- and continuous-variable input regimes, using single photon state, Schrödinger cat states, and two-mode squeezed vacuum state. Our findings apply to the engineering of quantum networks and photonic lattices, paving the way for applications in controlled routing in integrated quantum circuits.

quant-pharXiv:2605.09819•May 12, 2026•0 citations

Perfect state transfer on Cayley graphs over dihedral groups

Xiwang Cao, Keqin Feng

Recently, there are extensive studies on perfect state transfer on graphs due to their significant applications in quantum information processing and quantum computations. However, most of the graphs previously investigated are abelian Cayley graphs. In this paper, we study perfect state transfer on Cayley graphs over dihedral groups. Using the representations of the dihedral group , we present some necessary and sufficient conditions for the Cayley graph to have a perfect state transfer between two distinct vertices for some connection set S. Based on these conditions, we show that cannot have PST if n is odd and S is conjugation-closed. For some even integers n, it is possible for to have PST, some concrete constructions are provided.

Linear and Multilinear Algebra•Apr 3, 2019•28 citations

Perfect quantum state transfer on the Johnson scheme

Bahman Ahmadi, Mohammad Hassan Shirdareh Haghighi, Ahmad Mokhtar

arXiv:1710.09096•Linear Algebra and its Applications•Sep 24, 2019•12 citations

Remote Entanglement Generation Via Enhanced Quantum State Transfer

Tian-Le Wang, Peng Wang, Zean Zhao +16 more

Achieving robust and scalable remote quantum entanglement is one of the fundamental challenges for the development of distributed quantum networks and modular quantum computing systems. In this context, perfect state transfer (PST) and fractional state transfer (FST) have emerged as promising schemes for quantum state transfer and remote entanglement generation using only nearest-neighbor couplings. In this work, we propose a quantum state transfer scheme based on a zig-zag configuration, which introduces a control parameter for PST and FST. We show that this new parameter can suppress the population in the intermediate qubits, thereby reducing losses and enhancing state transfer. In certain limiting cases, our new scheme reduces to the conventional PST scheme, revealing an elegant mathematical structure inherent in the design. We experimentally demonstrate our proposed scheme on a superconducting quantum processor, achieving an 18% reduction in error for remote Bell state generation in a 1D ( 1 × 5 ) qubit chain with enhanced robustness to specific noise channels. Furthermore, we extend our approach to a 2D ( 3 × 3 ) network and successfully generate a W state among the four corner qubits. These results highlight the potential of our new enhanced quantum state transfer scheme for scalable and noise-resilient quantum communication and computing.

arXiv:2506.06669•PRX Quantum•Feb 4, 2026•2 citations

Perfect state transfer via quantum probability theory

S. Salimi, S. Ghoraishipour, A. Sorouri

arXiv:1007.3002•Quantum Information Processing•Mar 26, 2012•7 citations
We propose a quantum network consisting of optical waveguides in the linear regime for quantum state transfer. The circular topology of our network introduces novel functionalities that enable us to analytically identify the conditions under which perfect state transfer (PST) is achievable. We utilize the properties of the Fourier modes, in particular the zero Fourier modes, which provide a protected subspace for the efficient propagation of quantum states, resulting in PST to the diametrically opposite site in a network with any number of sites N=4nN = 4nN=4n. The coupling profiles in the photonic network modulate the number of zero-energy eigenmodes, with uniform couplings yielding more than evanescent ones, confirming that the expedition of observed PST originates from the collapse of the eigenvalue spectrum into three distinct eigenvalue blocks, including N/2N/2N/2 manifolds of zero Fourier modes. We investigate PST in both discrete- and continuous-variable input regimes, using single photon state, Schrödinger cat states, and two-mode squeezed vacuum state. Our findings apply to the engineering of quantum networks and photonic lattices, paving the way for applications in controlled routing in integrated quantum circuits.
Recently, there are extensive studies on perfect state transfer on graphs due to their significant applications in quantum information processing and quantum computations. However, most of the graphs previously investigated are abelian Cayley graphs. In this paper, we study perfect state transfer on Cayley graphs over dihedral groups. Using the representations of the dihedral group , we present some necessary and sufficient conditions for the Cayley graph to have a perfect state transfer between two distinct vertices for some connection set S. Based on these conditions, we show that cannot have PST if n is odd and S is conjugation-closed. For some even integers n, it is possible for to have PST, some concrete constructions are provided.
Achieving robust and scalable remote quantum entanglement is one of the fundamental challenges for the development of distributed quantum networks and modular quantum computing systems. In this context, perfect state transfer (PST) and fractional state transfer (FST) have emerged as promising schemes for quantum state transfer and remote entanglement generation using only nearest-neighbor couplings. In this work, we propose a quantum state transfer scheme based on a zig-zag configuration, which introduces a control parameter for PST and FST. We show that this new parameter can suppress the population in the intermediate qubits, thereby reducing losses and enhancing state transfer. In certain limiting cases, our new scheme reduces to the conventional PST scheme, revealing an elegant mathematical structure inherent in the design. We experimentally demonstrate our proposed scheme on a superconducting quantum processor, achieving an 18% reduction in error for remote Bell state generation in a 1D ( 1 × 5 ) qubit chain with enhanced robustness to specific noise channels. Furthermore, we extend our approach to a 2D ( 3 × 3 ) network and successfully generate a W state among the four corner qubits. These results highlight the potential of our new enhanced quantum state transfer scheme for scalable and noise-resilient quantum communication and computing.