Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2203.08758

Quantum Amplitude Interpolation

Charlee Stefanski, Vanio Markov, Constantin Gonciulea

Published Mar 16, 2022• 5 citations
arXivHTMLPDF

Abstract

In this paper we present a method for representing continuous signals with high precision by interpolating quantum state amplitudes. The method is inspired by the Nyquist-Shannon sampling theorem, which links continuous and discrete time signals. This method extends our previous method of computing generalized inner products from integer-valued functions to real-valued functions.

DOI
10.48550/arxiv.2203.08758

Related papers

Properties of The Discrete Sinc Quantum State and Applications to Measurement Interpolation

Charlee Stefanski, Vanio Markov, Constantin Gonciulea

Extracting the outcome of a quantum computation is a difficult task. In many cases, the quantum phase estimation algorithm is used to digitally encode a value in a quantum register whose amplitudes' magnitudes reflect the discrete sinc function. In the standard implementation the value is approximated by the most frequent outcome, however, using the frequencies of other outcomes allows for increased precision without using additional qubits. One existing approach is to use Maximum Likelihood Estimation, which uses the frequencies of all measurement outcomes. We provide and analyze several alternative estimators, the best of which rely on only the two most frequent measurement outcomes. The Ratio-Based Estimator uses a closed form expression for the decimal part of the encoded value using the ratio of the two most frequent outcomes. The Coin Approximation Estimator relies on the fact that the decimal part of the encoded value is very well approximated by the parameter of the Bernoulli process represented by the magnitudes of the largest two amplitudes. We also provide additional properties of the discrete sinc state that could be used to design other estimators.

arXiv:2207.00564•Jul 1, 2022•0 citations

Efficient Preparation of Quantum States With Exponential Precision

Péter Jaksch

It has been shown that, starting from the state |0>, in the general case, an arbitrary quantum state |ψ> cannot be prepared with exponential precision in polynomial time. However, we show that for the important special case when |ψ> represents discrete values of some real, continuous function ψ(x), efficient preparation is possible by applying the eigenvalue estimation algorithm to a Hamiltonian which has ψ(x) as an eigenstate. We construct the required Hamiltonian explicitly and present an iterative algorithm for removing unwanted superpositions from the output state in order to reach |ψ> within exponential accuracy. The method works under very general conditions and can be used to provide the quantum simulation algorithm with very accurate and general starting states.

arXiv:quant-ph/0512238•Dec 27, 2005•0 citations

Gibbs Sampling of Continuous Potentials on a Quantum Computer

Arsalan Motamedi, Pooya Ronagh

Gibbs sampling from continuous real-valued functions is a challenging problem of interest in machine learning. Here we leverage quantum Fourier transforms to build a quantum algorithm for this task when the function is periodic. We use the quantum algorithms for solving linear ordinary differential equations to solve the Fokker--Planck equation and prepare a quantum state encoding the Gibbs distribution. We show that the efficiency of interpolation and differentiation of these functions on a quantum computer depends on the rate of decay of the Fourier coefficients of the Fourier transform of the function. We view this property as a concentration of measure in the Fourier domain, and also provide functional analytic conditions for it. Our algorithm makes zeroeth order queries to a quantum oracle of the function. Despite suffering from an exponentially long mixing time, this algorithm allows for exponentially improved precision in sampling, and polynomial quantum speedups in mean estimation in the general case, and particularly under geometric conditions we identify for the critical points of the energy function.

arXiv:2210.08104•Oct 14, 2022•0 citations

Efficient quantum amplitude encoding of polynomial functions

Javier Gonzalez-Conde, Thomas W. Watts, Pablo Rodriguez-Grasa +1 more

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 (MPS). 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 either via its MPS or with a shallow sequence of multi-controlled gates that loads the linear function's Hadamard-Walsh series, and we explore how truncating the Hadamard-Walsh series of the linear function affects the final fidelity. Applying the inverse discrete Hadamard-Walsh transform converts the state encoding the series coefficients into an amplitude encoding of the linear function. Thus, we use this construction as a building block to achieve an exact block encoding of the amplitudes corresponding to the linear function on k0 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 k0 qubits. Finally we pad n−k0 qubits to generate an approximated encoding of the polynomial on n qubits, analyzing the error depending on k0 . In this regard, our methodology proposes a method to improve the state-of-the-art complexity by introducing controllable errors.

arXiv:2307.10917•Quantum•Mar 21, 2024•55 citations

A Generalized Quantum Inner Product and Applications to Financial Engineering

Vanio Markov, Charlee Stefanski, Abhijit Rao +1 more

