Pith. sign in

REVIEW 4 cited by

Dimensional Jump in Quantum Error Correction

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 1412.5079 v3 pith:UFYVYQQX submitted 2014-12-16 quant-ph

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

Topological stabilizer codes with different spatial dimensions have complementary properties. Here I show that the spatial dimension can be switched using gauge fixing. Combining 2D and 3D gauge color codes in a 3D qubit lattice, fault-tolerant quantum computation can be achieved with constant time overhead on the number of logical gates, up to efficient global classical computation, using only local quantum operations. Single-shot error correction plays a crucial role.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Fast simulation of fermions with reconfigurable qubits

    quant-ph 2025-09 conditional novelty 8.0 of 10

    Fermionic permutations can be compiled into O(N log N) Clifford gates in O(log N) depth, reducing fermion-to-qubit simulation overhead from O(N) to O(log N) per layer.

  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. Efficient simulation of logical magic state preparation protocols

    quant-ph 2025-12 conditional novelty 6.0 of 10

    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.

Pith tools