{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RQV76QVZP4Y7FIDLQIIPA5QXHX","short_pith_number":"pith:RQV76QVZ","schema_version":"1.0","canonical_sha256":"8c2bff42b97f31f2a06b8210f076173df32a630d6fa1b33229594c20ddcff384","source":{"kind":"arxiv","id":"1212.0506","version":3},"attestation_state":"computed","paper":{"title":"Exact synthesis of multiqubit Clifford+T circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Brett Giles, Peter Selinger","submitted_at":"2012-12-03T19:43:40Z","abstract_excerpt":"We prove that a unitary matrix has an exact representation over the Clifford+T gate set with local ancillas if and only if its entries are in the ring Z[1/sqrt(2),i]. Moreover, we show that one ancilla always suffices. These facts were conjectured by Kliuchnikov, Maslov, and Mosca. We obtain an algorithm for synthesizing a exact Clifford+T circuit from any such n-qubit operator. We also characterize the Clifford+T operators that can be represented without ancillas."},"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":"1212.0506","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-12-03T19:43:40Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"cb00740dafe42a56655c016a56e470a22428cd483c09d6e89050d3b5331d132c","abstract_canon_sha256":"96ee739b31c06fc85b8f4ec743eeb6d1a505303869ae9d33c52f9681c99d8126"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:15.885223Z","signature_b64":"MezeLUI3n0OoIJV2C4Oh3iMnlpEKb5oFL/x+LbkgT5AP66hIWz9QjQDa2GJey0JY+YkXnfHTn41ME37Rj/0WBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c2bff42b97f31f2a06b8210f076173df32a630d6fa1b33229594c20ddcff384","last_reissued_at":"2026-05-18T03:29:15.884526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:15.884526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact synthesis of multiqubit Clifford+T circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Brett Giles, Peter Selinger","submitted_at":"2012-12-03T19:43:40Z","abstract_excerpt":"We prove that a unitary matrix has an exact representation over the Clifford+T gate set with local ancillas if and only if its entries are in the ring Z[1/sqrt(2),i]. Moreover, we show that one ancilla always suffices. These facts were conjectured by Kliuchnikov, Maslov, and Mosca. We obtain an algorithm for synthesizing a exact Clifford+T circuit from any such n-qubit operator. We also characterize the Clifford+T operators that can be represented without ancillas."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0506","kind":"arxiv","version":3},"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":"1212.0506","created_at":"2026-05-18T03:29:15.884643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0506v3","created_at":"2026-05-18T03:29:15.884643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0506","created_at":"2026-05-18T03:29:15.884643+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQV76QVZP4Y7","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQV76QVZP4Y7FIDL","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQV76QVZ","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.25821","citing_title":"On the Complexity of the Succinct State Local Hamiltonian Problem","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RQV76QVZP4Y7FIDLQIIPA5QXHX","json":"https://pith.science/pith/RQV76QVZP4Y7FIDLQIIPA5QXHX.json","graph_json":"https://pith.science/api/pith-number/RQV76QVZP4Y7FIDLQIIPA5QXHX/graph.json","events_json":"https://pith.science/api/pith-number/RQV76QVZP4Y7FIDLQIIPA5QXHX/events.json","paper":"https://pith.science/paper/RQV76QVZ"},"agent_actions":{"view_html":"https://pith.science/pith/RQV76QVZP4Y7FIDLQIIPA5QXHX","download_json":"https://pith.science/pith/RQV76QVZP4Y7FIDLQIIPA5QXHX.json","view_paper":"https://pith.science/paper/RQV76QVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0506&json=true","fetch_graph":"https://pith.science/api/pith-number/RQV76QVZP4Y7FIDLQIIPA5QXHX/graph.json","fetch_events":"https://pith.science/api/pith-number/RQV76QVZP4Y7FIDLQIIPA5QXHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQV76QVZP4Y7FIDLQIIPA5QXHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQV76QVZP4Y7FIDLQIIPA5QXHX/action/storage_attestation","attest_author":"https://pith.science/pith/RQV76QVZP4Y7FIDLQIIPA5QXHX/action/author_attestation","sign_citation":"https://pith.science/pith/RQV76QVZP4Y7FIDLQIIPA5QXHX/action/citation_signature","submit_replication":"https://pith.science/pith/RQV76QVZP4Y7FIDLQIIPA5QXHX/action/replication_record"}},"created_at":"2026-05-18T03:29:15.884643+00:00","updated_at":"2026-05-18T03:29:15.884643+00:00"}