Optimizing Quantum Circuits for Arithmetic
arXiv:1805.12445
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.
References in corpus (2)
Cited by in corpus (13)
- Quantum Risk Analysis
- Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
- Black-box quantum state preparation without arithmetic
- Quantum data compression by principal component analysis
- Enhancing the Quantum Linear Systems Algorithm using Richardson Extrapolation
- The Efficient Preparation of Normal Distributions in Quantum Registers
- Quantum Differentially Private Sparse Regression Learning
- Quantum circuits design for evaluating transcendental functions based on a function-value binary expansion method
- Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
- Quantum Monte Carlo for Economics: Stress Testing and Macroeconomic Deep Learning
- A quantum circuit simulator and its applications on Sunway TaihuLight supercomputer
- Fast digital methods for adiabatic state preparation
- Quantum Algorithms for Unsupervised Machine Learning and Neural Networks