{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QD3SUNF7JDGCWLIMBX2PDG67IJ","short_pith_number":"pith:QD3SUNF7","schema_version":"1.0","canonical_sha256":"80f72a34bf48cc2b2d0c0df4f19bdf426c05e8c1411a080a2b186c9ff9256b6d","source":{"kind":"arxiv","id":"1305.6190","version":1},"attestation_state":"computed","paper":{"title":"Classical simulation complexity of extended Clifford circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Maarten Van den Nest, Richard Jozsa","submitted_at":"2013-05-27T12:22:52Z","abstract_excerpt":"Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a suitably restricted setting. Here we consider Clifford computations with a variety of additional ingredients: (a) strong vs. weak simulation, (b) inputs being computational basis states vs. general product states, (c) adaptive vs. non-adaptive choices of gates for circuits involving intermediate measurements, (d) single line outputs vs. multi-line ou"},"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":"1305.6190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-05-27T12:22:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2623f8bbe3ca185b9da272aac84cd5692111bb0aea794d6f044712e7ab4fd0a8","abstract_canon_sha256":"d3d60aa8ec921a7c8239e6442b0591ef2ae8f91149b41213b1d24b88e61de209"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:04.978422Z","signature_b64":"LWcGSZq4vgoIU2L8hU61UxpIaBtZKLBo05r2z9xxJxgQIfeDeigm7dzWPV14QBNRsTgFzfz0f5irxb8YMMM3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80f72a34bf48cc2b2d0c0df4f19bdf426c05e8c1411a080a2b186c9ff9256b6d","last_reissued_at":"2026-05-18T03:22:04.977865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:04.977865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical simulation complexity of extended Clifford circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Maarten Van den Nest, Richard Jozsa","submitted_at":"2013-05-27T12:22:52Z","abstract_excerpt":"Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a suitably restricted setting. Here we consider Clifford computations with a variety of additional ingredients: (a) strong vs. weak simulation, (b) inputs being computational basis states vs. general product states, (c) adaptive vs. non-adaptive choices of gates for circuits involving intermediate measurements, (d) single line outputs vs. multi-line ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6190","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":"1305.6190","created_at":"2026-05-18T03:22:04.977958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6190v1","created_at":"2026-05-18T03:22:04.977958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6190","created_at":"2026-05-18T03:22:04.977958+00:00"},{"alias_kind":"pith_short_12","alias_value":"QD3SUNF7JDGC","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QD3SUNF7JDGCWLIM","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QD3SUNF7","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.03435","citing_title":"Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QD3SUNF7JDGCWLIMBX2PDG67IJ","json":"https://pith.science/pith/QD3SUNF7JDGCWLIMBX2PDG67IJ.json","graph_json":"https://pith.science/api/pith-number/QD3SUNF7JDGCWLIMBX2PDG67IJ/graph.json","events_json":"https://pith.science/api/pith-number/QD3SUNF7JDGCWLIMBX2PDG67IJ/events.json","paper":"https://pith.science/paper/QD3SUNF7"},"agent_actions":{"view_html":"https://pith.science/pith/QD3SUNF7JDGCWLIMBX2PDG67IJ","download_json":"https://pith.science/pith/QD3SUNF7JDGCWLIMBX2PDG67IJ.json","view_paper":"https://pith.science/paper/QD3SUNF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6190&json=true","fetch_graph":"https://pith.science/api/pith-number/QD3SUNF7JDGCWLIMBX2PDG67IJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QD3SUNF7JDGCWLIMBX2PDG67IJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QD3SUNF7JDGCWLIMBX2PDG67IJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QD3SUNF7JDGCWLIMBX2PDG67IJ/action/storage_attestation","attest_author":"https://pith.science/pith/QD3SUNF7JDGCWLIMBX2PDG67IJ/action/author_attestation","sign_citation":"https://pith.science/pith/QD3SUNF7JDGCWLIMBX2PDG67IJ/action/citation_signature","submit_replication":"https://pith.science/pith/QD3SUNF7JDGCWLIMBX2PDG67IJ/action/replication_record"}},"created_at":"2026-05-18T03:22:04.977958+00:00","updated_at":"2026-05-18T03:22:04.977958+00:00"}