Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.00874

Multicopy teleportation and quantum program retrieval on superconducting quantum hardware

Yousef Mafi, Ali G. Moghaddam

quant-phSubmitted Oct 31, 2026• Announced Nov 3, 2026• 0 citations
arXivHTMLPDF

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.

Little sign of AI-generated textIncremental

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.

Related papers

Multicopy quantum state teleportation with application to storage and retrieval of quantum programs

Frédéric Grosshans, Michał Horodecki, Mio Murao +4 more

This work considers a teleportation task for Alice and Bob in a scenario where Bob cannot perform corrections. In particular, we analyse the task of multicopy state teleportation , where Alice has k identical copies of an arbitrary unknown d -dimensional qudit state | ψ ⟩ to teleport a single copy of | ψ ⟩ to Bob using a maximally entangled two-qudit state shared between Alice and Bob without Bob's correction. Alice may perform a joint measurement on her half of the entangled state and the k copies of | ψ ⟩ . We prove that the maximal probability of success for teleporting the exact state | ψ ⟩ to Bob is p ( d , k ) = k d ( k − 1 + d ) and present an explicit protocol to attain this performance. Then, by utilising k copies of an arbitrary target state | ψ ⟩ , we show how the multicopy state teleportation protocol can be employed to enhance the success probability of storage and retrieval of quantum programs, which aims to universally retrieve the action of an arbitrary quantum channel that is stored in a state. Our proofs make use of group representation theory methods, which may find applications beyond the problems addressed in this work.

arXiv:2409.10393•Quantum•May 13, 2026•6 citations

Circuit Teleportation via EPR Topology Encoding: Distributed Quantum Programming on Heterogeneous QPUs

Justin Howard-Stanley

Abstract We present the first experimental demonstration of quantum circuit teleportation between heterogeneous quantum processors using Bell state topology as a hardware-agnostic encoding framework. A complete quantum circuit---comprising 4 gate instructions (H, CNOT, Z measurements)---was teleported from Rigetti Computing's Ankaa-3 superconducting QPU to IQM Quantum Computers' Garnet system, with successful reconstruction and execution. The protocol encodes circuit instructions as Bell state manifolds using a 3-qubit error correction code with majority voting, achieving complete circuit fidelity despite architectural differences in native gate sets and connectivity topologies. By treating quantum gates as equivalence classes under entanglement structure---mapping $H \to |\Phi^+\rangle$, $\mathrm{CNOT} \to |\Psi^+\rangle$, $Z \to |\Phi^-\rangle$, and $M \to |\Psi^-\rangle$---we establish a foundational equivalence between gate operations and Bell basis projections. Implementation utilizes the hyperelliptic lattice infrastructure developed previously, enabling topologically-aware routing of quantum programs. This work demonstrates that heterogeneous quantum networks can execute distributed quantum algorithms without dedicated quantum channels or pre-shared high-fidelity entanglement, using only classical database coordination. The 100\% circuit execution success rate combined with error-corrected Bell state decoding provides strong evidence that topology-mediated programming offers a practical pathway toward distributed quantum computing infrastructure. We present comprehensive experimental data, theoretical analysis connecting Bell topology to quantum circuit semantics, and a scalable framework for cross-architecture quantum software distribution.

•Feb 9, 2026•0 citations

Efficient generation of multi-partite entanglement between non-local superconducting qubits using classical feedback

Akel Hashim, Ming Yuan, Pranav Gokhale +8 more

Quantum entanglement is one of the primary features which distinguish quantum computers from classical computers. In gate-based quantum computing, the creation of entangled states or the distribution of entanglement across a quantum processor often requires circuit depths, which grow with the number of entangled qubits. However, in teleportation-based quantum computing, one can deterministically generate entangled states with a circuit depth that is constant in the number of qubits, provided that one has access to an entangled resource state, the ability to perform mid-circuit measurements, and can rapidly transmit classical information. In this work, aided by fast classical field programmable gate array-based control hardware with a feedback latency of only 150 ns, we explore the utility of teleportation-based protocols for generating non-local, multi-partite entanglement between superconducting qubits. First, we demonstrate well-known protocols for generating Greenberger–Horne–Zeilinger states and non-local controlled-NOT gates in constant depth. Next, we utilize both protocols for implementing a quantum fan-out gate in constant depth among three non-local qubits (i.e., controlled-NOT-NOT). Finally, we demonstrate deterministic state teleportation and entanglement swapping between qubits on opposite sides of our quantum processor. Throughout this work, we find that the fidelity of our teleportation-based protocols is limited by measurement-induced dephasing on idling spectator qubits. Therefore, our work serves as a useful study of the current benefits and limitations of teleportation-based protocols on contemporary superconducting quantum processors.

