Implementing smooth functions of a Hermitian matrix on a quantum computer
arXiv:1806.06885 · doi:10.1088/2399-6528/ab25a2
Abstract
We review existing methods for implementing smooth functions f(A) of a sparse Hermitian matrix A on a quantum computer, and analyse a further combination of these techniques which has some advantages of simplicity and resource consumption in some cases. Our construction uses the linear combination of unitaries method with Chebyshev polynomial approximations. The query complexity we obtain is O(log C/eps) where eps is the approximation precision, and C>0 is an upper bound on the magnitudes of the derivatives of the function f over the domain of interest. The success probability depends on the 1-norm of the Taylor series coefficients of f, the sparsity d of the matrix, and inversely on the smallest singular value of the target matrix f(A).
arXiv comment16 pages
References in corpus (15)
- Quantum algorithm for solving linear systems of equations
- Quantum principal component analysis
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- 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
- Hamiltonian simulation with nearly optimal dependence on all parameters
- Simulating Physical Phenomena by Quantum Networks
- High-order quantum algorithm for solving linear differential equations
- Quantum algorithm for linear differential equations with exponentially improved dependence on precision
- Quantum algorithm and circuit design solving the Poisson equation
- Black-box quantum state preparation without arithmetic
- Improvements in Quantum SDP-Solving with Applications
- Repeat-Until-Success circuits with fixed-point oblivious amplitude amplification
- Engineering Functional Quantum Algorithms
Cited by in corpus (8)
- Quantum algorithm for estimating Renyi entropies of quantum states
- Spectral density estimation with the Gaussian Integral Transform
- Two-Unitary Decomposition Algorithm and Open Quantum System Simulation
- Entanglement Production and Convergence Properties of the Variational Quantum Eigensolver
- Implementation of Measurement Reduction for the Variational Quantum Eigensolver
- Faster spectral density calculation using energy moments
- Quantum algorithms for powering stable Hermitian matrices
- State preparation and evolution in quantum computing: a perspective from Hamiltonian moments