Efficient explicit circuit for quantum state preparation of piecewise continuous functions

Abstract

Efficiently uploading data into quantum states is essential for many quantum algorithms to achieve advantage across various applications. In this paper, we address this challenge by developing a method to upload a polynomial function $f(x)$ on the interval $x\in [-1,1]$ into a pure quantum state consisting of qubits, where a discretized $f(x)$ is the amplitude of this state. The preparation cost has $\mathcal{O}(n\log n)$ scaling in the number of qubits $n$ and linear scaling with the degree of the polynomial $Q$. This efficiency allows the preparation of states whose amplitudes correspond to high-degree polynomials (up to $10^4$), enabling accurate approximation of functions that admit efficient polynomial series representations and whose amplitude profiles are not extremely localized. We provide a fully explicit circuit realization, based on four real polynomials that meet specific parity and boundedness conditions. We extend this construction to cover piece-wise polynomial functions, a case not previously addressed explicitly in the literature, the algorithm scaling linearly with the number of piecewise parts. Our method achieves efficient quantum circuit implementation and we present detailed gate counting and resource analysis.

19 pages, 9 figures, 2 tables

References in corpus (26)

• Quantum Machine Learning
• Simulated Quantum Computation of Molecular Energies
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• On the relationship between continuous- and discrete-time quantum walk
• Quantum-state preparation with universal gate decompositions
• Minimal Universal Two-qubit Quantum Circuits
• Option Pricing using Quantum Computers
• Quantum algorithm and circuit design solving the Poisson equation
• Quantum Algorithm for Simulating the Wave Equation
• Quantum circuits with uniformly controlled one-qubit gates
• Efficient phase-factor evaluation in quantum signal processing
• Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions
• Quantum simulation of partial differential equations via Schrodingerisation: technical details
• Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering cross section of a 2D target
• Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations
• Quantum algorithms: A survey of applications and end-to-end complexities
• Configurable sublinear circuits for quantum state preparation
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis
• Efficient quantum amplitude encoding of polynomial functions
• A brief introduction to quantum algorithms
• Low-rank quantum state preparation
• Depth analysis of variational quantum algorithms for heat equation
• Efficient Hamiltonian Simulation for Solving Option Price Dynamics
• On efficient quantum block encoding of pseudo-differential operators
• Infinite quantum signal processing
• Quantum state preparation for multivariate functions

Cited by in corpus (2)

• Quantum Framework for Simulating Linear PDEs with Robin Boundary Conditions
• An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations