vix.ing · top · new · best · stats · spec

Efficient Floating-Point Arithmetic on Fault-Tolerant Quantum Computers

2025/10/23 by José E. Cruz Serrallés, Oluwadara Ogunkoya, Serrallés, José E. Cruz +12
Computer Science · #FOS: Physical sciences #Polynomial and algebraic computation #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.2510.20145

openalex publication_date 2025/10/23 · openalex created_date 2025/10/25 · openalex updated_date 2026/07/28

Abstract

We propose a novel floating-point encoding scheme that builds on prior work involving fixed-point encodings. We encode floating-point numbers using Two's Complement fixed-point mantissas and Two's Complement integral exponents. We used our proposed approach to develop quantum algorithms for fundamental arithmetic operations, such as bit-shifting, reciprocation, multiplication, and addition. We prototyped and investigated the performance of the floating-point encoding scheme on quantum computer simulations by performing reciprocation on randomly drawn inputs and by solving first-order ordinary differential equations, while varying the number of qubits in the encoding. We observed rapid convergence to the exact solutions as we increased the number of qubits and a significant reduction in the number of ancilla qubits required for reciprocation when compared with similar approaches.

Citations

Related