{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5NLW5JB6OAFJLFCGNKMHGXZWK5","short_pith_number":"pith:5NLW5JB6","schema_version":"1.0","canonical_sha256":"eb576ea43e700a9594466a98735f36577126035b58d94fb8d2bac7f5bc523f05","source":{"kind":"arxiv","id":"1212.0822","version":2},"attestation_state":"computed","paper":{"title":"Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dmitri Maslov, Michele Mosca, Vadym Kliuchnikov","submitted_at":"2012-12-04T18:53:38Z","abstract_excerpt":"We present an algorithm for building a circuit that approximates single qubit unitaries with precision {\\epsilon} using O(log(1/{\\epsilon})) Clifford and T gates and employing up to two ancillary qubits. The algorithm for computing our approximating circuit requires an average of O(log^2(1/{\\epsilon})log log(1/{\\epsilon})) operations. We prove that the number of gates in our circuit saturates the lower bound on the number of gates required in the scenario when a constant number of ancillae are supplied, and as such, our circuits are asymptotically optimal. This results in significant improveme"},"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.0822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-12-04T18:53:38Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"2ff9c65643bd9b577a8cb8ed24607a39ebe37562f0d93f73e4f89dd2c5dea890","abstract_canon_sha256":"e4e50000d53a2db5401dca831a3a402b00131a6577b4140b5d4af49a8bc08b27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:00.309724Z","signature_b64":"nMVxKadF+uGhCrO55jD3q2HJP2tdq3RDbTG2k+4MFY4PB6NxLSHkMnGHuhGY/LzSvO69a+OoeXkNGu5QMeDOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb576ea43e700a9594466a98735f36577126035b58d94fb8d2bac7f5bc523f05","last_reissued_at":"2026-05-18T03:26:00.309161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:00.309161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dmitri Maslov, Michele Mosca, Vadym Kliuchnikov","submitted_at":"2012-12-04T18:53:38Z","abstract_excerpt":"We present an algorithm for building a circuit that approximates single qubit unitaries with precision {\\epsilon} using O(log(1/{\\epsilon})) Clifford and T gates and employing up to two ancillary qubits. The algorithm for computing our approximating circuit requires an average of O(log^2(1/{\\epsilon})log log(1/{\\epsilon})) operations. We prove that the number of gates in our circuit saturates the lower bound on the number of gates required in the scenario when a constant number of ancillae are supplied, and as such, our circuits are asymptotically optimal. This results in significant improveme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0822","kind":"arxiv","version":2},"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.0822","created_at":"2026-05-18T03:26:00.309236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0822v2","created_at":"2026-05-18T03:26:00.309236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0822","created_at":"2026-05-18T03:26:00.309236+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NLW5JB6OAFJ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NLW5JB6OAFJLFCG","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NLW5JB6","created_at":"2026-05-18T12:26:56.085431+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/5NLW5JB6OAFJLFCGNKMHGXZWK5","json":"https://pith.science/pith/5NLW5JB6OAFJLFCGNKMHGXZWK5.json","graph_json":"https://pith.science/api/pith-number/5NLW5JB6OAFJLFCGNKMHGXZWK5/graph.json","events_json":"https://pith.science/api/pith-number/5NLW5JB6OAFJLFCGNKMHGXZWK5/events.json","paper":"https://pith.science/paper/5NLW5JB6"},"agent_actions":{"view_html":"https://pith.science/pith/5NLW5JB6OAFJLFCGNKMHGXZWK5","download_json":"https://pith.science/pith/5NLW5JB6OAFJLFCGNKMHGXZWK5.json","view_paper":"https://pith.science/paper/5NLW5JB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0822&json=true","fetch_graph":"https://pith.science/api/pith-number/5NLW5JB6OAFJLFCGNKMHGXZWK5/graph.json","fetch_events":"https://pith.science/api/pith-number/5NLW5JB6OAFJLFCGNKMHGXZWK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NLW5JB6OAFJLFCGNKMHGXZWK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NLW5JB6OAFJLFCGNKMHGXZWK5/action/storage_attestation","attest_author":"https://pith.science/pith/5NLW5JB6OAFJLFCGNKMHGXZWK5/action/author_attestation","sign_citation":"https://pith.science/pith/5NLW5JB6OAFJLFCGNKMHGXZWK5/action/citation_signature","submit_replication":"https://pith.science/pith/5NLW5JB6OAFJLFCGNKMHGXZWK5/action/replication_record"}},"created_at":"2026-05-18T03:26:00.309236+00:00","updated_at":"2026-05-18T03:26:00.309236+00:00"}