{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RMZ5QM2CMUS6UYYMQBN5YK6TIR","short_pith_number":"pith:RMZ5QM2C","schema_version":"1.0","canonical_sha256":"8b33d833426525ea630c805bdc2bd344567cf9be248b0c9c020b85070b7f4401","source":{"kind":"arxiv","id":"2308.13065","version":2},"attestation_state":"computed","paper":{"title":"Efficient Long-Range Entanglement using Dynamic Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alireza Seif, Derek S. Wang, Edward H. Chen, Elisa B\\\"aumer, Patrick Rall, Swarnadeep Majumder, Vinay Tripathi, Zlatko K. Minev","submitted_at":"2023-08-24T20:15:30Z","abstract_excerpt":"Quantum simulation traditionally relies on unitary dynamics, inherently imposing efficiency constraints on the generation of intricate entangled states. In principle, these limitations can be superseded by non-unitary, dynamic circuits. These circuits exploit measurements alongside conditional feed-forward operations, providing a promising approach for long-range entangling gates, higher effective connectivity of near-term hardware, and more efficient state preparations. Here, we explore the utility of shallow dynamic circuits for creating long-range entanglement on large-scale quantum devices"},"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":"2308.13065","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-24T20:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"16a8e48cf4a4a2968cb1508df2f6a9251a3fc57a55977c59ac12876ca7461c19","abstract_canon_sha256":"7f02f5102d9978858b1dfec89efe60f78310a048cface06944cff00be3f898a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:08:20.674346Z","signature_b64":"dTkm/evwk0SLJrzbzu6nbpy/toWRcSn8yCxB4agMQV3WVp8YADye+MSBg+XEIJ2tdCW7fZo3cbN3z4nKKrnSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b33d833426525ea630c805bdc2bd344567cf9be248b0c9c020b85070b7f4401","last_reissued_at":"2026-07-05T09:08:20.673778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:08:20.673778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Long-Range Entanglement using Dynamic Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alireza Seif, Derek S. Wang, Edward H. Chen, Elisa B\\\"aumer, Patrick Rall, Swarnadeep Majumder, Vinay Tripathi, Zlatko K. Minev","submitted_at":"2023-08-24T20:15:30Z","abstract_excerpt":"Quantum simulation traditionally relies on unitary dynamics, inherently imposing efficiency constraints on the generation of intricate entangled states. In principle, these limitations can be superseded by non-unitary, dynamic circuits. These circuits exploit measurements alongside conditional feed-forward operations, providing a promising approach for long-range entangling gates, higher effective connectivity of near-term hardware, and more efficient state preparations. Here, we explore the utility of shallow dynamic circuits for creating long-range entanglement on large-scale quantum devices"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13065","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/2308.13065/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":"2308.13065","created_at":"2026-07-05T09:08:20.673854+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.13065v2","created_at":"2026-07-05T09:08:20.673854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13065","created_at":"2026-07-05T09:08:20.673854+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMZ5QM2CMUS6","created_at":"2026-07-05T09:08:20.673854+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMZ5QM2CMUS6UYYM","created_at":"2026-07-05T09:08:20.673854+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMZ5QM2C","created_at":"2026-07-05T09:08:20.673854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2405.08810","citing_title":"Quantum computing with Qiskit","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15441","citing_title":"Quantum computation at the edge of chaos","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMZ5QM2CMUS6UYYMQBN5YK6TIR","json":"https://pith.science/pith/RMZ5QM2CMUS6UYYMQBN5YK6TIR.json","graph_json":"https://pith.science/api/pith-number/RMZ5QM2CMUS6UYYMQBN5YK6TIR/graph.json","events_json":"https://pith.science/api/pith-number/RMZ5QM2CMUS6UYYMQBN5YK6TIR/events.json","paper":"https://pith.science/paper/RMZ5QM2C"},"agent_actions":{"view_html":"https://pith.science/pith/RMZ5QM2CMUS6UYYMQBN5YK6TIR","download_json":"https://pith.science/pith/RMZ5QM2CMUS6UYYMQBN5YK6TIR.json","view_paper":"https://pith.science/paper/RMZ5QM2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.13065&json=true","fetch_graph":"https://pith.science/api/pith-number/RMZ5QM2CMUS6UYYMQBN5YK6TIR/graph.json","fetch_events":"https://pith.science/api/pith-number/RMZ5QM2CMUS6UYYMQBN5YK6TIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMZ5QM2CMUS6UYYMQBN5YK6TIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMZ5QM2CMUS6UYYMQBN5YK6TIR/action/storage_attestation","attest_author":"https://pith.science/pith/RMZ5QM2CMUS6UYYMQBN5YK6TIR/action/author_attestation","sign_citation":"https://pith.science/pith/RMZ5QM2CMUS6UYYMQBN5YK6TIR/action/citation_signature","submit_replication":"https://pith.science/pith/RMZ5QM2CMUS6UYYMQBN5YK6TIR/action/replication_record"}},"created_at":"2026-07-05T09:08:20.673854+00:00","updated_at":"2026-07-05T09:08:20.673854+00:00"}