Empirical performance bounds for quantum approximate optimization
From MaRDI portal
Publication:2099650
DOI10.1007/S11128-021-03342-3OpenAlexW3215922063MaRDI QIDQ2099650FDOQ2099650
Authors: Phillip C. Lotshaw, Travis S. Humble, Rebekah Herrman, James P. Ostrowski, George Siopsis 
Publication date: 24 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.06813
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
- Title not available (Why is that?)
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Title not available (Why is that?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Impact of graph structures for QAOA on maxcut
- 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
Cited In (15)
- Efficient depth selection for the implementation of noisy quantum approximate optimization algorithm
- Impact of graph structures for QAOA on maxcut
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- Quantum k-community detection: algorithm proposals and cross-architectural evaluation
- Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry
- Max-independent set and the quantum alternating operator ansatz
- An introduction to variational quantum algorithms for combinatorial optimization problems
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator
- On the universality of the quantum approximate optimization algorithm
- Benchmarking the quantum approximate optimization algorithm
- Title not available (Why is that?)
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
- A review on quantum approximate optimization algorithm and its variants
- Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs
Uses Software
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)
