Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems
Keyword(s):
We develop a global variable substitution method that reduces n-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 reduced problem using the quantum approximate optimization algorithm. For benchmark 3-SAT problems, we find that the upper bound of the unitary circuit depth is smaller when the problem is formulated as a product and uses the substitution method to decompose gates than when the problem is written in the linear formulation, which requires no decomposition.
2014 ◽
Vol 134
(3)
◽
pp. 466-467
2007 ◽
Vol 156
(1)
◽
pp. 83-97
◽
2017 ◽
Vol 81
◽
pp. 51-66
◽
1976 ◽
Vol 10
(6)
◽
pp. 377-378
◽
1988 ◽
Vol 7
(4)
◽
pp. 181-187
◽