The quantum approximate optimization algorithm and the sherrington-kirkpatrick model at infinite size

HIGHLIGHTS

• who: Edward Farhi et al. from the Google Inc, Venice, CA, USA Department of Physics, Harvard University, Cambridge, MA, USA have published the Article: The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size, in the Journal: (JOURNAL)
• what: The authors show how to prove for the case of p=3, and the generalization to other p is immediate. Proof of Lemma 2 - First Moment - To begin the authors show . The aim is to derive an n-independent bound bu,v (t) where |su,v (t, n)| ≤ bu,v (t), for which . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.