{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LCJMF6W3OAKXRDJWMB4CERIPNA","short_pith_number":"pith:LCJMF6W3","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"},"canonical_sha256":"5892c2fadb7015788d36607822450f681873c9f2c49c68a02c92fc8e27998f66","source":{"kind":"arxiv","id":"1510.03888","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03888","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03888v1","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03888","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"LCJMF6W3OAKX","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LCJMF6W3OAKXRDJW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LCJMF6W3","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LCJMF6W3OAKXRDJWMB4CERIPNA","target":"record","payload":{"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"},"canonical_sha256":"5892c2fadb7015788d36607822450f681873c9f2c49c68a02c92fc8e27998f66","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"},"source_kind":"arxiv","source_id":"1510.03888","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HzPWXvcm5AMCZt7FX6qSruX/rpApmlfHDCC0eG6Fqcnl+ZmO4t9SKT7uFJx7NTrqsaApOubvV0nC4hy/HCSqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:20:44.179035Z"},"content_sha256":"bcf7c15224190973111181c12d18a442d461114a83f16d7a09dc7261c6156dd9","schema_version":"1.0","event_id":"sha256:bcf7c15224190973111181c12d18a442d461114a83f16d7a09dc7261c6156dd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LCJMF6W3OAKXRDJWMB4CERIPNA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wd5eQfR3P+qyykkG2T9vW34T9V1RS+iFwWPTHW2YWdg5JP3tv6hbr6ekEMCfaKq1vPUAyOJC+1k4PB2ydUnrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:20:44.179406Z"},"content_sha256":"72070c97be6d486a44d65f1b4faf0dc55c1e51b3379f4cc2e5e8539cdf45dffc","schema_version":"1.0","event_id":"sha256:72070c97be6d486a44d65f1b4faf0dc55c1e51b3379f4cc2e5e8539cdf45dffc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA/bundle.json","state_url":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCJMF6W3OAKXRDJWMB4CERIPNA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T09:20:44Z","links":{"resolver":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA","bundle":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA/bundle.json","state":"https://pith.science/pith/LCJMF6W3OAKXRDJWMB4CERIPNA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCJMF6W3OAKXRDJWMB4CERIPNA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LCJMF6W3OAKXRDJWMB4CERIPNA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f4ff105eafe0ba58234229f6bee2a81cf8ba9d00e8558ea350ce7a74e1a069c7","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-13T20:40:05Z","title_canon_sha256":"45581139f91ee244af8b45c545c84ebf45a6f1d64a1cc24f1957fb7952898ca5"},"schema_version":"1.0","source":{"id":"1510.03888","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03888","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03888v1","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03888","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"LCJMF6W3OAKX","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LCJMF6W3OAKXRDJW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LCJMF6W3","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:72070c97be6d486a44d65f1b4faf0dc55c1e51b3379f4cc2e5e8539cdf45dffc","target":"graph","created_at":"2026-05-18T01:30:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Alex Bocharov, Jon Yard, Martin Roetteler, Vadym Kliuchnikov","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-13T20:40:05Z","title":"A Framework for Approximating Qubit Unitaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03888","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bcf7c15224190973111181c12d18a442d461114a83f16d7a09dc7261c6156dd9","target":"record","created_at":"2026-05-18T01:30:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f4ff105eafe0ba58234229f6bee2a81cf8ba9d00e8558ea350ce7a74e1a069c7","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-13T20:40:05Z","title_canon_sha256":"45581139f91ee244af8b45c545c84ebf45a6f1d64a1cc24f1957fb7952898ca5"},"schema_version":"1.0","source":{"id":"1510.03888","kind":"arxiv","version":1}},"canonical_sha256":"5892c2fadb7015788d36607822450f681873c9f2c49c68a02c92fc8e27998f66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5892c2fadb7015788d36607822450f681873c9f2c49c68a02c92fc8e27998f66","first_computed_at":"2026-05-18T01:30:07.621307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:07.621307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Z2CS7b87YF5axTBfag9sMWoeUp1Fm3tYEiJc/6/BEtsh+xO1qzAExE4pYYYQMd9urjWbfJH+PbPBU0QYzWBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:07.621869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03888","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcf7c15224190973111181c12d18a442d461114a83f16d7a09dc7261c6156dd9","sha256:72070c97be6d486a44d65f1b4faf0dc55c1e51b3379f4cc2e5e8539cdf45dffc"],"state_sha256":"003848ac24bf182f91e97b086848ec2b50ffffa56fc069af9da0d07d922b39b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIOcQfMe0YLY+fxmaT9ODHfAD3I2xfrNjFgNiai06rrEarZJx67N0lICJQ3jBMSqd8uFHTQsXRg27h0gFqv1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:20:44.181363Z","bundle_sha256":"a723905c1a36d34fa08cc8e8ee8a27cd885b5d4c9df94b1e63eb5af673e38623"}}