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:2610.09022

Teleportation of a programmable gate

Nada Ali, Mark Hillery

quant-phSubmitted Oct 6, 2026• Announced Oct 8, 2026• 0 citations
arXivHTMLPDF

Abstract

Alice and Bob each have a qubit, and they would like to perform a two-qubit gate on them with the assistance of Charlie. The action of this gate depends on a parameter, which either Charlie knows, will receive later as classical information, or is encoded in a program state. We discuss both the case in which Alice and Bob send Charlie their qubits, which he entangles with his state, and the case where Alice and Bob use teleportation to entangle their states with Charlie's state. All of these procedures depend on the ability of Alice and Bob to apply local correction operations that depend on the results of measurements that Charlie makes, and we discuss under what conditions such operations are possible.

AI Summary

The paper asks how spatially separated qubits can undergo a parameter-dependent entangling gate when a controller chooses the parameter later or receives it encoded in a quantum program. It develops protocols for $\mathrm{CPHASE}(\theta)$ and related diagonal gates, first with the input qubits physically visiting the controller and then using shared entanglement, Bell measurements, and LOCC. For the physical-transfer construction, a controller qutrit records the two inputs’ Hamming weight. Applying a phase to its $|2\rangle$ component, measuring in a Fourier basis, and broadcasting the outcome implements $\mathrm{CPHASE}(\theta)$ after local phase corrections. An $N$-dimensional program $N^{-1/2}\sum_{j=0}^{N-1}e^{-ij\theta}|j\rangle$ supplies the unknown phase through a controlled cyclic shift, with heralded success probability $(N-1)/N$. A parity-phase variant needs only a controller qubit. Modular Hamming-weight encodings and product-group Fourier measurements provide sufficient constructions for multiqubit diagonal gates with local corrections. The teleportation-based two-input protocol uses a four-dimensional controller system. A superconducting-device test implements only the simplified, classically parameterized parity-phase protocol, equivalent to $R_{ZZ}(\theta)$ up to global phase—not the quantum-program or full teleportation versions. Corrections are applied in post-processing. With 8,000 shots per point, fitted single-qubit fringe visibilities are $0.796\pm0.004$ remotely and $0.961\pm0.003$ directly; reported state fidelities at $\theta=\pi/2$ are $0.858\pm0.008$ and $0.971\pm0.005$, respectively. The stated experimental purpose is verification rather than outperforming direct implementation; finite-dimensional quantum programming remains probabilistic.

Some signs of AI-generated textIncrementalUnclear noveltyOverclaimsPossible error

Error found: The teleportation protocol interchanges Alice’s and Bob’s corrections for Charlie’s outcomes v3 and v4, leaving an unwanted Z_A Z_B in half the runs unless those instructions are swapped. The hardware experiment implements diag(1,e^{i theta},e^{i theta},1), equivalent up to global phase to R_ZZ(theta), rather than the paper’s defined CPHASE(theta), so it does not directly verify that gate.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Teleportation of an Arbitrary Two-qubit State

Feng Xun-Li, Zhongyang Wang, Xu Zhi-Zhan

A scheme to teleport an unknown two qubit state from Alice (the sender) to Bob (the receiver) using two Einstein Podolsky Rosen (EPR) pairs is presented, each EPR pair being shared by both Alice and Bob. Firstly, Alice combines each of the two particles in the teleported state with an EPR particle and makes Bell state measurement on each combination. Then she transmits the outcomes of her measurements to Bob classically. According to Alice′s measurement results, Bob can perform appropriate unitary operations on his two EPR particles to retrieve the initial state.

Chinese Journal of Lasers•Jan 1, 2001•0 citations

Conditioning two-party quantum teleportation within a three-party quantum channel

Stefano Pirandola, Stefano Mancini, David Vitali

