Multicopy teleportation and quantum program retrieval on superconducting quantum hardware
Abstract
Correction-free teleportation protocols offer a probabilistic route around the limits imposed by the quantum no-programming theorem, but have remained largely theoretical. Here, we experimentally implement and benchmark correction-free multicopy teleportation on noisy superconducting quantum hardware. Key to this is an efficient circuit implementation: by suitably decomposing the unitary that maps the multicopy measurement basis onto the computational basis, we substantially reduce circuit depth and gate count. For one- and two-qubit input states, using k=2 and $3$ copies, we observe success probabilities substantially exceeding the single-copy bound with fidelities above 0.85. We further explore applications to probabilistic programmable quantum processors, in particular the storage and retrieval of unitary operations encoded in quantum program states. Our results establish the practical feasibility of multicopy teleportation and highlight its potential for near-term quantum processors and distributed quantum computing.
Related
- Multicopy quantum state teleportation with application to storage and retrieval of quantum programs
- Parallel Teleportation via AME(5,2) States on IBM Quantum Hardware
- Teleportation Game: Quantum Teleportation in Multi-Agent Systems for Interactive Music
- Mentor-Initiated Asymmetric Bidirectional Quantum Teleportation Protocol for Arbitrary Qubit States
- Pump-Free Microwave-Optical Bell Pair Generation for Teleportation-Based Quantum Transduction
BibTeX
@misc{mafi2026multicopy,
title = {{Multicopy teleportation and quantum program retrieval on superconducting quantum hardware}},
author = {Yousef Mafi and Ali G. Moghaddam},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.00874},
eprint = {2611.00874},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.00874},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Multicopy teleportation and quantum program retrieval on superconducting quantum hardware
AU - Yousef Mafi
AU - Ali G. Moghaddam
PY - 2026
DA - 2026/11/01
PB - arXiv
DO - 10.48550/arxiv.2611.00874
UR - https://arxiv.org/abs/2611.00874
AB - Correction-free teleportation protocols offer a probabilistic route around the limits imposed by the quantum no-programming theorem, but have remained largely theoretical. Here, we experimentally implement and benchmark correction-free multicopy teleportation on noisy superconducting quantum hardware. Key to this is an efficient circuit implementation: by suitably decomposing the unitary that maps the multicopy measurement basis onto the computational basis, we substantially reduce circuit depth and gate count. For one- and two-qubit input states, using k=2 and $3$ copies, we observe success probabilities substantially exceeding the single-copy bound with fidelities above 0.85. We further explore applications to probabilistic programmable quantum processors, in particular the storage and retrieval of unitary operations encoded in quantum program states. Our results establish the practical feasibility of multicopy teleportation and highlight its potential for near-term quantum processors and distributed quantum computing.
ER -