Lower bounds on circuit depth of the quantum approximate optimization algorithm

DOI10.1007/s11128-021-03001-7OpenAlexW3128749955MaRDI QIDQ2687096

Travis S. Humble, James Ostrowski, George Siopsis, Rebekah Herrman

Publication date: 1 March 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.01820

zbMATH Keywords

combinatorial optimizationchromatic indexcircuit depthquantum approximate optimization algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Quantum computation (81P68)

Related Items (5)

Impact of graph structures for QAOA on maxcut ⋮ A universal quantum algorithm for weighted maximum cut and Ising problems ⋮ Solving MaxCut with quantum imaginary time evolution ⋮ Empirical performance bounds for quantum approximate optimization ⋮ Efficient depth selection for the implementation of noisy quantum approximate optimization algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic behavior of the chromatic index for hypergraphs
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• Unbounded knapsack problem: Dynamic programming revisited
• ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE
• Shortest path algorithms for knapsack type problems
• Reducibility among Combinatorial Problems
• On the degree, size, and chromatic index of a uniform hypergraph

This page was built for publication: Lower bounds on circuit depth of the quantum approximate optimization algorithm