{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HWM7V25X522QLDM3DEC33ZKOCI","short_pith_number":"pith:HWM7V25X","schema_version":"1.0","canonical_sha256":"3d99faebb7eeb5058d9b1905bde54e1235fe225ee0fb425741b0b16be5e85949","source":{"kind":"arxiv","id":"1906.01734","version":2},"attestation_state":"computed","paper":{"title":"Phase Gadget Synthesis for Shallow Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"quant-ph","authors_text":"Alexander Cowtan, Ross Duncan, Seyon Sivarajah, Silas Dilkes, Will Simmons","submitted_at":"2019-06-04T21:37:13Z","abstract_excerpt":"We give an overview of the circuit optimisation methods used by tket, a compiler system for quantum software developed by Cambridge Quantum Computing Ltd. We focus on a novel technique based around phase gadgets, a family of multi-qubit quantum operations which occur naturally in a wide range of quantum circuits of practical interest. The phase gadgets have a simple presentation in the ZX-calculus, which makes it easy to reason about them. Taking advantage of this, we present an efficient method to translate the phase gadgets back to CNOT gates and single qubit operations suitable for executio"},"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":"1906.01734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-04T21:37:13Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"859ebdde28ae71c1aaff6440f826752f7e350ef34e5c3c2f2b7587049a6d8689","abstract_canon_sha256":"c9c64271ec44a8d6997d4fb805b150a9c8f97a65d1f79e6850a9347113b33005"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:59:33.426681Z","signature_b64":"nvKGDGY82+Px6dSM0YqNhsAu2kWn82RTMtttFJNFkXyT2qZXER16PLA2lze2o+31WmvI5vzaaodexcsEXTp8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d99faebb7eeb5058d9b1905bde54e1235fe225ee0fb425741b0b16be5e85949","last_reissued_at":"2026-07-05T00:59:33.426269Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:59:33.426269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase Gadget Synthesis for Shallow Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"quant-ph","authors_text":"Alexander Cowtan, Ross Duncan, Seyon Sivarajah, Silas Dilkes, Will Simmons","submitted_at":"2019-06-04T21:37:13Z","abstract_excerpt":"We give an overview of the circuit optimisation methods used by tket, a compiler system for quantum software developed by Cambridge Quantum Computing Ltd. We focus on a novel technique based around phase gadgets, a family of multi-qubit quantum operations which occur naturally in a wide range of quantum circuits of practical interest. The phase gadgets have a simple presentation in the ZX-calculus, which makes it easy to reason about them. Taking advantage of this, we present an efficient method to translate the phase gadgets back to CNOT gates and single qubit operations suitable for executio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01734","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/1906.01734/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":"1906.01734","created_at":"2026-07-05T00:59:33.426335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01734v2","created_at":"2026-07-05T00:59:33.426335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01734","created_at":"2026-07-05T00:59:33.426335+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWM7V25X522Q","created_at":"2026-07-05T00:59:33.426335+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWM7V25X522QLDM3","created_at":"2026-07-05T00:59:33.426335+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWM7V25X","created_at":"2026-07-05T00:59:33.426335+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07554","citing_title":"RubriQ: Rubric-Guided Group Relative Policy Optimization for Constraint-Aware Quantum Circuit Synthesis","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2606.29962","citing_title":"BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03545","citing_title":"Shortest Path in Pauli Forest -- An Algorithm for Decomposing Pauli Exponentials to Quantum Circuits","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21123","citing_title":"Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19029","citing_title":"MonteQ: A Monte Carlo Tree Search Based Quantum Circuit Synthesis Framework","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17630","citing_title":"Randomized Subsystem Descent for Fermion-to-Qubit Mapping","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HWM7V25X522QLDM3DEC33ZKOCI","json":"https://pith.science/pith/HWM7V25X522QLDM3DEC33ZKOCI.json","graph_json":"https://pith.science/api/pith-number/HWM7V25X522QLDM3DEC33ZKOCI/graph.json","events_json":"https://pith.science/api/pith-number/HWM7V25X522QLDM3DEC33ZKOCI/events.json","paper":"https://pith.science/paper/HWM7V25X"},"agent_actions":{"view_html":"https://pith.science/pith/HWM7V25X522QLDM3DEC33ZKOCI","download_json":"https://pith.science/pith/HWM7V25X522QLDM3DEC33ZKOCI.json","view_paper":"https://pith.science/paper/HWM7V25X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01734&json=true","fetch_graph":"https://pith.science/api/pith-number/HWM7V25X522QLDM3DEC33ZKOCI/graph.json","fetch_events":"https://pith.science/api/pith-number/HWM7V25X522QLDM3DEC33ZKOCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWM7V25X522QLDM3DEC33ZKOCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWM7V25X522QLDM3DEC33ZKOCI/action/storage_attestation","attest_author":"https://pith.science/pith/HWM7V25X522QLDM3DEC33ZKOCI/action/author_attestation","sign_citation":"https://pith.science/pith/HWM7V25X522QLDM3DEC33ZKOCI/action/citation_signature","submit_replication":"https://pith.science/pith/HWM7V25X522QLDM3DEC33ZKOCI/action/replication_record"}},"created_at":"2026-07-05T00:59:33.426335+00:00","updated_at":"2026-07-05T00:59:33.426335+00:00"}