{"query": "M. Troyer 2005 — Computational complexity and fundamental li", "count": 3, "results": [{"id": "card_src_mill_troyer_wiese_2005", "title": "M. Troyer 2005 — Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations", "shelf": "millennium", "surface": "secular", "snippet": "M. Troyer, U.-J. Wiese (2005). Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations. Phys. Rev. Lett. 94 (2005) 170201. DOI 10.1103/PhysRevLett.94.170201. ", "authority_tier": "reference", "source": "M. Troyer, U.-J. Wiese (2005), Phys. Rev. Lett. 94 (2005) 170201", "readable": false, "generated": false}, {"id": "card_src_pron_troyer", "title": "troyer", "shelf": "pronunciation", "surface": "secular", "snippet": "troyer: pronounced (ARPABET) T R OY1 ER0. From the CMU Pronouncing Dictionary — the standard machine-readable pronunciations of North American English.", "authority_tier": "reference", "source": "CMU Pronouncing Dictionary (cmudict) — BSD-2-Clause, Carnegie Mellon", "readable": false, "generated": false}, {"id": "card_joint_sign_problem", "title": "The lattice sign problem is NP-hard", "shelf": "codex", "surface": "secular", "snippet": "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 hard", "authority_tier": "engine_derived", "source": "Narrow Highway - the Millennium floor, a joint found in the literature (operator seed)", "readable": false, "generated": false}], "house": {"door": "FIND", "kind": "cards", "trail": "results", "seal": null, "next_step": {"do": "open the top card", "door": "FIND", "tool": "card_get", "params": {"id": "card_src_mill_troyer_wiese_2005"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}