{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OAP7VDVHWHKXYH3HQ77RBBJW7F","short_pith_number":"pith:OAP7VDVH","canonical_record":{"source":{"id":"1303.1411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-03-06T18:23:56Z","cross_cats_sorted":[],"title_canon_sha256":"dbfc52ce9c30319ff185bb12945472f5c9f33b30cf10f5d03555643b74c83b9e","abstract_canon_sha256":"034255fe66dd9620f6ebe90918a7ba8f385d84afe6a45e13161ca09e743ce54d"},"schema_version":"1.0"},"canonical_sha256":"701ffa8ea7b1d57c1f6787ff108536f957de2d951d0d02cbc38b63f6141a7510","source":{"kind":"arxiv","id":"1303.1411","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1411","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1411v1","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1411","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"OAP7VDVHWHKX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OAP7VDVHWHKXYH3H","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OAP7VDVH","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OAP7VDVHWHKXYH3HQ77RBBJW7F","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-03-06T18:23:56Z","cross_cats_sorted":[],"title_canon_sha256":"dbfc52ce9c30319ff185bb12945472f5c9f33b30cf10f5d03555643b74c83b9e","abstract_canon_sha256":"034255fe66dd9620f6ebe90918a7ba8f385d84afe6a45e13161ca09e743ce54d"},"schema_version":"1.0"},"canonical_sha256":"701ffa8ea7b1d57c1f6787ff108536f957de2d951d0d02cbc38b63f6141a7510","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:33.979863Z","signature_b64":"ztc9aLD4P3EEkUM9l6nYH0rtpggi8mqLqAMe/sQfRVsigOLPsBHNGsHID1IGqZ81N9fsxGy40OQtAFTpfpCgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"701ffa8ea7b1d57c1f6787ff108536f957de2d951d0d02cbc38b63f6141a7510","last_reissued_at":"2026-05-18T03:17:33.978908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:33.978908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1411","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-18T03:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RgdUI8X2NvRd8LseoMARIxkruVH2q+DP8dpM430+OQqH3MDsN/owZY4yxyBvljBEX02dSucHQ5kWoiCyPIjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:22:49.352392Z"},"content_sha256":"e4f81945b4a26d0b4c0bea1dca6c52084ad00df285f05fe26d212d8543cf4139","schema_version":"1.0","event_id":"sha256:e4f81945b4a26d0b4c0bea1dca6c52084ad00df285f05fe26d212d8543cf4139"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OAP7VDVHWHKXYH3HQ77RBBJW7F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Decomposition of Single-Qubit Gates into $V$ Basis Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alex Bocharov, Krysta M. Svore, Yuri Gurevich","submitted_at":"2013-03-06T18:23:56Z","abstract_excerpt":"We develop the first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal $V$ basis. The $V$ basis is an alternative universal basis to the more commonly studied $\\{H,T\\}$ basis. We propose two classical algorithms for quantum circuit compilation: the first algorithm has expected polynomial time (in precision $\\log(1/\\epsilon)$) and offers a depth/precision guarantee that improves upon state-of-the-art methods for compiling into the $\\{H,T\\}$ basis by factors ranging from 1.86 to $\\log_2(5)$. The second algorithm is analogous to direct search and yi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1411","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-18T03:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+19ZeBsTAmo6aNIWb5ssL+xLtlT6Po4mOhnrqPT5nHnw0VRyInykNrmUeb7No5vmeaUoDcmeRODhJ4ors7JDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:22:49.352748Z"},"content_sha256":"9319fba9a787362947eca9c5c6e6da0a24f4a999b8ba5ac6f8c349f18eea9347","schema_version":"1.0","event_id":"sha256:9319fba9a787362947eca9c5c6e6da0a24f4a999b8ba5ac6f8c349f18eea9347"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAP7VDVHWHKXYH3HQ77RBBJW7F/bundle.json","state_url":"https://pith.science/pith/OAP7VDVHWHKXYH3HQ77RBBJW7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAP7VDVHWHKXYH3HQ77RBBJW7F/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-05T15:22:49Z","links":{"resolver":"https://pith.science/pith/OAP7VDVHWHKXYH3HQ77RBBJW7F","bundle":"https://pith.science/pith/OAP7VDVHWHKXYH3HQ77RBBJW7F/bundle.json","state":"https://pith.science/pith/OAP7VDVHWHKXYH3HQ77RBBJW7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAP7VDVHWHKXYH3HQ77RBBJW7F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OAP7VDVHWHKXYH3HQ77RBBJW7F","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":"034255fe66dd9620f6ebe90918a7ba8f385d84afe6a45e13161ca09e743ce54d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-03-06T18:23:56Z","title_canon_sha256":"dbfc52ce9c30319ff185bb12945472f5c9f33b30cf10f5d03555643b74c83b9e"},"schema_version":"1.0","source":{"id":"1303.1411","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1411","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1411v1","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1411","created_at":"2026-05-18T03:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"OAP7VDVHWHKX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OAP7VDVHWHKXYH3H","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OAP7VDVH","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:9319fba9a787362947eca9c5c6e6da0a24f4a999b8ba5ac6f8c349f18eea9347","target":"graph","created_at":"2026-05-18T03:17:33Z","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 develop the first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal $V$ basis. The $V$ basis is an alternative universal basis to the more commonly studied $\\{H,T\\}$ basis. We propose two classical algorithms for quantum circuit compilation: the first algorithm has expected polynomial time (in precision $\\log(1/\\epsilon)$) and offers a depth/precision guarantee that improves upon state-of-the-art methods for compiling into the $\\{H,T\\}$ basis by factors ranging from 1.86 to $\\log_2(5)$. The second algorithm is analogous to direct search and yi","authors_text":"Alex Bocharov, Krysta M. Svore, Yuri Gurevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-03-06T18:23:56Z","title":"Efficient Decomposition of Single-Qubit Gates into $V$ Basis Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1411","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:e4f81945b4a26d0b4c0bea1dca6c52084ad00df285f05fe26d212d8543cf4139","target":"record","created_at":"2026-05-18T03:17:33Z","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":"034255fe66dd9620f6ebe90918a7ba8f385d84afe6a45e13161ca09e743ce54d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-03-06T18:23:56Z","title_canon_sha256":"dbfc52ce9c30319ff185bb12945472f5c9f33b30cf10f5d03555643b74c83b9e"},"schema_version":"1.0","source":{"id":"1303.1411","kind":"arxiv","version":1}},"canonical_sha256":"701ffa8ea7b1d57c1f6787ff108536f957de2d951d0d02cbc38b63f6141a7510","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"701ffa8ea7b1d57c1f6787ff108536f957de2d951d0d02cbc38b63f6141a7510","first_computed_at":"2026-05-18T03:17:33.978908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:33.978908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ztc9aLD4P3EEkUM9l6nYH0rtpggi8mqLqAMe/sQfRVsigOLPsBHNGsHID1IGqZ81N9fsxGy40OQtAFTpfpCgAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:33.979863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1411","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4f81945b4a26d0b4c0bea1dca6c52084ad00df285f05fe26d212d8543cf4139","sha256:9319fba9a787362947eca9c5c6e6da0a24f4a999b8ba5ac6f8c349f18eea9347"],"state_sha256":"06f5356783e5d39d9a4a336ee36456cec54a585499f5e7b96f7b4fec9dec9038"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlhIV/lncS4DHSNUx2re/eEGGzpy8vacmtV2TxMHnQe9S44yeAFE1JxHYlG4fwi5yp+/zLuWDz1pMNeY2R8aBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:22:49.354740Z","bundle_sha256":"911e1c87811be405b1c3072a8f837c10be77fc2aafd8334b97a0cc8099a619c8"}}