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:

Showing 1-25 of 45 citing articles:

There and back again: A circuit extraction tale
Miriam Backens, Hector Miller-Bakewell, Giovanni de Felice, et al.
Quantum (2021) Vol. 5, pp. 421-421
Open Access | Times Cited: 61
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
Ross Duncan, Aleks Kissinger, Simon Perdrix, et al.
Quantum (2020) Vol. 4, pp. 279-279
Open Access | Times Cited: 67
Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
Aleks Kissinger, John van de Wetering
Quantum Science and Technology (2022) Vol. 7, Iss. 4, pp. 044001-044001
Open Access | Times Cited: 34
Contraction of ZX diagrams with triangles via stabiliser decompositions
Mark Koch, Richie Yeung, Quanlong Wang
Physica Scripta (2024) Vol. 99, Iss. 10, pp. 105122-105122
Open Access | Times Cited: 4
Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
Boldizsár Poór, Quanlong Wang, Razin A. Shaikh, et al.
(2023), pp. 1-14
Open Access | Times Cited: 10
Simulating molecules on a cloud-based 5-qubit IBM-Q universal quantum computer
Sebastian Leontica, Felix Tennie, Tristan Farrow
Communications Physics (2021) Vol. 4, Iss. 1
Open Access | Times Cited: 21
An Algebraic Axiomatisation of ZX-calculus
Quanlong Wang
arXiv (Cornell University) (2021) Vol. 340, pp. 303-332
Open Access | Times Cited: 17
Diagrammatic Analysis for Parameterized Quantum Circuits
Tobias Stollenwerk, Stuart Hadfield
Electronic Proceedings in Theoretical Computer Science (2023) Vol. 394, pp. 262-301
Open Access | Times Cited: 7
Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization
Korbinian Staudacher, Tobias Guggemos, Sophia Grundner-Culemann, et al.
Electronic Proceedings in Theoretical Computer Science (2023) Vol. 394, pp. 29-45
Open Access | Times Cited: 7
Enriching Diagrams with Algebraic Operations
Alejandro Villoria, Henning Basold, Alfons Laarman
Lecture notes in computer science (2024), pp. 121-143
Open Access | Times Cited: 2
Measurement-Based Quantum Approximate Optimization
Tobias Stollenwerk, Stuart Hadfield
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (2024), pp. 1115-1127
Open Access | Times Cited: 2
Automated Reasoning in Quantum Circuit Compilation
Dimitrios Thanos, Alejandro Villoria, Sebastiaan Brand, et al.
Lecture notes in computer science (2024), pp. 106-134
Closed Access | Times Cited: 2
Foundations for Near-Term Quantum Natural Language Processing.
Bob Coecke, Giovanni de Felice, Konstantinos Meichanetzidis, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 18
Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms
Niel de Beaudrap, Ross Duncan, Dominic Horsman, et al.
arXiv (Cornell University) (2020) Vol. 318, pp. 85-105
Open Access | Times Cited: 17
A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness
Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart
(2019), pp. 1-10
Open Access | Times Cited: 16
Completeness of the ZH-calculus
Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell, et al.
Compositionality (2023) Vol. 5, pp. 5-5
Open Access | Times Cited: 5
ZX-calculus for the working quantum computer scientist
John van de Wetering
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 14
The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford
Renaud Vilmart
Lecture notes in computer science (2021), pp. 531-550
Closed Access | Times Cited: 12
AKLT-States as ZX-Diagrams: Diagrammatic Reasoning for Quantum States
Richard D.P. East, John van de Wetering, Nicholas Chancellor, et al.
PRX Quantum (2022) Vol. 3, Iss. 1
Open Access | Times Cited: 9
Minimal Equational Theories for Quantum Circuits
Alexandre Clément, Noé Delorme, Simon Perdrix
(2024), pp. 1-14
Open Access | Times Cited: 1
Optimizing ZX-Diagrams with Deep Reinforcement Learning
M Nägele, Florian Marquardt
Machine Learning Science and Technology (2024) Vol. 5, Iss. 3, pp. 035077-035077
Open Access | Times Cited: 1
AND-gates in ZX-calculus: Spider Nest Identities and QBC-completeness
Anthony Munson, Bob Coecke, Quanlong Wang
arXiv (Cornell University) (2021) Vol. 340, pp. 230-255
Open Access | Times Cited: 9
Algebraic complete axiomatisation of ZX-calculus with a normal form via elementary matrix operations
Quanlong Wang
arXiv (Cornell University) (2020)
Open Access | Times Cited: 9
Kindergarden quantum mechanics graduates ...or how I learned to stop gluing LEGO together and love the ZX-calculus
Bob Coecke, Dominic Horsman, Aleks Kissinger, et al.
Theoretical Computer Science (2021) Vol. 897, pp. 1-22
Open Access | Times Cited: 8
Towards a Minimal Stabilizer ZX-calculus
Miriam Backens, Simon Perdrix, Quanlong Wang
arXiv (Cornell University) (2017)
Open Access | Times Cited: 7
Page 1 - Next Page

Scroll to top