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 76-100 of 190 citing articles:

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
Mixer-phaser Ansätze for quantum optimization with hard constraints
Ryan LaRose, Eleanor Rieffel, Davide Venturelli
Quantum Machine Intelligence (2022) Vol. 4, Iss. 2
Open Access | Times Cited: 13
Augmenting QAOA Ansatz with Multiparameter Problem-Independent Layer
Michelle Chalupnik, Hans Melo, Yuri Alexeev, et al.
2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2022), pp. 97-103
Open Access | Times Cited: 13
Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
Yunlong Yu, Chenfeng Cao, Xiang‐Bin Wang, et al.
Physical Review Research (2023) Vol. 5, Iss. 2
Open Access | Times Cited: 7
An introduction to variational quantum algorithms for combinatorial optimization problems
Camille Grangé, Michael Poss, Eric Bourreau
4OR (2023) Vol. 21, Iss. 3, pp. 363-403
Closed Access | Times Cited: 7
A Quantum Computing Approach for the Unit Commitment Problem
Pascal Halffmann, Patrick Holzer, Kai Plociennik, et al.
Lecture notes in operations research (2023), pp. 113-120
Closed Access | Times Cited: 7
The Role of Entanglement in Quantum-Relaxation Based Optimization Algorithms
Kosei Teramoto, Rudy Raymond, Hiroshi Imai
2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2023), pp. 543-553
Open Access | Times Cited: 7
Distributionally Robust Variational Quantum Algorithms With Shifted Noise
Zichang He, Bo Peng, Yuri Alexeev, et al.
IEEE Transactions on Quantum Engineering (2024) Vol. 5, pp. 1-12
Open Access | Times Cited: 2
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
Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms
Teague Tomesh, Nicholas Allen, Daniel Dilley, et al.
Quantum (2024) Vol. 8, pp. 1493-1493
Open Access | Times Cited: 2
Iteration Complexity of Variational Quantum Algorithms
Vyacheslav Kungurtsev, Georgios Korpas, Jakub Mareček, et al.
Quantum (2024) Vol. 8, pp. 1495-1495
Open Access | Times Cited: 2
Benchmarking Digital Quantum Simulations Above Hundreds of Qubits Using Quantum Critical Dynamics
Alexander Miessen, Daniel J. Egger, Ivano Tavernelli, et al.
PRX Quantum (2024) Vol. 5, Iss. 4
Open Access | Times Cited: 2
Performance Evaluation and Acceleration of the QTensor Quantum Circuit Simulator on GPUs
Danylo Lykov, Angela Chen, Huaxuan Chen, et al.
(2021), pp. 27-34
Open Access | Times Cited: 16
From Digital Humanities to Quantum Humanities: Potentials and Applications
Johanna Barzen
Springer eBooks (2022), pp. 1-52
Closed Access | Times Cited: 11
Quantum Local Search with the Quantum Alternating Operator Ansatz
Teague Tomesh, Zain H. Saleem, Martin Suchara
Quantum (2022) Vol. 6, pp. 781-781
Open Access | Times Cited: 11
Bayesian learning of parameterised quantum circuits
Samuel Duffield, Marcello Benedetti, Matthias Rosenkranz
Machine Learning Science and Technology (2023) Vol. 4, Iss. 2, pp. 025007-025007
Open Access | Times Cited: 6
Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
Felix Gemeinhardt, Antonio Garmendía, Manuel Wimmer, et al.
ACM Computing Surveys (2023) Vol. 56, Iss. 3, pp. 1-36
Open Access | Times Cited: 6
Freedom of the mixer rotation axis improves performance in the quantum approximate optimization algorithm
Luke C. G. Govia, C. Poole, M. Saffman, et al.
Physical review. A/Physical review, A (2021) Vol. 104, Iss. 6
Open Access | Times Cited: 15
Selection and Optimization of Hyperparameters in Warm-Started Quantum Optimization for the MaxCut Problem
Felix Truger, Martin Beisel, Johanna Barzen, et al.
Electronics (2022) Vol. 11, Iss. 7, pp. 1033-1033
Open Access | Times Cited: 10
Markov chain Monte Carlo enhanced variational quantum algorithms
Taylor L. Patti, Omar Shehab, Khadijeh Najafi, et al.
Quantum Science and Technology (2022) Vol. 8, Iss. 1, pp. 015019-015019
Open Access | Times Cited: 10
Quantum Optimization Heuristics with an Application to Knapsack Problems
Wim van Dam, Karim Eldefrawy, Nicholas Genise, et al.
2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2021)
Open Access | Times Cited: 14
Quantum approximate optimization for combinatorial problems with constraints
Yue Ruan, Zhiqiang Yuan, Xiling Xue, et al.
Information Sciences (2022) Vol. 619, pp. 98-125
Closed Access | Times Cited: 9
Quantum Computing Techniques for Multi-Knapsack Problems
Abhishek Awasthi, Francesco Bär, Joseph Doetsch, et al.
arXiv (Cornell University) (2023)
Open Access | Times Cited: 5
Data re-uploading with a single qudit
Noah L. Wach, Manuel S. Rudolph, Fred Jendrzejewski, et al.
Quantum Machine Intelligence (2023) Vol. 5, Iss. 2
Open Access | Times Cited: 5
Initial State Encoding via Reverse Quantum Annealing and H-Gain Features
Elijah Pelofske, Georg Hahn, Hristo Djidjev
IEEE Transactions on Quantum Engineering (2023) Vol. 4, pp. 1-21
Open Access | Times Cited: 5

Scroll to top