Pages that link to "Item:Q2059592"
From MaRDI portal
The following pages link to A study of the performance of classical minimizers in the quantum approximate optimization algorithm (Q2059592):
Displaying 12 items.
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems (Q669949) (← links)
- Prospects of quantum-classical optimization for digital design (Q849768) (← links)
- The potential of quantum annealing for rapid solution structure identification (Q2074663) (← links)
- The variational quantum eigensolver: a review of methods and best practices (Q2092477) (← links)
- Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
- Benchmarking the quantum approximate optimization algorithm (Q2681529) (← links)
- Impact of graph structures for QAOA on maxcut (Q2685581) (← links)
- Lower bounds on circuit depth of the quantum approximate optimization algorithm (Q2687096) (← links)
- Evolution strategies: application in hybrid quantum-classical neural networks (Q2687671) (← links)
- A comparison of various classical optimizers for a variational quantum linear solver (Q2690481) (← links)
- Solving the Kemeny ranking aggregation problem with quantum optimization algorithms (Q6139170) (← links)
- A review on quantum approximate optimization algorithm and its variants (Q6546559) (← links)