A card from a free library — ask anything, no account, works offline. Every card carries its source.
The lattice sign problem is NP-hard
joint
Troyer and Wiese (2005): the fermion sign problem of quantum Monte Carlo - the obstacle to simulating lattice gauge theory at finite density - is NP-hard. A proof that P = NP would remove it; its hardness is a statement about computation sitting inside a statement about gauge fields.
source
Narrow Highway - the Millennium floor, a joint found in the literature (operator seed)
card id
card_joint_sign_problem
address
WIT.codex.EXP/the-lattice-sign-problem-is-np-hard/REF.WITNESSED@narrow-highway-the-mille
adjoining cards
- part of → The Millennium floor - seven open questions, and where they connect — a joint that is proven or observed - a part of the floor
- connects at → Yang-Mills existence and the mass gap — The lattice sign problem is NP-hard. troyer wiese 2005. Cited, not sealed: no arithmetic t
- connects at → P versus NP — The lattice sign problem is NP-hard. troyer wiese 2005. Cited, not sealed: no arithmetic t
- cites → M. Troyer 2005 — Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations — the record the joint stands on
Is this card incomplete? Tell the library — it will call out for more ↗