{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LCJMF6W3OAKXRDJWMB4CERIPNA","short_pith_number":"pith:LCJMF6W3","schema_version":"1.0","canonical_sha256":"5892c2fadb7015788d36607822450f681873c9f2c49c68a02c92fc8e27998f66","source":{"kind":"arxiv","id":"1510.03888","version":1},"attestation_state":"computed","paper":{"title":"A Framework for Approximating Qubit Unitaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alex Bocharov, Jon Yard, Martin Roetteler, Vadym Kliuchnikov","submitted_at":"2015-10-13T20:40:05Z","abstract_excerpt":"We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\\varepsilon$-approximations using circuits of length $O(\\log(1/\\varepsilon))$, which is asymptotically optimal. The algorithm achieves the same quality of approximation as previously-known algorithms for Clifford+T [arXiv:1212.6253], V-basis [arXiv:1303.1411] and Clifford+$\\pi/12$ [arXiv:1409.3552], running on average in time polynomial in $O(\\log(1/\\varepsilon))$ (conditional on a number-theoretic conjecture). Ours is the first such algorithm "},"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":"1510.03888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-13T20:40:05Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"45581139f91ee244af8b45c545c84ebf45a6f1d64a1cc24f1957fb7952898ca5","abstract_canon_sha256":"f4ff105eafe0ba58234229f6bee2a81cf8ba9d00e8558ea350ce7a74e1a069c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:07.621869Z","signature_b64":"4Z2CS7b87YF5axTBfag9sMWoeUp1Fm3tYEiJc/6/BEtsh+xO1qzAExE4pYYYQMd9urjWbfJH+PbPBU0QYzWBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5892c2fadb7015788d36607822450f681873c9f2c49c68a02c92fc8e27998f66","last_reissued_at":"2026-05-18T01:30:07.621307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:07.621307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework for Approximating Qubit Unitaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alex Bocharov, Jon Yard, Martin Roetteler, Vadym Kliuchnikov","submitted_at":"2015-10-13T20:40:05Z","abstract_excerpt":"We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\\varepsilon$-approximations using circuits of length $O(\\log(1/\\varepsilon))$, which is asymptotically optimal. The algorithm achieves the same quality of approximation as previously-known algorithms for Clifford+T [arXiv:1212.6253], V-basis [arXiv:1303.1411] and Clifford+$\\pi/12$ [arXiv:1409.3552], running on average in time polynomial in $O(\\log(1/\\varepsilon))$ (conditional on a number-theoretic conjecture). Ours is the first such algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03888","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":""},"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":"1510.03888","created_at":"2026-05-18T01:30:07.621411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03888v1","created_at":"2026-05-18T01:30:07.621411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03888","created_at":"2026-05-18T01:30:07.621411+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCJMF6W3OAKX","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCJMF6W3OAKXRDJW","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCJMF6W3","created_at":"2026-05-18T12:29:29.992203+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/LCJMF6W3OAKXRDJWMB4CERIPNA","json":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA.json","graph_json":"https://pith.science/api/pith-number/LCJMF6W3OAKXRDJWMB4CERIPNA/graph.json","events_json":"https://pith.science/api/pith-number/LCJMF6W3OAKXRDJWMB4CERIPNA/events.json","paper":"https://pith.science/paper/LCJMF6W3"},"agent_actions":{"view_html":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA","download_json":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA.json","view_paper":"https://pith.science/paper/LCJMF6W3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03888&json=true","fetch_graph":"https://pith.science/api/pith-number/LCJMF6W3OAKXRDJWMB4CERIPNA/graph.json","fetch_events":"https://pith.science/api/pith-number/LCJMF6W3OAKXRDJWMB4CERIPNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA/action/storage_attestation","attest_author":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA/action/author_attestation","sign_citation":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA/action/citation_signature","submit_replication":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA/action/replication_record"}},"created_at":"2026-05-18T01:30:07.621411+00:00","updated_at":"2026-05-18T01:30:07.621411+00:00"}