In this paper we present a canonical quantum computing method to estimate the weighted sum w(k)f(k) of the values taken by a discrete function f and real weights w(k). The canonical aspect of the method comes from relying on a single linear function encoded in the amplitudes of a quantum state, and using register entangling to encode the function f. We further expand this framework by mapping function values to hashes in order to estimate weighted sums w(k)h(f(k)) of hashed function values with real hashes h. This generalization allows the computation of restricted weighted sums such as value at risk, comparators, as well as Lebesgue integrals and partial moments of statistical distributions. We also introduce essential building blocks such as efficient encodings of standardized linear quantum states and normal distributions.

arXiv:2201.09845•Jan 24, 2022•18 citations

Creating superpositions that correspond to efficiently integrable probability distributions

Lov K. Grover, Terry Rudolph

We give a simple and efficient process for generating a quantum superposition of states which form a discrete approximation of any efficiently integrable (such as log concave) probability density functions.

arXiv:quant-ph/0208112•Aug 15, 2002•615 citations
In this paper we present a method for representing continuous signals with high precision by interpolating quantum state amplitudes. The method is inspired by the Nyquist-Shannon sampling theorem, which links continuous and discrete time signals. This method extends our previous method of computing generalized inner products from integer-valued functions to real-valued functions.
Extracting the outcome of a quantum computation is a difficult task. In many cases, the quantum phase estimation algorithm is used to digitally encode a value in a quantum register whose amplitudes' magnitudes reflect the discrete sinc function. In the standard implementation the value is approximated by the most frequent outcome, however, using the frequencies of other outcomes allows for increased precision without using additional qubits. One existing approach is to use Maximum Likelihood Estimation, which uses the frequencies of all measurement outcomes. We provide and analyze several alternative estimators, the best of which rely on only the two most frequent measurement outcomes. The Ratio-Based Estimator uses a closed form expression for the decimal part of the encoded value using the ratio of the two most frequent outcomes. The Coin Approximation Estimator relies on the fact that the decimal part of the encoded value is very well approximated by the parameter of the Bernoulli process represented by the magnitudes of the largest two amplitudes. We also provide additional properties of the discrete sinc state that could be used to design other estimators.
It has been shown that, starting from the state |0>, in the general case, an arbitrary quantum state |ψ> cannot be prepared with exponential precision in polynomial time. However, we show that for the important special case when |ψ> represents discrete values of some real, continuous function ψ(x), efficient preparation is possible by applying the eigenvalue estimation algorithm to a Hamiltonian which has ψ(x) as an eigenstate. We construct the required Hamiltonian explicitly and present an iterative algorithm for removing unwanted superpositions from the output state in order to reach |ψ> within exponential accuracy. The method works under very general conditions and can be used to provide the quantum simulation algorithm with very accurate and general starting states.
Gibbs sampling from continuous real-valued functions is a challenging problem of interest in machine learning. Here we leverage quantum Fourier transforms to build a quantum algorithm for this task when the function is periodic. We use the quantum algorithms for solving linear ordinary differential equations to solve the Fokker--Planck equation and prepare a quantum state encoding the Gibbs distribution. We show that the efficiency of interpolation and differentiation of these functions on a quantum computer depends on the rate of decay of the Fourier coefficients of the Fourier transform of the function. We view this property as a concentration of measure in the Fourier domain, and also provide functional analytic conditions for it. Our algorithm makes zeroeth order queries to a quantum oracle of the function. Despite suffering from an exponentially long mixing time, this algorithm allows for exponentially improved precision in sampling, and polynomial quantum speedups in mean estimation in the general case, and particularly under geometric conditions we identify for the critical points of the energy function.
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 (MPS). 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 either via its MPS or with a shallow sequence of multi-controlled gates that loads the linear function's Hadamard-Walsh series, and we explore how truncating the Hadamard-Walsh series of the linear function affects the final fidelity. Applying the inverse discrete Hadamard-Walsh transform converts the state encoding the series coefficients into an amplitude encoding of the linear function. Thus, we use this construction as a building block to achieve an exact block encoding of the amplitudes corresponding to the linear function on k0 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 k0 qubits. Finally we pad n−k0 qubits to generate an approximated encoding of the polynomial on n qubits, analyzing the error depending on k0 . In this regard, our methodology proposes a method to improve the state-of-the-art complexity by introducing controllable errors.
In this paper we present a canonical quantum computing method to estimate the weighted sum w(k)f(k) of the values taken by a discrete function f and real weights w(k). The canonical aspect of the method comes from relying on a single linear function encoded in the amplitudes of a quantum state, and using register entangling to encode the function f. We further expand this framework by mapping function values to hashes in order to estimate weighted sums w(k)h(f(k)) of hashed function values with real hashes h. This generalization allows the computation of restricted weighted sums such as value at risk, comparators, as well as Lebesgue integrals and partial moments of statistical distributions. We also introduce essential building blocks such as efficient encodings of standardized linear quantum states and normal distributions.