{"record":{"author":{"account_ref":null,"orcid":null},"builds_on":[],"content_schema":"pubphys.content.topic/1","content_sha256":"c98b70e1d05c7f7b8659f622f430ee2661103e06ccbfbffbe635f2b1d6dc857d","created":"2026-10-03T07:17:52Z","files":[],"origin":{"assisted_by":[],"kind":"seed"},"parents":[],"salt":"5046e06d71b7d825dea227202b797f4c2b6a255e9545aa78f4fc58862366ede4","schema":"pubphys.record/2","site":"pubphys.com","target":null,"type":"topic"},"content":{"external_id":"qi.classical-simulability","field":"qi","n":"1","review_cite":"R. Orus, Tensor networks for complex quantum systems, Nature Reviews Physics, 2019","review_link":"https://arxiv.org/abs/1812.04011","review_verified":"true","summary":"Some quantum processes can be copied efficiently on ordinary computers, for example when entanglement stays small or noise washes out the quantum effects. The question is where exactly the line between easy and hard lies.","title":"Boundaries of classical simulability of quantum systems","topic_ref":null,"why":"This line sets where quantum computers and quantum experiments can tell us anything classical computers cannot."},"attested":{"attestation":{"batch":null,"client_id":null,"id_token_sha256":null,"kind":"platform"},"record_hash":"2c6beabcac690dc93131e1fe587b8b4a01c9e2df57eeabff1c22a4fbf820561b","schema":"pubphys.attested/1"},"envelope":{"attested_hash":"5bc0ef09be3ce9bfe8aec45b1c17d24b3c9042e3383800bd808bec1510853dd5","platform_signature":{"key_id":"c6afc19b31429869751f06879c75cd64ea92654423d15b44be775bf1310a60da","sig":"kWeSPa4O6jQPzfkb6_6WJNRBmpsXKeix_Lk7iPj0CqQcxuqfAgX3GnvvfsOARx1g_ot_QQWVteZkmcsQT9usBQ"},"schema":"pubphys.envelope/1"},"record_hash":"2c6beabcac690dc93131e1fe587b8b4a01c9e2df57eeabff1c22a4fbf820561b","leaf_index":329}