A 121 qubit quantum processor just proved a 1978 Olympiad geometry problem, though not because it is faster

[Scholes]

Researchers from Zhejiang University and Tsinghua University in China have used a 121 qubit superconducting quantum processor to work through a geometry problem that originally appeared in the 1978 International Mathematical Olympiad, involving intersecting triangles and circles. The result is not being framed as a speed record, because classical computers still solve problems like this considerably faster than the quantum system managed, and the actual significance sits somewhere else entirely.

The team applied two distinct approaches to different parts of the challenge. For proving the perpendicularity of a square's diagonals, they implemented what is known as Wu's method through quantum algebra, translating a classical algebraic geometry proof technique into a form that could actually run on quantum hardware. For the harder 1978 Olympiad problem itself, they turned to symbolic proof search instead, using quantum circuits to propose candidate logical reasoning steps, apply them, and then evaluate whether the resulting chain of reasoning actually holds up, essentially automating a piece of mathematical proof construction on quantum hardware rather than classical silicon.

What makes this worth paying attention to is not that a quantum computer solved a decades old maths competition problem, since a talented human mathematician or a classical computer algebra system could handle it without much difficulty. The real point the researchers are making is that automated theorem proving involving abstract concepts and extended logical chains can actually execute successfully on quantum hardware at all, despite the persistent noise and instability that continues to plague current generation qubits and limits how long a coherent computation can run before errors start accumulating.

The researchers frame their own contribution specifically around opening up a new category of task for near term quantum processors, describing their work as establishing automated logical reasoning as a viable task for near term quantum processors and providing a concrete pathway toward quantum enhanced symbolic intelligence. That framing positions this less as a demonstration of quantum computing solving a practical problem today and more as evidence that an entirely new application category, symbolic and logical reasoning rather than pure numerical calculation, might eventually become a genuine use case for quantum hardware as it matures.

The usual caveats that apply to fresh quantum computing research apply here too. The work remains available only as a preprint on arXiv and has not yet gone through peer review, so the claims about noise robustness and the broader implications for symbolic reasoning on quantum hardware should be treated as an interesting early result rather than a settled scientific conclusion just yet.

A Quantum Computer Just Confirmed A 48 Year Old Math Problemwww.sciencealert.com