A universal quantum algorithm for weighted maximum cut and Ising problems
From MaRDI portal
Publication:6171439
DOI10.1007/s11128-023-04025-xarXiv2306.06539MaRDI QIDQ6171439
Jan Lellmann, Florian Mannel, Natacha Kuete Meli
Publication date: 11 August 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.06539
quantum algorithmsIsing modelvariational quantum circuitsweighted maximum cuthybrid quantum circuits
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Benchmarking the quantum approximate optimization algorithm
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- Spectral Gap Amplification
- Quantum Computation and Quantum Information
- Bounds for the adiabatic approximation with applications to quantum computation
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Revisiting Normalized Gradient Descent: Fast Evasion of Saddle Points
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Logical Reversibility of Computation
- A universal quantum algorithm for weighted maximum cut and Ising problems
