Perfect and peak state transfer on IBM quantum hardware
Abstract
We run continuous-time quantum walks with perfect and peak state transfer on a present-day superconducting quantum processor, IBM Quantum's $156$-qubit Heron device ibm_kingston, deliberately without error correction or error mitigation. Perfect state transfer and its relaxations have been studied extensively in algebraic graph theory, where one can prove exactly which graphs move a quantum state from one vertex to another with probability one (or with the largest probability the graph allows, in the case of peak state transfer), and at what time. Our experiments cover perfect state transfer on the hypercubes Q2 = C4 and Q3, and on the Hamming-weighted paths HPn, the equitable-partition quotients of the hypercubes Qn, for n up to $20$; peak state transfer on the Xn family for n up to $11$; and, for comparison, moving the state along a path of qubits by a sequence of SWAP gates.
Related
- Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise
- Construction of Partial Join Graphs with Perfect State Transfer in Shunt Decomposition-Based Quantum Walks
- Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization
- Spectral width and polynomial degree in perfect state transfer
- Perfect state transfer on mixed graphs: complete classes and transfer times
BibTeX
@misc{awuah2026perfect,
title = {{Perfect and peak state transfer on IBM quantum hardware}},
author = {Priscilla Awuah and Krystal Guo},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.20855},
eprint = {2610.20855},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.20855},
}
RIS
TY - UNPB
TI - Perfect and peak state transfer on IBM quantum hardware
AU - Priscilla Awuah
AU - Krystal Guo
PY - 2026
DA - 2026/10/14
PB - arXiv
DO - 10.48550/arxiv.2610.20855
UR - https://arxiv.org/abs/2610.20855
AB - We run continuous-time quantum walks with perfect and peak state transfer on a present-day superconducting quantum processor, IBM Quantum's $156$-qubit Heron device ibm_kingston, deliberately without error correction or error mitigation. Perfect state transfer and its relaxations have been studied extensively in algebraic graph theory, where one can prove exactly which graphs move a quantum state from one vertex to another with probability one (or with the largest probability the graph allows, in the case of peak state transfer), and at what time. Our experiments cover perfect state transfer on the hypercubes Q_2 = C_4 and Q_3, and on the Hamming-weighted paths HP_n, the equitable-partition quotients of the hypercubes Q_n, for n up to $20$; peak state transfer on the X_n family for n up to $11$; and, for comparison, moving the state along a path of qubits by a sequence of SWAP gates.
ER -