arXiv:2611.00874
Multicopy teleportation and quantum program retrieval on superconducting quantum hardware
Yousef Mafi, Ali G. Moghaddam
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.
AI Summary
The paper investigates whether multicopy correction-free teleportation and retrieval of stored unitary operations can be implemented on noisy superconducting hardware. The protocol consumes $k$ identical copies of an unknown pure input and one maximally entangled qudit pair. Its previously established optimal success probability is $p(d,k)=k/[d(k-1+d)]$, exceeding the single-copy rate $1/d^2$ and approaching $1/d$. The collective measurement is implemented by mapping its support to computational-basis outcomes through unitary completion, followed by quantum Shannon decomposition (QSD) or isometry synthesis. For qubit inputs, the stated gate-count scaling improves from $\Theta(4^k)$ with QSD to $\Theta(k2^k)$ with isometry synthesis; at $k=3$, the latter reduces transpiled two-qubit gates by approximately 45%. Experiments on IBM’s 156-qubit Heron processor use up to five copies and 20,000 shots per circuit, with measurement mitigation and dynamical decoupling. Success probabilities exceed the single-copy baseline for $k=2,3$ in single-qubit tests and $k=2$–$4$ in two-qubit tests. Reported fidelities exceed 90% through $k=2$, and 80% through $k=3$ for single-qubit tests and $k=4$ for two-qubit tests. Program-retrieval demonstrations include six single-qubit gates, each tested on one input, and selected two-qubit programs. Storage-delay tests show approximately unchanged success rates but decaying fidelity, modeled with a characteristic lifetime near $65\,\mu\mathrm{s}$. The demonstrations remain small-scale: synthesis costs grow exponentially, connectivity adds routing overhead, and accumulated noise substantially degrades performance at $k=5$. More symmetry-aware circuit constructions and improved gate fidelities and coherence are identified as needed for larger implementations.
Error found: The program-memory discussion uses Bell-pair dephasing times to motivate an input-independent depolarizing fidelity decay, although pure dephasing instead gives a qubit retrieval fidelity approaching (1+z²)/2 for input Bloch coordinate z, not universally 1/2.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.