We consider an arbitrary continuous-variable three-party Gaussian quantum state which is used to perform quantum teleportation of a pure Gaussian state between two of the parties (Alice and Bob). In turn, the third party (Charlie) can condition the process by means of local operations and classical communication. We find the best measurement that Charlie can implement on his own mode that preserves the Gaussian character of the three-mode state and optimizes the teleportation fidelity between Alice and Bob.

arXiv:quant-ph/0410213•Physical Review A•Apr 18, 2005•21 citations

Teleporting a qubit a la Everett

George Svetlichny

If both Alice and Bob have access to a two-qubit "background state" then, by simulating Everett's many worlds interpretation of measurement, Alice can teleport a qubit to Bob, each using fixed unitaries. The Everett picture unifies unitaries, measurements, and classical communication into just unitaries, provided there are background states shared by all parties. We review some of the literature on this theme and point out an additional fact: If Bob has access to only one of the background qubits, teleportation is still possible by Alice sending Bob one classical bit of information gained from a measurement of the other qubit.

arXiv:quant-ph/0610081•Oct 10, 2006•1 citation

Optimal Strategies for Winning Certain Coset-Guessing Quantum Games

Michael Schleppy, Emina Soljanin, Nicolas Swanson

In a recently introduced coset guessing game, Alice plays against Bob and Charlie, aiming to meet a joint winning condition. Bob and Charlie can only communicate before the game starts to devise a joint strategy. The game we consider begins with Alice preparing a 2m-qubit quantum state based on a random selection of three parameters. She sends the first m qubits to Bob and the rest to Charlie, and then reveals to them her choice for one of the parameters. Bob is supposed to guess one of the hidden parameters, Charlie the other, and they win if both guesses are correct. From previous work, we know that the probability of Bob’s and Charlie’s guesses being simultaneously correct goes to zero exponentially as m increases. We derive a tight upper bound on this probability and show how Bob and Charlie can achieve it. While developing an optimal strategy, we devised an encoding circuit using only and Hadamard gates, which builds CSS codes from EPR pairs using only local operations. We found that the role of quantum information that Alice communicates to Bob and Charlie is to make their responses correlated rather than improve their individual (marginal) correct guessing rates.

arXiv:2410.08160•IEEE Journal on Selected Areas in Information Theory•Jan 1, 2025•1 citation

Qubit assisted Conclusive Teleportation

Somshubhro Bandyopadhyay

We present an optimal method for teleporting an unknown qubit using any pure entangled state.

arXiv:quant-ph/9907010•Jul 4, 1999•1 citation

Teleportation of Entanglement for Continuous Variables

A. I. Zhiliba, В. Н. Горбачев, Andrew I. Trubilko

Teleportation of an unknown two particle pure entangled state usingthe threeparticle quantum channel is considered. Two receivers Bob and Claire can recover the unknown state sent by Alice. But they cannot recover it separately.

