{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:23ORGLVIDYQZWKW7EMRVWP4G2H","short_pith_number":"pith:23ORGLVI","schema_version":"1.0","canonical_sha256":"d6dd132ea81e219b2adf23235b3f86d1fe7e467ff64a6f8ce8785b23f460ccb3","source":{"kind":"arxiv","id":"2403.01018","version":2},"attestation_state":"computed","paper":{"title":"Optimal quantum circuit cuts with application to clustered Hamiltonian simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Angus Lowe, Aram W. Harrow","submitted_at":"2024-03-01T22:31:33Z","abstract_excerpt":"We study methods to replace entangling operations with random local operations in a quantum computation, at the cost of increasing the number of required executions. First, we consider \"space-like cuts\" where an entangling unitary is replaced with random local unitaries. We propose an entanglement measure for quantum dynamics, the product extent, which bounds the cost in a procedure for this replacement based on two copies of the Hadamard test. In the terminology of prior work, this procedure yields a quasiprobability decomposition with minimal 1-norm in a number of cases, which addresses an o"},"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":"2403.01018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-01T22:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"074577d6f2d65c6ff821eab5ee6e536d82132156d4071f44ee37005f3871ebb4","abstract_canon_sha256":"eaa400facd5244dd11e2ab8bb493c64e7681fb72832c20718efe79c6bd6ca69c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:41.264442Z","signature_b64":"ItUYWi0RSZZQVQ1d0RDLXDXLU/RQKcRwAwPO+JumpzBbirZOC9kgfxHQaujjmnIEFFl43J++K1l253QAV2eBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6dd132ea81e219b2adf23235b3f86d1fe7e467ff64a6f8ce8785b23f460ccb3","last_reissued_at":"2026-07-05T10:03:41.263949Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:41.263949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal quantum circuit cuts with application to clustered Hamiltonian simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Angus Lowe, Aram W. Harrow","submitted_at":"2024-03-01T22:31:33Z","abstract_excerpt":"We study methods to replace entangling operations with random local operations in a quantum computation, at the cost of increasing the number of required executions. First, we consider \"space-like cuts\" where an entangling unitary is replaced with random local unitaries. We propose an entanglement measure for quantum dynamics, the product extent, which bounds the cost in a procedure for this replacement based on two copies of the Hadamard test. In the terminology of prior work, this procedure yields a quasiprobability decomposition with minimal 1-norm in a number of cases, which addresses an o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01018","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/2403.01018/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":"2403.01018","created_at":"2026-07-05T10:03:41.264011+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.01018v2","created_at":"2026-07-05T10:03:41.264011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01018","created_at":"2026-07-05T10:03:41.264011+00:00"},{"alias_kind":"pith_short_12","alias_value":"23ORGLVIDYQZ","created_at":"2026-07-05T10:03:41.264011+00:00"},{"alias_kind":"pith_short_16","alias_value":"23ORGLVIDYQZWKW7","created_at":"2026-07-05T10:03:41.264011+00:00"},{"alias_kind":"pith_short_8","alias_value":"23ORGLVI","created_at":"2026-07-05T10:03:41.264011+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.06649","citing_title":"Optimized Circuit Cutting for QAOA Sampling Tasks","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/23ORGLVIDYQZWKW7EMRVWP4G2H","json":"https://pith.science/pith/23ORGLVIDYQZWKW7EMRVWP4G2H.json","graph_json":"https://pith.science/api/pith-number/23ORGLVIDYQZWKW7EMRVWP4G2H/graph.json","events_json":"https://pith.science/api/pith-number/23ORGLVIDYQZWKW7EMRVWP4G2H/events.json","paper":"https://pith.science/paper/23ORGLVI"},"agent_actions":{"view_html":"https://pith.science/pith/23ORGLVIDYQZWKW7EMRVWP4G2H","download_json":"https://pith.science/pith/23ORGLVIDYQZWKW7EMRVWP4G2H.json","view_paper":"https://pith.science/paper/23ORGLVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.01018&json=true","fetch_graph":"https://pith.science/api/pith-number/23ORGLVIDYQZWKW7EMRVWP4G2H/graph.json","fetch_events":"https://pith.science/api/pith-number/23ORGLVIDYQZWKW7EMRVWP4G2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23ORGLVIDYQZWKW7EMRVWP4G2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23ORGLVIDYQZWKW7EMRVWP4G2H/action/storage_attestation","attest_author":"https://pith.science/pith/23ORGLVIDYQZWKW7EMRVWP4G2H/action/author_attestation","sign_citation":"https://pith.science/pith/23ORGLVIDYQZWKW7EMRVWP4G2H/action/citation_signature","submit_replication":"https://pith.science/pith/23ORGLVIDYQZWKW7EMRVWP4G2H/action/replication_record"}},"created_at":"2026-07-05T10:03:41.264011+00:00","updated_at":"2026-07-05T10:03:41.264011+00:00"}