{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:L5SKJD7PXBX6YOXAES6PIV4MYN","short_pith_number":"pith:L5SKJD7P","schema_version":"1.0","canonical_sha256":"5f64a48fefb86fec3ae024bcf4578cc37f9caa583b7826492151c583c45f1971","source":{"kind":"arxiv","id":"2506.02105","version":1},"attestation_state":"computed","paper":{"title":"Learning Circuits with Infinite Tensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Joe Gibbs, Lukasz Cincio","submitted_at":"2025-06-02T18:00:01Z","abstract_excerpt":"Hamiltonian simulation on quantum computers is strongly constrained by gate counts, motivating techniques to reduce circuit depths. While tensor networks are natural competitors to quantum computers, we instead leverage them to support circuit design, with datasets of tensor networks enabling a unitary synthesis inspired by quantum machine learning. For a target simulation in the thermodynamic limit, translation invariance is exploited to significantly reduce the optimization complexity, avoiding a scaling with system size. Our approach finds circuits to efficiently prepare ground states, and "},"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":"2506.02105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-06-02T18:00:01Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"6d8e8dfef82c3df3e3b190989f6ee3d6f09084344df4b9899eceb9b52b08994f","abstract_canon_sha256":"f9b582a26555ab080f67de317d97f0672272c40f44193237e63fcfa529d01f12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:32.534202Z","signature_b64":"oYa78vy/2i76unYeFE+VAN+nWJNrTACMOsf/A29XS6kaIGUa8mmdDizQwtg3bedj4nyAlJoN19pkaI+tV615CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f64a48fefb86fec3ae024bcf4578cc37f9caa583b7826492151c583c45f1971","last_reissued_at":"2026-07-05T11:14:32.533749Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:32.533749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Circuits with Infinite Tensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Joe Gibbs, Lukasz Cincio","submitted_at":"2025-06-02T18:00:01Z","abstract_excerpt":"Hamiltonian simulation on quantum computers is strongly constrained by gate counts, motivating techniques to reduce circuit depths. While tensor networks are natural competitors to quantum computers, we instead leverage them to support circuit design, with datasets of tensor networks enabling a unitary synthesis inspired by quantum machine learning. For a target simulation in the thermodynamic limit, translation invariance is exploited to significantly reduce the optimization complexity, avoiding a scaling with system size. Our approach finds circuits to efficiently prepare ground states, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02105","kind":"arxiv","version":1},"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/2506.02105/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":"2506.02105","created_at":"2026-07-05T11:14:32.533811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.02105v1","created_at":"2026-07-05T11:14:32.533811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02105","created_at":"2026-07-05T11:14:32.533811+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5SKJD7PXBX6","created_at":"2026-07-05T11:14:32.533811+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5SKJD7PXBX6YOXA","created_at":"2026-07-05T11:14:32.533811+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5SKJD7P","created_at":"2026-07-05T11:14:32.533811+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18515","citing_title":"Exponentially many initializations to avoid barren plateaus","ref_index":94,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14094","citing_title":"Simulating the dynamics of an SU(2) matrix model on a trapped-ion quantum computer","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20384","citing_title":"Hessian-vector products for tensor networks via recursive tangent-state propagation","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L5SKJD7PXBX6YOXAES6PIV4MYN","json":"https://pith.science/pith/L5SKJD7PXBX6YOXAES6PIV4MYN.json","graph_json":"https://pith.science/api/pith-number/L5SKJD7PXBX6YOXAES6PIV4MYN/graph.json","events_json":"https://pith.science/api/pith-number/L5SKJD7PXBX6YOXAES6PIV4MYN/events.json","paper":"https://pith.science/paper/L5SKJD7P"},"agent_actions":{"view_html":"https://pith.science/pith/L5SKJD7PXBX6YOXAES6PIV4MYN","download_json":"https://pith.science/pith/L5SKJD7PXBX6YOXAES6PIV4MYN.json","view_paper":"https://pith.science/paper/L5SKJD7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.02105&json=true","fetch_graph":"https://pith.science/api/pith-number/L5SKJD7PXBX6YOXAES6PIV4MYN/graph.json","fetch_events":"https://pith.science/api/pith-number/L5SKJD7PXBX6YOXAES6PIV4MYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5SKJD7PXBX6YOXAES6PIV4MYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5SKJD7PXBX6YOXAES6PIV4MYN/action/storage_attestation","attest_author":"https://pith.science/pith/L5SKJD7PXBX6YOXAES6PIV4MYN/action/author_attestation","sign_citation":"https://pith.science/pith/L5SKJD7PXBX6YOXAES6PIV4MYN/action/citation_signature","submit_replication":"https://pith.science/pith/L5SKJD7PXBX6YOXAES6PIV4MYN/action/replication_record"}},"created_at":"2026-07-05T11:14:32.533811+00:00","updated_at":"2026-07-05T11:14:32.533811+00:00"}