{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:THIIOCRNRF7FABP2ODQJIHIBXZ","short_pith_number":"pith:THIIOCRN","schema_version":"1.0","canonical_sha256":"99d0870a2d897e5005fa70e0941d01be703aa4875a6010b1c94e7d8edac747e2","source":{"kind":"arxiv","id":"2408.03064","version":1},"attestation_state":"computed","paper":{"title":"Measurement-Based Long-Range Entangling Gates in Constant Depth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elisa B\\\"aumer, Stefan Woerner","submitted_at":"2024-08-06T09:35:42Z","abstract_excerpt":"The depth of quantum circuits is a critical factor when running them on state-of-the-art quantum devices due to their limited coherence times. Reducing circuit depth decreases noise in near-term quantum computations and reduces overall computation time, thus, also benefiting fault-tolerant quantum computations. Here, we show how to reduce the depth of quantum sub-routines that typically scale linearly with the number of qubits, such as quantum fan-out and long-range CNOT gates, to a constant depth using mid-circuit measurements and feed-forward operations, while only requiring a 1D line topolo"},"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.03064","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-06T09:35:42Z","cross_cats_sorted":[],"title_canon_sha256":"e51f33eb23e6f8a1c9a535b7e39db0fda50c06a6010cda3929cd147a17a3bcb6","abstract_canon_sha256":"23e5bac2fe8bddcd19f2f83dbb07484ad98dfb8190ca0b786e705601937c979d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:24.480259Z","signature_b64":"PHgEfxKmAQVpyJGU21HQeqIlVngSW10gFd4YiHReEGzzLFhERLIu5F0ht+dozjpSAVhHmow/M2FCVPvKxYpEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99d0870a2d897e5005fa70e0941d01be703aa4875a6010b1c94e7d8edac747e2","last_reissued_at":"2026-07-05T10:59:24.479794Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:24.479794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Measurement-Based Long-Range Entangling Gates in Constant Depth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elisa B\\\"aumer, Stefan Woerner","submitted_at":"2024-08-06T09:35:42Z","abstract_excerpt":"The depth of quantum circuits is a critical factor when running them on state-of-the-art quantum devices due to their limited coherence times. Reducing circuit depth decreases noise in near-term quantum computations and reduces overall computation time, thus, also benefiting fault-tolerant quantum computations. Here, we show how to reduce the depth of quantum sub-routines that typically scale linearly with the number of qubits, such as quantum fan-out and long-range CNOT gates, to a constant depth using mid-circuit measurements and feed-forward operations, while only requiring a 1D line topolo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03064","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.03064/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.03064","created_at":"2026-07-05T10:59:24.479845+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.03064v1","created_at":"2026-07-05T10:59:24.479845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03064","created_at":"2026-07-05T10:59:24.479845+00:00"},{"alias_kind":"pith_short_12","alias_value":"THIIOCRNRF7F","created_at":"2026-07-05T10:59:24.479845+00:00"},{"alias_kind":"pith_short_16","alias_value":"THIIOCRNRF7FABP2","created_at":"2026-07-05T10:59:24.479845+00:00"},{"alias_kind":"pith_short_8","alias_value":"THIIOCRN","created_at":"2026-07-05T10:59:24.479845+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.13469","citing_title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","ref_index":78,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/THIIOCRNRF7FABP2ODQJIHIBXZ","json":"https://pith.science/pith/THIIOCRNRF7FABP2ODQJIHIBXZ.json","graph_json":"https://pith.science/api/pith-number/THIIOCRNRF7FABP2ODQJIHIBXZ/graph.json","events_json":"https://pith.science/api/pith-number/THIIOCRNRF7FABP2ODQJIHIBXZ/events.json","paper":"https://pith.science/paper/THIIOCRN"},"agent_actions":{"view_html":"https://pith.science/pith/THIIOCRNRF7FABP2ODQJIHIBXZ","download_json":"https://pith.science/pith/THIIOCRNRF7FABP2ODQJIHIBXZ.json","view_paper":"https://pith.science/paper/THIIOCRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.03064&json=true","fetch_graph":"https://pith.science/api/pith-number/THIIOCRNRF7FABP2ODQJIHIBXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/THIIOCRNRF7FABP2ODQJIHIBXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THIIOCRNRF7FABP2ODQJIHIBXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THIIOCRNRF7FABP2ODQJIHIBXZ/action/storage_attestation","attest_author":"https://pith.science/pith/THIIOCRNRF7FABP2ODQJIHIBXZ/action/author_attestation","sign_citation":"https://pith.science/pith/THIIOCRNRF7FABP2ODQJIHIBXZ/action/citation_signature","submit_replication":"https://pith.science/pith/THIIOCRNRF7FABP2ODQJIHIBXZ/action/replication_record"}},"created_at":"2026-07-05T10:59:24.479845+00:00","updated_at":"2026-07-05T10:59:24.479845+00:00"}