Fetching the paper…
Reading the bibliography…
Encoding hard-constrained optimization problems into a variational quantum algorithm often turns out to be a challenging task.
1908
Earlier work this paper cites.
A graph coloring algorithm for large scheduling problems
Leighton FT · 1977
Earlier work this paper cites.
Taking advantage of stable sets of variables in constraint satisfaction problems
Freuder EC, Quinn MJ · 1985
Earlier work this paper cites.
An introduction to the theory of groups
Roman JJ · 1995
Earlier work this paper cites.
A limited memory algorithm for bound constrained optimization
Byrd RH, Lu P, Nocedal J, Zhu C · 1995
Earlier work this paper cites.
Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces
Storn R, Price K · 1997
Earlier work this paper cites.
Product graphs
Imrich W, Klavzar S · 2000
Earlier work this paper cites.
The symmetric group
Sagan BE · 2001
Earlier work this paper cites.
Handbook of constraint programming
Rossi F, Beek Pv, Walsh T · 2006
Earlier work this paper cites.
On the CNOT-cost of TOFFOLI gates
Shende VV, Markov IL · 2009
Earlier work this paper cites.
Quantum computation and quantum information
Nielsen MA, Chuang IL · 2010
Earlier work this paper cites.
A variational eigenvalue solver on a photonic quantum processor
Peruzzo A, McClean J, Shadbolt P, Yung MH, Zhou XQ, Love PJ, et al · 2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
Ising formulations of many NP problems
Lucas A · 2014
Earlier work this paper cites.
Multi-objective transit route network design as set covering problem
Owais M, Osman MK, Moussa G · 2015
Earlier work this paper cites.
A hybrid quantum-classical approach to solving scheduling problems
Tran T, Do M, Rieffel E, Frank J, Wang Z, O’Gorman B, et al · 2016
Earlier work this paper cites.
Endliche permutationsgruppen
Sambale B · 2017
Earlier work this paper cites.
Quantum computing in the NISQ era and beyond
Preskill J · 2018
Earlier work this paper cites.
From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
Hadfield S, Wang Z, O’Gorman B, Rieffel E, Venturelli D, Biswas R · 2019
Earlier work this paper cites.
Characterizing local noise in QAOA circuits
Marshall J, Wudarski F, Hadfield S, Hogg T · 2020
Earlier work this paper cites.
Improving variational quantum optimization using CVaR
Barkoutsos PK, Nannicini G, Robert A, Tavernelli I, Woerner S · 2020
Earlier work this paper cites.
Benchmarking the quantum approximate optimization algorithm
Willsch M, Willsch D, Jin F, De Raedt H, Michielsen K · 2020
Cited alongside, same era.
Grover mixers for QAOA: shifting complexity from mixer design to state preparation
Bärtschi A, Eidenbenz S · 2020
Cited alongside, same era.
Variational quantum algorithms
Cerezo M, Arrasmith A, Babbush R, Benjamin SC, Endo S, Fujii K, et al · 2021
Cited alongside, same era.
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
Harrigan MP, Sung KJ, Neeley M, Satzinger KJ, Arute F, Arya K, et al · 2021
Cited alongside, same era.
Quantum optimization heuristics with an application to knapsack problems
van Dam W, Eldefrawy K, Genise N, Parham N · 2021
Cited alongside, same era.
Error mitigation for deep quantum optimization circuits by leveraging problem symmetries
Quantum-assisted solution paths for the capacitated vehicle routing problem
Palackal L, Poggel B, Wulff M, Ehm H, Lorenz JM, Mendl CB · 2023
Closest in time.
Application of quantum approximate optimization algorithm to job shop scheduling problem
Kurowski K, Pecyna T, Slysz M, Różycki R, Waligóra G, We c · 2023
Closest in time.
Quantum computing techniques for multi-knapsack problems
Awasthi A, Bär F, Doetsch J, Ehm H, Erdmann M, Hess M, et al · 2023
Closest in time.
A quantum algorithm with group theory
Koßmann G · 2023
Closest in time.
Error mitigation for quantum approximate optimization
Weidinger A, Mbeng GB, Lechner W · 2023
Closest in time.
Digitized counterdiabatic quantum algorithms for logistics scheduling
Dalal A, Montalban I, Hegade NN, Cadavid AG, Solano E, Awasthi A, et al · 2024
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Shaydulin R, Galda A · 2021
Cited alongside, same era.
Threshold-based quantum optimization
Golden J, Bärtschi A, O’Malley D, Eidenbenz S · 2021
Cited alongside, same era.
Training variational quantum algorithms is NP-Hard
Bittel L, Kliesch M · 2021
Cited alongside, same era.
Entanglement devised barren plateau mitigation
Patti TL, Najafi K, Gao X, Yelin SF · 2021
Cited alongside, same era.
Warm-starting quantum optimization
Egger DJ, Marec̆ek J, Woerner S · 2021
Cited alongside, same era.
Evaluation of QAOA based on the approximation ratio of individual samples
Larkin J, Jonsson M, Justice D, Guerreschi GG · 2022
Cited alongside, same era.
Noisy intermediate-scale quantum algorithms
Bharti K, Cervera-Lierta A, Kyaw TH, Haug T, Alperin-Lea S, Anand A, et al · 2022
Cited alongside, same era.
A feasibility-preserved quantum approximate solver for the capacitated vehicle routing problem
Xie N, Lee X, Cai D, Saito Y, Asai N, Lau HC · 2024
Closest in time.
Elementary proof of QAOA convergence
Binkowski L, Koßmann G, Ziegler T, Schwonnek R · 2024
Closest in time.
The effect of classical optimizers and Ansatz depth on QAOA performance in noisy devices
Pellow-Jarman A, McFarthing S, Sinayskiy I, Park DK, Pillay A, Petruccione F · 2024
Closest in time.
Iterative layerwise training for the quantum approximate optimization algorithm
Lee X, Yan X, Xie N, Cai D, Saito Y, Asai N · 2024
Closest in time.
2024
Closest in time.
Deep-Circuit QAOA
Koßmann G, Binkowski L, van Lujik L, Ziegler T, Schwonnek R · 2025
Closest in time.
Two-step quantum search algorithm for solving traveling salesman problems
Sato R, Gordon C, Saito K, Kawashima H, Nikuni T, Watabe S · 2025
Closest in time.
Quantum tree generator improves QAOA state-of-the-art for the knapsack problem
Christiansen P, Binkowski L, Ramacciotti D, Wilkening S · 2025
Closest in time.
Inductive construction of variational quantum circuit for constrained combinatorial optimization
Nakada H, Tanahashi K, Tanaka S · 2025
Closest in time.
Constraint graph model analysis of the quantum alternating operator ansatz
Binkowski L · 2025
Closest in time.
Reflection groups and coxeter groups
Humphreys JE · 2025
Closest in time.
Barren plateaus in variational quantum computing
Larocca M, Thanasilp S, Wang S, Sharma K, Biamonte J, et al · 2025
Closest in time.
From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits
Binkowski L, Koßmann G, Osborne TJ, Schwonnek R, Ziegler T · 2025
Closest in time.
Quantum optimization algorithms for the traveling salesman problem
Schwiering M · 2025
Closest in time.