Classical algorithms for quantum mean values
نویسندگان
چکیده
We consider the task of estimating expectation value an $n$-qubit tensor product observable $O_1\otimes O_2\otimes \cdots \otimes O_n$ in output state a shallow quantum circuit. This is cornerstone variational algorithms for optimization, machine learning, and simulation many-body systems. Here we study its computational complexity constant-depth circuits three types single-qubit observables $O_j$ which are (a) close to identity, (b) positive semidefinite, (c) arbitrary. It shown that mean problem admits classical approximation algorithm with runtime scaling as $\mathrm{poly}(n)$ $2^{\tilde{O}(\sqrt{n})}$ cases (a,b) respectively. In case give linear-time geometrically local on two-dimensional grid. The approximated small relative error (a), while (b,c) satisfy less demanding additive bound. based (respectively) Barvinok's polynomial interpolation method, OR function arising from query complexity, Monte Carlo method combined Matrix Product State techniques. also prove technical lemma characterizing zero-free region certain polynomials associated circuit, may be independent interest.
منابع مشابه
Classical and Quantum Algorithms for Exponential Congruences
Abstract. We discuss classical and quantum algorithms for solvability testing and finding integer solutions x, y of equations of the form af + bg = c over finite fields Fq. A quantum algorithm with time complexity q(log q) is presented. While still superpolynomial in log q, this quantum algorithm is significantly faster than the best known classical algorithm, which has time complexity q(log q)...
متن کاملClassical and Quantum Algorithms for USO Recognition
Unique Sink Orientations (USOs) are orientations of the hypercube graph capable of encoding many optimization problems, such as linear programming. When a USO is given in implicit form as an oracle, the USO recognition problem aims to distinguish USO from non-USO oracles. In this thesis we introduce a new type of orientation, the pseudo-USOs, which are closely related to the USO recognition pro...
متن کاملClassical and Quantum Algorithms for the Boolean Satisfiability Problem
This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts deterministic and probabilistic algorithms, propositions of their properties and the main result is that the problem has not an efficient algorithm (NP is not P). Novel quantum algorithms and propositions depict that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Physics
سال: 2021
ISSN: ['1745-2473', '1745-2481']
DOI: https://doi.org/10.1038/s41567-020-01109-8