{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ET2XMMCFOEHFYP3USJSOMHU27T","short_pith_number":"pith:ET2XMMCF","schema_version":"1.0","canonical_sha256":"24f5763045710e5c3f749264e61e9afcef5c55167701773c132e83df877754e9","source":{"kind":"arxiv","id":"1902.05100","version":2},"attestation_state":"computed","paper":{"title":"Isometric Tensor Network States in Two Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.str-el","authors_text":"Frank Pollmann, Michael P. Zaletel","submitted_at":"2019-02-13T19:59:24Z","abstract_excerpt":"Tensor network states (TNS) are a promising but numerically challenging tool for simulating two-dimensional (2D) quantum many-body problems. We introduce an isometric restriction of the TNS ansatz that allows for highly efficient contraction of the network. We consider two concrete applications using this ansatz. First, we show that a matrix-product state representation of a 2D quantum state can be iteratively transformed into an isometric 2D TNS. Second, we introduce a 2D version of the time-evolving block decimation algorithm (TEBD$^2$) for approximating the ground state of a Hamiltonian as "},"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":"1902.05100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2019-02-13T19:59:24Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"a5836bface2d898a892c88e15dd02a266b00ee32694beadb5f019f5fef7d9acb","abstract_canon_sha256":"a473275eb8368fe2daad1d871d466d39869380e4f2732acfd82c399e741bd543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:38:53.619934Z","signature_b64":"Uy1KLzhbRivRSsohuKK4HOqqceyUGWRYJuHM+DUNb2EbKeXqP7i3PFHnglwK/vZ1BFX1uYTNCyfuNR+wAO41Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24f5763045710e5c3f749264e61e9afcef5c55167701773c132e83df877754e9","last_reissued_at":"2026-07-05T00:38:53.619471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:38:53.619471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Isometric Tensor Network States in Two Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.str-el","authors_text":"Frank Pollmann, Michael P. Zaletel","submitted_at":"2019-02-13T19:59:24Z","abstract_excerpt":"Tensor network states (TNS) are a promising but numerically challenging tool for simulating two-dimensional (2D) quantum many-body problems. We introduce an isometric restriction of the TNS ansatz that allows for highly efficient contraction of the network. We consider two concrete applications using this ansatz. First, we show that a matrix-product state representation of a 2D quantum state can be iteratively transformed into an isometric 2D TNS. Second, we introduce a 2D version of the time-evolving block decimation algorithm (TEBD$^2$) for approximating the ground state of a Hamiltonian as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05100","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/1902.05100/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":"1902.05100","created_at":"2026-07-05T00:38:53.619534+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05100v2","created_at":"2026-07-05T00:38:53.619534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05100","created_at":"2026-07-05T00:38:53.619534+00:00"},{"alias_kind":"pith_short_12","alias_value":"ET2XMMCFOEHF","created_at":"2026-07-05T00:38:53.619534+00:00"},{"alias_kind":"pith_short_16","alias_value":"ET2XMMCFOEHFYP3U","created_at":"2026-07-05T00:38:53.619534+00:00"},{"alias_kind":"pith_short_8","alias_value":"ET2XMMCF","created_at":"2026-07-05T00:38:53.619534+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20029","citing_title":"A Finite-Volume Scheme for the Continuum Extrapolation of Lattice Step-Scaling in (2+1)D Hamiltonian U(1) Gauge Theory","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2502.06961","citing_title":"Fully optimised variational simulation of a dynamical quantum phase transition on a trapped-ion quantum computer","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ET2XMMCFOEHFYP3USJSOMHU27T","json":"https://pith.science/pith/ET2XMMCFOEHFYP3USJSOMHU27T.json","graph_json":"https://pith.science/api/pith-number/ET2XMMCFOEHFYP3USJSOMHU27T/graph.json","events_json":"https://pith.science/api/pith-number/ET2XMMCFOEHFYP3USJSOMHU27T/events.json","paper":"https://pith.science/paper/ET2XMMCF"},"agent_actions":{"view_html":"https://pith.science/pith/ET2XMMCFOEHFYP3USJSOMHU27T","download_json":"https://pith.science/pith/ET2XMMCFOEHFYP3USJSOMHU27T.json","view_paper":"https://pith.science/paper/ET2XMMCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05100&json=true","fetch_graph":"https://pith.science/api/pith-number/ET2XMMCFOEHFYP3USJSOMHU27T/graph.json","fetch_events":"https://pith.science/api/pith-number/ET2XMMCFOEHFYP3USJSOMHU27T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ET2XMMCFOEHFYP3USJSOMHU27T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ET2XMMCFOEHFYP3USJSOMHU27T/action/storage_attestation","attest_author":"https://pith.science/pith/ET2XMMCFOEHFYP3USJSOMHU27T/action/author_attestation","sign_citation":"https://pith.science/pith/ET2XMMCFOEHFYP3USJSOMHU27T/action/citation_signature","submit_replication":"https://pith.science/pith/ET2XMMCFOEHFYP3USJSOMHU27T/action/replication_record"}},"created_at":"2026-07-05T00:38:53.619534+00:00","updated_at":"2026-07-05T00:38:53.619534+00:00"}