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:

Space-efficient binary optimization for variational quantum computing
Adam Glos, Aleksandra Krawiec, Zoltán Zimborás
npj Quantum Information (2022) Vol. 8, Iss. 1
Open Access | Times Cited: 31

Showing 1-25 of 31 citing articles:

Towards large-scale quantum optimization solvers with few qubits
Marco Sciorilli, Lucas R. Borges, Taylor L. Patti, et al.
Nature Communications (2025) Vol. 16, Iss. 1
Open Access | Times Cited: 3
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
Qubit Efficient Quantum Algorithms for the Vehicle Routing Problem on Noisy Intermediate‐Scale Quantum Processors
Ioannis D. Leonidas, Alexander Dukakis, Benjamin Y. L. Tan, et al.
Advanced Quantum Technologies (2024) Vol. 7, Iss. 5
Closed Access | Times Cited: 6
Accelerating Grover Adaptive Search: Qubit and Gate Count Reduction Strategies With Higher Order Formulations
Y. Sano, Kosuke Mitarai, Naoki Yamamoto, et al.
IEEE Transactions on Quantum Engineering (2024) Vol. 5, pp. 1-12
Open Access | Times Cited: 6
Computing high-degree polynomial gradients in memory
Tinish Bhattacharya, George Higgins Hutchinson, Giacomo Pedretti, et al.
Nature Communications (2024) Vol. 15, Iss. 1
Open Access | Times Cited: 6
The Quantum Cybersecurity Threat May Arrive Sooner Than You Think
Pete Ford
Computer (2023) Vol. 56, Iss. 2, pp. 134-136
Open Access | Times Cited: 13
A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem
Ningyi Xie, Xinwei Lee, Dongsheng Cai, et al.
Research Square (Research Square) (2024)
Open Access | Times Cited: 4
Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
Bence Bakó, Adam Glos, Özlem Salehi, et al.
Quantum (2025) Vol. 9, pp. 1663-1663
Open Access
Speedup of high-order unconstrained binary optimization using quantum $${{\mathbb{Z}}}_{2}$$ lattice gauge theory
Bi-Ying Wang, Xiaopeng Cui, Qingguo Zeng, et al.
Communications Physics (2025) Vol. 8, Iss. 1
Open Access
Encoding-independent optimization problem formulation for quantum computing
Federico Domínguez, Josua Unger, Matthias Traube, et al.
Frontiers in Quantum Science and Technology (2023) Vol. 2
Open Access | Times Cited: 11
Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem
Y. Sano, Masaya Norimoto, Naoki Ishikawa
IEEE Transactions on Quantum Engineering (2023) Vol. 4, pp. 1-12
Open Access | Times Cited: 9
Evidence that PUBO outperforms QUBO when solving continuous optimization problems with the QAOA
Jonas Stein, Farbod Chamanian, Maximilian Zorn, et al.
(2023)
Open Access | Times Cited: 8
The Coming Decades of Quantum Simulation
Joana Fraxanet, Tymoteusz Salamon, Maciej Lewenstein
Lecture notes in physics (2023), pp. 85-125
Closed 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
Exponential qubit reduction in optimization for financial transaction settlement
Elias X. Huber, Benjamin Y. L. Tan, Paul Griffin, et al.
EPJ Quantum Technology (2024) Vol. 11, Iss. 1
Open Access | Times Cited: 2
Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing
Krzysztof Domino, Akash Kundu, Özlem Salehi, et al.
Quantum Information Processing (2022) Vol. 21, Iss. 9
Open Access | Times Cited: 12
Optimizing the Production of Test Vehicles Using Hybrid Constrained Quantum Annealing
Adam Glos, Akash Kundu, Özlem Salehi
SN Computer Science (2023) Vol. 4, Iss. 5
Open Access | Times Cited: 6
Quantum Data Encoding Patterns and their Consequences
Martin Gogeissl, Hila Safi, Wolfgang Mauerer
(2024), pp. 27-37
Closed Access | Times Cited: 1
A feasibility-preserved quantum approximate solver for the Capacitated Vehicle Routing Problem
Ningyi Xie, Xinwei Lee, Dongsheng Cai, et al.
Quantum Information Processing (2024) Vol. 23, Iss. 8
Open Access | Times Cited: 1
A quantum information theoretic analysis of reinforcement learning-assisted quantum architecture search
Abhishek Sadhu, Aritra Sarkar, Akash Kundu
Quantum Machine Intelligence (2024) Vol. 6, Iss. 2
Open Access | Times Cited: 1
Quantum Annealing and GNN for Solving TSP with QUBO
Haoqi He
Lecture notes in computer science (2024), pp. 134-145
Closed Access | Times Cited: 1
Embedding All Feasible Solutions of Traveling Salesman Problem by Divide-and-Conquer Quantum Search
Rei Sato, Kazuhiro Saito, Tetsuro Nikuni, et al.
2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2023), pp. 270-271
Closed Access | Times Cited: 2
Hamiltonian-oriented homotopy quantum approximate optimization algorithm
Akash Kundu, Ludmila Botelho, Adam Glos
Physical review. A/Physical review, A (2024) Vol. 109, Iss. 2
Closed Access
Scientometric Analysis of Quantum Algorithms for VANET Optimization
Pooja, Sandeep K. Sood
IEEE Transactions on Systems Man and Cybernetics Systems (2024) Vol. 54, Iss. 10, pp. 6447-6457
Closed Access
Efficient Encodings of the Travelling Salesperson Problem for Variational Quantum Algorithms
Manuel Schnaus, Lilly Palackal, Benedikt Poggel, et al.
(2024), pp. 81-87
Open Access
Page 1 - Next Page

Scroll to top