REVIEW 4 cited by
Universal transversal gates with color codes - a simplified approach
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
abstract
We provide a simplified, yet rigorous presentation of the ideas from Bomb\'{i}n's paper "Gauge Color Codes" [arXiv:1311.0879v3]. Our presentation is self-contained, and assumes only basic concepts from quantum error correction. We provide an explicit construction of a family of color codes in arbitrary dimensions and describe some of their crucial properties. Within this framework, we explicitly show how to transversally implement the generalized phase gate $R_n=\text{diag}(1,e^{2\pi i/2^n})$, which deviates from the method in "Gauge Color Codes", allowing an arguably simpler proof. We describe how to implement the Hadamard gate $H$ fault-tolerantly using code switching. In three dimensions, this yields, together with the transversal $CNOT$, a fault-tolerant universal gate set $\{H,CNOT,R_3\}$ without state-distillation.
Forward citations
Cited by 4 Pith papers
-
A distillation-teleportation protocol for fault-tolerant QRAM
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.
-
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.
-
Efficient simulation of logical magic state preparation protocols
A classical simulation method that propagates circuit-level Pauli noise to a Clifford error makes logical magic-state preparation protocols simulable in time polynomial in qubits and the target state's stabilizer rank.
-
Native Non-Clifford Gates in Quantum LDPC Codes: Conditions, Synthesis, and Scaling Limits
The main theorem claiming constant-depth logical CCZ gates exist from many 'magic-friendly triples' has mutually inconsistent hypotheses, and its key local-implementation step is unproved.
Discussion (0). Sign in to comment.