research
A Minecraft Seed Puts Grover's Oracle on a Hardware Budget
Specializing constant arithmetic cut a representative oracle from 467 to 275 qubits and from about 2.04 million to 48,896 CX gates.
Summary
Specializing constant arithmetic cut a representative oracle from 467 to 275 qubits and from about 2.04 million to 48,896 CX gates.
A quantum search advantage depends on the cost of the oracle, not only Grover's square-root query count. For Minecraft 1.13.1 seed recovery, researchers built a reversible oracle combining structure placement with an inverse 32-bit linear-congruential transform. Constant-specific Fourier arithmetic reduced the placement predicate's width and changed the stated two-qubit-gate scaling from cubic to quadratic. Under a common-basis Qiskit accounting, one folded residual-search construction used 275 circuit qubits, 48,896 CX gates and depth 4,482, versus 467 qubits, 2,038,804 CX gates and depth 186,328 for the register-to-register baseline. Reduced circuits were also run inside complete Grover loops on IBM and Quantinuum hardware; routing remained a major determinant of behavior.
Why it matters
Specializing constant arithmetic cut a representative oracle from 467 to 275 qubits and from about 2.04 million to 48,896 CX gates.
Limits and context
- A quantum search advantage depends on the cost of the oracle, not only Grover's square-root query count.
Key claims
Specializing constant arithmetic cut a representative oracle from 467 to 275 qubits and from about 2.04 million to 48,896 CX gates.
Qualification: A quantum search advantage depends on the cost of the oracle, not only Grover's square-root query count.
Evidence: source-2026-10-27-007
Sources
- arXiv preprint 2610.33139, original v1arXiv · primary research
Corrections
No corrections have been recorded for this story.