NobleBlocks
Public

Approximating random quantum optimization problems

Published in Physical Review A • Jun 25, 2013
NobleIDNI6P20W20R00S45
Authors:
Benjamin Hsu
,
Chris R. Laumann
,
Andreas M. Läuchli

Abstract

We report a cluster of results regarding the difficulty of finding approximate ground states to typical instances of the quantum satisfiability problem $k$-body quantum satisfiability ($k$-QSAT) on large random graphs. As an approximation strategy, we optimize the solution space over ``classical'' p...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!