Each problem states how progress is verified and what counts as a contribution. Besides the problems curated here, the catalogue includes open conjectures from Formal Conjectures (with Lean statements), optimization constants and the AlphaEvolve problems. Know one that belongs here? Propose a problem.
2 shown
Map the boundary of classical simulability for quantum-advantage random circuit sampling experiments by improving tensor-network and other classical algorithms, with reproducible cost estimates and fidelity benchmarks.
Improve reproducible, circuit-level-noise thresholds and logical error rates for surface codes and quantum LDPC codes through better codes, syndrome circuits and decoders, benchmarked with open simulators such as Stim.
