{"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"}