Black-Box Quantum State Preparation with Inverse Coefficients
- URL: http://arxiv.org/abs/2112.05937v1
- Date: Sat, 11 Dec 2021 09:22:25 GMT
- Title: Black-Box Quantum State Preparation with Inverse Coefficients
- Authors: Shengbin Wang, Zhimin Wang, Runhong He, Guolong Cui, Shangshang Shi,
Ruimin Shang, Jiayun Li, Yanan Li, Wendong Li, Zhiqiang Wei, Yongjian Gu
- Abstract summary: Black-box quantum state preparation is a fundamental building block for many higher-level quantum algorithms.
We present a new algorithm for performing black-box state preparation with inverse coefficients based on the technique of inequality test.
- Score: 17.63187488168065
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Black-box quantum state preparation is a fundamental building block for many
higher-level quantum algorithms, which is applied to transduce the data from
computational basis into amplitude. Here we present a new algorithm for
performing black-box state preparation with inverse coefficients based on the
technique of inequality test. This algorithm can be used as a subroutine to
perform the controlled rotation stage of the Harrow-Hassidim-Lloyd (HHL)
algorithm and the associated matrix inversion algorithms with exceedingly low
cost. Furthermore, we extend this approach to address the general black-box
state preparation problem where the transduced coefficient is a general
non-linear function. The present algorithm greatly relieves the need to do
arithmetic and the error is only resulted from the truncated error of binary
string. It is expected that our algorithm will find wide usage both in the NISQ
and fault-tolerant quantum algorithms.
Related papers
- Low depth amplitude estimation without really trying [1.1005025875011782]
Quantum amplitude estimation algorithms provide quadratic speedup to Monte-Carlo simulations.
They require a circuit depth that scales as inverse of the estimation error.
We bypass this limitation by performing the classical Monte-Carlo method on the quantum algorithm itself.
arXiv Detail & Related papers (2024-10-02T01:59:33Z) - Generalized quantum Arimoto-Blahut algorithm and its application to
quantum information bottleneck [55.22418739014892]
We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al.
We apply our algorithm to the quantum information bottleneck with three quantum systems.
Our numerical analysis shows that our algorithm is better than their algorithm.
arXiv Detail & Related papers (2023-11-19T00:06:11Z) - Solving Systems of Linear Equations: HHL from a Tensor Networks Perspective [39.58317527488534]
We present an algorithm for solving systems of linear equations based on the HHL algorithm with a novel qudits methodology.
We perform a quantum-inspired version on tensor networks, taking advantage of their ability to perform non-unitary operations such as projection.
arXiv Detail & Related papers (2023-09-11T08:18:41Z) - A Universal Quantum Algorithm for Weighted Maximum Cut and Ising
Problems [0.0]
We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary problems.
We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted maximum cut or the Ising Hamiltonian.
Measuring the expectation of this operator on a variational quantum state yields the variational energy of the quantum system.
arXiv Detail & Related papers (2023-06-10T23:28:13Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Alternatives to a nonhomogeneous partial differential equation quantum
algorithm [52.77024349608834]
We propose a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Apsi(textbfr)=f(textbfr)$.
These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.
arXiv Detail & Related papers (2022-05-11T14:29:39Z) - Quantum algorithm for stochastic optimal stopping problems with
applications in finance [60.54699116238087]
The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory.
We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
arXiv Detail & Related papers (2021-11-30T12:21:41Z) - Fast Black-Box Quantum State Preparation Based on Linear Combination of
Unitaries [21.632886077572046]
We propose to perform black-box state preparation using the technique of linear combination of unitaries (LCU)
Our algorithms improve upon the existed best results by reducing the required additional qubits and Toffoli gates to 2log(n) and n, respectively, in the bit precision n.
The further reduced complexity of the present algorithms brings the black-box quantum state preparation closer to reality.
arXiv Detail & Related papers (2021-05-13T12:29:06Z) - Quantum Algorithms for Prediction Based on Ridge Regression [0.7612218105739107]
We propose a quantum algorithm based on ridge regression model, which get the optimal fitting parameters.
The proposed algorithm has a wide range of application and the proposed algorithm can be used as a subroutine of other quantum algorithms.
arXiv Detail & Related papers (2021-04-27T11:03:52Z) - Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra [53.46106569419296]
We create classical (non-quantum) dynamic data structures supporting queries for recommender systems and least-squares regression.
We argue that the previous quantum-inspired algorithms for these problems are doing leverage or ridge-leverage score sampling in disguise.
arXiv Detail & Related papers (2020-11-09T01:13:07Z) - Quantum state preparation with multiplicative amplitude transduction [0.0]
Two variants of the algorithm with different emphases are introduced.
One variant uses fewer qubits and no controlled gates, while the other variant potentially requires fewer gates overall.
A general analysis is given to estimate the number of qubits necessary to achieve a desired precision in the amplitudes of the computational basis states.
arXiv Detail & Related papers (2020-06-01T14:36:50Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.