Optimized QUBO formulation methods for quantum computing

Abstract Quantum computers have strict requirements for the problems that they can efficiently solve. One of the principal limiting factor for the performances of noisy intermediate-scale quantum (NISQ) devices is the number of qubits required by the running algorithm. Several combinatorial optimization problems can be solved with NISQ devices once that a corresponding quadratic unconstrained binary optimization (QUBO) form is derived. Numerous techniques have been proposed to achieve such reformulations and, depending on the method chosen, the number of binary variables required, and therefore of qubits, can vary considerably. The aim of this work is to drastically reduce the variables needed for these QUBO…

• SN
  Scuola Normale Superiore

  Award: CI14_UNICREDIT_MARMI
• MD
  Ministero dell’Istruzione, dell’Università e della Ricerca

  Award: PE0000023-NQSTI