Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper runs continuous-time quantum walks with perfect and peak state transfer on IBM's 156-qubit Heron processor, without error correction or mitigation, and tests circuits up to 20 qubits. The work is useful as a hardware check of graph-theoretic predictions, which are proven exactly for these graph families. Readers should note that it benchmarks noisy, present-day devices rather than demonstrating a practical speedup.
Sources coveringarXiv, Quantum Zeitgeist, news.ubc.ca
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Perfect and peak state transfer on IBM quantum hardware

arXiv2 min read

arXiv:2610.20855v1 Announce Type: new 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 $Q_2 = C_4$ and $Q_3$, and on the Hamming-weighted paths $\mathrm{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.

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 $Q_2 = C_4$ and $Q_3$, and on the Hamming-weighted paths $\mathrm{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.

41 pages. Code available at this https URL

Quantum Physics (quant-ph); Combinatorics (math.CO)

arXiv:2610.20855 [quant-ph]

(or arXiv:2610.20855v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.20855 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 247 words

Related coverage