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:

Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
Elijah Pelofske, Andreas Bärtschi, Stephan Eidenbenz
Lecture notes in computer science (2023), pp. 240-258
Open Access | Times Cited: 33

Showing 1-25 of 33 citing articles:

A review on Quantum Approximate Optimization Algorithm and its variants
Kostas Blekos, Dean Brand, Andrea Ceschini, et al.
Physics Reports (2024) Vol. 1068, pp. 1-66
Open Access | Times Cited: 77
Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem
Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti, et al.
Science Advances (2024) Vol. 10, Iss. 22
Open Access | Times Cited: 31
Quantum approximate optimization via learning-based adaptive optimization
Lixue Cheng, Yuqin Chen, Shi‐Xin Zhang, et al.
Communications Physics (2024) Vol. 7, Iss. 1
Open Access | Times Cited: 9
Quantum-enhanced greedy combinatorial optimization solver
Maxime Dupont, Bram Evert, Mark J. Hodson, et al.
Science Advances (2023) Vol. 9, Iss. 45
Open Access | Times Cited: 19
Short-depth QAOA circuits and quantum annealing on higher-order ising models
Elijah Pelofske, Andreas Bärtschi, Stephan Eidenbenz
npj Quantum Information (2024) Vol. 10, Iss. 1
Open Access | Times Cited: 7
High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
Elijah Pelofske, Andreas Bärtschi, John Golden, et al.
2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2023), pp. 506-517
Open Access | Times Cited: 14
Alignment between initial state and mixer improves QAOA performance for constrained optimization
Zichang He, Ruslan Shaydulin, Shouvanik Chakrabarti, et al.
npj Quantum Information (2023) Vol. 9, Iss. 1
Open Access | Times Cited: 13
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
Determining probability density functions with adiabatic quantum computing
Matteo Robbiati, Juan Cruz-Martinez, Stefano Carrazza
Quantum Machine Intelligence (2025) Vol. 7, Iss. 1
Open Access
Application of Quantum Computers and Their Unique Properties for Constrained Optimization in Engineering Problems: Welded Beam Design
Dawid Ewald
Electronics (2025) Vol. 14, Iss. 5, pp. 1027-1027
Open Access
Multiobjective Optimization and Network Routing With Near-Term Quantum Computers
Shao-Hen Chiew, Kilian Poirier, Rajesh Mishra, et al.
IEEE Transactions on Quantum Engineering (2024) Vol. 5, pp. 1-19
Open Access | Times Cited: 3
Hybrid Gate-Based and Annealing Quantum Computing for Large-Size Ising Problems
Chen-Yu Liu, Hsi‐Sheng Goan
Research Square (Research Square) (2024)
Open Access | Times Cited: 2
QAOA-Assisted Benders' Decomposition for Mixed-integer Linear Programming
Zhongqi Zhao, Lei Fan, Yuanxiong Guo, et al.
ICC 2022 - IEEE International Conference on Communications (2024), pp. 1127-1132
Closed Access | Times Cited: 2
Hybrid Iterative Annealing Method Using a Quantum Annealer and a Classical Computer
Keisuke Fukada, Tatshuhiko Shirai, Nozomu Togawa
2023 IEEE International Conference on Consumer Electronics (ICCE) (2024), pp. 1-6
Closed Access | Times Cited: 1
Benchmarking Metaheuristic-Integrated QAOA Against Quantum Annealing
Arul Rhik Mazumder, Anuvab Sen, Udayon Sen
Lecture notes in networks and systems (2024), pp. 651-666
Closed Access | Times Cited: 1
Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs
Elijah Pelofske, Andreas Bärtschi, Łukasz Cincio, et al.
npj Quantum Information (2024) Vol. 10, Iss. 1
Open Access | Times Cited: 1
A Review on Quantum Approximate Optimization Algorithm and its Variants
Kostas Blekos, Dean Brand, Andrea Ceschini, et al.
arXiv (Cornell University) (2023)
Open Access | Times Cited: 4
Variational Amplitude Amplification for Solving QUBO Problems
Daniel Koch, Massimiliano Cutugno, Saahil Patel, et al.
Quantum Reports (2023) Vol. 5, Iss. 4, pp. 625-658
Open Access | Times Cited: 3
Variational Amplitude Amplification for Solving QUBO Problems
Daniel Koch, Massimiliano Cutugno, Saahil Patel, et al.
(2023)
Open Access | Times Cited: 2
On the possibility of using quantum annealers to solve problems of computational materials science
Nickolay V Maletin, V. V. Dremov, I. I. Klebanov
Laser Physics Letters (2023) Vol. 20, Iss. 11, pp. 115205-115205
Closed Access | Times Cited: 2
Quantum Join Ordering by Splitting the Search Space of QUBO Problems
N. Nayak, Tobias Winker, Umut Çalıkyılmaz, et al.
Datenbank-Spektrum (2024) Vol. 24, Iss. 1, pp. 21-32
Open Access
Tight Lieb–Robinson Bound for approximation ratio in quantum annealing
Arthur Braida, Simon Martiel, Ioan Todinca
npj Quantum Information (2024) Vol. 10, Iss. 1
Open Access
A Layerwise-Multi-Angle Approach to Fine-Tuning the Quantum Approximate Optimization Algorithm
Leonardo Lavagna, Andrea Ceschini, Antonello Rosato, et al.
2022 International Joint Conference on Neural Networks (IJCNN) (2024) Vol. abs/1911.08043, pp. 1-8
Closed Access
Benchmarking Quantum Annealers with Near-Optimal Minor-Embedded Instances
Valentin Gilbert, Julien Rodriguez, Stéphane Louise
2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2024), pp. 531-537
Closed Access
High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
Elijah Pelofske, Andreas Bärtschi, John Golden, et al.
arXiv (Cornell University) (2023)
Open Access | Times Cited: 1
Page 1 - Next Page

Scroll to top