{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PNHH6NKWBATL4JYJNVEVUNHVSJ","short_pith_number":"pith:PNHH6NKW","schema_version":"1.0","canonical_sha256":"7b4e7f35560826be27096d495a34f5927458620fb8b23364366f57e48ef6244e","source":{"kind":"arxiv","id":"2001.05997","version":4},"attestation_state":"computed","paper":{"title":"Optimal Two-Qubit Circuits for Universal Fault-Tolerant Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew N. Glaudell, Jacob M. Taylor, Neil J. Ross","submitted_at":"2020-01-16T18:55:38Z","abstract_excerpt":"We study two-qubit circuits over the Clifford+CS gate set, which consists of the Clifford gates together with the controlled-phase gate CS=diag(1,1,1,i). The Clifford+CS gate set is universal for quantum computation and its elements can be implemented fault-tolerantly in most error-correcting schemes through magic state distillation. Since non-Clifford gates are typically more expensive to perform in a fault-tolerant manner, it is often desirable to construct circuits that use few CS gates. In the present paper, we introduce an efficient and optimal synthesis algorithm for two-qubit Clifford+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":"2001.05997","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-16T18:55:38Z","cross_cats_sorted":[],"title_canon_sha256":"7c2cbcf3e0ea42a74d7df02b7402762822541fff1ab8953be1ec7f36294f6388","abstract_canon_sha256":"c92ad1199e80556fb03c4860f0cb02471abdc664c045de811ac8c7f8888532fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:50:19.318356Z","signature_b64":"WfInofWGnAEdiFCRkAch2NK9WmD6batv6lYcBSZBnBYEczQjiZDXuWHBykMQRwC/Qwc6Y8vMPR8oeX58pc4jBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b4e7f35560826be27096d495a34f5927458620fb8b23364366f57e48ef6244e","last_reissued_at":"2026-07-05T02:50:19.317888Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:50:19.317888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Two-Qubit Circuits for Universal Fault-Tolerant Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew N. Glaudell, Jacob M. Taylor, Neil J. Ross","submitted_at":"2020-01-16T18:55:38Z","abstract_excerpt":"We study two-qubit circuits over the Clifford+CS gate set, which consists of the Clifford gates together with the controlled-phase gate CS=diag(1,1,1,i). The Clifford+CS gate set is universal for quantum computation and its elements can be implemented fault-tolerantly in most error-correcting schemes through magic state distillation. Since non-Clifford gates are typically more expensive to perform in a fault-tolerant manner, it is often desirable to construct circuits that use few CS gates. In the present paper, we introduce an efficient and optimal synthesis algorithm for two-qubit Clifford+C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.05997","kind":"arxiv","version":4},"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/2001.05997/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":"2001.05997","created_at":"2026-07-05T02:50:19.317949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.05997v4","created_at":"2026-07-05T02:50:19.317949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.05997","created_at":"2026-07-05T02:50:19.317949+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNHH6NKWBATL","created_at":"2026-07-05T02:50:19.317949+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNHH6NKWBATL4JYJ","created_at":"2026-07-05T02:50:19.317949+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNHH6NKW","created_at":"2026-07-05T02:50:19.317949+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.20387","citing_title":"A small and interesting architecture for early fault-tolerant quantum computers","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PNHH6NKWBATL4JYJNVEVUNHVSJ","json":"https://pith.science/pith/PNHH6NKWBATL4JYJNVEVUNHVSJ.json","graph_json":"https://pith.science/api/pith-number/PNHH6NKWBATL4JYJNVEVUNHVSJ/graph.json","events_json":"https://pith.science/api/pith-number/PNHH6NKWBATL4JYJNVEVUNHVSJ/events.json","paper":"https://pith.science/paper/PNHH6NKW"},"agent_actions":{"view_html":"https://pith.science/pith/PNHH6NKWBATL4JYJNVEVUNHVSJ","download_json":"https://pith.science/pith/PNHH6NKWBATL4JYJNVEVUNHVSJ.json","view_paper":"https://pith.science/paper/PNHH6NKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.05997&json=true","fetch_graph":"https://pith.science/api/pith-number/PNHH6NKWBATL4JYJNVEVUNHVSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PNHH6NKWBATL4JYJNVEVUNHVSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNHH6NKWBATL4JYJNVEVUNHVSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNHH6NKWBATL4JYJNVEVUNHVSJ/action/storage_attestation","attest_author":"https://pith.science/pith/PNHH6NKWBATL4JYJNVEVUNHVSJ/action/author_attestation","sign_citation":"https://pith.science/pith/PNHH6NKWBATL4JYJNVEVUNHVSJ/action/citation_signature","submit_replication":"https://pith.science/pith/PNHH6NKWBATL4JYJNVEVUNHVSJ/action/replication_record"}},"created_at":"2026-07-05T02:50:19.317949+00:00","updated_at":"2026-07-05T02:50:19.317949+00:00"}