{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:M6DUERIPDXU7QJ3OYUS2CDCP3R","short_pith_number":"pith:M6DUERIP","schema_version":"1.0","canonical_sha256":"678742450f1de9f8276ec525a10c4fdc74743fcaf1d41cfb143a7e468898da63","source":{"kind":"arxiv","id":"2411.14434","version":3},"attestation_state":"computed","paper":{"title":"Quantum CORDIC -- Arcsine on a Budget","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A reversible quantum CORDIC algorithm computes the arcsine function using O(n) qubits for n-bit precision.","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Iain Burge, Joaquin Garcia-Alfaro, Michel Barbeau","submitted_at":"2024-11-02T11:00:58Z","abstract_excerpt":"This work introduces a quantum algorithm for computing the function arcsine, with arbitrary accuracy. We leverage a technique from embedded computing and field-programmable gate arrays, called COordinate Rotation DIgital Computer (CORDIC). CORDIC is a family of iterative algorithms that, in a classical context, can approximate various trigonometric, hyperbolic, and elementary functions using only bit shifts and additions. Adapting CORDIC to the quantum context is non-trivial, as the algorithm traditionally uses several non-reversible operations. We detail a method for CORDIC that avoids such n"},"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":true},"canonical_record":{"source":{"id":"2411.14434","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-02T11:00:58Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"4d925a70573100a1b40dff4590f5180b5eb2bbb1a2893fff55d2432bc066b923","abstract_canon_sha256":"e712baa816396313870fa287e216d63f43b4a4d8c857bc7c65f749d213e21cb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T01:36:12.128602Z","signature_b64":"oJnBesIShW3gLVwh1rqiwwoGcuzZYLqZp3IeAPTxFQpGNVoVy6ozlXFwBBINLx9vLjJomWbHUeapIjcwZYOGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"678742450f1de9f8276ec525a10c4fdc74743fcaf1d41cfb143a7e468898da63","last_reissued_at":"2026-08-05T01:36:12.127069Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T01:36:12.127069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum CORDIC -- Arcsine on a Budget","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A reversible quantum CORDIC algorithm computes the arcsine function using O(n) qubits for n-bit precision.","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Iain Burge, Joaquin Garcia-Alfaro, Michel Barbeau","submitted_at":"2024-11-02T11:00:58Z","abstract_excerpt":"This work introduces a quantum algorithm for computing the function arcsine, with arbitrary accuracy. We leverage a technique from embedded computing and field-programmable gate arrays, called COordinate Rotation DIgital Computer (CORDIC). CORDIC is a family of iterative algorithms that, in a classical context, can approximate various trigonometric, hyperbolic, and elementary functions using only bit shifts and additions. Adapting CORDIC to the quantum context is non-trivial, as the algorithm traditionally uses several non-reversible operations. We detail a method for CORDIC that avoids such n"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For n bits of precision, our method has space complexity of order n qubits, a layer count in the order of n times log n, and a CNOT count in the order of n squared.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The non-reversible operations traditionally present in classical CORDIC can be replaced by fully reversible quantum equivalents while preserving the stated asymptotic resource counts (abstract, paragraph on adapting CORDIC to quantum context).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A reversible quantum CORDIC algorithm computes arcsine using O(n) qubits, O(n log n) layers, and O(n²) CNOT gates for n-bit precision.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A reversible quantum CORDIC algorithm computes the arcsine function using O(n) qubits for n-bit precision.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ca1994f79167cc5600a291d413d979db457ae4a2aa41a0311a41be9543a53a81"},"source":{"id":"2411.14434","kind":"arxiv","version":3},"verdict":{"id":"35b7bbc6-de90-4fb4-b3a9-b68a273a52e2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-23T17:57:50.057195Z","strongest_claim":"For n bits of precision, our method has space complexity of order n qubits, a layer count in the order of n times log n, and a CNOT count in the order of n squared.","one_line_summary":"A reversible quantum CORDIC algorithm computes arcsine using O(n) qubits, O(n log n) layers, and O(n²) CNOT gates for n-bit precision.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The non-reversible operations traditionally present in classical CORDIC can be replaced by fully reversible quantum equivalents while preserving the stated asymptotic resource counts (abstract, paragraph on adapting CORDIC to quantum context).","pith_extraction_headline":"A reversible quantum CORDIC algorithm computes the arcsine function using O(n) qubits for n-bit precision."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14434/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":2,"snapshot_sha256":"39233bf33d6983b4ca96c3dd27bc4277454dd6b7f9292f427ff0dedb0e5b568e"},"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":"2411.14434","created_at":"2026-08-05T01:36:12.127509+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14434v3","created_at":"2026-08-05T01:36:12.127509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14434","created_at":"2026-08-05T01:36:12.127509+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6DUERIPDXU7","created_at":"2026-08-05T01:36:12.127509+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6DUERIPDXU7QJ3O","created_at":"2026-08-05T01:36:12.127509+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6DUERIP","created_at":"2026-08-05T01:36:12.127509+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.16719","citing_title":"Fullqubit alchemist: Quantum algorithm for alchemical free energy calculations","ref_index":111,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R","json":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R.json","graph_json":"https://pith.science/api/pith-number/M6DUERIPDXU7QJ3OYUS2CDCP3R/graph.json","events_json":"https://pith.science/api/pith-number/M6DUERIPDXU7QJ3OYUS2CDCP3R/events.json","paper":"https://pith.science/paper/M6DUERIP"},"agent_actions":{"view_html":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R","download_json":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R.json","view_paper":"https://pith.science/paper/M6DUERIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14434&json=true","fetch_graph":"https://pith.science/api/pith-number/M6DUERIPDXU7QJ3OYUS2CDCP3R/graph.json","fetch_events":"https://pith.science/api/pith-number/M6DUERIPDXU7QJ3OYUS2CDCP3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R/action/storage_attestation","attest_author":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R/action/author_attestation","sign_citation":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R/action/citation_signature","submit_replication":"https://pith.science/pith/M6DUERIPDXU7QJ3OYUS2CDCP3R/action/replication_record"}},"created_at":"2026-08-05T01:36:12.127509+00:00","updated_at":"2026-08-05T01:36:12.127509+00:00"}