arXiv:2403.18768•APL Quantum•Nov 10, 2025•19 citations

A hardware-efficient Berkeley gate for superconducting quantum processors

M. AbuGhanem

The Berkeley gate is a high-performance, two-qubit entangling operation with particular potential for quantum error correction and fault-tolerant protocols. However, harnessing this potential on current noisy intermediate-scale quantum (NISQ) processors, requires efficient compilation and robust performance under realistic noise conditions. In this work, we demonstrate a hardware-efficient implementation of the Berkeley gate on a superconducting quantum processor. Using quantum process tomography (QPT), we experimentally characterize its performance and benchmark it against a noiseless quantum simulator to evaluate its practical reliability in the NISQ era. Experimental measurements confirm the gate's correct logical action, producing the target partially entangled state with a subspace confinement probability of [Formula: see text] on real quantum hardware compared to 100% in quantum simulation. Results from QPT experiments show a simulated process fidelity of [Formula: see text], while the experimental process fidelity on hardware is [Formula: see text]. The observed discrepancy is analyzed in the context of device-specific noise sources, including qubit relaxation, dephasing, and state preparation and measurement (SPAM) errors. Our work provides a concrete fidelity benchmark for the Berkeley gate on superconducting hardware and quantify the impact of realistic noise on a non-trivial two-qubit operation, supporting its use in near-term algorithmic and error-correction applications.

Scientific Reports•Jun 5, 2026•0 citations

Benchmarking a Quantum Teleportation Protocol in Superconducting Circuits Using Tomography and an Entanglement Witness

Matthias Baur, Arkady Fedorov, L. Steffen +3 more

Teleportation of a quantum state may be used for distributing entanglement between distant qubits in quantum communication and for quantum computation. Here we demonstrate the implementation of a teleportation protocol, up to the single-shot measurement step, with superconducting qubits coupled to a microwave resonator. Using full quantum state tomography and evaluating an entanglement witness, we show that the protocol generates a genuine tripartite entangled state of all three qubits. Calculating the projection of the measured density matrix onto the basis states of two qubits allows us to reconstruct the teleported state. Repeating this procedure for a complete set of input states we find an average output state fidelity of 86%.

arXiv:1107.4774•Physical Review Letters•Jan 24, 2012•90 citations

Entanglement enables coherence transfer and feedforward corrects the state in quantum teleportation on superconducting dynamic circuits

Vikas Rai, Shazan Farhat

Abstract Quantum teleportation transfers an unknown qubit state from a sender to a receiver using a shared entangled pair and a classically conditioned correction without moving the physical carrier. On the dynamic-circuit hardware, the complete protocol (which includes mid-circuit measurement and conditional feedforward) now runs on a single circuit. We use this to benchmark three-qubit teleportation on a 156-qubit IBM Heron r2 processor (ibm_fez). A single-qubit RY(θ) input was teleported at six angles along a meridian of the Bloch sphere and reconstructed by state tomography alongside two ablation controls; one without entanglement and the other without feedforward. The full protocol returns a mean fidelity of about 0.945, nearly constant across the angles and above the 2/3 full-Bloch-sphere reference at all six sampled angles. Removing feedforward lowered the fidelity to about 0.51, close to a maximally mixed state. On the other hand, removing entanglement yields (1 + cos²θ)/2 with a mean near 0.75, transferring the population but losing the coherence. Together, these results establish that entanglement and feedforward are both necessary. The calibration-limited fidelity serves as a reference for this class of hardware. A separate run returned a Bell-state fidelity value of 0.957. A branch-resolved analysis confirmed that the four measurement branches are Pauli rotations of the target realigned by feedforward. The reported fidelity depends only on the rotation angle and the device noise.

