TITLE:
Diffusion-Operator Qubit Bounds and an Error-Burst Qubit Ceiling for Oracle-Based Quantum Search: A Conditional Resource Estimate
AUTHORS:
Ying Liu
KEYWORDS:
Quantum Computing, Grover’s Algorithm, Oracle, Surface Code, Quantum Error Correction, Error Bursts, Spacetime Volume, Resource Estimation, Fault-Tolerant Quantum Computing
JOURNAL NAME:
Journal of Quantum Information Science,
Vol.16 No.4,
October
23,
2026
ABSTRACT: Grover’s algorithm searches an unstructured database of N = 2n items in O(
N
) sequential oracle-and-diffusion rounds, a bound already proven optimal. This paper asks a different question: given realistic fault-tolerant hardware constraints, how large an unstructured search can actually be carried to completion? Using a spacetime-volume resource model—accounting for circuit depth, active and idle qubit exposure, and surface-code error suppression—we first derive an oracle-independent upper bound: the diffusion operator alone, together with the round count fixed by the
N
lower bound, bounds the number of index qubits that a completed search can use to roughly 22 to 53, depending on code distance, a bound that no oracle implementation can loosen, only tighten. We then identify a second, distinct constraint: error bursts, rare correlated fault events with a specific physical origin in cosmic-ray and ambient-radiation exposure, measured directly on current superconducting hardware, are not suppressed by increasing code distance the way ordinary logical error is. This produces an asymptotic ceiling of approximately 50 index qubits that persists regardless of code distance, since the limiting factor becomes a fault mechanism that ordinary error correction does not address. This finding is scoped deliberately: it is a conditional resource estimate tied to one class of hardware’s currently measured, largely unmitigated behavior, not a fundamental limit on quantum computing or a demonstration that this failure mode is physically irreducible—active mitigation research and recent theoretical work indicate the ceiling may relax as hardware and decoding strategies mature. Finally, we show the oracle-independent bound degrades gracefully rather than catastrophically as realistic oracle cost is introduced, via a single-parameter sensitivity analysis.