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:
Extending relax-and-round combinatorial optimization solvers with quantum correlations
Maxime Dupont, Bhuvanesh Sundar
Physical review. A/Physical review, A (2024) Vol. 109, Iss. 1
Closed Access | Times Cited: 8
Maxime Dupont, Bhuvanesh Sundar
Physical review. A/Physical review, A (2024) Vol. 109, Iss. 1
Closed Access | Times Cited: 8
Showing 8 citing articles:
Approximate Solutions of Combinatorial Problems via Quantum Relaxations
Bryce Fuller, Charles Hadfield, Jennifer R. Glick, et al.
IEEE Transactions on Quantum Engineering (2024) Vol. 5, pp. 1-15
Open Access | Times Cited: 8
Bryce Fuller, Charles Hadfield, Jennifer R. Glick, et al.
IEEE Transactions on Quantum Engineering (2024) Vol. 5, pp. 1-15
Open Access | Times Cited: 8
Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems
Filip B. Maciejewski, Stuart Hadfield, Benjamin Hall, et al.
Physical Review Applied (2024) Vol. 22, Iss. 4
Open Access | Times Cited: 8
Filip B. Maciejewski, Stuart Hadfield, Benjamin Hall, et al.
Physical Review Applied (2024) Vol. 22, Iss. 4
Open Access | Times Cited: 8
Enhancing Quantum Algorithms for Quadratic Unconstrained Binary Optimization via Integer Programming
Friedrich Wagner, Jonas Nüßlein, Frauke Liers
ACM Transactions on Quantum Computing (2025)
Open Access
Friedrich Wagner, Jonas Nüßlein, Frauke Liers
ACM Transactions on Quantum Computing (2025)
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
Maxime Dupont, Bhuvanesh Sundar, Bram Evert, et al.
Physical Review Applied (2025) Vol. 23, Iss. 1
Closed Access
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
Manuel H. Muñoz-Arias, Stefanos Kourtis, Alexandre Blais
Physical Review Research (2024) Vol. 6, Iss. 2
Open Access | Times Cited: 3
Utilizing modern computer architectures to solve mathematical optimization problems: A survey
David E. Bernal Neira, Carl D. Laird, Laurens Lueg, et al.
Computers & Chemical Engineering (2024) Vol. 184, pp. 108627-108627
Closed Access | Times Cited: 2
David E. Bernal Neira, Carl D. Laird, Laurens Lueg, et al.
Computers & Chemical Engineering (2024) Vol. 184, pp. 108627-108627
Closed Access | Times Cited: 2
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
Jonathan Wurtz, Stefan Sack, Sheng-Tao Wang
IEEE Transactions on Quantum Engineering (2024) Vol. 5, pp. 1-14
Open Access | Times Cited: 2
Near-term quantum algorithm for solving the MaxCut problem with fewer quantum resources
Zhao Xiumei, Yongmei Li, Jing Li, et al.
Physica A Statistical Mechanics and its Applications (2024) Vol. 648, pp. 129951-129951
Closed Access
Zhao Xiumei, Yongmei Li, Jing Li, et al.
Physica A Statistical Mechanics and its Applications (2024) Vol. 648, pp. 129951-129951
Closed Access
