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 inspired by the Grover-Rudolph algorithm, which partially solve the problem of loading real functions. Indeed, by allowing for an infidelity and under certain smoothness conditions, we prove that the complexity of Grover-Rudolph algorithm can be reduced from O(2 n ) to O(2 k 0 ( ) ), with n the number of qubits and k 0 ( ) 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.

Quantum algorithm for calculating risk contributions in a credit portfolio

“…Some implementations for this type of oracle have been proposed. Originally, the implementation as a series of arithmetic circuits and controlled rotation was proposed in [53], and some extensions and modifications on this have been also proposed recently [54][55][56]. In another direction, some state preparation methods based on variational algorithms with parametric quantum circuits have been considered [57][58][59][60][61].…”

Covariance matrix preparation for quantum principal component analysis

“…For a classical dataset, we can imagine that the y (i) vectors (defined above) are encoded in the |ψ (i) states through an amplitude encoding procedure. There is a large body of literature on amplitude encoding [10][11][12][13][14], including near-term approaches [15][16][17], and hence we refer the reader to this literature. Hence, in what follows, we can restrict to datasets composed of quantum states.…”

“…In this work, we make a simple but technologically important observation. We consider a dataset that has been amplitude encoded [10][11][12][13][14][15][16][17], such that the dataset is described by an ensemble {p i , |ψ i } of normalized quantum states |ψ i . We note that it is straightforward to use classical randomness in order to prepare the ensemble average density matrix ρ = i p i |ψ i ψ i |, as shown in Fig.…”

Quantum algorithm for stochastic optimal stopping problems with applications in finance

“…Even though we assume the existence of the oracle U , constructing such unitary is an important question on its own. A few methods have been proposed in order to tackle such problem, one of the most famous is due to Grover and Rudolph [37] (see [56] for recent improvements on the Grover-Rudolph method), which loads into a quantum computer a discretization of a distribution with density function p(x). More specifically, it creates the quantum state…”