{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:N32F724QQVN3OCDDSEKGWDNTY4","short_pith_number":"pith:N32F724Q","schema_version":"1.0","canonical_sha256":"6ef45feb90855bb7086391146b0db3c72545d3cd82dc5a8f0877db13f818c172","source":{"kind":"arxiv","id":"2012.13966","version":1},"attestation_state":"computed","paper":{"title":"ZX-calculus for the working quantum computer scientist","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"John van de Wetering","submitted_at":"2020-12-27T15:54:25Z","abstract_excerpt":"The ZX-calculus is a graphical language for reasoning about quantum computation that has recently seen an increased usage in a variety of areas such as quantum circuit optimisation, surface codes and lattice surgery, measurement-based quantum computation, and quantum foundations. The first half of this review gives a gentle introduction to the ZX-calculus suitable for those familiar with the basics of quantum computing. The aim here is to make the reader comfortable enough with the ZX-calculus that they could use it in their daily work for small computations on quantum circuits and states. The"},"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":"2012.13966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-12-27T15:54:25Z","cross_cats_sorted":[],"title_canon_sha256":"2c62c654dcbfe340ca9e073b2983404faa646652623fe00548e96771477c2ae2","abstract_canon_sha256":"254a75522f3fb8ab8089a2a475e42ba18ec6d895cc5e3f28a5c5023297c2f9e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:02:14.374358Z","signature_b64":"+dTNzObk2HsRbqu4cutIXNqmMOC3L172JYHwoT7CB3i5vjbcJ3yfMHEW4bZ5LGfrH5nOu/bloGoRhwHu9Y4eBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ef45feb90855bb7086391146b0db3c72545d3cd82dc5a8f0877db13f818c172","last_reissued_at":"2026-07-05T02:02:14.373959Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:02:14.373959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ZX-calculus for the working quantum computer scientist","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"John van de Wetering","submitted_at":"2020-12-27T15:54:25Z","abstract_excerpt":"The ZX-calculus is a graphical language for reasoning about quantum computation that has recently seen an increased usage in a variety of areas such as quantum circuit optimisation, surface codes and lattice surgery, measurement-based quantum computation, and quantum foundations. The first half of this review gives a gentle introduction to the ZX-calculus suitable for those familiar with the basics of quantum computing. The aim here is to make the reader comfortable enough with the ZX-calculus that they could use it in their daily work for small computations on quantum circuits and states. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.13966","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/2012.13966/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":"2012.13966","created_at":"2026-07-05T02:02:14.374014+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.13966v1","created_at":"2026-07-05T02:02:14.374014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.13966","created_at":"2026-07-05T02:02:14.374014+00:00"},{"alias_kind":"pith_short_12","alias_value":"N32F724QQVN3","created_at":"2026-07-05T02:02:14.374014+00:00"},{"alias_kind":"pith_short_16","alias_value":"N32F724QQVN3OCDD","created_at":"2026-07-05T02:02:14.374014+00:00"},{"alias_kind":"pith_short_8","alias_value":"N32F724Q","created_at":"2026-07-05T02:02:14.374014+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12383","citing_title":"Minimality of the Stabilizer ZX Calculus","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05664","citing_title":"Gauging the Spacetime Code","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16509","citing_title":"Quokka#: Quantum Computing with #SAT","ref_index":95,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15266","citing_title":"Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13929","citing_title":"Linear-Time T-Gate Optimization via Random Abstraction","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11417","citing_title":"String Diagrams for Quantum Foundations, Computing and Natural Language Processing","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06251","citing_title":"Meromorphic Quantum Computing","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17784","citing_title":"Current-State Opacity in Safe Partially Observed Quantum Petri Nets: True-Concurrency Semantics and Exact Symbolic Verification","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04828","citing_title":"Hybrid Fourier Neural Operator for Surrogate Modeling of Laser Processing with a Quantum-Circuit Mixer","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04049","citing_title":"FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models","ref_index":88,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N32F724QQVN3OCDDSEKGWDNTY4","json":"https://pith.science/pith/N32F724QQVN3OCDDSEKGWDNTY4.json","graph_json":"https://pith.science/api/pith-number/N32F724QQVN3OCDDSEKGWDNTY4/graph.json","events_json":"https://pith.science/api/pith-number/N32F724QQVN3OCDDSEKGWDNTY4/events.json","paper":"https://pith.science/paper/N32F724Q"},"agent_actions":{"view_html":"https://pith.science/pith/N32F724QQVN3OCDDSEKGWDNTY4","download_json":"https://pith.science/pith/N32F724QQVN3OCDDSEKGWDNTY4.json","view_paper":"https://pith.science/paper/N32F724Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.13966&json=true","fetch_graph":"https://pith.science/api/pith-number/N32F724QQVN3OCDDSEKGWDNTY4/graph.json","fetch_events":"https://pith.science/api/pith-number/N32F724QQVN3OCDDSEKGWDNTY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N32F724QQVN3OCDDSEKGWDNTY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N32F724QQVN3OCDDSEKGWDNTY4/action/storage_attestation","attest_author":"https://pith.science/pith/N32F724QQVN3OCDDSEKGWDNTY4/action/author_attestation","sign_citation":"https://pith.science/pith/N32F724QQVN3OCDDSEKGWDNTY4/action/citation_signature","submit_replication":"https://pith.science/pith/N32F724QQVN3OCDDSEKGWDNTY4/action/replication_record"}},"created_at":"2026-07-05T02:02:14.374014+00:00","updated_at":"2026-07-05T02:02:14.374014+00:00"}