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:

Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm
Danylo Lykov, Jonathan Wurtz, C. Poole, et al.
npj Quantum Information (2023) Vol. 9, Iss. 1
Open Access | Times Cited: 19

Showing 19 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

Early Fault-Tolerant Quantum Computing
Amara Katabarwa, Katerina Gratsea, Athena Caesura, et al.
PRX Quantum (2024) Vol. 5, Iss. 2
Open Access | Times Cited: 13

Symmetry-informed transferability of optimal parameters in the quantum approximate optimization algorithm
Isak Brundin, Laura García-Álvarez
Physical review. A/Physical review, A (2025) Vol. 111, Iss. 2
Open Access | Times Cited: 1

Approximate Boltzmann distributions in quantum approximate optimization
Phillip C. Lotshaw, George Siopsis, James Ostrowski, et al.
Physical review. A/Physical review, A (2023) Vol. 108, Iss. 4
Open Access | Times Cited: 13

Demonstration of Weighted-Graph Optimization on a Rydberg-Atom Array Using Local Light Shifts
André Gonçalves de Oliveira, E. Diamond-Hitchcock, D. M. Walker, et al.
PRX Quantum (2025) Vol. 6, Iss. 1
Open Access

Benchmarking quantum optimization for the maximum-cut problem on a superconducting quantum computer
Maxime Dupont, Bhuvanesh Sundar, Bram Evert, et al.
Physical Review Applied (2025) Vol. 23, Iss. 1
Closed Access

Quantum imaginary time evolution and the unit-disk maximum independent set problem
Víctor A. Penas, Marcelo Losada, Pedro W. Lamberti
Physical review. A/Physical review, A (2025) Vol. 111, Iss. 4
Closed Access

Fast Simulation of High-Depth QAOA Circuits
Danylo Lykov, Ruslan Shaydulin, Yue Sun, et al.
(2023), pp. 1443-1451
Closed Access | Times Cited: 10

Solving Non-native Combinatorial Optimization Problems using Hybrid Quantum-classical Algorithms
Jonathan Wurtz, Stefan Sack, Sheng-Tao Wang
IEEE Transactions on Quantum Engineering (2024) Vol. 5, pp. 1-14
Open Access | Times Cited: 2

Performance analysis of multi-angle QAOA for $$p > 1$$
Igor Gaidai, Rebekah Herrman
Scientific Reports (2024) Vol. 14, Iss. 1
Open Access | Times Cited: 2

Research advancements in quantum computing and digital twins
Jeerisuda Khumsikiew, Rojjares Netthong, Bancha Yingngam
Elsevier eBooks (2024), pp. 103-125
Closed Access | Times Cited: 2

Simulations of Quantum Approximate Optimization Algorithm on HPC-QC Integrated Systems
Seongmin Kim, In‐Saeng Suh
2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2024), pp. 464-465
Closed 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

Multiple Query Optimization Using a Gate-Based Quantum Computer
Tobias Fankhauser, Marc E. Solèr, Rudolf Marcel Füchslin, et al.
IEEE Access (2023) Vol. 11, pp. 114031-114043
Open Access | Times Cited: 4

Generation of quantum phases of matter and finding a maximum-weight independent set of unit-disk graphs using Rydberg atoms
Ahmed M. Farouk, I. I. Beterov, Peng Xu, et al.
Physical review. A/Physical review, A (2024) Vol. 110, Iss. 2
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

Optimized Noise Suppression for Quantum Circuits
Friedrich Wagner, Daniel J. Egger, Frauke Liers
INFORMS journal on computing (2024)
Open Access

QArchSearch: A Scalable Quantum Architecture Search Package
Ankit Kulshrestha, Ilya Safro, Yuri Alexeev
(2023), pp. 1487-1491
Open Access | Times Cited: 1

NISQ-compatible approximate quantum algorithm for unconstrained and constrained discrete optimization
M. R. Perelshtein, A. I. Pakhomchik, А. А. Мельников, et al.
arXiv (Cornell University) (2023)
Open Access

Fast Simulation of High-Depth QAOA Circuits
Danylo Lykov, Ruslan Shaydulin, Yue Sun, et al.
arXiv (Cornell University) (2023)
Open Access

Page 1

Scroll to top