Approximating random quantum optimization problems
Published in arXiv (Cornell University) • Apr 10, 2013
Authors:,,
Hsu, B.
Laumann, C. R.
Laeuchli, A.
Abstract
We report a cluster of results regarding the difficulty of finding approximate ground states to typical instances of the quantum satisfiability problem $k$-QSAT on large random graphs. As an approximation strategy, we optimize the solution space over `classical' product states, which in turn introdu...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!