Fast, in-place, and ancilla-free quantum algorithms for integer multiplication and inversion
David Halpenny, Adithya Sireesh, Petros Wallden
Abstract
Arithmetic operations are a fundamental building block in the design of quantum algorithms, with their implementation cost expected to have a significant impact on the viability of a wide variety of quantum applications. In this work, we present novel algorithms for a number of in-place quantum arithmetic operations that are highly efficient in terms of their space and gate count overheads compared to the current state-of-the-art. We show that in-place modular multiplication of integers, modulo a power of two, can be performed with either a classical or quantum odd multiplier using O(n1+ε) gates and no ancilla qubits, for any ε>0. We then show that standard in-place integer multiplication can be performed with a non-zero classical or quantum multiplier using O(n1+ε) gates for any ε>0, with no ancilla qubits required for the classical multiplier and a logarithmic number of ancilla qubits for the quantum. Using our quantum modular multiplication algorithm, we also show that in-place modular inversion, modulo a power of two, can be performed using O(n1+ε) gates and no ancilla qubits, for any ε>0. To our knowledge, these are the first quantum algorithms achieving both subquadratic gate counts and sublinear ancilla counts for each of the considered in-place operations. All but one of these fast operations are optimal in terms of memory, only requiring enough space to store the output of the operation, which overwrites the input directly. We present our multiplication algorithms as consequences of a single unified theorem, which may find further application within quantum arithmetic.
Create a lesson
Related papers
High-temperature Gibbs states are uniformly Markovian and trivial
Andrew D. Kim, Tai Hsuan Yang, Jong Yeon Lee
Query-Optimal Quantum Minimum Finding from Numerical Estimators
Egil Bae
High-Accuracy Neural-Network Quantum States via Randomized Real-Time Dynamics
John M. Martyn, Rod Rofougaran, Samuel Stein et al.
End-to-End Quantum Algorithm for Differential Equations: Application to Simulating a Biomolecular System
Mohsen Bagherimehrab, Daniyaal Farooqi, Gavin K. Brennen et al.
Classically Trained Quantum Generative Models with Shared Training and Fine Tuning for Quantum Matter
Mario Herrero-Gonzalez, Elham Kashefi, Mina Doosti
Classical Oracle Separation of QMA from the QCMA Hierarchy and Quantum Cryptography Even When P = QCMA
Alper Cakan