{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:S47RBZTMDBNDPWFYWJLP5YOH7R","short_pith_number":"pith:S47RBZTM","schema_version":"1.0","canonical_sha256":"973f10e66c185a37d8b8b256fee1c7fc7f3e97186a4ff6603ef254be69812069","source":{"kind":"arxiv","id":"quant-ph/0505030","version":2},"attestation_state":"computed","paper":{"title":"The Solovay-Kitaev algorithm","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher M. Dawson, Michael A. Nielsen","submitted_at":"2005-05-06T00:55:45Z","abstract_excerpt":"This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form of an efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequence of gates from a fixed and finite set. The algorithm can be used, for example, to compile Shor's algorithm, which uses rotations of $\\pi / 2^k$, into an efficient fault-tolerant form using only Hadamard, controlled-{\\sc not}, and $\\pi / 8$ gates. The algorithm runs in $O(\\log^{2.71}(1/\\epsilon))$ time, and produces as output a sequence of $O(\\log^{3.97}(1/\\epsilon))$ quantum gates which is guaranteed to approximate "},"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":"quant-ph/0505030","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-05-06T00:55:45Z","cross_cats_sorted":[],"title_canon_sha256":"b8091acb90d09aea916aae465723d784e3fb175d84171aa153f6c6d41a19453c","abstract_canon_sha256":"39687d0c5a3f6662843cb40cdd2033cd36c5bc306a4c69ddeacd21f252186d40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:57.990659Z","signature_b64":"ywr7aVpr7BajjxNG8Hr2S0rP72PwdU5G5iMDM6oij8CtPCR2YCDoWqaYhJmv57j6o6NTs+y3JJPyOxB2RLkZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"973f10e66c185a37d8b8b256fee1c7fc7f3e97186a4ff6603ef254be69812069","last_reissued_at":"2026-07-04T14:46:57.990304Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:57.990304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Solovay-Kitaev algorithm","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher M. Dawson, Michael A. Nielsen","submitted_at":"2005-05-06T00:55:45Z","abstract_excerpt":"This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form of an efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequence of gates from a fixed and finite set. The algorithm can be used, for example, to compile Shor's algorithm, which uses rotations of $\\pi / 2^k$, into an efficient fault-tolerant form using only Hadamard, controlled-{\\sc not}, and $\\pi / 8$ gates. The algorithm runs in $O(\\log^{2.71}(1/\\epsilon))$ time, and produces as output a sequence of $O(\\log^{3.97}(1/\\epsilon))$ quantum gates which is guaranteed to approximate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0505030","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0505030/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":"quant-ph/0505030","created_at":"2026-07-04T14:46:57.990378+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0505030v2","created_at":"2026-07-04T14:46:57.990378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0505030","created_at":"2026-07-04T14:46:57.990378+00:00"},{"alias_kind":"pith_short_12","alias_value":"S47RBZTMDBND","created_at":"2026-07-04T14:46:57.990378+00:00"},{"alias_kind":"pith_short_16","alias_value":"S47RBZTMDBNDPWFY","created_at":"2026-07-04T14:46:57.990378+00:00"},{"alias_kind":"pith_short_8","alias_value":"S47RBZTM","created_at":"2026-07-04T14:46:57.990378+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":17,"internal_anchor_count":9,"sample":[{"citing_arxiv_id":"2607.08508","citing_title":"Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12480","citing_title":"Geometric Algebra Quantum Gate Decomposition","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2606.04038","citing_title":"Graphical and algebraic methods for Boolean factoring","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2606.02014","citing_title":"Lie Algebra-Based Quantum Optimal Controls Interpolation","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2606.00581","citing_title":"Analog photonic simulator for large-scale transport","ref_index":120,"is_internal_anchor":true},{"citing_arxiv_id":"2111.07992","citing_title":"Query and Depth Upper Bounds for Quantum Unitaries via Grover Search","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2505.00683","citing_title":"Quantum Circuit Overhead","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2509.09320","citing_title":"Quantum Coherence and Anomalous Work Extraction in Qubit Gate Dynamics","ref_index":69,"is_internal_anchor":true},{"citing_arxiv_id":"2507.04337","citing_title":"Efficient Simulation of High-Level Quantum Gates","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12066","citing_title":"Benchmarking and Resource Analysis for Augmented-Lagrangian Quantum Hamiltonian Descent","ref_index":72,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":230,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27054","citing_title":"A Timelike Quantum Focusing Conjecture","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01367","citing_title":"From Characterization To Construction: Generative Quantum Circuit Synthesis from Gate Set Tomography Data","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00979","citing_title":"Universality of Quantum Gates in Particle and Symmetry Constrained Subspaces","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15099","citing_title":"O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19319","citing_title":"An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics","ref_index":203,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02051","citing_title":"Sub-Cubic Quantum Gate Synthesis via Stochastic Commutator Decomposition","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S47RBZTMDBNDPWFYWJLP5YOH7R","json":"https://pith.science/pith/S47RBZTMDBNDPWFYWJLP5YOH7R.json","graph_json":"https://pith.science/api/pith-number/S47RBZTMDBNDPWFYWJLP5YOH7R/graph.json","events_json":"https://pith.science/api/pith-number/S47RBZTMDBNDPWFYWJLP5YOH7R/events.json","paper":"https://pith.science/paper/S47RBZTM"},"agent_actions":{"view_html":"https://pith.science/pith/S47RBZTMDBNDPWFYWJLP5YOH7R","download_json":"https://pith.science/pith/S47RBZTMDBNDPWFYWJLP5YOH7R.json","view_paper":"https://pith.science/paper/S47RBZTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0505030&json=true","fetch_graph":"https://pith.science/api/pith-number/S47RBZTMDBNDPWFYWJLP5YOH7R/graph.json","fetch_events":"https://pith.science/api/pith-number/S47RBZTMDBNDPWFYWJLP5YOH7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S47RBZTMDBNDPWFYWJLP5YOH7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S47RBZTMDBNDPWFYWJLP5YOH7R/action/storage_attestation","attest_author":"https://pith.science/pith/S47RBZTMDBNDPWFYWJLP5YOH7R/action/author_attestation","sign_citation":"https://pith.science/pith/S47RBZTMDBNDPWFYWJLP5YOH7R/action/citation_signature","submit_replication":"https://pith.science/pith/S47RBZTMDBNDPWFYWJLP5YOH7R/action/replication_record"}},"created_at":"2026-07-04T14:46:57.990378+00:00","updated_at":"2026-07-04T14:46:57.990378+00:00"}