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:

ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
Miriam Backens, Aleks Kissinger
arXiv (Cornell University) (2019) Vol. 287, pp. 23-42
Open Access | Times Cited: 46

Showing 1-25 of 46 citing articles:

Reducing the number of non-Clifford gates in quantum circuits
Aleks Kissinger, John van de Wetering
Physical review. A/Physical review, A (2020) Vol. 102, Iss. 2
Open Access | Times Cited: 132
PyZX: Large Scale Automated Diagrammatic Reasoning
Aleks Kissinger, John van de Wetering
arXiv (Cornell University) (2020) Vol. 318, pp. 229-241
Open Access | Times Cited: 109
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
The challenge and opportunities of quantum literacy for future education and transdisciplinary problem-solving
Laurentiu Nita, Laura Mazzoli Smith, Nicholas Chancellor, et al.
Research in Science & Technological Education (2021) Vol. 41, Iss. 2, pp. 564-580
Open Access | Times Cited: 37
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
Universal MBQC with generalised parity-phase interactions and Pauli measurements
Aleks Kissinger, John van de Wetering
Quantum (2019) Vol. 3, pp. 134-134
Open Access | Times Cited: 28
Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits
Matthew Amy, Andrew N. Glaudell, Neil J. Ross
Quantum (2020) Vol. 4, pp. 252-252
Open Access | Times Cited: 26
With a Few Square Roots, Quantum Computing Is as Easy as Pi
Jacques Carette, Chris Heunen, Robin Kaarsgaard, et al.
Proceedings of the ACM on Programming Languages (2024) Vol. 8, Iss. POPL, pp. 546-574
Open Access | Times Cited: 3
Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus
Louis Lemonnier, John van de Wetering, Aleks Kissinger
arXiv (Cornell University) (2021) Vol. 340, pp. 188-212
Open Access | Times Cited: 19
Tensor Network Rewriting Strategies for Satisfiability and Counting
Niel de Beaudrap, Aleks Kissinger, Konstantinos Meichanetzidis
arXiv (Cornell University) (2021) Vol. 340, pp. 46-59
Open Access | Times Cited: 17
An Algebraic Axiomatisation of ZX-calculus
Quanlong Wang
arXiv (Cornell University) (2021) Vol. 340, pp. 303-332
Open Access | Times Cited: 17
Quantum Picturalism: Learning Quantum Theory in High School
Selma Dündar‐Coecke, Lia Yeh, Caterina Puca, et al.
2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2023), pp. 21-32
Open Access | Times Cited: 6
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
Graphical Fourier Theory and the Cost of Quantum Addition
Stach Kuijpers, John van de Wetering, Aleks Kissinger
arXiv (Cornell University) (2019)
Open Access | Times Cited: 12
Relating Measurement Patterns to Circuits via Pauli Flow
Will Simmons
arXiv (Cornell University) (2021) Vol. 343, pp. 50-101
Open Access | Times Cited: 10
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
ZX-Calculus and Extended Wolfram Model Systems II: Fast Diagrammatic Reasoning with an Application to Quantum Circuit Simplification
Jonathan Gorard, Manojna Namuduri, Xerxes D. Arsiwalla
arXiv (Cornell University) (2021)
Open Access | Times Cited: 9
SZX-calculus: Scalable Graphical Quantum Reasoning
Titouan Carette, Dominic Horsman, Simon Perdrix
arXiv (Cornell University) (2019)
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
When Only Topology Matters
Titouan Carette
arXiv (Cornell University) (2021)
Open Access | Times Cited: 7
ZX-Calculus and Extended Hypergraph Rewriting Systems I: A Multiway Approach to Categorical Quantum Information Theory.
Jonathan Gorard, Manojna Namuduri, Xerxes D. Arsiwalla
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 6
Page 1 - Next Page

Scroll to top