aiqbench analysis
Composing insight from the full article — this may take a moment.
Multicopy teleportation and quantum program retrieval on superconducting quantum hardware
arXiv:2611.00874v1 Announce Type: new 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.
Read the full article at arXivRelated coverage

Quantum teleportation works with a surface code up to distance 7
Quantum Zeitgeist · Oct 27, 2026
Branch-Resolved Characterization of Feed-Forward Error in Dynamic Teleportation via Classical Choi Shadows
arXiv · Jun 9, 2026
Branch-Resolved Characterization of Feed-Forward Error in Dynamic Teleportation via Classical Choi Shadows
arXiv · Jul 23, 2026
Lattice surgery for near-term experimental logical qubit entanglement creation in planar architectures
arXiv · Jun 16, 2026