REVIEW 1 cited by
Measurement-free, scalable and fault-tolerant universal quantum computing
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
Reliable execution of large-scale quantum algorithms requires robust underlying operations and this challenge is addressed by quantum error correction (QEC). Most modern QEC protocols rely on measurements and feed-forward operations, which are experimentally demanding, and often slow and prone to high error rates. Additionally, no single error-correcting code intrinsically supports the full set of logical operations required for universal quantum computing, resulting in an increased operational overhead. In this work, we present a complete toolbox for fault-tolerant universal quantum computing without the need for measurements during algorithm execution by combining the strategies of code switching and concatenation. To this end, we develop new fault-tolerant, measurement-free protocols to transfer encoded information between 2D and 3D color codes, which offer complementary and in combination universal sets of robust logical gates. We identify experimentally realistic regimes where these protocols surpass state-of-the-art measurement-based approaches. Moreover, we extend the scheme to higher-distance codes by concatenating the 2D color code with itself and by integrating code switching for operations that lack a natively fault-tolerant implementation. Our measurement-free approach thereby provides a practical and scalable pathway for universal quantum computing on state-of-the-art quantum processors.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.