Convex optimization of programmable quantum computers

HIGHLIGHTS

• who: Leonardo Banchi from the Published in partnership with The University of New South Wales have published the research work: Convex optimization of programmable quantum computers, in the Journal: (JOURNAL)
• what: The authors show the solutions to these long-standing open problems. The authors show that the optimization of programmable quantum computers is a convex problem for which the solution can always be found by means of classical semidefinite programming (SDP), and classical gradient-based methods that are commonly employed for machine_learning (ML) applications. In the methods section, the authors show that other cost functions . . .
  

   

  

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

  Thanks :)

  Username or E-mail:

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