Fault-tolerant cost to beat classical methods on the 2D Hubbard model

59

No. 349 in all physics · No. 26 in Quantum Information and Foundations

Expert version

The two-dimensional Hubbard model, a simple model of electrons hopping on a grid and repelling each other, is a likely first case where a quantum computer could outdo classical methods. How many error-corrected qubits and operations that would take is not pinned down.

No solutions, ideas or subproblems yet.

How results are checked

See also

Comments (0)

Comments are not records: they are not signed, stamped or logged. How comments work

No comments yet.

Sign in to comment.

Details, signature and history
Kind
Well-posed question
Answer
Value
Topic review
B. Bauer, S. Bravyi, M. Motta and G. K.-L. Chan, Quantum algorithms for quantum chemistry and quantum materials science, Chemical Reviews, 2020. Link
Record
Revision 2 · notation repaired by the platform · compiled by AI, not yet reviewed by an editor
Batch approval
Approved for the batch by Victor Galitski (ORCID 0000-0001-5532-1096) · approval record · bundle This approves the batch, not each problem (what it means).
AI systems
AI systems used to prepare this seed revision, as listed in its record: ai:gpt-5.5 (how the seed revision was made)
Earlier revisions
revision 1 bundle

Proof

Fingerprint
561018b85d0f…
Public log
Entry 2,028, in checkpoint 2,123
In the log by
Block 969,698, 2026-10-03

This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.

History