{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G3SZXSHZYPKHF2PLUQILLWPTMM","short_pith_number":"pith:G3SZXSHZ","schema_version":"1.0","canonical_sha256":"36e59bc8f9c3d472e9eba410b5d9f3632aaeb803ebe3f474b6ab49aa62be06dd","source":{"kind":"arxiv","id":"2410.09030","version":1},"attestation_state":"computed","paper":{"title":"Learning dynamic quantum circuits for efficient state preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bryan K. Clark, Faisal Alam","submitted_at":"2024-10-11T17:47:46Z","abstract_excerpt":"Dynamic quantum circuits (DQCs) incorporate mid-circuit measurements and gates conditioned on these measurement outcomes. DQCs can prepare certain long-range entangled states in constant depth, making them a promising route to preparing complex quantum states on devices with a limited coherence time. Almost all constructions of DQCs for state preparation have been formulated analytically, relying on special structure in the target states. In this work, we approach the problem of state preparation variationally, developing scalable tensor network algorithms which find high-fidelity DQC preparat"},"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":"2410.09030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-11T17:47:46Z","cross_cats_sorted":[],"title_canon_sha256":"bd590b3c5460a3ac0efda41306666e7669d0e3f99bd2882a56facd6fbdcdbfbc","abstract_canon_sha256":"2ad3678f2b70f998f40deed907ed59241a84ddbe49ab89fa2659b8ede854f77d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:20.946622Z","signature_b64":"Ic4m9S6NmwmuY5I7f6llao5rq7F4zeA3CxkzPxt2rbfa5otYJ/po2oM9j6ML144/ESakJd5n2Hp3C45TIlOzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36e59bc8f9c3d472e9eba410b5d9f3632aaeb803ebe3f474b6ab49aa62be06dd","last_reissued_at":"2026-07-05T09:19:20.946190Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:20.946190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning dynamic quantum circuits for efficient state preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bryan K. Clark, Faisal Alam","submitted_at":"2024-10-11T17:47:46Z","abstract_excerpt":"Dynamic quantum circuits (DQCs) incorporate mid-circuit measurements and gates conditioned on these measurement outcomes. DQCs can prepare certain long-range entangled states in constant depth, making them a promising route to preparing complex quantum states on devices with a limited coherence time. Almost all constructions of DQCs for state preparation have been formulated analytically, relying on special structure in the target states. In this work, we approach the problem of state preparation variationally, developing scalable tensor network algorithms which find high-fidelity DQC preparat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.09030","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/2410.09030/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":"2410.09030","created_at":"2026-07-05T09:19:20.946251+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.09030v1","created_at":"2026-07-05T09:19:20.946251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.09030","created_at":"2026-07-05T09:19:20.946251+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3SZXSHZYPKH","created_at":"2026-07-05T09:19:20.946251+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3SZXSHZYPKHF2PL","created_at":"2026-07-05T09:19:20.946251+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3SZXSHZ","created_at":"2026-07-05T09:19:20.946251+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05256","citing_title":"Error Mitigation in Dynamic Circuits for Hamiltonian Simulation","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03360","citing_title":"Characterizing and Benchmarking Dynamic Quantum Circuits","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05256","citing_title":"Error Mitigation in Dynamic Circuits for Hamiltonian Simulation","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G3SZXSHZYPKHF2PLUQILLWPTMM","json":"https://pith.science/pith/G3SZXSHZYPKHF2PLUQILLWPTMM.json","graph_json":"https://pith.science/api/pith-number/G3SZXSHZYPKHF2PLUQILLWPTMM/graph.json","events_json":"https://pith.science/api/pith-number/G3SZXSHZYPKHF2PLUQILLWPTMM/events.json","paper":"https://pith.science/paper/G3SZXSHZ"},"agent_actions":{"view_html":"https://pith.science/pith/G3SZXSHZYPKHF2PLUQILLWPTMM","download_json":"https://pith.science/pith/G3SZXSHZYPKHF2PLUQILLWPTMM.json","view_paper":"https://pith.science/paper/G3SZXSHZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.09030&json=true","fetch_graph":"https://pith.science/api/pith-number/G3SZXSHZYPKHF2PLUQILLWPTMM/graph.json","fetch_events":"https://pith.science/api/pith-number/G3SZXSHZYPKHF2PLUQILLWPTMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3SZXSHZYPKHF2PLUQILLWPTMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3SZXSHZYPKHF2PLUQILLWPTMM/action/storage_attestation","attest_author":"https://pith.science/pith/G3SZXSHZYPKHF2PLUQILLWPTMM/action/author_attestation","sign_citation":"https://pith.science/pith/G3SZXSHZYPKHF2PLUQILLWPTMM/action/citation_signature","submit_replication":"https://pith.science/pith/G3SZXSHZYPKHF2PLUQILLWPTMM/action/replication_record"}},"created_at":"2026-07-05T09:19:20.946251+00:00","updated_at":"2026-07-05T09:19:20.946251+00:00"}