Alice & Bob Proposes Five-Criteria Framework to Benchmark Logical Qubit Claims
Key Takeaways
Industry Framework: Alice & Bob introduces a modality-agnostic set of five criteria to objectively evaluate and compare logical qubit demonstrations toward fault-tolerant quantum computing.
Beyond-Breakeven Demonstration: Google Quantum AI’s surface code implementation is cited as achieving beyond-breakeven logical qubit lifetimes, satisfying the first criterion through direct experimental comparison with physical qubits.
Utility-Focused Evaluation: The criteria stress scalable error suppression, sufficient experimental duration to capture realistic error dynamics, and performance without post-selection to align claims with practical FTQC requirements.
Alice & Bob has published the whitepaper “Defining the Logical Qubit: Five Criteria to Benchmark Logical Qubit Claims.” The document supplies investors, analysts, enterprise decision-makers, and researchers with a structured, modality-agnostic framework for assessing logical qubit demonstrations. By concentrating on the properties required to serve as reliable building blocks for fault-tolerant quantum computing (FTQC), the criteria address inconsistent usage of the term “logical qubit” across hardware platforms and provide a practical basis for evaluating genuine progress toward utility-scale systems.
Technical Framework & Deployment Implementation
Logical qubits arise from quantum error correction (QEC) protocols that encode information across multiple physical qubits, detect errors via syndrome measurements, and apply corrections through decoding while preserving the encoded quantum state. The whitepaper defines a useful logical qubit as one that meets five interlocking requirements to function as a scalable component of FTQC rather than an isolated laboratory demonstration.
The five criteria are:
- Breakeven: The logical qubit lifetime must exceed that of the best physical qubit from which it is constructed. Both logical and physical error rates must be measured experimentally under comparable conditions; demonstrations that remain below breakeven indicate that error-correction overhead outweighs protection.
- Scalable Parameters: The error-correcting code must belong to a parametrized family (commonly characterized by code distance d) in which increasing the parameter systematically lowers the logical error rate. For distance-d codes, up to (d-1)/2 errors can be corrected, providing a tunable pathway to arbitrarily low logical error rates given sufficient physical resources.
- Sufficient QEC Cycles: The number of quantum error correction cycles executed during characterization must exceed the code distance. Shorter experiments risk under-sampling temporally correlated error patterns, producing optimistic extrapolations that do not reflect steady-state logical error rates.
- Performance Across All Runs: Logical error rates must be extracted from the complete dataset without heavy reliance on post-selection or discarding of runs in which errors are detected. Real FTQC computations cannot selectively ignore failing segments; syndrome extraction, decoding, and correction occur continuously on all data.
- Utility Timescales: Experiments must operate over durations comparable to target algorithms—hours to days for applications such as Shor’s algorithm for RSA-2048 factoring or molecular simulations (FeMoco, Hubbard model)—to ensure that low-frequency, potentially non-local errors are observed and mitigated rather than merely inferred from short benchmarking runs. Notably, Google Quantum AI demonstrated beyond-breakeven logical lifetimes using a surface code, satisfying this and the breakeven criterion.
These requirements collectively enforce that claimed logical qubits exhibit measurable improvement over physical hardware, tunable suppression of errors, statistically robust characterization, and resilience under conditions representative of sustained computation.
Market Positioning & Commercial Impact
The framework supplies a common reference that enables direct, apples-to-apples comparisons among superconducting, neutral-atom, spin, photonic, and bosonic-cat approaches without favoring any single hardware modality. By translating abstract QEC concepts into concrete, testable checkpoints, it reduces ambiguity for non-specialist stakeholders evaluating technology roadmaps and capital allocation.
Emphasis on utility-relevant timescales and rejection of post-selection aligns experimental claims more closely with the operational constraints of long-running fault-tolerant algorithms. This alignment supports more accurate forecasting of hardware overhead, error-correction resource budgets, and time-to-utility, thereby strengthening the commercial case for continued investment in FTQC development across the broader quantum ecosystem.
Find out more here.
Further articles, reports, and the latest quantum computing news may be found at The Qubit Report.
- Alice & Bob, Fault-Tolerant Quantum Computing (FTQC), Five-Criteria Framework, Google Quantum AI, Logical Qubit, Modality-Agnostic Evaluation, Performance Without Post-Selection, Quantum Error Correction (QEC), Qubit, Scalable Qubits, Sufficient Quantum Error Correction Cycles, Surface Code, Utility Timescales
Related Articles
Quantum Computing Weekly Round-Up: Week Ending June 6, 2026
This Quantum Computing Weekly Round-Up captures a week where capital kept flowing, hardware roadmaps gained concrete targets, and security moved from theory to deployed roots
Zhejiang University Achieves Breakthrough with World’s First Superconducting QRAM Prototype
Researchers at Zhejiang University have demonstrated the world’s first prototype of a quantum random access memory (QRAM) on a superconducting quantum chip. The system successfully
Classiq and Pontificia Universidad Católica de Chile Launch Latin America’s First Quantum Machine Learning Consortium for Computational Pathology
Classiq and Pontificia Universidad Católica de Chile have launched Latin America’s first Quantum Machine Learning Consortium for computational pathology. The 12-month project focuses on renal