Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918053632016384 |
|---|---|
| author | Benchasattabuse, Naphan Bärtschi, Andreas García-Pintos, Luis Pedro Golden, John Lemons, Nathan Eidenbenz, Stephan |
| author_facet | Benchasattabuse, Naphan Bärtschi, Andreas García-Pintos, Luis Pedro Golden, John Lemons, Nathan Eidenbenz, Stephan |
| contents | The quantum approximate optimization algorithm, also known in its generalization as the quantum alternating operator ansatz, (QAOA) is a heuristic hybrid quantum-classical algorithm for finding high-quality approximate solutions to combinatorial optimization problems, such as maximum satisfiability. While the QAOA is well studied, theoretical results as to its runtime or approximation ratio guarantees are still relatively sparse. We provide some of the first lower bounds for the number of rounds (the dominant component of QAOA runtimes) required for the QAOA. For our main result, we (i) leverage a connection between quantum annealing times and the angles of the QAOA to derive a lower bound on the number of rounds of the QAOA with respect to the guaranteed approximation ratio. We apply and calculate this bound with Grover-style mixing unitaries and (ii) show that this type of QAOA requires at least a polynomial number of rounds to guarantee any constant approximation ratios for most problems. We also (iii) show that the bound depends only on the statistical values of the objective functions, and when the problem can be modeled as a $k$-local Hamiltonian, can be easily estimated from the coefficients of the Hamiltonians. For the conventional transverse-field mixer, (iv) our framework gives a trivial lower bound to all bounded-occurrence local cost problems and for all strictly $k$-local cost Hamiltonians matching known results that constant approximation ratio is obtainable with a constant-round QAOA for a few optimization problems from these classes. Using our proof framework, (v) we recover the Grover lower bound for unstructured search and, with small modification, show that our bound applies to any QAOA-style search protocol that starts in the ground state of the mixing unitaries. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_15442 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios Benchasattabuse, Naphan Bärtschi, Andreas García-Pintos, Luis Pedro Golden, John Lemons, Nathan Eidenbenz, Stephan Quantum Physics Data Structures and Algorithms The quantum approximate optimization algorithm, also known in its generalization as the quantum alternating operator ansatz, (QAOA) is a heuristic hybrid quantum-classical algorithm for finding high-quality approximate solutions to combinatorial optimization problems, such as maximum satisfiability. While the QAOA is well studied, theoretical results as to its runtime or approximation ratio guarantees are still relatively sparse. We provide some of the first lower bounds for the number of rounds (the dominant component of QAOA runtimes) required for the QAOA. For our main result, we (i) leverage a connection between quantum annealing times and the angles of the QAOA to derive a lower bound on the number of rounds of the QAOA with respect to the guaranteed approximation ratio. We apply and calculate this bound with Grover-style mixing unitaries and (ii) show that this type of QAOA requires at least a polynomial number of rounds to guarantee any constant approximation ratios for most problems. We also (iii) show that the bound depends only on the statistical values of the objective functions, and when the problem can be modeled as a $k$-local Hamiltonian, can be easily estimated from the coefficients of the Hamiltonians. For the conventional transverse-field mixer, (iv) our framework gives a trivial lower bound to all bounded-occurrence local cost problems and for all strictly $k$-local cost Hamiltonians matching known results that constant approximation ratio is obtainable with a constant-round QAOA for a few optimization problems from these classes. Using our proof framework, (v) we recover the Grover lower bound for unstructured search and, with small modification, show that our bound applies to any QAOA-style search protocol that starts in the ground state of the mixing unitaries. |
| title | Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios |
| topic | Quantum Physics Data Structures and Algorithms |
| url | https://arxiv.org/abs/2308.15442 |