Benchmarking the quantum approximate optimization algorithm
From MaRDI portal
Publication:2681529
DOI10.1007/s11128-020-02692-8OpenAlexW3098974447MaRDI QIDQ2681529
Fengping Jin, Kristel Michielsen, Hans De Raedt, Madita Willsch, Dennis Willsch
Publication date: 3 February 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.02359
Related Items (6)
A practitioner’s guide to quantum algorithms for optimisation problems ⋮ Grover search inspired alternating operator ansatz of quantum approximate optimization algorithm for search problems ⋮ A universal quantum algorithm for weighted maximum cut and Ising problems ⋮ A study of the performance of classical minimizers in the quantum approximate optimization algorithm ⋮ Statistical quality assessment of Ising-based annealer outputs ⋮ Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
Uses Software
Cites Work
- Unnamed Item
- Fast clique minor generation in Chimera qubit connectivity graphs
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- The Design of Approximation Algorithms
- The vectorization of ITPACK 2C
- On the Product of Semi-Groups of Operators
- Decomposition formulas of exponential operators and Lie exponentials with some applications to quantum mechanics and statistical physics
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes
- A Simplex Method for Function Minimization
- Massively parallel quantum computer simulator, eleven years later
This page was built for publication: Benchmarking the quantum approximate optimization algorithm
