{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LDYP62SYJBPQNB26JPV3ZMJGYP","short_pith_number":"pith:LDYP62SY","schema_version":"1.0","canonical_sha256":"58f0ff6a58485f06875e4bebbcb126c3d927ddbf500c0bc1052dff94b855398b","source":{"kind":"arxiv","id":"1902.03178","version":6},"attestation_state":"computed","paper":{"title":"Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","math.CO"],"primary_cat":"quant-ph","authors_text":"Aleks Kissinger, John van de Wetering, Ross Duncan, Simon Perdrix","submitted_at":"2019-02-08T16:37:51Z","abstract_excerpt":"We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-level language for describing quantum computations graphically. Then, using the rules of the ZX-calculus, we give a simplification strategy for ZX-diagrams based on the two graph transformations of local complementation and pivoting and show that the resulting reduced diagram can be transformed back into a quantum circuit. While little is known about extracting circuits from arbitrary ZX-diagrams, we show that the un"},"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":"1902.03178","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-02-08T16:37:51Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"8b4ff801dafb54e98b1c21b985f0671aa612afc5ad71706020d54abe32bce8d2","abstract_canon_sha256":"fdbbef09501a8ef2edd627796055b314a716b8dbfcdfa6fc428d57ceebf47e2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:15:04.840083Z","signature_b64":"tKPOW8iwxXJxaQqY6ipAiU/yrzM2sfkFE6pv9SQ/mUcuX+iaSs5QLCL3g9ojLqEHna9kKi0Qsm3+92y1WffCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58f0ff6a58485f06875e4bebbcb126c3d927ddbf500c0bc1052dff94b855398b","last_reissued_at":"2026-07-05T01:15:04.839595Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:15:04.839595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","math.CO"],"primary_cat":"quant-ph","authors_text":"Aleks Kissinger, John van de Wetering, Ross Duncan, Simon Perdrix","submitted_at":"2019-02-08T16:37:51Z","abstract_excerpt":"We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-level language for describing quantum computations graphically. Then, using the rules of the ZX-calculus, we give a simplification strategy for ZX-diagrams based on the two graph transformations of local complementation and pivoting and show that the resulting reduced diagram can be transformed back into a quantum circuit. While little is known about extracting circuits from arbitrary ZX-diagrams, we show that the un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03178","kind":"arxiv","version":6},"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/1902.03178/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":"1902.03178","created_at":"2026-07-05T01:15:04.839651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03178v6","created_at":"2026-07-05T01:15:04.839651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03178","created_at":"2026-07-05T01:15:04.839651+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDYP62SYJBPQ","created_at":"2026-07-05T01:15:04.839651+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDYP62SYJBPQNB26","created_at":"2026-07-05T01:15:04.839651+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDYP62SY","created_at":"2026-07-05T01:15:04.839651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29962","citing_title":"BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LDYP62SYJBPQNB26JPV3ZMJGYP","json":"https://pith.science/pith/LDYP62SYJBPQNB26JPV3ZMJGYP.json","graph_json":"https://pith.science/api/pith-number/LDYP62SYJBPQNB26JPV3ZMJGYP/graph.json","events_json":"https://pith.science/api/pith-number/LDYP62SYJBPQNB26JPV3ZMJGYP/events.json","paper":"https://pith.science/paper/LDYP62SY"},"agent_actions":{"view_html":"https://pith.science/pith/LDYP62SYJBPQNB26JPV3ZMJGYP","download_json":"https://pith.science/pith/LDYP62SYJBPQNB26JPV3ZMJGYP.json","view_paper":"https://pith.science/paper/LDYP62SY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03178&json=true","fetch_graph":"https://pith.science/api/pith-number/LDYP62SYJBPQNB26JPV3ZMJGYP/graph.json","fetch_events":"https://pith.science/api/pith-number/LDYP62SYJBPQNB26JPV3ZMJGYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDYP62SYJBPQNB26JPV3ZMJGYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDYP62SYJBPQNB26JPV3ZMJGYP/action/storage_attestation","attest_author":"https://pith.science/pith/LDYP62SYJBPQNB26JPV3ZMJGYP/action/author_attestation","sign_citation":"https://pith.science/pith/LDYP62SYJBPQNB26JPV3ZMJGYP/action/citation_signature","submit_replication":"https://pith.science/pith/LDYP62SYJBPQNB26JPV3ZMJGYP/action/replication_record"}},"created_at":"2026-07-05T01:15:04.839651+00:00","updated_at":"2026-07-05T01:15:04.839651+00:00"}