Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems
We develop a global variable substitution method that reduces <i>n</i>-variable monomials in combinatorial optimization problems to equivalent instances with monomials in fewer variables. We apply this technique to 3-SAT and analyze the optimal quantum unitary circuit depth needed to solve the reduc...
Spremljeno u:
| Glavni autori: | , , , , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
MDPI AG
2021-10-01
|
| Serija: | Algorithms |
| Teme: | |
| Online pristup: | https://www.mdpi.com/1999-4893/14/10/294 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|
