{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Z7JQOSJYFTDSCKRICE64DT4CO6","short_pith_number":"pith:Z7JQOSJY","schema_version":"1.0","canonical_sha256":"cfd30749382cc7212a28113dc1cf827783b722f4265e674db9c0dd77329d868d","source":{"kind":"arxiv","id":"1409.4355","version":2},"attestation_state":"computed","paper":{"title":"Optimal ancilla-free Clifford+V approximation of z-rotations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Neil J. Ross","submitted_at":"2014-09-15T18:09:08Z","abstract_excerpt":"We describe a new efficient algorithm to approximate z-rotations by ancilla-free Clifford+V circuits, up to a given precision epsilon. Our algorithm is optimal in the presence of an oracle for integer factoring: it outputs the shortest Clifford+V circuit solving the given problem instance. In the absence of such an oracle, our algorithm is still near-optimal, producing circuits of V-count m + O(log(log(1/epsilon))), where m is the V-count of the third-to-optimal solution. A restricted version of the algorithm approximates z-rotations in the Pauli+V gate set. Our method is based on previous wor"},"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":"1409.4355","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-09-15T18:09:08Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"5dcb563791509fb9bd6d37fbd253e04bb093957ddd1855501adf2366827b782e","abstract_canon_sha256":"d4418e565a2d3c6721737ef8e92ce77ef727afce9b7e8642d826350c099d008f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:49.225675Z","signature_b64":"ADbeQgpgKEWjhBpAGSg7n5uPOT9Q5lYZy/H7koA9Wvy5OnTmZILxDklI3lVrr/PFTnh8qhBQrSPv3gYQTip6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfd30749382cc7212a28113dc1cf827783b722f4265e674db9c0dd77329d868d","last_reissued_at":"2026-05-18T01:30:49.225219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:49.225219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal ancilla-free Clifford+V approximation of z-rotations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Neil J. Ross","submitted_at":"2014-09-15T18:09:08Z","abstract_excerpt":"We describe a new efficient algorithm to approximate z-rotations by ancilla-free Clifford+V circuits, up to a given precision epsilon. Our algorithm is optimal in the presence of an oracle for integer factoring: it outputs the shortest Clifford+V circuit solving the given problem instance. In the absence of such an oracle, our algorithm is still near-optimal, producing circuits of V-count m + O(log(log(1/epsilon))), where m is the V-count of the third-to-optimal solution. A restricted version of the algorithm approximates z-rotations in the Pauli+V gate set. Our method is based on previous wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4355","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":""},"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":"1409.4355","created_at":"2026-05-18T01:30:49.225297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.4355v2","created_at":"2026-05-18T01:30:49.225297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4355","created_at":"2026-05-18T01:30:49.225297+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7JQOSJYFTDS","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7JQOSJYFTDSCKRI","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7JQOSJY","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.06076","citing_title":"Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z7JQOSJYFTDSCKRICE64DT4CO6","json":"https://pith.science/pith/Z7JQOSJYFTDSCKRICE64DT4CO6.json","graph_json":"https://pith.science/api/pith-number/Z7JQOSJYFTDSCKRICE64DT4CO6/graph.json","events_json":"https://pith.science/api/pith-number/Z7JQOSJYFTDSCKRICE64DT4CO6/events.json","paper":"https://pith.science/paper/Z7JQOSJY"},"agent_actions":{"view_html":"https://pith.science/pith/Z7JQOSJYFTDSCKRICE64DT4CO6","download_json":"https://pith.science/pith/Z7JQOSJYFTDSCKRICE64DT4CO6.json","view_paper":"https://pith.science/paper/Z7JQOSJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.4355&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7JQOSJYFTDSCKRICE64DT4CO6/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7JQOSJYFTDSCKRICE64DT4CO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7JQOSJYFTDSCKRICE64DT4CO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7JQOSJYFTDSCKRICE64DT4CO6/action/storage_attestation","attest_author":"https://pith.science/pith/Z7JQOSJYFTDSCKRICE64DT4CO6/action/author_attestation","sign_citation":"https://pith.science/pith/Z7JQOSJYFTDSCKRICE64DT4CO6/action/citation_signature","submit_replication":"https://pith.science/pith/Z7JQOSJYFTDSCKRICE64DT4CO6/action/replication_record"}},"created_at":"2026-05-18T01:30:49.225297+00:00","updated_at":"2026-05-18T01:30:49.225297+00:00"}