Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Warm-starting quantum optimization
Daniel J. Egger, Jakub Mareček, Stefan Woerner
Quantum (2021) Vol. 5, pp. 479-479
Open Access | Times Cited: 190

Showing 51-75 of 190 citing articles:

QCEDA: Using Quantum Computers for EDA
Matthias Jung, Sven O. Krumke, Christof Schroth, et al.
Lecture notes in computer science (2025), pp. 32-46
Closed Access
Circuit implementation and analysis of a quantum-walk based search complement algorithm
Allan Wing-Bocanegra, Carlos Efrain Quintero-Narvaez, Salvador E. Venegas-Andraca
Scientific Reports (2025) Vol. 15, Iss. 1
Open Access
Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
Reuben Tate, Stephan Eidenbenz
Lecture notes in computer science (2025), pp. 311-323
Closed Access
Parallel circuit implementation of variational quantum algorithms
Michele Cattelan, Sheir Yarkoni, Wolfgang Lechner
npj Quantum Information (2025) Vol. 11, Iss. 1
Open Access
Detecting quasidegenerate ground states in topological models via the variational quantum eigensolver
Carola Ciaramelletti, Martin Beseda, Mirko Consiglio, et al.
Physical review. A/Physical review, A (2025) Vol. 111, Iss. 2
Closed Access
Continuous-time quantum optimization without the adiabatic principle
R.J. Banks, Georgios S. Raftis, Dan E. Browne, et al.
Physical review. A/Physical review, A (2025) Vol. 111, Iss. 3
Open Access
Bias-field digitized counterdiabatic quantum optimization
Alejandro Gomez Cadavid, Archismita Dalal, Anton Simen, et al.
Physical Review Research (2025) Vol. 7, Iss. 2
Open Access
Approaches to Constrained Quantum Approximate Optimization
Zain H. Saleem, Teague Tomesh, Bilal Tariq, et al.
SN Computer Science (2023) Vol. 4, Iss. 2
Open Access | Times Cited: 12
Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths
Reuben Tate, Jai Moondra, Bryan T. Gard, et al.
Quantum (2023) Vol. 7, pp. 1121-1121
Open Access | Times Cited: 12
Fermionic quantum approximate optimization algorithm
Takuya Yoshioka, Keita Sasada, Yuichiro Nakano, et al.
Physical Review Research (2023) Vol. 5, Iss. 2
Open Access | Times Cited: 11
Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement
Stefan Sack, Raimel Medina, Richard Kueng, et al.
Physical review. A/Physical review, A (2023) Vol. 107, Iss. 6
Open Access | Times Cited: 11
Error mitigation for quantum approximate optimization
Anita Weidinger, Glen Bigan Mbeng, Wolfgang Lechner
Physical review. A/Physical review, A (2023) Vol. 108, Iss. 3
Open Access | Times Cited: 11
Graph representation learning for parameter transferability in quantum approximate optimization algorithm
Jose Falla, Quinn Langfitt, Yuri Alexeev, et al.
Quantum Machine Intelligence (2024) Vol. 6, Iss. 2
Open Access | Times Cited: 4
Provable bounds for noise-free expectation values computed from noisy samples
Samantha V. Barron, Daniel J. Egger, Elijah Pelofske, et al.
Nature Computational Science (2024) Vol. 4, Iss. 11, pp. 865-875
Open Access | Times Cited: 4
Lyapunov-control-inspired strategies for quantum combinatorial optimization
Alicia Magann, Kenneth Rudinger, Matthew Grace, et al.
Physical review. A/Physical review, A (2022) Vol. 106, Iss. 6
Open Access | Times Cited: 17
Improving the Variational Quantum Eigensolver Using Variational Adiabatic Quantum Computing
Stuart M. Harwood, Dimitar Trenev, Spencer T. Stober, et al.
ACM Transactions on Quantum Computing (2022) Vol. 3, Iss. 1, pp. 1-20
Open Access | Times Cited: 16
Quantum Computing Techniques for Multi-knapsack Problems
Abhishek Awasthi, Francesco Bär, Joseph Doetsch, et al.
Lecture notes in networks and systems (2023), pp. 264-284
Open Access | Times Cited: 9
Quantum-Assisted Solution Paths for the Capacitated Vehicle Routing Problem
Lilly Palackal, Benedikt Poggel, Matthias Wulff, et al.
2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2023)
Closed Access | Times Cited: 9
Convergence of digitized-counterdiabatic QAOA: circuit depth versus free parameters
Mara Vizzuso, Gianluca Passarelli, Giovanni Cantele, et al.
New Journal of Physics (2023) Vol. 26, Iss. 1, pp. 013002-013002
Open Access | Times Cited: 9
Low-depth Clifford circuits approximately solve MaxCut
Manuel H. Muñoz-Arias, Stefanos Kourtis, Alexandre Blais
Physical Review Research (2024) Vol. 6, Iss. 2
Open Access | Times Cited: 3
Quantum Artificial Intelligence: A Brief Survey
Matthias Klusch, Jörg Lässig, Daniel Müssig, et al.
KI - Künstliche Intelligenz (2024) Vol. 38, Iss. 4, pp. 257-276
Open Access | Times Cited: 3
Patterns for Hybrid Quantum Algorithms
Manuela Weigold, Johanna Barzen, Frank Leymann, et al.
Communications in computer and information science (2021), pp. 34-51
Closed Access | Times Cited: 21
Evolving objective function for improved variational quantum optimization
Ioannis Kolotouros, Petros Wallden
Physical Review Research (2022) Vol. 4, Iss. 2
Open Access | Times Cited: 14
Similarity-based parameter transferability in the quantum approximate optimization algorithm
Alexey Galda, E Gupta, Jose Falla, et al.
Frontiers in Quantum Science and Technology (2023) Vol. 2
Open Access | Times Cited: 8
Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
Nicolas P. D. Sawaya, Albert T Schmitz, Stuart Hadfield
Quantum (2023) Vol. 7, pp. 1111-1111
Open Access | Times Cited: 8

Scroll to top