{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N4QYN7D7UF2CLTW3TYI63QBA5R","short_pith_number":"pith:N4QYN7D7","schema_version":"1.0","canonical_sha256":"6f2186fc7fa17425cedb9e11edc020ec5ba518cffb719697c518aee9c9965c7d","source":{"kind":"arxiv","id":"2404.05618","version":4},"attestation_state":"computed","paper":{"title":"Single-qubit rotation algorithm with logarithmic Toffoli count and gate depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christoffer Hindlycke, Jan-{\\AA}ke Larsson","submitted_at":"2024-04-08T15:46:56Z","abstract_excerpt":"We propose a direct (non-recursive) algorithm for applying a rotation $R_{\\theta^\\ast}$, $\\epsilon$-close to a desired rotation $R_\\theta$, to a single qubit using the Clifford+Toffoli gate set. Our algorithm does not rely on repeatedly applying a fixed rotation, but immediately applies $R_{\\theta^\\ast}$. It succeeds with probability strictly greater than $1/2$, has an expected number of repetitions strictly less than 2, expected Toffoli count logarithmic in $\\tfrac{1}{\\epsilon}$, and expected gate depth also logarithmic in $\\tfrac{1}{\\epsilon}$."},"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":"2404.05618","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-04-08T15:46:56Z","cross_cats_sorted":[],"title_canon_sha256":"0feeaac9e62c6480f2e2915dbeaa158dc67cbde55126f6a99c0f99fcf315ca0d","abstract_canon_sha256":"09edbe293f2cddc0e39e50a45c2d7ab694b7b36a2876ab2c555daef69758fc2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:53.396323Z","signature_b64":"4RjbvixRgFl47FRfuaOwkdrhBJliWKWh5JTR9Y6kHZvRWibSz+sj9coCUgePJLO1fTXRLlCDTk8l9Z9ZsK9CBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f2186fc7fa17425cedb9e11edc020ec5ba518cffb719697c518aee9c9965c7d","last_reissued_at":"2026-07-05T09:27:53.395842Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:53.395842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single-qubit rotation algorithm with logarithmic Toffoli count and gate depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christoffer Hindlycke, Jan-{\\AA}ke Larsson","submitted_at":"2024-04-08T15:46:56Z","abstract_excerpt":"We propose a direct (non-recursive) algorithm for applying a rotation $R_{\\theta^\\ast}$, $\\epsilon$-close to a desired rotation $R_\\theta$, to a single qubit using the Clifford+Toffoli gate set. Our algorithm does not rely on repeatedly applying a fixed rotation, but immediately applies $R_{\\theta^\\ast}$. It succeeds with probability strictly greater than $1/2$, has an expected number of repetitions strictly less than 2, expected Toffoli count logarithmic in $\\tfrac{1}{\\epsilon}$, and expected gate depth also logarithmic in $\\tfrac{1}{\\epsilon}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05618","kind":"arxiv","version":4},"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/2404.05618/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":"2404.05618","created_at":"2026-07-05T09:27:53.395898+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.05618v4","created_at":"2026-07-05T09:27:53.395898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05618","created_at":"2026-07-05T09:27:53.395898+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4QYN7D7UF2C","created_at":"2026-07-05T09:27:53.395898+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4QYN7D7UF2CLTW3","created_at":"2026-07-05T09:27:53.395898+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4QYN7D7","created_at":"2026-07-05T09:27:53.395898+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/N4QYN7D7UF2CLTW3TYI63QBA5R","json":"https://pith.science/pith/N4QYN7D7UF2CLTW3TYI63QBA5R.json","graph_json":"https://pith.science/api/pith-number/N4QYN7D7UF2CLTW3TYI63QBA5R/graph.json","events_json":"https://pith.science/api/pith-number/N4QYN7D7UF2CLTW3TYI63QBA5R/events.json","paper":"https://pith.science/paper/N4QYN7D7"},"agent_actions":{"view_html":"https://pith.science/pith/N4QYN7D7UF2CLTW3TYI63QBA5R","download_json":"https://pith.science/pith/N4QYN7D7UF2CLTW3TYI63QBA5R.json","view_paper":"https://pith.science/paper/N4QYN7D7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.05618&json=true","fetch_graph":"https://pith.science/api/pith-number/N4QYN7D7UF2CLTW3TYI63QBA5R/graph.json","fetch_events":"https://pith.science/api/pith-number/N4QYN7D7UF2CLTW3TYI63QBA5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4QYN7D7UF2CLTW3TYI63QBA5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4QYN7D7UF2CLTW3TYI63QBA5R/action/storage_attestation","attest_author":"https://pith.science/pith/N4QYN7D7UF2CLTW3TYI63QBA5R/action/author_attestation","sign_citation":"https://pith.science/pith/N4QYN7D7UF2CLTW3TYI63QBA5R/action/citation_signature","submit_replication":"https://pith.science/pith/N4QYN7D7UF2CLTW3TYI63QBA5R/action/replication_record"}},"created_at":"2026-07-05T09:27:53.395898+00:00","updated_at":"2026-07-05T09:27:53.395898+00:00"}