Pith. sign in

REVIEW 9 cited by

Quantum Teleportation is a Universal Computational Primitive

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/9908010 v1 pith:ON26BFP2 submitted 1999-08-02 quant-ph

classification quant-ph
keywords quantumgatesstatesvarietyallowsbellbitscomputational
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a method to create a variety of interesting gates by teleporting quantum bits through special entangled states. This allows, for instance, the construction of a quantum computer based on just single qubit operations, Bell measurements, and GHZ states. We also present straightforward constructions of a wide variety of fault-tolerant quantum gates.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 9 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A distillation-teleportation protocol for fault-tolerant QRAM

    quant-ph 2025-05 accept novelty 8.0 of 10

    An adaptive distillation-teleportation protocol implements a fault-tolerant QRAM query with poly(n) quantum resources and 1/poly(n) device fidelity, at the cost of an exponential classical dataset update each round.

  2. Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery

    quant-ph 2026-07 accept novelty 7.5 of 10

    Cross-code lattice surgery between surface and 3D colour codes yields certified logical GHZ and |CCZ> GME plus arbitrary logical rotations on a trapped-ion processor.

  3. Finding diagonal logical gates in CSS codes and circuits

    quant-ph 2026-07 conditional novelty 7.0 of 10

    Diagonal logical gates of a CSS code or circuit are exactly the kernel of a pullback map on phase functions, and that kernel can be computed in cubic time.

  4. Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes

    quant-ph 2025-12 conditional novelty 7.0 of 10

    Non-Abelian surface codes based on dihedral groups D_{4N} implement transversal phase gates T^{1/N} at any Clifford-hierarchy level in 2D, with a qubit-only version when 8N is a power of two.

  5. A Framework for Quantum Data Center Emulation Using Digital Quantum Computers

    quant-ph 2025-09 unverdicted novelty 7.0 of 10

    Partitioning a single quantum processor into logical QPUs with collisional-model noise emulates a quantum data center on real hardware.

  6. Magic-protected entanglement and Clifford-irreducible structure in magic state space

    quant-ph 2026-07 conditional novelty 6.0 of 10

    Quantum states are classified by how much bipartite entanglement survives optimal simplification by classically easy Clifford operations, yielding a split into weakly protected T-magic and strongly protected W-magic regimes.

  7. Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes

    quant-ph 2026-02 unverdicted novelty 6.0 of 10

    A homological framework identifies necessary and sufficient obstruction conditions for transversal logical diagonal gates in quantum CSS codes.

  8. Extremal Magic States from Symmetric Lattices

    quant-ph 2025-06 conditional novelty 6.0 of 10

    Vectors from symmetric lattices E8, BW16, and E6 map onto stabiliser and maximal-magic states, yielding explicit three-qubit and one-qutrit magic states and conjectured complete counts.

  9. Delay-Independent Stability of Nonlinear Delay Differential Equations via Isospectral Reduction

    math.DS 2025-08 unverdicted novelty 5.0 of 10

    Claims a delay-independent global exponential stability criterion for a broad class of nonlinear nonautonomous delay differential equations using isospectral reduction of an associated sequence of matrices.

Pith tools