Empirical performance bounds for quantum approximate optimization
From MaRDI portal
Publication:2099650
Recommendations
- Benchmarking the quantum approximate optimization algorithm
- Impact of graph structures for QAOA on maxcut
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- Classical symmetries and the quantum approximate optimization algorithm
- Benchmarking the performance of portfolio optimization with QAOA
Cites work
- Branching and bounds tighteningtechniques for non-convex MINLP
- scientific article; zbMATH DE number 5899272 (Why is no real title available?)
- scientific article; zbMATH DE number 1078257 (Why is no real title available?)
- Impact of graph structures for QAOA on maxcut
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator
Cited in
(20)- Efficient depth selection for the implementation of noisy quantum approximate optimization algorithm
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Benchmarking the quantum approximate optimization algorithm
- On the universality of the quantum approximate optimization algorithm
- Impact of graph structures for QAOA on maxcut
- Quantum k-community detection: algorithm proposals and cross-architectural evaluation
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator
- Max-independent set and the quantum alternating operator ansatz
- scientific article; zbMATH DE number 7651034 (Why is no real title available?)
- Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry
- An introduction to variational quantum algorithms for combinatorial optimization problems
- Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs
- A review on quantum approximate optimization algorithm and its variants
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
- Benchmarking the emulation of measurement-based quantum computing through the max K-Cut algorithm
- An improved adaptive quantum genetic algorithm as classical optimizer for the quantum approximate optimization algorithm on MaxCut problem
- Transfer learning of optimal QAOA parameters in combinatorial optimization
- Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms
- An introduction to variational quantum algorithms for combinatorial optimization problems
This page was built for publication: Empirical performance bounds for quantum approximate optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099650)