Scientific Reports•Jul 23, 2026•0 citations
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=2k=2k=2 and 333 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.
The paper investigates whether multicopy correction-free teleportation and retrieval of stored unitary operations can be implemented on noisy superconducting hardware. The protocol consumes kkk 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)]p(d,k)=k/[d(k-1+d)]p(d,k)=k/[d(k−1+d)], exceeding the single-copy rate 1/d21/d^21/d2 and approaching 1/d1/d1/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 Θ(4k)\Theta(4^k)Θ(4k) with QSD to Θ(k2k)\Theta(k2^k)Θ(k2k) with isometry synthesis; at k=3k=3k=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,3k=2,3k=2,3 in single-qubit tests and k=2k=2k=2–444 in two-qubit tests. Reported fidelities exceed 90% through k=2k=2k=2, and 80% through k=3k=3k=3 for single-qubit tests and k=4k=4k=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 μs65\,\mu\mathrm{s}65μs.
The demonstrations remain small-scale: synthesis costs grow exponentially, connectivity adds routing overhead, and accumulated noise substantially degrades performance at k=5k=5k=5. More symmetry-aware circuit constructions and improved gate fidelities and coherence are identified as needed for larger implementations.
This work considers a teleportation task for Alice and Bob in a scenario where Bob cannot perform corrections. In particular, we analyse the task of multicopy state teleportation , where Alice has k identical copies of an arbitrary unknown d -dimensional qudit state | ψ ⟩ to teleport a single copy of | ψ ⟩ to Bob using a maximally entangled two-qudit state shared between Alice and Bob without Bob's correction. Alice may perform a joint measurement on her half of the entangled state and the k copies of | ψ ⟩ . We prove that the maximal probability of success for teleporting the exact state | ψ ⟩ to Bob is p ( d , k ) = k d ( k − 1 + d ) and present an explicit protocol to attain this performance. Then, by utilising k copies of an arbitrary target state | ψ ⟩ , we show how the multicopy state teleportation protocol can be employed to enhance the success probability of storage and retrieval of quantum programs, which aims to universally retrieve the action of an arbitrary quantum channel that is stored in a state. Our proofs make use of group representation theory methods, which may find applications beyond the problems addressed in this work.
Abstract We present the first experimental demonstration of quantum circuit teleportation between heterogeneous quantum processors using Bell state topology as a hardware-agnostic encoding framework. A complete quantum circuit---comprising 4 gate instructions (H, CNOT, Z measurements)---was teleported from Rigetti Computing's Ankaa-3 superconducting QPU to IQM Quantum Computers' Garnet system, with successful reconstruction and execution. The protocol encodes circuit instructions as Bell state manifolds using a 3-qubit error correction code with majority voting, achieving complete circuit fidelity despite architectural differences in native gate sets and connectivity topologies. By treating quantum gates as equivalence classes under entanglement structure---mapping H→∣Φ+⟩H \to |\Phi^+\rangleH→∣Φ+⟩, CNOT→∣Ψ+⟩\mathrm{CNOT} \to |\Psi^+\rangleCNOT→∣Ψ+⟩, Z→∣Φ−⟩Z \to |\Phi^-\rangleZ→∣Φ−⟩, and M→∣Ψ−⟩M \to |\Psi^-\rangleM→∣Ψ−⟩---we establish a foundational equivalence between gate operations and Bell basis projections. Implementation utilizes the hyperelliptic lattice infrastructure developed previously, enabling topologically-aware routing of quantum programs. This work demonstrates that heterogeneous quantum networks can execute distributed quantum algorithms without dedicated quantum channels or pre-shared high-fidelity entanglement, using only classical database coordination. The 100\% circuit execution success rate combined with error-corrected Bell state decoding provides strong evidence that topology-mediated programming offers a practical pathway toward distributed quantum computing infrastructure. We present comprehensive experimental data, theoretical analysis connecting Bell topology to quantum circuit semantics, and a scalable framework for cross-architecture quantum software distribution.
Quantum entanglement is one of the primary features which distinguish quantum computers from classical computers. In gate-based quantum computing, the creation of entangled states or the distribution of entanglement across a quantum processor often requires circuit depths, which grow with the number of entangled qubits. However, in teleportation-based quantum computing, one can deterministically generate entangled states with a circuit depth that is constant in the number of qubits, provided that one has access to an entangled resource state, the ability to perform mid-circuit measurements, and can rapidly transmit classical information. In this work, aided by fast classical field programmable gate array-based control hardware with a feedback latency of only 150 ns, we explore the utility of teleportation-based protocols for generating non-local, multi-partite entanglement between superconducting qubits. First, we demonstrate well-known protocols for generating Greenberger–Horne–Zeilinger states and non-local controlled-NOT gates in constant depth. Next, we utilize both protocols for implementing a quantum fan-out gate in constant depth among three non-local qubits (i.e., controlled-NOT-NOT). Finally, we demonstrate deterministic state teleportation and entanglement swapping between qubits on opposite sides of our quantum processor. Throughout this work, we find that the fidelity of our teleportation-based protocols is limited by measurement-induced dephasing on idling spectator qubits. Therefore, our work serves as a useful study of the current benefits and limitations of teleportation-based protocols on contemporary superconducting quantum processors.
The Berkeley gate is a high-performance, two-qubit entangling operation with particular potential for quantum error correction and fault-tolerant protocols. However, harnessing this potential on current noisy intermediate-scale quantum (NISQ) processors, requires efficient compilation and robust performance under realistic noise conditions. In this work, we demonstrate a hardware-efficient implementation of the Berkeley gate on a superconducting quantum processor. Using quantum process tomography (QPT), we experimentally characterize its performance and benchmark it against a noiseless quantum simulator to evaluate its practical reliability in the NISQ era. Experimental measurements confirm the gate's correct logical action, producing the target partially entangled state with a subspace confinement probability of [Formula: see text] on real quantum hardware compared to 100% in quantum simulation. Results from QPT experiments show a simulated process fidelity of [Formula: see text], while the experimental process fidelity on hardware is [Formula: see text]. The observed discrepancy is analyzed in the context of device-specific noise sources, including qubit relaxation, dephasing, and state preparation and measurement (SPAM) errors. Our work provides a concrete fidelity benchmark for the Berkeley gate on superconducting hardware and quantify the impact of realistic noise on a non-trivial two-qubit operation, supporting its use in near-term algorithmic and error-correction applications.
Teleportation of a quantum state may be used for distributing entanglement between distant qubits in quantum communication and for quantum computation. Here we demonstrate the implementation of a teleportation protocol, up to the single-shot measurement step, with superconducting qubits coupled to a microwave resonator. Using full quantum state tomography and evaluating an entanglement witness, we show that the protocol generates a genuine tripartite entangled state of all three qubits. Calculating the projection of the measured density matrix onto the basis states of two qubits allows us to reconstruct the teleported state. Repeating this procedure for a complete set of input states we find an average output state fidelity of 86%.
Abstract Quantum teleportation transfers an unknown qubit state from a sender to a receiver using a shared entangled pair and a classically conditioned correction without moving the physical carrier. On the dynamic-circuit hardware, the complete protocol (which includes mid-circuit measurement and conditional feedforward) now runs on a single circuit. We use this to benchmark three-qubit teleportation on a 156-qubit IBM Heron r2 processor (ibm_fez). A single-qubit RY(θ) input was teleported at six angles along a meridian of the Bloch sphere and reconstructed by state tomography alongside two ablation controls; one without entanglement and the other without feedforward. The full protocol returns a mean fidelity of about 0.945, nearly constant across the angles and above the 2/3 full-Bloch-sphere reference at all six sampled angles. Removing feedforward lowered the fidelity to about 0.51, close to a maximally mixed state. On the other hand, removing entanglement yields (1 + cos²θ)/2 with a mean near 0.75, transferring the population but losing the coherence. Together, these results establish that entanglement and feedforward are both necessary. The calibration-limited fidelity serves as a reference for this class of hardware. A separate run returned a Bell-state fidelity value of 0.957. A branch-resolved analysis confirmed that the four measurement branches are Pauli rotations of the target realigned by feedforward. The reported fidelity depends only on the rotation angle and the device noise.