{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UNPVCJTPDARDAHEDWAWD62Q2LN","short_pith_number":"pith:UNPVCJTP","schema_version":"1.0","canonical_sha256":"a35f51266f1822301c83b02c3f6a1a5b40a63601406b023280c090fd026f0470","source":{"kind":"arxiv","id":"1810.10259","version":1},"attestation_state":"computed","paper":{"title":"On Clifford groups in quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J. Tolar","submitted_at":"2018-10-24T09:15:34Z","abstract_excerpt":"The term Clifford group was introduced in 1998 by D. Gottesmann in his investigation of quantum error-correcting codes. The simplest Clifford group in multiqubit quantum computation is generated by a restricted set of unitary Clifford gates - the Hadamard, $\\pi/4$-phase and controlled-X gates. Because of this restriction the Clifford model of quantum computation can be efficiently simulated on a classical computer (the Gottesmann-Knill theorem). However, this fact does not diminish the importance of the Clifford model, since it may serve as a suitable starting point for a full-fledged quantum "},"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":"1810.10259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-24T09:15:34Z","cross_cats_sorted":[],"title_canon_sha256":"5f4d25af960337971283f0075b1dcaae1274a14d882afab03ad3c69bcd5be667","abstract_canon_sha256":"f6907e3c08bb0ddb1f7bdaec10c8437d0cd30f56adba5ad6d12c9e776aa2f51c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:23.730677Z","signature_b64":"6E48nZOthW63YUGyJ/OYwGytVv4L01aDx3j7pU9KGp1zNPHz1uLDYiafcJZC3l7lZ5v81VW14adKB0u6JoRaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a35f51266f1822301c83b02c3f6a1a5b40a63601406b023280c090fd026f0470","last_reissued_at":"2026-05-18T00:02:23.730036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:23.730036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Clifford groups in quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J. Tolar","submitted_at":"2018-10-24T09:15:34Z","abstract_excerpt":"The term Clifford group was introduced in 1998 by D. Gottesmann in his investigation of quantum error-correcting codes. The simplest Clifford group in multiqubit quantum computation is generated by a restricted set of unitary Clifford gates - the Hadamard, $\\pi/4$-phase and controlled-X gates. Because of this restriction the Clifford model of quantum computation can be efficiently simulated on a classical computer (the Gottesmann-Knill theorem). However, this fact does not diminish the importance of the Clifford model, since it may serve as a suitable starting point for a full-fledged quantum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10259","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":""},"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":"1810.10259","created_at":"2026-05-18T00:02:23.730130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10259v1","created_at":"2026-05-18T00:02:23.730130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10259","created_at":"2026-05-18T00:02:23.730130+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNPVCJTPDARD","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNPVCJTPDARDAHED","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNPVCJTP","created_at":"2026-05-18T12:32:56.356000+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/UNPVCJTPDARDAHEDWAWD62Q2LN","json":"https://pith.science/pith/UNPVCJTPDARDAHEDWAWD62Q2LN.json","graph_json":"https://pith.science/api/pith-number/UNPVCJTPDARDAHEDWAWD62Q2LN/graph.json","events_json":"https://pith.science/api/pith-number/UNPVCJTPDARDAHEDWAWD62Q2LN/events.json","paper":"https://pith.science/paper/UNPVCJTP"},"agent_actions":{"view_html":"https://pith.science/pith/UNPVCJTPDARDAHEDWAWD62Q2LN","download_json":"https://pith.science/pith/UNPVCJTPDARDAHEDWAWD62Q2LN.json","view_paper":"https://pith.science/paper/UNPVCJTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10259&json=true","fetch_graph":"https://pith.science/api/pith-number/UNPVCJTPDARDAHEDWAWD62Q2LN/graph.json","fetch_events":"https://pith.science/api/pith-number/UNPVCJTPDARDAHEDWAWD62Q2LN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNPVCJTPDARDAHEDWAWD62Q2LN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNPVCJTPDARDAHEDWAWD62Q2LN/action/storage_attestation","attest_author":"https://pith.science/pith/UNPVCJTPDARDAHEDWAWD62Q2LN/action/author_attestation","sign_citation":"https://pith.science/pith/UNPVCJTPDARDAHEDWAWD62Q2LN/action/citation_signature","submit_replication":"https://pith.science/pith/UNPVCJTPDARDAHEDWAWD62Q2LN/action/replication_record"}},"created_at":"2026-05-18T00:02:23.730130+00:00","updated_at":"2026-05-18T00:02:23.730130+00:00"}