Kluwer Academic Publishers eBooks•Feb 24, 2006•3 citations
Alice and Bob each have a qubit, and they would like to perform a two-qubit gate on them with the assistance of Charlie. The action of this gate depends on a parameter, which either Charlie knows, will receive later as classical information, or is encoded in a program state. We discuss both the case in which Alice and Bob send Charlie their qubits, which he entangles with his state, and the case where Alice and Bob use teleportation to entangle their states with Charlie's state. All of these procedures depend on the ability of Alice and Bob to apply local correction operations that depend on the results of measurements that Charlie makes, and we discuss under what conditions such operations are possible.
The paper asks how spatially separated qubits can undergo a parameter-dependent entangling gate when a controller chooses the parameter later or receives it encoded in a quantum program. It develops protocols for CPHASE(θ)\mathrm{CPHASE}(\theta)CPHASE(θ) and related diagonal gates, first with the input qubits physically visiting the controller and then using shared entanglement, Bell measurements, and LOCC.
For the physical-transfer construction, a controller qutrit records the two inputs’ Hamming weight. Applying a phase to its ∣2⟩|2\rangle∣2⟩ component, measuring in a Fourier basis, and broadcasting the outcome implements CPHASE(θ)\mathrm{CPHASE}(\theta)CPHASE(θ) after local phase corrections. An NNN-dimensional program N−1/2∑j=0N−1e−ijθ∣j⟩N^{-1/2}\sum_{j=0}^{N-1}e^{-ij\theta}|j\rangleN−1/2∑j=0N−1​e−ijθ∣j⟩ supplies the unknown phase through a controlled cyclic shift, with heralded success probability (N−1)/N(N-1)/N(N−1)/N. A parity-phase variant needs only a controller qubit. Modular Hamming-weight encodings and product-group Fourier measurements provide sufficient constructions for multiqubit diagonal gates with local corrections. The teleportation-based two-input protocol uses a four-dimensional controller system.
A superconducting-device test implements only the simplified, classically parameterized parity-phase protocol, equivalent to RZZ(θ)R_{ZZ}(\theta)RZZ​(θ) up to global phase—not the quantum-program or full teleportation versions. Corrections are applied in post-processing. With 8,000 shots per point, fitted single-qubit fringe visibilities are 0.796±0.0040.796\pm0.0040.796±0.004 remotely and 0.961±0.0030.961\pm0.0030.961±0.003 directly; reported state fidelities at θ=π/2\theta=\pi/2θ=π/2 are 0.858±0.0080.858\pm0.0080.858±0.008 and 0.971±0.0050.971\pm0.0050.971±0.005, respectively. The stated experimental purpose is verification rather than outperforming direct implementation; finite-dimensional quantum programming remains probabilistic.
A scheme to teleport an unknown two qubit state from Alice (the sender) to Bob (the receiver) using two Einstein Podolsky Rosen (EPR) pairs is presented, each EPR pair being shared by both Alice and Bob. Firstly, Alice combines each of the two particles in the teleported state with an EPR particle and makes Bell state measurement on each combination. Then she transmits the outcomes of her measurements to Bob classically. According to Alice′s measurement results, Bob can perform appropriate unitary operations on his two EPR particles to retrieve the initial state.
We consider an arbitrary continuous-variable three-party Gaussian quantum state which is used to perform quantum teleportation of a pure Gaussian state between two of the parties (Alice and Bob). In turn, the third party (Charlie) can condition the process by means of local operations and classical communication. We find the best measurement that Charlie can implement on his own mode that preserves the Gaussian character of the three-mode state and optimizes the teleportation fidelity between Alice and Bob.
If both Alice and Bob have access to a two-qubit "background state" then, by simulating Everett's many worlds interpretation of measurement, Alice can teleport a qubit to Bob, each using fixed unitaries. The Everett picture unifies unitaries, measurements, and classical communication into just unitaries, provided there are background states shared by all parties. We review some of the literature on this theme and point out an additional fact: If Bob has access to only one of the background qubits, teleportation is still possible by Alice sending Bob one classical bit of information gained from a measurement of the other qubit.
In a recently introduced coset guessing game, Alice plays against Bob and Charlie, aiming to meet a joint winning condition. Bob and Charlie can only communicate before the game starts to devise a joint strategy. The game we consider begins with Alice preparing a 2m-qubit quantum state based on a random selection of three parameters. She sends the first m qubits to Bob and the rest to Charlie, and then reveals to them her choice for one of the parameters. Bob is supposed to guess one of the hidden parameters, Charlie the other, and they win if both guesses are correct. From previous work, we know that the probability of Bob’s and Charlie’s guesses being simultaneously correct goes to zero exponentially as m increases. We derive a tight upper bound on this probability and show how Bob and Charlie can achieve it. While developing an optimal strategy, we devised an encoding circuit using only and Hadamard gates, which builds CSS codes from EPR pairs using only local operations. We found that the role of quantum information that Alice communicates to Bob and Charlie is to make their responses correlated rather than improve their individual (marginal) correct guessing rates.