Entanglement teleportation along a regenerating hamster-wheel graph state

We present an efficient and reusable approach to quantum teleportation that allows cyclic teleportation of a two-qubit graph state around a quantum hamster wheel-a ring of qubits entangled as a one-dimensional line prepared on the 20-qubit Quantinuum H1-1 ion-trap quantum processor. The qubits on the ring are periodically measured and reused to achieve a teleportation depth that exceeds the total number of available qubits in the quantum processor. Using the outcomes measured during teleportation, we calculate and apply byproduct operators through dynamic circuits to correct local transformations induced on the teleported state. We evaluate the quality of teleportation by tracing the preserved entanglement and fidelity of the teleported two-qubit graph state from its density matrix. In the real-machine experiments, we demonstrate that 58% of the teleported state's entanglement is sustained with a measured two-qubit negativity of [Formula: see text] after three complete revolutions around the hamster wheel, or equivalently, after hopping across 56 qubits. On the machine-specific noisy emulator, we found that the teleported state after 100 hops still sustained 45% of its entanglement. By performing teleportation along a regenerating graph state, our work provides a benchmarking strategy on the entanglement-preserving capability of physical quantum computers beyond their own qubit count through cluster state cycling quality, as well as a step forward in demonstrating the feasibility of a core ingredient in measurement-based quantum computation.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-12-03
DOI
https://doi.org/10.1038/s41598-025-30301-0
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Entanglement teleportation along a regenerating hamster-wheel graph state

Lloyd C. L. Hollenberg, Gary J. Mooney, John F. Kam, Haiyue Kang
Scientific Reports
Quantum Computing Algorithms and Architecture
article

Entanglement teleportation along a regenerating hamster-wheel graph state

Lloyd C. L. Hollenberg, Gary J. Mooney, John F. Kam, Haiyue Kang
article en

Abstract

We present an efficient and reusable approach to quantum teleportation that allows cyclic teleportation of a two-qubit graph state around a quantum hamster wheel-a ring of qubits entangled as a one-dimensional line prepared on the 20-qubit Quantinuum H1-1 ion-trap quantum processor. The qubits on the ring are periodically measured and reused to achieve a teleportation depth that exceeds the total number of available qubits in the quantum processor. Using the outcomes measured during teleportation, we calculate and apply byproduct operators through dynamic circuits to correct local transformations induced on the teleported state. We evaluate the quality of teleportation by tracing the preserved entanglement and fidelity of the teleported two-qubit graph state from its density matrix. In the real-machine experiments, we demonstrate that 58% of the teleported state's entanglement is sustained with a measured two-qubit negativity of [Formula: see text] after three complete revolutions around the hamster wheel, or equivalently, after hopping across 56 qubits. On the machine-specific noisy emulator, we found that the teleported state after 100 hops still sustained 45% of its entanglement. By performing teleportation along a regenerating graph state, our work provides a benchmarking strategy on the entanglement-preserving capability of physical quantum computers beyond their own qubit count through cluster state cycling quality, as well as a step forward in demonstrating the feasibility of a core ingredient in measurement-based quantum computation.

Scientific ReportsVol. 16(1)
The University of Melbourne (AU), Centre for Quantum Computation and Communication Technology (AU), Monash University (AU)
Australian Government
Openalex Percentile: Top 80%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.