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:
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
Renaud Vilmart
Lecture notes in computer science (2021), pp. 531-550
Closed Access | Times Cited: 12
Showing 12 citing articles:
Linear and Non-linear Relational Analyses for Quantum Program Optimization
Matthew Amy, Joseph Lunderville
Proceedings of the ACM on Programming Languages (2025) Vol. 9, Iss. POPL, pp. 1072-1103
Open Access
Matthew Amy, Joseph Lunderville
Proceedings of the ACM on Programming Languages (2025) Vol. 9, Iss. POPL, pp. 1072-1103
Open Access
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
Louis Lemonnier, John van de Wetering, Aleks Kissinger
arXiv (Cornell University) (2021) Vol. 340, pp. 188-212
Open Access | Times Cited: 19
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
Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell, et al.
Compositionality (2023) Vol. 5, pp. 5-5
Open Access | Times Cited: 5
Formal Methods for Quantum Programs: A Survey
Christophe Chareton, Sébastien Bardin, Dong-Ho Lee, et al.
arXiv (Cornell University) (2021)
Open Access | Times Cited: 6
Christophe Chareton, Sébastien Bardin, Dong-Ho Lee, et al.
arXiv (Cornell University) (2021)
Open Access | Times Cited: 6
Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes
Matthew Amy
Electronic Proceedings in Theoretical Computer Science (2023) Vol. 384, pp. 127-141
Open Access | Times Cited: 2
Matthew Amy
Electronic Proceedings in Theoretical Computer Science (2023) Vol. 384, pp. 127-141
Open Access | Times Cited: 2
Symbolic Synthesis of Clifford Circuits and Beyond
Matthew Amy, Owen Bennett-Gibbs, Neil J. Ross
Electronic Proceedings in Theoretical Computer Science (2023) Vol. 394, pp. 343-362
Open Access | Times Cited: 2
Matthew Amy, Owen Bennett-Gibbs, Neil J. Ross
Electronic Proceedings in Theoretical Computer Science (2023) Vol. 394, pp. 343-362
Open Access | Times Cited: 2
A Graphical #SAT Algorithm for Formulae with Small Clause Density
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
arXiv (Cornell University) (2022)
Open Access | Times Cited: 3
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
arXiv (Cornell University) (2022)
Open Access | Times Cited: 3
The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality
Patrick Roy, John van de Wetering, Lia Yeh
Electronic Proceedings in Theoretical Computer Science (2023) Vol. 384, pp. 142-170
Open Access | Times Cited: 1
Patrick Roy, John van de Wetering, Lia Yeh
Electronic Proceedings in Theoretical Computer Science (2023) Vol. 384, pp. 142-170
Open Access | Times Cited: 1
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
Renaud Vilmart
Logical Methods in Computer Science (2024) Vol. Volume 20, Issue 1
Open Access
Renaud Vilmart
Logical Methods in Computer Science (2024) Vol. Volume 20, Issue 1
Open Access
A Graphical #SAT Algorithm for Formulae with Small Clause Density
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
Electronic Proceedings in Theoretical Computer Science (2024) Vol. 406, pp. 137-161
Open Access
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
Electronic Proceedings in Theoretical Computer Science (2024) Vol. 406, pp. 137-161
Open Access
The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality
Patrick Roy, John van de Wetering, Lia Yeh
arXiv (Cornell University) (2023)
Open Access
Patrick Roy, John van de Wetering, Lia Yeh
arXiv (Cornell University) (2023)
Open Access
Symbolic Synthesis of Clifford Circuits and Beyond
Matthew Amy, Owen Bennett-Gibbs, Neil J. Ross
arXiv (Cornell University) (2022)
Open Access
Matthew Amy, Owen Bennett-Gibbs, Neil J. Ross
arXiv (Cornell University) (2022)
Open Access
