{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5H3GCSKWUD43KBEMF7AE2OC2EY","short_pith_number":"pith:5H3GCSKW","schema_version":"1.0","canonical_sha256":"e9f6614956a0f9b5048c2fc04d385a261b3fb544484f1e48e9b113e58f48655a","source":{"kind":"arxiv","id":"2402.07975","version":2},"attestation_state":"computed","paper":{"title":"Computational complexity of isometric tensor network states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daniel Malz, Rahul Trivedi","submitted_at":"2024-02-12T19:00:00Z","abstract_excerpt":"We determine the computational power of isometric tensor network states (isoTNS), a variational ansatz originally developed to numerically find and compute properties of gapped ground states and topological states in two dimensions. By mapping 2D isoTNS to 1+1D unitary quantum circuits, we find that computing local expectation values in isoTNS is $\\textsf{BQP}$-complete. We then introduce injective isoTNS, which are those isoTNS that are the unique ground states of frustration-free Hamiltonians, and which are characterized by an injectivity parameter $\\delta\\in(0,1/D]$, where $D$ is the bond d"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2402.07975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-02-12T19:00:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ba432ea8bf8cfbc8dd45152a694f2a7a332b9a15cb2715074783ac484443ab1c","abstract_canon_sha256":"881fcc04fd77b04ed72a9235e0d468960838739876fc2e031ad6902b836a22a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:25:04.778481Z","signature_b64":"Gl4jAlDEwojrS+sEnWS+N6av2Q2622E2YM8K7gNYBSEaBsYJB3FU7njL5bnANagZmJVXhdWTr2ye/Z8X7WfBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9f6614956a0f9b5048c2fc04d385a261b3fb544484f1e48e9b113e58f48655a","last_reissued_at":"2026-07-05T10:25:04.777971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:25:04.777971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational complexity of isometric tensor network states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daniel Malz, Rahul Trivedi","submitted_at":"2024-02-12T19:00:00Z","abstract_excerpt":"We determine the computational power of isometric tensor network states (isoTNS), a variational ansatz originally developed to numerically find and compute properties of gapped ground states and topological states in two dimensions. By mapping 2D isoTNS to 1+1D unitary quantum circuits, we find that computing local expectation values in isoTNS is $\\textsf{BQP}$-complete. We then introduce injective isoTNS, which are those isoTNS that are the unique ground states of frustration-free Hamiltonians, and which are characterized by an injectivity parameter $\\delta\\in(0,1/D]$, where $D$ is the bond d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07975","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.07975/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.07975","created_at":"2026-07-05T10:25:04.778030+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.07975v2","created_at":"2026-07-05T10:25:04.778030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07975","created_at":"2026-07-05T10:25:04.778030+00:00"},{"alias_kind":"pith_short_12","alias_value":"5H3GCSKWUD43","created_at":"2026-07-05T10:25:04.778030+00:00"},{"alias_kind":"pith_short_16","alias_value":"5H3GCSKWUD43KBEM","created_at":"2026-07-05T10:25:04.778030+00:00"},{"alias_kind":"pith_short_8","alias_value":"5H3GCSKW","created_at":"2026-07-05T10:25:04.778030+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23670","citing_title":"Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23670","citing_title":"Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2507.08080","citing_title":"Diagonal Isometric Form for Tensor Network States in Two Dimensions","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5H3GCSKWUD43KBEMF7AE2OC2EY","json":"https://pith.science/pith/5H3GCSKWUD43KBEMF7AE2OC2EY.json","graph_json":"https://pith.science/api/pith-number/5H3GCSKWUD43KBEMF7AE2OC2EY/graph.json","events_json":"https://pith.science/api/pith-number/5H3GCSKWUD43KBEMF7AE2OC2EY/events.json","paper":"https://pith.science/paper/5H3GCSKW"},"agent_actions":{"view_html":"https://pith.science/pith/5H3GCSKWUD43KBEMF7AE2OC2EY","download_json":"https://pith.science/pith/5H3GCSKWUD43KBEMF7AE2OC2EY.json","view_paper":"https://pith.science/paper/5H3GCSKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.07975&json=true","fetch_graph":"https://pith.science/api/pith-number/5H3GCSKWUD43KBEMF7AE2OC2EY/graph.json","fetch_events":"https://pith.science/api/pith-number/5H3GCSKWUD43KBEMF7AE2OC2EY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5H3GCSKWUD43KBEMF7AE2OC2EY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5H3GCSKWUD43KBEMF7AE2OC2EY/action/storage_attestation","attest_author":"https://pith.science/pith/5H3GCSKWUD43KBEMF7AE2OC2EY/action/author_attestation","sign_citation":"https://pith.science/pith/5H3GCSKWUD43KBEMF7AE2OC2EY/action/citation_signature","submit_replication":"https://pith.science/pith/5H3GCSKWUD43KBEMF7AE2OC2EY/action/replication_record"}},"created_at":"2026-07-05T10:25:04.778030+00:00","updated_at":"2026-07-05T10:25:04.778030+00:00"}