Quantum algorithms for approximate function loading

Abstract

Loading classical data into quantum computers represents an essential stage in many relevant quantum algorithms, especially in the field of quantum machine learning. Therefore, the inefficiency of this loading process means a major bottleneck for the application of these algorithms. Here, we introduce two approximate quantum-state preparation methods for the NISQ era inspired by the Grover-Rudolph algorithm, which partially solve the problem of loading real functions. Indeed, by allowing for an infidelity $\epsilon$ and under certain smoothness conditions, we prove that the complexity of the implementation of the Grover-Rudolph algorithm without ancillary qubits, first introduced by Möttönen $\text{et al}$, results into $\mathcal{O}(2^{k_0(\epsilon )})$, with $n$ the number of qubits and $k_0(\epsilon )$ asymptotically independent of $n$. This leads to a dramatic reduction in the number of required two-qubit gates. Aroused by this result, we also propose a variational algorithm capable of loading functions beyond the aforementioned smoothness conditions. Our variational Ansatz is explicitly tailored to the landscape of the function, leading to a quasi-optimized number of hyperparameters. This allows us to achieve high fidelity in the loaded state with high speed convergence for the studied examples.

References in corpus (7)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• Quantum computational advantage using photons
• Strong quantum computational advantage using a superconducting quantum processor
• Quantum Data Fitting
• Quantum-state preparation with universal gate decompositions
• Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator

Cited by in corpus (22)

• Barren Plateaus in Variational Quantum Computing
• Constant-depth preparation of matrix product states with adaptive quantum circuits
• Efficient quantum amplitude encoding of polynomial functions
• Noisy intermediate-scale quantum simulation of the one-dimensional wave equation
• Sparse Quantum State Preparation for Strongly Correlated Systems
• Quantum state preparation for multivariate functions
• Quantum Carleman linearisation efficiency in nonlinear fluid dynamics
• Quantum algorithm for the Vlasov simulation of the large-scale structure formation with massive neutrinos
• Quantum Algorithm for Estimating Betti Numbers Using Cohomology Approach
• The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
• Hamiltonian Forging of a Thermofield Double
• Quantum circuits for partial differential equations in Fourier space
• Improved quantum algorithm for calculating eigenvalues of differential operators and its application to estimating the decay rate of the perturbation distribution tail in stochastic inflation
• Conditional Generative Models for Learning Stochastic Processes
• Quantum state preparation via piecewise QSVT
• Dividing quantum circuits for time evolution of stochastic processes by orthogonal series density estimation
• Sublinear Classical-to-Quantum Data Encoding using $n$-Toffoli Gates
• Quantum approximated cloning-assisted density matrix exponentiation
• Quantum algorithm for solving McKean-Vlasov stochastic differential equations
• Quantum Algorithms for State Preparation and Data Classification based on Stabilizer Codes
• Time series generation for option pricing on quantum computers using tensor network
• Nonlinear path-following via the asymptotic numerical method on a quantum processor