Quantum
Teleportation of a programmable gate
Publication: quant-ph updates on arXiv.org
Author: Nada Ali, Mark Hillery
Source published: 08/10/2026, 04:00:00 UTC
Briefing created: 08/10/2026, 06:03:30 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 08/10/2026, 04:13:25 UTC.
Briefings
This article proposes a method for teleporting a programmable gate between two parties using a third party, Charlie, as a quantum memory. The protocol relies on Alice and Bob sharing a qubit with Charlie, who then performs a joint operation on the shared state and his own qubit. The outcome of this process depends on classical communication from Charlie to Alice and Bob, which allows them to apply local corrections to achieve the desired two-qubit gate. The paper explores scenarios where the gate parameter is known to Charlie beforehand versus when it is encoded in a program state sent later.
Key points
- The protocol enables teleportation of a programmable gate using Charlie as a quantum memory resource.
- The procedure requires Alice and Bob to perform local correction operations based on classical information received from Charlie.
Context and limitations
The article discusses theoretical protocols and conditions for feasibility but does not provide experimental results, specific parameter values, or a complete mathematical proof of the gate's operation.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 08/10/2026, 06:03:30 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeiawqdz5yz642liha6z4bnmqduuj7d3trcoyjktucnndkdgsm5vzlm