Efficient quantum amplitude encoding of polynomial functions

Abstract

Loading functions into quantum computers represents an essential step in several quantum algorithms, such as quantum partial differential equation solvers. Therefore, the inefficiency of this process leads to a major bottleneck for the application of these algorithms. Here, we present and compare two efficient methods for the amplitude encoding of real polynomial functions on $n$ qubits. This case holds special relevance, as any continuous function on a closed interval can be uniformly approximated with arbitrary precision by a polynomial function. The first approach relies on the matrix product state representation. We study and benchmark the approximations of the target state when the bond dimension is assumed to be small. The second algorithm combines two subroutines. Initially we encode the linear function into the quantum registers with a shallow sequence of multi-controlled gates that loads the linear function's Hadamard-Walsh series, exploring how truncating the Hadamard-Walsh series of the linear function affects the final fidelity. Applying the inverse discrete Hadamard-Walsh transform transforms the series coefficients into an amplitude encoding of the linear function. Then, we use this construction as a building block to achieve a block encoding of the amplitudes corresponding to the linear function on $k_0$ qubits and apply the quantum singular value transformation that implements a polynomial transformation to the block encoding of the amplitudes. This unitary together with the Amplitude Amplification algorithm will enable us to prepare the quantum state that encodes the polynomial function on $k_0$ qubits. Finally we pad $n-k_0$ qubits to generate an approximated encoding of the polynomial on $n$ qubits, analyzing the error depending on $k_0$. In this regard, our methodology proposes a method to improve the state-of-the-art complexity by introducing controllable errors.

References in corpus (80)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Elementary gates for quantum computation
• The density-matrix renormalization group in the age of matrix product states
• Quantum algorithm for solving linear systems of equations
• Supervised learning with quantum enhanced feature spaces
• Efficient classical simulation of slightly entangled quantum computations
• Quantum computational advantage using photons
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Strong quantum computational advantage using a superconducting quantum processor
• Logical quantum processor based on reconfigurable atom arrays
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• The effect of data encoding on the expressive power of variational quantum machine learning models
• Quantum computing for finance: overview and prospects
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• A rigorous and robust quantum speed-up in supervised machine learning
• Quantum Data Fitting
• Quantum Generative Adversarial Networks for Learning and Loading Random Distributions
• Entropy scaling and simulability by Matrix Product States
• Quantum Computing for Finance: State of the Art and Future Prospects
• Sequential generation of entangled multi-qubit states
• Variational quantum algorithms for nonlinear problems
• Minimal Universal Two-qubit Quantum Circuits
• Preconditioned quantum linear system algorithm
• Quantum computing for finance
• Quantum computational finance: Monte Carlo pricing of financial derivatives
• Creating superpositions that correspond to efficiently integrable probability distributions
• Efficient quantum algorithm for dissipative nonlinear differential equations
• Option Pricing using Quantum Computers
• Real- and imaginary-time evolution with compressed quantum circuits
• Quantum algorithm for linear differential equations with exponentially improved dependence on precision
• A divide-and-conquer algorithm for quantum state preparation
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• Efficient phase-factor evaluation in quantum signal processing
• Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
• The methodology of resonant equiangular composite quantum gates
• A Quantum Inspired Approach to Exploit Turbulence Structures
• Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
• Koopman-von Neumann Approach to Quantum Simulation of Nonlinear Classical Dynamics
• Black-box quantum state preparation without arithmetic
• Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
• Preparation of matrix product states with log-depth quantum circuits
• The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
• Product Decomposition of Periodic Functions in Quantum Signal Processing
• Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering cross section of a 2D target
• Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations
• A quantum algorithm to solve nonlinear differential equations
• Towards Pricing Financial Derivatives with an IBM Quantum Computer
• Koopman wavefunctions and classical-quantum correlation dynamics
• Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations
• Multigrid Renormalization
• Quantum algorithms for approximate function loading
• Quantum Algorithms for Solving Ordinary Differential Equations via Classical Integration Methods
• Finding Angles for Quantum Signal Processing with Machine Precision
• Quantum State Preparation of Normal Distributions using Matrix Product States
• Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
• Fast Black-Box Quantum State Preparation
• Efficient Hamiltonian Simulation for Solving Option Price Dynamics
• Evolution of hybrid quantum-classical wavefunctions
• On efficient quantum block encoding of pseudo-differential operators
• Challenges for quantum computation of nonlinear dynamical systems using linear representations
• Preparing Arbitrary Continuous Functions in Quantum Registers With Logarithmic Complexity
• Transformation of quantum states using uniformly controlled rotations
• Asymptotically Optimal Circuit Depth for Quantum State Preparation and General Unitary Synthesis
• Efficient quantum algorithm for nonlinear reaction-diffusion equations and energy estimation
• Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions
• Black-Box Quantum State Preparation with Inverse Coefficients
• Decomposition of Matrix Product States into Shallow Quantum Circuits
• Nonlinear transformation of complex amplitudes via quantum singular value transformation
• A Generalized Quantum Inner Product and Applications to Financial Engineering
• State preparation based on quantum phase estimation
• Mixed Quantum-Semiclassical Simulation
• A CS guide to the quantum singular value transformation
• Efficient Quantum State Preparation with Walsh Series
• Non-Linear Transformations of Quantum Amplitudes: Exponential Improvement, Generalization, and Applications
• Entanglement Properties of Quantum Superpositions of Smooth, Differentiable Functions
• Embedding classical dynamics in a quantum computer

Cited by in corpus (18)

• Simulating fluid flows with quantum computing
• Compact quantum algorithms for time-dependent differential equations
• Boundary Treatment for Variational Quantum Simulations of Partial Differential Equations on Quantum Computers
• Quantum state preparation for multivariate functions
• Image Classification with Rotation-Invariant Variational Quantum Circuits
• Quantum Carleman linearisation efficiency in nonlinear fluid dynamics
• Quantum smoothed particle hydrodynamics algorithm inspired by quantum walks
• The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
• Efficient explicit circuit for quantum state preparation of piecewise continuous functions
• QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation
• A Quantum-Inspired Algorithm for Wave Simulation Using Tensor Networks
• An Efficient Decomposition of the Carleman Linearized Burgers' Equation
• Quantum state preparation via piecewise QSVT
• Quantum approximated cloning-assisted density matrix exponentiation
• Sublinear Classical-to-Quantum Data Encoding using $n$-Toffoli Gates
• Pseudospectral method for solving PDEs using Matrix Product States
• Quantum Encoding of Structured Data with Matrix Product States
• A Quantum Genetic Algorithm with application to Cosmological Parameters Estimation