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
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.
Forward citations
Cited by 9 Pith papers
-
Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery
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.
-
Finding diagonal logical gates in CSS codes and circuits
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.
-
Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes
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.
-
A Framework for Quantum Data Center Emulation Using Digital Quantum Computers
A hardware-based emulation framework for quantum data centers is developed by splitting qubit coupling maps on one processor and using ancilla qubits to simulate transduction and fiber noise, with demonstrations on IB...
-
Magic-protected entanglement and Clifford-irreducible structure in magic state space
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.
-
Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 site...
-
Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes
A homological framework identifies necessary and sufficient obstruction conditions for transversal logical diagonal gates in quantum CSS codes.
-
Delay-Independent Stability of Nonlinear Delay Differential Equations via Isospectral Reduction
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.
-
A Framework for Quantum Data Center Emulation Using Digital Quantum Computers
Partitioning a single quantum processor into logical QPUs with collisional-model noise emulates a quantum data center on real hardware.
Discussion (0). Sign in to comment.