Optimizing Quantum Circuits for Arithmetic
read the original abstract
Many quantum algorithms make use of oracles which evaluate classical functions on a superposition of inputs. In order to facilitate implementation, testing, and resource estimation of such algorithms, we present quantum circuits for evaluating functions that are often encountered in the quantum algorithm literature. This includes Gaussians, hyperbolic tangent, sine/cosine, inverse square root, arcsine, and exponentials. We use insights from classical high-performance computing in order to optimize our circuits and implement a quantum software stack module which allows to automatically generate circuits for evaluating piecewise smooth functions in the computational basis. Our circuits enable more detailed cost analyses of various quantum algorithms, allowing to identify concrete applications of future quantum computing devices. Furthermore, our resource estimates may guide future research aiming to reduce the costs or even the need for arithmetic in the computational basis altogether.
This paper has not been read by Pith yet.
Forward citations
Cited by 10 Pith papers
-
Quantum Solvers for Nonlinear Matrix Equations in Quantum Chemistry
Quantum algorithm block-encodes Riccati solutions for m-particle m-hole RPA using Riesz projectors and QSVT, claiming linear system-size scaling under sparsity and polynomial cost in excitation rank m.
-
Coherent Rollout Oracles for Finite-Horizon Sequential Decision Problems
A coherent quantum rollout oracle is built from O(Nw)-gate rank-select circuits with proven optimality, delivering O(sqrt(k)/eps) query complexity for planning problems and formally verified in Lean.
-
Quantum algorithm for solving high-dimensional linear stochastic differential equations via amplitude encoding of the noise term
Quantum algorithms achieve polylog(N) complexity for high-dimensional linear SDEs by amplitude-encoding the solution and noise via Dyson series or Euler-Maruyama approximations plus quantum linear systems solvers.
-
Quantum simulation of electronic structure via quantum fast multipole method
Quantum fast multipole method yields electronic structure simulation gate complexity t(η^{4/3}N^{1/3} + η^{1/3}N^{2/3})(η N t / ε)^{o(1)}, providing roughly O(η) speedup over prior work for N < η^7.
-
Quantum CORDIC -- Arcsine on a Budget
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.
-
Boundary-Aware QFT Block-Encoding of Fractional Laplacians
The paper presents a zero-padding method to make QFT block-encodings match open-boundary Toeplitz truncations of fractional Laplacians instead of periodic circulant surrogates.
-
An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics
An oracle-free Trotter-based quantum algorithm for nonadiabatic molecular dynamics achieves circuit depth advantages over QROM architectures and retains T-gate scalability compared to quantum signal processing.
-
Automatic De-Quantization of Quantum Programs Using Constant Propagation
Hybrid quantum-classical constant propagation reduces multi-qubit quantum operations by propagating constants between quantum and classical program states.
-
Phase-Fidelity-Aware Truncated Quantum Fourier Transform for Scalable Phase Estimation on NISQ Hardware
A hardware-calibrated truncated QFT reduces gate count 31-44% at 30 qubits while bounding total variation distance error by O(2^{-d}) and outperforming full QFT under moderate noise.
-
SparQSim: Simulating Scalable Quantum Algorithms via Sparse Quantum State Representations
SparQSim is a sparse-state quantum simulator in C++ supporting QRAM that outperforms dense Schrödinger simulators on high-sparsity benchmark circuits and produces consistent results for quantum linear system solvers.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.