{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GYTS7BIDQ5WJTASIML5NMG5RLX","short_pith_number":"pith:GYTS7BID","schema_version":"1.0","canonical_sha256":"36272f8503876c99824862fad61bb15dd9734a6106a576dae4828074106c7024","source":{"kind":"arxiv","id":"2311.10357","version":5},"attestation_state":"computed","paper":{"title":"Fast algorithms for classical specifications of stabiliser states and Clifford gates","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Ming Yin, Nadish de Silva, Wilfred Salmon","submitted_at":"2023-11-17T07:09:10Z","abstract_excerpt":"The stabiliser formalism plays a central role in quantum computing, error correction, and fault tolerance. Conversions between and verifications of different specifications of stabiliser states and Clifford gates are important components of many classical algorithms in quantum information, e.g. for gate synthesis, circuit optimisation, and simulating quantum circuits. These core functions are also used in the numerical experiments critical to formulating and testing mathematical conjectures on the stabiliser formalism.\n  We develop novel mathematical insights concerning stabiliser states and C"},"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":"2311.10357","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-17T07:09:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"680832b7e09f66e9a53d554127d6846e03126cc19cce06d6152cc4ee656e1fc1","abstract_canon_sha256":"899071edfd3c5ef86a490ba5ba283d1dde2488a349091ce96183b5fc66b4a191"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:17.355041Z","signature_b64":"W74RJEG/7tGC3dFs7j6qiwQeuflFniavMzaD87AvbLe9MEPWIPwVSejR4jo0wBcojJ/Gb+y4GJyCzQ0kUA9FBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36272f8503876c99824862fad61bb15dd9734a6106a576dae4828074106c7024","last_reissued_at":"2026-07-05T09:58:17.354537Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:17.354537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast algorithms for classical specifications of stabiliser states and Clifford gates","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Ming Yin, Nadish de Silva, Wilfred Salmon","submitted_at":"2023-11-17T07:09:10Z","abstract_excerpt":"The stabiliser formalism plays a central role in quantum computing, error correction, and fault tolerance. Conversions between and verifications of different specifications of stabiliser states and Clifford gates are important components of many classical algorithms in quantum information, e.g. for gate synthesis, circuit optimisation, and simulating quantum circuits. These core functions are also used in the numerical experiments critical to formulating and testing mathematical conjectures on the stabiliser formalism.\n  We develop novel mathematical insights concerning stabiliser states and C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10357","kind":"arxiv","version":5},"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/2311.10357/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":"2311.10357","created_at":"2026-07-05T09:58:17.354638+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.10357v5","created_at":"2026-07-05T09:58:17.354638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10357","created_at":"2026-07-05T09:58:17.354638+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYTS7BIDQ5WJ","created_at":"2026-07-05T09:58:17.354638+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYTS7BIDQ5WJTASI","created_at":"2026-07-05T09:58:17.354638+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYTS7BID","created_at":"2026-07-05T09:58:17.354638+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16004","citing_title":"Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GYTS7BIDQ5WJTASIML5NMG5RLX","json":"https://pith.science/pith/GYTS7BIDQ5WJTASIML5NMG5RLX.json","graph_json":"https://pith.science/api/pith-number/GYTS7BIDQ5WJTASIML5NMG5RLX/graph.json","events_json":"https://pith.science/api/pith-number/GYTS7BIDQ5WJTASIML5NMG5RLX/events.json","paper":"https://pith.science/paper/GYTS7BID"},"agent_actions":{"view_html":"https://pith.science/pith/GYTS7BIDQ5WJTASIML5NMG5RLX","download_json":"https://pith.science/pith/GYTS7BIDQ5WJTASIML5NMG5RLX.json","view_paper":"https://pith.science/paper/GYTS7BID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.10357&json=true","fetch_graph":"https://pith.science/api/pith-number/GYTS7BIDQ5WJTASIML5NMG5RLX/graph.json","fetch_events":"https://pith.science/api/pith-number/GYTS7BIDQ5WJTASIML5NMG5RLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYTS7BIDQ5WJTASIML5NMG5RLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYTS7BIDQ5WJTASIML5NMG5RLX/action/storage_attestation","attest_author":"https://pith.science/pith/GYTS7BIDQ5WJTASIML5NMG5RLX/action/author_attestation","sign_citation":"https://pith.science/pith/GYTS7BIDQ5WJTASIML5NMG5RLX/action/citation_signature","submit_replication":"https://pith.science/pith/GYTS7BIDQ5WJTASIML5NMG5RLX/action/replication_record"}},"created_at":"2026-07-05T09:58:17.354638+00:00","updated_at":"2026-07-05T09:58:17.354638+00:00"}