REVIEW 13 cited by
Demonstration of quantum computation and error correction with a tesseract code
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
A critical milestone for quantum computers is to demonstrate fault-tolerant computation that outperforms computation on physical qubits. The tesseract subsystem color code protects four logical qubits in 16 physical qubits, to distance four. Using the tesseract code on Quantinuum's trapped-ion quantum computers, we prepare high-fidelity encoded graph states on up to 12 logical qubits, beneficially combining for the first time fault-tolerant error correction and computation. We also protect encoded states through up to five rounds of error correction. Using performant quantum software and hardware together allows moderate-depth logical quantum circuits to have an order of magnitude less error than the equivalent unencoded circuits.
Forward citations
Cited by 13 Pith papers
-
Fast-tracking and disentangling of qubit noise fluctuations using minimal-data averaging and hierarchical discrete fluctuation auto-segmentation
A new hierarchical segmentation algorithm disentangles concurrent discrete frequency fluctuations in transmons, tracking them at tens of milliseconds resolution and attributing them to charge parity switching and a ch...
-
Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates
High-rate self-dual quantum Reed–Muller codes admit ancilla-free addressable Clifford gates generated by transversal H and fold-transversal phase gates.
-
Clifford Transformations for Fermionic Quantum Systems: From Paulis to Majoranas to Fermions
Fermionic Clifford transformations are generated by half-body and pair operators with angles kπ/2, preserving many-body rank and fermionic parity.
-
Complementary 3D color codes for transversal quantum logic
Complementary tetrahedral and H-tetrahedral 3D color codes supply transversal magic and most entanglement; a pieceable round-robin CZ with 2D Steane extraction completes a universal FT gate set.
-
No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits
No stabilizer code can implement the full logical Clifford group on multiple logical qubits using transversal gates, fold-transversal gates beyond two qubits, or code automorphisms.
-
Syndrome aware mitigation of logical errors
Conditioning logical error mitigation on the measured error-correcting syndromes cuts sampling overhead exponentially and can make error correction useful above its standard pseudo-threshold.
-
Efficient and scalable inter-module switching for distributed quantum computing architectures
GMZI-based decentralized switch designs achieve any-to-any module connectivity with half the active depth and coupler count of GMZI-Spanke switches.
-
Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization
Parity-aware BPE, which prioritizes the worst-compressed language at each merge, cuts cross-lingual tokenization inequality by up to 89% at negligible global cost.
-
Automorphism gadgets in homological product codes
Permutation automorphisms of input codes induce logical operations on homological product codes, implementable by physical qubit permutations plus a subsystem circuit, with effective distance preservation when permuta...
-
Demonstration of measurement-free universal fault-tolerant quantum computation
A trapped-ion experiment realizes measurement-free fault-tolerant logical teleportation, a universal logical gate set, and a three-logical-qubit Grover search, albeit with success below the classical baseline.
-
Correcting a noisy quantum computer using a quantum computer
A variational quantum circuit, trained on syndrome data, decodes surface codes with accuracy close to minimum-weight perfect matching in classical simulation.
-
Awesome Quantum Computing Experiments: Benchmarking Experimental Progress Towards Fault-Tolerant Quantum Computation
Experimental quantum hardware metrics follow exponential trends with reported doubling or halving times of about one to six years across platforms.
-
A Framework for Quantum Advantage
A framework defining quantum advantage as verifiable plus classically superior, with a conclusion that random circuit sampling is not yet a satisfactory path.
Discussion (0). Sign in to comment.