Result card Published 2026-07-23

Coherent Three-Qubit Quantum Teleportation (Deferred Measurement) - references arXiv:2607.19770

References: Latency-Constrained Encoded Quantum Teleportation with Punctured Codes (Mahmoud Saad Abouamer, Jakob Kaltoft Sondergaard, Petar Popovski, 2026) arXiv:2607.19770

This card records a deterministic simulator run on Provenova inspired by this paper. It does not reproduce the paper's hardware results, and does not imply any endorsement by its authors.

This card demonstrates the quantum teleportation primitive - the textbook three-qubit protocol that transfers an unknown single-qubit state from a sender to a receiver using one shared entangled (Bell) pair plus, in the standard formulation, classical communication.

Because the Provenova gate set is unitary-only, we build the coherent variant via the principle of deferred measurement: the message qubit (q0) is prepared with a single Ry rotation, a Bell pair is created on (q1, q2), a Bell-basis rotation (CX then H) is applied to (q0, q1), and the usual Pauli corrections are realised as a deferred CX (from q1) and CZ (from q0) onto q2. The input amplitude on q0 is thereby mapped coherently onto the receiver qubit q2.

What the referenced paper reports: Abouamer, Sondergaard, and Popovski study encoded teleportation, in which the transmitted qubit is protected by a quantum error-correcting code and sent as a codeword. Their abstract frames reliability as a logical-error probability under latency constraints, where entanglement is accumulated over time and degrades in memory, and it examines how code length and code puncturing trade off against entanglement availability and fidelity across latency budgets, concluding that resource-aware adaptation matters for reliable quantum networking.

This Provenova card is inspired by that work only in so far as it isolates the underlying teleportation primitive. It is a deterministic simulator run on Provenova, not a reproduction of the paper's encoded-teleportation scheme, its punctured codes, its latency-reliability analysis, or any hardware result. No endorsement by the authors is implied; readers interested in the coding-theoretic and networking results should consult the linked arXiv abstract.

Provenova: recorded Provenova: reproduced Provenova: benchmarked Provenova: compliant Provenova: audit-ready
Maturity badges — Recorded → Reproduced → Benchmarked → Compliant → Audit-ready. Learn more
Backend
local_sim / aer_statevector (simulator)
Shots
4096
Hellinger fidelity
1.0
Verdict
reproducible
Provenance hash
af5824314691a8a4461c31d6f4c06c6f4141792158cfb178b2e5713ec96af507
Calibration captured : 2026-01-01T00:00:00+00:00

Verify offline — this hash is Merkle-bound to the exact calibration and hardware state. How verification works →

Result distribution
Cite this
PID : ql:card:af5824314691a8a4
Embed
Badge (Markdown)
[![Provenova: recorded](https://provenova.net/badge/coherent-three-qubit-quantum-teleportation-defer-kd2v2q6d/recorded.svg)](https://provenova.net/cards/coherent-three-qubit-quantum-teleportation-defer-kd2v2q6d)
Full card (iframe)
<iframe src="https://provenova.net/cards/coherent-three-qubit-quantum-teleportation-defer-kd2v2q6d/embed.html" width="400" height="420" style="border:0;overflow:hidden" loading="lazy" title="Coherent Three-Qubit Quantum Teleportation (Deferred Measurement) - references arXiv:2607.19770 — Provenova"></iframe>
Provenova

The vendor-neutral system of record for quantum — every run bound to the exact calibration that produced it, reproducible and offline-verifiable.