REVIEW 3 cited by
Demonstrating dynamic surface codes
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
A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome checks, permitting correction of logical information. Recently, the development of time-dynamic approaches to error correction has uncovered new codes and new code implementations. In this work, we experimentally demonstrate three time-dynamic implementations of the surface code, each offering a unique solution to hardware design challenges and introducing flexibility in surface code realization. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Finally, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead. We measure the error suppression factor when scaling from distance-3 to distance-5 codes of $\Lambda_{35,\text{hex}} = 2.15(2)$, $\Lambda_{35,\text{walk}} = 1.69(6)$, and $\Lambda_{35,\text{iSWAP}} = 1.56(2)$, achieving state-of-the-art error suppression for each. With detailed error budgeting, we explore their performance trade-offs and implications for hardware design. This work demonstrates that dynamic circuit approaches satisfy the demands for fault-tolerance and opens new alternative avenues for scalable hardware design.
Forward citations
Cited by 3 Pith papers
-
Theory and Architecture of Syndrome-Resolved Logical Gates
A new theorem gives weak (probabilistic) transversal implementations of arbitrary multi-qubit Pauli rotations for CSS codes, enabling an in-place rotation architecture with large projected resource savings.
-
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.
-
Realization of a Quantum Error Detection Code with a Dynamically Reassigned Ancillary Qubit
A three-transmon experiment shows that an error-detection circuit where the ancilla qubit is swapped along the chain works as well as the standard fixed-ancilla version.
Discussion (0). Continue with ORCID to comment.