{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RFYIUIM35UWXVAXF7FTAVW7GXC","short_pith_number":"pith:RFYIUIM3","schema_version":"1.0","canonical_sha256":"89708a219bed2d7a82e5f9660adbe6b8b3020408dbaa4b7e35274252199739e5","source":{"kind":"arxiv","id":"2605.22744","version":1},"attestation_state":"computed","paper":{"title":"Quantum circuit design via dynamic Pauli constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Bultrini, James R. Wootton, Merlin Incerti-Medici, Pierre Fromholz","submitted_at":"2026-05-21T17:14:16Z","abstract_excerpt":"We introduce a novel software-oriented model of quantum computation motivated by the practical constraints of near-term quantum hardware. In this model, gates are specified by constraints expressed in terms of Pauli observables, with each disjoint layer of gates accompanied by a pairwise or $k$-local quantum state tomography of the device. We prove that the model is equivalent to the coupling-graph-restricted circuit model and hence universal for BQP, with a polynomial overhead: simulating a depth-$D$ circuit on $N$ qubits requires at most $O(D^2 N \\log N)$ complexity. The model formalizes an "},"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":"2605.22744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-21T17:14:16Z","cross_cats_sorted":[],"title_canon_sha256":"bb2e607ded4464acf00777a638c90cf46c549f2b1a3aaa594a870564dce31f01","abstract_canon_sha256":"aad631b04bdf181e89836106c12c7d0f1b5e05ccbb8c00795107e237e88e216a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T02:04:52.933956Z","signature_b64":"Z0qNAH/F3OGKyT8xkOjLAjDOIt3UMz9c4xALkfMLpjyz5OG6bmzFQCKWiyOhWbHopWDEA2KYusF3ujbUUwGyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89708a219bed2d7a82e5f9660adbe6b8b3020408dbaa4b7e35274252199739e5","last_reissued_at":"2026-05-22T02:04:52.933363Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T02:04:52.933363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum circuit design via dynamic Pauli constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Bultrini, James R. Wootton, Merlin Incerti-Medici, Pierre Fromholz","submitted_at":"2026-05-21T17:14:16Z","abstract_excerpt":"We introduce a novel software-oriented model of quantum computation motivated by the practical constraints of near-term quantum hardware. In this model, gates are specified by constraints expressed in terms of Pauli observables, with each disjoint layer of gates accompanied by a pairwise or $k$-local quantum state tomography of the device. We prove that the model is equivalent to the coupling-graph-restricted circuit model and hence universal for BQP, with a polynomial overhead: simulating a depth-$D$ circuit on $N$ qubits requires at most $O(D^2 N \\log N)$ complexity. The model formalizes an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22744","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/2605.22744/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":"2605.22744","created_at":"2026-05-22T02:04:52.933465+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22744v1","created_at":"2026-05-22T02:04:52.933465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22744","created_at":"2026-05-22T02:04:52.933465+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFYIUIM35UWX","created_at":"2026-05-22T02:04:52.933465+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFYIUIM35UWXVAXF","created_at":"2026-05-22T02:04:52.933465+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFYIUIM3","created_at":"2026-05-22T02:04:52.933465+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RFYIUIM35UWXVAXF7FTAVW7GXC","json":"https://pith.science/pith/RFYIUIM35UWXVAXF7FTAVW7GXC.json","graph_json":"https://pith.science/api/pith-number/RFYIUIM35UWXVAXF7FTAVW7GXC/graph.json","events_json":"https://pith.science/api/pith-number/RFYIUIM35UWXVAXF7FTAVW7GXC/events.json","paper":"https://pith.science/paper/RFYIUIM3"},"agent_actions":{"view_html":"https://pith.science/pith/RFYIUIM35UWXVAXF7FTAVW7GXC","download_json":"https://pith.science/pith/RFYIUIM35UWXVAXF7FTAVW7GXC.json","view_paper":"https://pith.science/paper/RFYIUIM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22744&json=true","fetch_graph":"https://pith.science/api/pith-number/RFYIUIM35UWXVAXF7FTAVW7GXC/graph.json","fetch_events":"https://pith.science/api/pith-number/RFYIUIM35UWXVAXF7FTAVW7GXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFYIUIM35UWXVAXF7FTAVW7GXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFYIUIM35UWXVAXF7FTAVW7GXC/action/storage_attestation","attest_author":"https://pith.science/pith/RFYIUIM35UWXVAXF7FTAVW7GXC/action/author_attestation","sign_citation":"https://pith.science/pith/RFYIUIM35UWXVAXF7FTAVW7GXC/action/citation_signature","submit_replication":"https://pith.science/pith/RFYIUIM35UWXVAXF7FTAVW7GXC/action/replication_record"}},"created_at":"2026-05-22T02:04:52.933465+00:00","updated_at":"2026-05-22T02:04:52.933465+00:00"}