{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2RKCNPIX4TIS4XRHETJEZ76TOL","short_pith_number":"pith:2RKCNPIX","schema_version":"1.0","canonical_sha256":"d45426bd17e4d12e5e2724d24cffd372c0cb787d9b07a9500424dad86571ed1d","source":{"kind":"arxiv","id":"2301.08609","version":7},"attestation_state":"computed","paper":{"title":"Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Albert Akhriev, Jiri Vala, Niall F. Robertson, Sergiy Zhuk","submitted_at":"2023-01-20T14:40:29Z","abstract_excerpt":"We introduce AQCtensor, a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS). Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum many-body Hamiltonians. This tailored approach has two clear advantages over previous algorithms that were designed to map a generic MPS to a quantum circuit. First, we optimize all parameters of a parametric circuit at once using Approximate Quantum Compiling (AQC) - this is to be contrasted with other approaches based on locally optimizing a subset of circuit "},"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":"2301.08609","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-20T14:40:29Z","cross_cats_sorted":[],"title_canon_sha256":"3bfe726ede11848585354c26e6002db439584d4ccc714650cc66699398efeb52","abstract_canon_sha256":"37230e27b4fd5f788561ae4c865f0d78079cb47537d8af1e1ed9acaf3f0c906c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:59.862073Z","signature_b64":"q7ibhErPwEuCTbfWoHnN4M9y1k40bij299rdvmQNklmUdrKIVz8lPyJShdj9abBnVIXTRGoPcFj4rifR17+eBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d45426bd17e4d12e5e2724d24cffd372c0cb787d9b07a9500424dad86571ed1d","last_reissued_at":"2026-07-05T11:23:59.861572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:59.861572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Albert Akhriev, Jiri Vala, Niall F. Robertson, Sergiy Zhuk","submitted_at":"2023-01-20T14:40:29Z","abstract_excerpt":"We introduce AQCtensor, a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS). Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum many-body Hamiltonians. This tailored approach has two clear advantages over previous algorithms that were designed to map a generic MPS to a quantum circuit. First, we optimize all parameters of a parametric circuit at once using Approximate Quantum Compiling (AQC) - this is to be contrasted with other approaches based on locally optimizing a subset of circuit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08609","kind":"arxiv","version":7},"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/2301.08609/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":"2301.08609","created_at":"2026-07-05T11:23:59.861634+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.08609v7","created_at":"2026-07-05T11:23:59.861634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08609","created_at":"2026-07-05T11:23:59.861634+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RKCNPIX4TIS","created_at":"2026-07-05T11:23:59.861634+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RKCNPIX4TIS4XRH","created_at":"2026-07-05T11:23:59.861634+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RKCNPIX","created_at":"2026-07-05T11:23:59.861634+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28169","citing_title":"Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm","ref_index":131,"is_internal_anchor":false},{"citing_arxiv_id":"2503.14371","citing_title":"Superdiffusion resilience in Heisenberg Chains with 2D interactions on a quantum processor","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2504.21298","citing_title":"Preparation Circuits for Matrix Product States by Classical Variational Disentanglement","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20331","citing_title":"Bowtie VarQTE: A Resource-Efficient Quantum State Preparation Primitive","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2RKCNPIX4TIS4XRHETJEZ76TOL","json":"https://pith.science/pith/2RKCNPIX4TIS4XRHETJEZ76TOL.json","graph_json":"https://pith.science/api/pith-number/2RKCNPIX4TIS4XRHETJEZ76TOL/graph.json","events_json":"https://pith.science/api/pith-number/2RKCNPIX4TIS4XRHETJEZ76TOL/events.json","paper":"https://pith.science/paper/2RKCNPIX"},"agent_actions":{"view_html":"https://pith.science/pith/2RKCNPIX4TIS4XRHETJEZ76TOL","download_json":"https://pith.science/pith/2RKCNPIX4TIS4XRHETJEZ76TOL.json","view_paper":"https://pith.science/paper/2RKCNPIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.08609&json=true","fetch_graph":"https://pith.science/api/pith-number/2RKCNPIX4TIS4XRHETJEZ76TOL/graph.json","fetch_events":"https://pith.science/api/pith-number/2RKCNPIX4TIS4XRHETJEZ76TOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RKCNPIX4TIS4XRHETJEZ76TOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RKCNPIX4TIS4XRHETJEZ76TOL/action/storage_attestation","attest_author":"https://pith.science/pith/2RKCNPIX4TIS4XRHETJEZ76TOL/action/author_attestation","sign_citation":"https://pith.science/pith/2RKCNPIX4TIS4XRHETJEZ76TOL/action/citation_signature","submit_replication":"https://pith.science/pith/2RKCNPIX4TIS4XRHETJEZ76TOL/action/replication_record"}},"created_at":"2026-07-05T11:23:59.861634+00:00","updated_at":"2026-07-05T11:23:59.861634+00:00"}