Explicit lower bounds on strong quantum simulation

30 Apr 2018 Huang Cupjin Newman Michael Szegedy Mario

We consider the problem of strong (amplitude-wise) simulation of $n$-qubit quantum circuits, and identify a subclass of simulators we call monotone. This subclass encompasses almost all prominent simulation techniques... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • QUANTUM PHYSICS
  • COMPUTATIONAL COMPLEXITY