On the Exponential Sample Complexity of the Quantum State Sign Estimation Problem [article]

Arthur G. Rattew, Marco Pistoia
2021 arXiv   pre-print
We demonstrate that the ability to estimate the relative sign of an arbitrary n-qubit quantum state (with real amplitudes), given only k copies of that state, would yield a kn-query algorithm for unstructured search. Thus the quantum sample complexity of sign estimation must be exponential: Ω(2^n/2/n). In particular, we show that an efficient procedure for solving the sign estimation problem would allow for a polynomial time solution to the NP-complete problem 3-SAT.
arXiv:2108.03193v2 fatcat:rigveosvh5byvbqkbjog2raymy