{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:OHLP35GMLAIDWWVXEKNZT4QNWA","short_pith_number":"pith:OHLP35GM","schema_version":"1.0","canonical_sha256":"71d6fdf4cc58103b5ab7229b99f20db0163f4ca9542440d92b4349b69f161d1b","source":{"kind":"arxiv","id":"2112.02040","version":1},"attestation_state":"computed","paper":{"title":"Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Adam Bouland, Tudor Giurgica-Tiron","submitted_at":"2021-12-03T17:39:41Z","abstract_excerpt":"The Solovay-Kitaev algorithm is a fundamental result in quantum computation. It gives an algorithm for efficiently compiling arbitrary unitaries using universal gate sets: any unitary can be approximated by short gates sequences, whose length scales merely poly-logarithmically with accuracy. As a consequence, the choice of gate set is typically unimportant in quantum computing. However, the Solovay-Kitaev algorithm requires the gate set to be inverse-closed. It has been a longstanding open question if efficient algorithmic compilation is possible without this condition. In this work, we provid"},"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":"2112.02040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-12-03T17:39:41Z","cross_cats_sorted":["cs.DS","math-ph","math.MP"],"title_canon_sha256":"9f9b5bc0a02e76917f5fc2146718e4b042b9e967dbd338440dd925ca67b295b8","abstract_canon_sha256":"70e006f3ea9dcd93a741ce467b581ed988b5cd4a5389793c7bf3a44346914a66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:35.188325Z","signature_b64":"pPint3/3OdcbmPD7NSWWdiP+odQgQZJdtsxqyqG5fVXn+IpsE3JIh/20kIbPU4pAm3A31clBhHiuJAvfsqhwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71d6fdf4cc58103b5ab7229b99f20db0163f4ca9542440d92b4349b69f161d1b","last_reissued_at":"2026-07-05T03:37:35.187729Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:35.187729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Adam Bouland, Tudor Giurgica-Tiron","submitted_at":"2021-12-03T17:39:41Z","abstract_excerpt":"The Solovay-Kitaev algorithm is a fundamental result in quantum computation. It gives an algorithm for efficiently compiling arbitrary unitaries using universal gate sets: any unitary can be approximated by short gates sequences, whose length scales merely poly-logarithmically with accuracy. As a consequence, the choice of gate set is typically unimportant in quantum computing. However, the Solovay-Kitaev algorithm requires the gate set to be inverse-closed. It has been a longstanding open question if efficient algorithmic compilation is possible without this condition. In this work, we provid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.02040","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.02040/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":"2112.02040","created_at":"2026-07-05T03:37:35.187816+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.02040v1","created_at":"2026-07-05T03:37:35.187816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.02040","created_at":"2026-07-05T03:37:35.187816+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHLP35GMLAID","created_at":"2026-07-05T03:37:35.187816+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHLP35GMLAIDWWVX","created_at":"2026-07-05T03:37:35.187816+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHLP35GM","created_at":"2026-07-05T03:37:35.187816+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01227","citing_title":"Polynomial equivalence of the global transverse-field Ising model and the gate model of quantum computation","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2505.00683","citing_title":"Quantum Circuit Overhead","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02051","citing_title":"Sub-Cubic Quantum Gate Synthesis via Stochastic Commutator Decomposition","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA","json":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA.json","graph_json":"https://pith.science/api/pith-number/OHLP35GMLAIDWWVXEKNZT4QNWA/graph.json","events_json":"https://pith.science/api/pith-number/OHLP35GMLAIDWWVXEKNZT4QNWA/events.json","paper":"https://pith.science/paper/OHLP35GM"},"agent_actions":{"view_html":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA","download_json":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA.json","view_paper":"https://pith.science/paper/OHLP35GM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.02040&json=true","fetch_graph":"https://pith.science/api/pith-number/OHLP35GMLAIDWWVXEKNZT4QNWA/graph.json","fetch_events":"https://pith.science/api/pith-number/OHLP35GMLAIDWWVXEKNZT4QNWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA/action/storage_attestation","attest_author":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA/action/author_attestation","sign_citation":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA/action/citation_signature","submit_replication":"https://pith.science/pith/OHLP35GMLAIDWWVXEKNZT4QNWA/action/replication_record"}},"created_at":"2026-07-05T03:37:35.187816+00:00","updated_at":"2026-07-05T03:37:35.187816+00:00"}