{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:E56NLTRKLMTFTNBYSTM4EVLUU5","short_pith_number":"pith:E56NLTRK","schema_version":"1.0","canonical_sha256":"277cd5ce2a5b2659b43894d9c25574a75a95985bcb73590564ace1231a2270f8","source":{"kind":"arxiv","id":"2408.12583","version":1},"attestation_state":"computed","paper":{"title":"Quantum Circuit Optimization using Differentiable Programming of Tensor Network States","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ananda Roy, David Rogerson","submitted_at":"2024-08-22T17:48:53Z","abstract_excerpt":"Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network methods. The said algorithm runs on classical hardware and finds shallow, accurate quantum circuits by minimizing scalar cost functions. The gradients relevant for the optimization process are computed using the reverse mode automatic differentiation technique implemented on top of the time-evolved block decimation algorithm for matrix product states. A variati"},"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":"2408.12583","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-22T17:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"779734a859538a514f91095db1d7d1d51a857b35768caf7b5d26b186e2797b02","abstract_canon_sha256":"8c2998233f2d6730e139a5d6ee5dae3663493e15e37b72070069a223245d9eda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:16.935010Z","signature_b64":"g0jFzLepIygfJuVLuhKwhsVIWCUPibag0aCNFF2cOkB2Wr26yKlRYb2fsnqPCDJoAn5SX0tG1+icOUQGq7UKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"277cd5ce2a5b2659b43894d9c25574a75a95985bcb73590564ace1231a2270f8","last_reissued_at":"2026-07-05T08:58:16.934509Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:16.934509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Circuit Optimization using Differentiable Programming of Tensor Network States","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ananda Roy, David Rogerson","submitted_at":"2024-08-22T17:48:53Z","abstract_excerpt":"Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network methods. The said algorithm runs on classical hardware and finds shallow, accurate quantum circuits by minimizing scalar cost functions. The gradients relevant for the optimization process are computed using the reverse mode automatic differentiation technique implemented on top of the time-evolved block decimation algorithm for matrix product states. A variati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12583","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/2408.12583/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":"2408.12583","created_at":"2026-07-05T08:58:16.934574+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.12583v1","created_at":"2026-07-05T08:58:16.934574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12583","created_at":"2026-07-05T08:58:16.934574+00:00"},{"alias_kind":"pith_short_12","alias_value":"E56NLTRKLMTF","created_at":"2026-07-05T08:58:16.934574+00:00"},{"alias_kind":"pith_short_16","alias_value":"E56NLTRKLMTFTNBY","created_at":"2026-07-05T08:58:16.934574+00:00"},{"alias_kind":"pith_short_8","alias_value":"E56NLTRK","created_at":"2026-07-05T08:58:16.934574+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.11861","citing_title":"Optimizing Quantum Photonic Integrated Circuits using Differentiable Tensor Networks","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05627","citing_title":"Loss-aware state space geometry for quantum variational algorithms","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E56NLTRKLMTFTNBYSTM4EVLUU5","json":"https://pith.science/pith/E56NLTRKLMTFTNBYSTM4EVLUU5.json","graph_json":"https://pith.science/api/pith-number/E56NLTRKLMTFTNBYSTM4EVLUU5/graph.json","events_json":"https://pith.science/api/pith-number/E56NLTRKLMTFTNBYSTM4EVLUU5/events.json","paper":"https://pith.science/paper/E56NLTRK"},"agent_actions":{"view_html":"https://pith.science/pith/E56NLTRKLMTFTNBYSTM4EVLUU5","download_json":"https://pith.science/pith/E56NLTRKLMTFTNBYSTM4EVLUU5.json","view_paper":"https://pith.science/paper/E56NLTRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.12583&json=true","fetch_graph":"https://pith.science/api/pith-number/E56NLTRKLMTFTNBYSTM4EVLUU5/graph.json","fetch_events":"https://pith.science/api/pith-number/E56NLTRKLMTFTNBYSTM4EVLUU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E56NLTRKLMTFTNBYSTM4EVLUU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E56NLTRKLMTFTNBYSTM4EVLUU5/action/storage_attestation","attest_author":"https://pith.science/pith/E56NLTRKLMTFTNBYSTM4EVLUU5/action/author_attestation","sign_citation":"https://pith.science/pith/E56NLTRKLMTFTNBYSTM4EVLUU5/action/citation_signature","submit_replication":"https://pith.science/pith/E56NLTRKLMTFTNBYSTM4EVLUU5/action/replication_record"}},"created_at":"2026-07-05T08:58:16.934574+00:00","updated_at":"2026-07-05T08:58:16.934574+00:00"}