arxiv: 2605.11417 · v1 · submitted 2026-05-12 · 🪐 quant-ph

Recognition: 3 theorem links

· Lean Theorem

String Diagrams for Quantum Foundations, Computing and Natural Language Processing

Muhammad Hamza Waseem

Authors on Pith no claims yet

Pith reviewed 2026-05-13 02:23 UTC · model grok-4.3

classification 🪐 quant-ph

keywords string diagramsconstructor theorycategorical quantum mechanicswave logic circuitsDisCoCircprocess theoriesquantum foundationsnatural language processing

0 comments

The pith

String diagrams formalize constructor theory as a process theory and show that locality conflicts with composition in quantum physics.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The thesis applies string diagrams from symmetric monoidal categories to formalize processes across quantum foundations, logic circuits, and language. Constructor theory is recast as a process theory, exposing an incompatibility between its locality principle and the ability to compose processes in quantum settings. This leads to the claim that categorical quantum mechanics can serve as a constructor theory once locality is dropped. A separate formalism uses phase encoding to represent and optimize wave-based Boolean logic circuits, motivated by spin-wave examples. A hybrid grammar for Urdu is introduced so that restricted Urdu text produces DisCoCirc circuits identical to English ones up to gate translation, reducing language-specific overhead.

Core claim

We formalise constructor theory as a process theory. In the context of quantum physics, we also demonstrate the conflict between constructor-theoretic principles of locality and composition. Moreover, we argue that if the principle of locality is rejected, categorical quantum mechanics (CQM) can be conceived as a constructor theory of quantum physics. We develop a formalism for wave-based logic circuits with phase encoding and show that a hybrid grammar for Urdu maps its text surjectively onto DisCoCirc circuits, making Urdu and English circuits equivalent up to gate-level translation.

What carries the argument

String diagrams as a visually intuitive and mathematically rigorous syntax for symmetric monoidal categories that represent processes and their sequential or parallel composition.

If this is right

Constructor theory becomes expressible in the same diagrammatic language used for other process theories in physics and computing.
Wave-based logic circuits gain a systematic method for design, analysis, and optimization through phase encoding.
Grammatical bureaucracy between languages is reduced because Urdu and English fragments produce identical circuit structures up to translation.
A process-relational outlook across science gains concrete diagrammatic support that unifies foundations, computation, and language.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The diagrammatic approach could be tested on additional languages to check whether the equivalence of text circuits holds more broadly.
Rejecting locality while retaining composition might open routes to modeling non-local quantum effects in a constructor-theoretic setting.
Phase-encoded wave logic could be compared directly with standard gate models to quantify any reduction in physical resource use.

Load-bearing premise

String diagrams provide a faithful syntax that captures the essential principles of constructor theory, wave logic, and grammatical mappings without introducing artifacts or losing key properties.

What would settle it

A concrete constructor-theoretic task in quantum physics, such as a specific information-processing task, that cannot be represented by string diagrams while simultaneously satisfying both the locality and composition principles.

read the original abstract

Applied category theory provides powerful mathematical tools for modelling processes and their composition. Symmetric monoidal categories, which involve series and parallel composition, are particularly well-suited for describing the composition of processes in space and time. Also called process theories, they admit string diagrams, which constitute a visually intuitive, mathematically rigorous, expressive and flexible syntax that is applicable to wide-ranging scientific domains. In this thesis, we employ string diagrams to investigate a selection of topics in the areas of quantum foundations, computing, and natural language processing: (1) We formalise constructor theory as a process theory. In the context of quantum physics, we also demonstrate the conflict between constructor-theoretic principles of locality and composition. Moreover, we argue that if the principle of locality is rejected, categorical quantum mechanics (CQM) can be conceived as a constructor theory of quantum physics. (2) We develop a formalism for wave-based logic circuits with phase encoding. We motivate the formalism using the example of spin-wave circuits, and then demonstrate its utility in design, analysis and optimisation of Boolean logic circuits. (3) We investigate the elimination of inter-language grammatical bureaucracy in the distributional compositional circuits (DisCoCirc) framework. In particular, we develop a hybrid grammar for a restricted fragment of the Urdu language, and show that Urdu text endowed with this hybrid grammar maps surjectively to DisCoCirc text circuits. Furthermore, we show that for the same language fragment, Urdu and English text circuits become the same up to gate-level translation. The aforementioned work supports the view that a process-relational outlook in science is well-supported by applied category-theoretic tools, particularly string diagrams.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This thesis applies string diagrams to formalize constructor theory with a quantum locality-composition conflict, adds wave logic circuits, and gives a hybrid Urdu grammar for DisCoCirc, but the contributions stay within existing frameworks.

read the letter

The thesis formalizes constructor theory inside symmetric monoidal categories with string diagrams, shows an explicit conflict between its locality and composition principles in the quantum case, and concludes that categorical quantum mechanics becomes a constructor theory once locality is dropped. It also sets up a phase-encoding wave logic formalism, motivates it with spin-wave circuits, and uses it for Boolean logic design and optimization. On the language side it builds a hybrid grammar for a restricted Urdu fragment and proves that the resulting text circuits map surjectively onto DisCoCirc circuits and match English circuits up to gate translation. These are the concrete new pieces: the specific formalization, the conflict construction, the wave-logic examples, and the Urdu mapping. They are all explicit constructions rather than vague claims. The work is clearest when it stays close to the diagrams and shows how the mappings actually work. The softer parts are that the constructor-theory argument is conditional on rejecting locality and does not resolve any standing open problem in foundations; the Urdu grammar covers only a narrow fragment so it does not remove general inter-language bureaucracy; and the wave-logic section is mostly illustrative rather than delivering new circuit theorems or experimental data. No circularity or hidden assumptions appear in the steps that are described. This is for readers already working in applied category theory who want worked examples in quantum or categorical NLP. A serious referee should see it because the formal pieces are specific enough to check for consistency and because the thesis format lets the author lay out the three applications side by side.

Referee Report

2 major / 2 minor

Summary. The manuscript uses string diagrams in symmetric monoidal categories to (1) formalize constructor theory as a process theory, exhibit a conflict between its locality and composition principles in the quantum case, and argue that categorical quantum mechanics (CQM) becomes a constructor theory once locality is dropped; (2) introduce a phase-encoding formalism for wave-based logic circuits, motivated by spin-wave examples and applied to Boolean circuit design, analysis and optimisation; (3) construct a hybrid grammar for a fragment of Urdu within the DisCoCirc framework, proving a surjective mapping from Urdu text to DisCoCirc circuits and showing that Urdu and English circuits coincide up to gate-level translation.

Significance. If the explicit constructions hold, the work supplies a unified process-theoretic lens across quantum foundations, wave logic and multilingual compositional semantics, with concrete demonstrations (conflict between locality and composition, surjective grammar mapping) that illustrate the reach of string-diagram syntax. The absence of free parameters or ad-hoc axioms in the formalizations, together with the direct identification of CQM under relaxed locality, strengthens the case for applied category theory in these domains.

major comments (2)

[constructor theory section] § on constructor theory (quantum case): the claimed conflict between locality and composition is load-bearing for the subsequent identification of CQM with constructor theory; the manuscript must exhibit an explicit pair of string diagrams (or an equation) in which the two principles cannot be simultaneously satisfied, rather than arguing at the level of general principles.
[NLP section] DisCoCirc Urdu fragment: the surjectivity claim and the statement that Urdu and English circuits coincide up to gate translation are central to the elimination of grammatical bureaucracy; a concrete example circuit (with the hybrid grammar rules applied) is required to verify that no additional relations are introduced by the hybrid grammar.

minor comments (2)

The abstract refers to 'this thesis' while the manuscript is submitted as a journal article; a brief note on the relation between the three parts (single work vs. compilation) would aid readers.
[wave logic section] Wave-logic section: the motivation from spin-wave circuits would benefit from one additional sentence linking the phase-encoding choice to a measurable physical parameter (e.g., precession angle).

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their positive assessment and constructive comments. We address each major comment below.

read point-by-point responses

Referee: [constructor theory section] § on constructor theory (quantum case): the claimed conflict between locality and composition is load-bearing for the subsequent identification of CQM with constructor theory; the manuscript must exhibit an explicit pair of string diagrams (or an equation) in which the two principles cannot be simultaneously satisfied, rather than arguing at the level of general principles.

Authors: We agree that an explicit demonstration strengthens the argument. In the revised manuscript we will insert a concrete pair of string diagrams (with the corresponding equation) in the constructor-theory section that exhibit a quantum process where the locality and composition principles cannot hold simultaneously. This example will be placed immediately before the identification of CQM with constructor theory under relaxed locality. revision: yes
Referee: [NLP section] DisCoCirc Urdu fragment: the surjectivity claim and the statement that Urdu and English circuits coincide up to gate translation are central to the elimination of grammatical bureaucracy; a concrete example circuit (with the hybrid grammar rules applied) is required to verify that no additional relations are introduced by the hybrid grammar.

Authors: We accept that a worked example is needed for verification. We will add a fully expanded example in the DisCoCirc Urdu section: a short Urdu sentence, the hybrid grammar rules applied step by step, the resulting string diagram, and the corresponding English circuit. The example will confirm surjectivity and show that the circuits coincide up to gate translation with no extra relations imposed by the hybrid grammar. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected in derivation chain

full rationale

The paper applies established symmetric monoidal categories and string diagrams as a syntax to formalize constructor theory as a process theory, exhibit a conflict between locality and composition in the quantum setting, and conditionally identify CQM with a constructor theory upon dropping locality. It further develops wave-logic formalisms and hybrid grammars for DisCoCirc mappings. Each step consists of explicit constructions and arguments grounded in prior category-theoretic frameworks rather than self-definitional reductions, fitted parameters renamed as predictions, or load-bearing self-citations. The central claims remain independent of the inputs by construction and are self-contained against external benchmarks of applied category theory.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

From the abstract, the work relies on standard category theory without introducing new free parameters, ad hoc axioms, or invented entities; all contributions are formalizations of existing concepts.

pith-pipeline@v0.9.0 · 5589 in / 1118 out tokens · 61883 ms · 2026-05-13T02:23:41.069668+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction echoes

?

echoes
ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

We formalise constructor theory as a process theory... categorical quantum mechanics (CQM) can be conceived as a constructor theory of quantum physics.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We develop a formalism for wave-based logic circuits with phase encoding... ZX-calculus rules
IndisputableMonolith/Foundation/ArithmeticFromLogic.lean LogicNat ≃ Nat recovery unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

hybrid grammar for Urdu... text circuits become the same up to gate-level translation

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

229 extracted references · 229 canonical work pages · 1 internal anchor

[1]

Poincaré.Science and Hypothesis

H. Poincaré.Science and Hypothesis. London and Newcastle-on-Tyne: The Walter Scott Publishing Co., Ltd., 1905

work page 1905
[2]

Process Philosophy

J. Seibt. “Process Philosophy”. In:The Stanford Encyclopedia of Philosophy. Ed. by E. N. Zalta and U. Nodelman. Spring 2024. Metaphysics Research Lab, Stanford University, 2024

work page 2024
[3]

Democritus

S. Berryman. “Democritus”. In:The Stanford Encyclopedia of Philosophy. Ed. by E. N. Zalta and U. Nodelman. Spring 2023. Metaphysics Research Lab, Stanford University, 2023

work page 2023
[4]

Parmenides

J. Palmer. “Parmenides”. In:The Stanford Encyclopedia of Philosophy. Ed. by E. N. Zalta. Winter 2020. Metaphysics Research Lab, Stanford University, 2020

work page 2020
[5]

Heraclitus

D. W. Graham. “Heraclitus”. In:The Stanford Encyclopedia of Philosophy. Ed. by E. N. Zalta and U. Nodelman. Winter 2023. Metaphysics Research Lab, Stanford University, 2023

work page 2023
[6]

Leibniz’s philosophy of physics

J. K. McDonough. “Leibniz’s philosophy of physics”. In:The Stanford Encyclopedia of Philosophy. Ed. by E. N. Zalta and U. Nodelman. Fall 2024. Metaphysics Research Lab, Stanford University, 2024

work page 2024
[7]

Rescher.Process Metaphysics: An Introduction to Process Philosophy

N. Rescher.Process Metaphysics: An Introduction to Process Philosophy. State University of New York Press, 1996

work page 1996
[8]

Alfred North Whitehead

R. Desmet and A. D. Irvine. “Alfred North Whitehead”. In:The Stanford Encyclopedia of Philosophy. Ed. by E. N. Zalta and U. Nodelman. Winter 2022. Metaphysics Research Lab, Stanford University, 2022

work page 2022
[9]

Discussion of probability relations between separated systems

E. Schrödinger. “Discussion of probability relations between separated systems”. In: Mathematical Proceedings of the Cambridge Philosophical Society. Vol. 31. 4. Cambridge University Press. 1935, pp. 555–563

work page 1935
[10]

Fong and D

B. Fong and D. I. Spivak.An Invitation to Applied Category Theory: Seven Sketches in Compositionality. Cambridge University Press, 2019

work page 2019
[11]

N. S. Yanofsky.Monoidal Category Theory: Unifying Concepts in Mathematics, Physics, and Computing. MIT Press, 2024

work page 2024
[12]

Applications of negative dimensional tensors

R. Penrose. “Applications of negative dimensional tensors”. In:Combinatorial mathematics and its applications1 (1971), pp. 221–244

work page 1971
[13]

The geometry of tensor calculus, I

A. Joyal and R. Street. “The geometry of tensor calculus, I”. In:Advances in mathematics 88.1 (1991), pp. 55–112

work page 1991
[14]

A survey of graphical languages for monoidal categories

P. Selinger. “A survey of graphical languages for monoidal categories”. In:New Structures for Physics. Ed. by B. Coecke. Lecture Notes in Physics. arXiv:0908.3347. Springer-Verlag, 2011, pp. 275–337

work page arXiv 2011
[15]

Piedeleu and F

R. Piedeleu and F. Zanasi.An Introduction to String Diagrams for Computer Scientists. Elements in Applied Category Theory. Cambridge University Press, 2025

work page 2025
[16]

Space-time approach to quantum electrodynamics

R. Feynman. “Space-time approach to quantum electrodynamics”. In:Physical Review 76.6 (1949), pp. 769–789

work page 1949
[17]

The theory of positrons

R. Feynman. “The theory of positrons”. In:Physical Review76.6 (1949), pp. 749–759. 157 REFERENCES 158

work page 1949
[18]

Eine algebraisierung des syntheseproblems von schaltkreisen I

G. Hotz. “Eine algebraisierung des syntheseproblems von schaltkreisen I.” In:Elektronische Informationsverarbeitung und Kybernetik1.3 (1965), pp. 185–205

work page 1965
[19]

Pavlovic.Programs as Diagrams: From Categorical Computability to Computable Cate- gories

D. Pavlovic.Programs as Diagrams: From Categorical Computability to Computable Cate- gories. Springer Nature, 2023

work page 2023
[20]

Kindergarten quantum mechanics: lecture notes

B. Coecke. “Kindergarten quantum mechanics: lecture notes”. In:AIP Conference Proceed- ings. Vol. 810. 1. American Institute of Physics. 2006, pp. 81–98

work page 2006
[21]

Kindergarden quantum mechanics graduates... or how I learned to stop gluing LEGO together and love the ZX-calculus

B. Coecke, D. Horsman, A. Kissinger, and Q. Wang. “Kindergarden quantum mechanics graduates... or how I learned to stop gluing LEGO together and love the ZX-calculus”. In: Theoretical Computer Science897 (2022), pp. 1–22

work page 2022
[22]

Coecke and A

B. Coecke and A. Kissinger.Picturing Quantum Processes. A First Course in Quantum Theory and Diagrammatic Reasoning. Cambridge University Press, 2017

work page 2017
[23]

Coecke and S

B. Coecke and S. Gogioso.Quantum in Pictures. Quantinuum, 2022

work page 2022
[24]

Basic ZX-calculus for students and professionals

B. Coecke. “Basic ZX-calculus for students and professionals”. In:arXiv preprint arXiv:2303.03163 (2023)

work page arXiv 2023
[25]

String diagrammatic electrical circuit theory

G. Boisseau and P. Sobocinski. “String diagrammatic electrical circuit theory”. In:Pro- ceedings of the Fourth International Conference on Applied Category Theory, ACT 2021, Cambridge, United Kingdom, 12-16th July 2021. Ed. by K. Kishida. Vol. 372. EPTCS. 2021, pp. 178–191

work page 2021
[26]

Categorical semantics of digital circuits

D. R. Ghica and A. Jung. “Categorical semantics of digital circuits”. In:2016 Formal Methods in Computer-Aided Design (FMCAD). IEEE. 2016, pp. 41–48

work page 2016
[27]

A complete theory of sequential digital circuits: denotational, operational and algebraic semantics

D. R. Ghica, G. Kaye, and D. Sprunger. “A complete theory of sequential digital circuits: denotational, operational and algebraic semantics”. In:arXiv preprint arXiv:2201.10456 (2025)

work page arXiv 2025
[28]

Quantum linear optics via string diagrams

G. de Felice and B. Coecke. “Quantum linear optics via string diagrams”. In:Electronic Proceedings in Theoretical Computer Science394 (2023), pp. 83–100

work page 2023
[29]

LOv-calculus: a graphical language for linear optical quantum circuits

A. Clément, N. Heurtel, S. Mansfield, S. Perdrix, and B. Valiron. “LOv-calculus: a graphical language for linear optical quantum circuits”. In:47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Ed. by S. Szeider, R. Ganian, and A. Silva. Vol. 241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, G...

work page 2022
[30]

A compositional distributional model of meaning

S. Clark, B. Coecke, and M. Sadrzadeh. “A compositional distributional model of meaning”. In:Proceedings of the Second Quantum Interaction Symposium (QI-2008). Oxford. 2008, pp. 133–140

work page 2008
[31]

The mathematics of text structure

B. Coecke. “The mathematics of text structure”. In:Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics. Springer, 2021, pp. 181–217

work page 2021
[32]

Distilling text into circuits

V. Wang-Ma´scianica, J. Liu, and B. Coecke. “Distilling text into circuits”. In:arXiv preprint arXiv:2301.10595(2023)

work page arXiv 2023
[33]

Categories in control

J. C. Baez and J. Erbele. “Categories in control”. In:Theory and Applications of Categories 30.24 (2015), pp. 836–881

work page 2015
[34]

Categories in control: applied PROPs

J. M. Erbele. “Categories in control: applied PROPs”. In:arXiv preprint arXiv:1611.07591 (2016)

work page arXiv 2016
[35]

Causal models in string diagrams

R. Lorenz and S. Tull. “Causal models in string diagrams”. In:arXiv preprint arXiv:2304.07638 (2023). REFERENCES 159

work page arXiv 2023
[36]

Disintegration and Bayesian inversion via string diagrams

K. Cho and B. Jacobs. “Disintegration and Bayesian inversion via string diagrams”. In: Mathematical Structures in Computer Science29.7 (2019), pp. 938–971

work page 2019
[37]

De Finetti’s theorem in categorical probability

T. Fritz, T. Gonda, and P. Perrone. “De Finetti’s theorem in categorical probability”. In: Journal of Stochastic Analysis2.4 (2021), p. 6

work page 2021
[38]

Category theory in machine learning

D. Shiebler, B. Gavranovi´c, and P. Wilson. “Category theory in machine learning”. In: arXiv preprint arXiv:2106.07032(2021)

work page arXiv 2021
[39]

Hybrid quantum-classical machine learning with string diagrams

A. Koziell-Pipe and A. Kissinger. “Hybrid quantum-classical machine learning with string diagrams”. In:arXiv preprint arXiv:2407.03673(2024)

work page arXiv 2024
[40]

String diagrams for game theory

J. Hedges. “String diagrams for game theory”. In:arXiv preprint arXiv:1503.06072(2015)

work page arXiv 2015
[41]

Compositionality and string diagrams for game theory

J. Hedges, E. Shprits, V. Winschel, and P. Zahn. “Compositionality and string diagrams for game theory”. In:arXiv preprint arXiv:1604.06061(2016)

work page arXiv 2016
[42]

Compositional game theory

N. Ghani, J. Hedges, V. Winschel, and P. Zahn. “Compositional game theory”. In: Proceedings of the 33rd annual ACM/IEEE symposium on logic in computer science. 2018, pp. 472–481

work page 2018
[43]

Quantum Picturalism

B. Coecke. “Quantum Picturalism”. In:Contemporary Physics51 (2009). arXiv:0908.1787, pp. 59–83

work page arXiv 2009
[44]

Quantum Picturalism: learning quantum theory in high school

S. Dündar-Coecke, L. Yeh, C. Puca, S. M. -L. Pfaendler, M. H. Waseem, T. Cervoni, A. Kissinger, S. Gogioso, and B. Coecke. “Quantum Picturalism: learning quantum theory in high school”. In:2023 IEEE International Conference on Quantum Computing and Engineering (QCE). Vol. 3. IEEE. 2023, pp. 21–32

work page 2023
[45]

Making the quantum world accessible to young learners through Quantum Picturalism: an experimental study

S. Dündar-Coecke, C. Puca, L. Yeh, M. H. Waseem, E. M. Pothos, T. Cervoni, S. M. . -. Pfaendler, V. Wang-Ma´scianica, P. Sigrist, F. Tomassini, V. Anandraj, I. Khan, S. Gogioso, A. Kissinger, and B. Coecke. “Making the quantum world accessible to young learners through Quantum Picturalism: an experimental study”. In:arXiv preprint arXiv:2504.01013 (2025)

work page arXiv 2025
[46]

Constructor theory

D. Deutsch. “Constructor theory”. In:Synthese190.18 (2013), pp. 4331–4359

work page 2013
[47]

Introduction to spin wave computing

A. Mahmoud, F. Ciubotaru, F. Vanderveken, A. V. Chumak, S. Hamdioui, C. Adelmann, and S. Cotofana. “Introduction to spin wave computing”. In:Journal of Applied Physics 128.16 (2020), p. 161101

work page 2020
[48]

Con- structor theory as process theory

S. Gogioso, V. Wang-Ma´scianica, M. H. Waseem, C. M. Scandolo, and B. Coecke. “Con- structor theory as process theory”. In:Electronic Proceedings in Theoretical Computer Science397 (2023), pp. 137–151

work page 2023
[49]

Information flow in entangled quantum systems

D. Deutsch and P. Hayden. “Information flow in entangled quantum systems”. In: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences456.1999 (2000), pp. 1759–1774

work page 1999
[50]

String diagrams for wave-based computation

M. H. Waseem and A. D. Karenowska. “String diagrams for wave-based computation”. In: Applied Physics Letters123.24 (2023)

work page 2023
[51]

Language-independence of DisCoCirc’s text circuits: English and Urdu

M. H. Waseem, J. Liu, V. Wang-Ma´scianica, and B. Coecke. “Language-independence of DisCoCirc’s text circuits: English and Urdu”. In: ProceedingsEnd-to-End Compositional Models of Vector-Based Semantics,NUI Galway, 15-16 August 2022. Ed. by M. Moortgat and G. Wijnholds. Vol. 366. Electronic Proceedings in Theoretical Computer Science. Open Publishing Asso...

work page 2022
[52]

M. H. Waseem, Faizan-e-Ilahi, and M. S. Anwar.Quantum Mechanics in the Single Photon Laboratory. IOP Publishing, 2020. REFERENCES 160

work page 2020
[53]

M. S. Anwar, Faizan-e-Ilahi, S. B. Hyder, and M. H. Waseem.Quantum Mechanics in the Single-Photon Laboratory. IOP Publishing, 2024

work page 2024
[54]

Why John von Neumann did not like the Hilbert space formalism of quantum mechanics (and what he liked instead)

M. Rédei. “Why John von Neumann did not like the Hilbert space formalism of quantum mechanics (and what he liked instead)”. In:Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics27.4 (1996), pp. 493–510

work page 1996
[55]

A categorical semantics of quantum protocols

S. Abramsky and B. Coecke. “A categorical semantics of quantum protocols”. In:Proceed- ings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.IEEE. 2004, pp. 415–425

work page 2004
[56]

von Neumann.Mathematische Grundlagen der Quantenmechanik

J. von Neumann.Mathematische Grundlagen der Quantenmechanik. [Translation, Mathe- matical Foundations of Quantum Mechanics, Princeton University Press, 1955.] Springer- Verlag, 1932

work page 1955
[57]

Reconstructing quantum theory from diagrammatic postulates

J. H. Selby, C. M. Scandolo, and B. Coecke. “Reconstructing quantum theory from diagrammatic postulates”. In:Quantum5 (2021), p. 445

work page 2021
[58]

Operational quantum logic: an overview

B. Coecke, D. Moore, and A. Wilce. “Operational quantum logic: an overview”. In:Current Research in Operational Quantum Logic: Algebras, Categories, Languages(2000), pp. 1–36

work page 2000
[59]

On the theory of composition in physics

L. Hardy. “On the theory of composition in physics”. In:Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. arXiv:1303.1537. Springer, 2013, pp. 83–106

work page arXiv 2013
[60]

Kindergarten quantum mechanics

B. Coecke. “Kindergarten quantum mechanics”. In:Quantum Theory: Reconsiderations of the Foundations III. Ed. by A. Khrennikov. arXiv:quant-ph/0510032. AIP Press, 2005, pp. 81–98

work page arXiv 2005
[61]

Heunen, M

C. Heunen, M. Sadrzadeh, and E. Grefenstette.Quantum Physics and Linguistics: A Compositional, Diagrammatic Discourse. Oxford University Press, 2013

work page 2013
[62]

Founda- tions for near-term quantum natural language processing.arXiv preprint arXiv:2012.03755, 2020

B. Coecke, G. de Felice, K. Meichanetzidis, and A. Toumi. “Foundations for near-term quantum natural language processing”. In:arXiv preprint arXiv:2012.03755(2020)

work page arXiv 2012
[63]

Quantum natural language processing on near-term quantum computers

K. Meichanetzidis, S. Gogioso, G. de Felice, N. Chiappori, A. Toumi, and B. Coecke. “Quantum natural language processing on near-term quantum computers”. In:Proceedings 17th International Conference on Quantum Physics and Logic, QPL 2020, Paris, France, June 2 - 6, 2020. Ed. by B. Valiron, S. Mansfield, P. Arrighi, and P. Panangaden. Vol. 340. EPTCS. 2020...

work page 2020
[64]

QNLP in practice: running compositional models of meaning on a quantum computer

R. Lorenz, A. Pearson, K. Meichanetzidis, D. Kartsaklis, and B. Coecke. “QNLP in practice: running compositional models of meaning on a quantum computer”. In:Journal of Artificial Intelligence Research76 (2023), pp. 1305–1342

work page 2023
[65]

Reducing the number of non-Clifford gates in quantum circuits

A. Kissinger and J. van de Wetering. “Reducing the number of non-Clifford gates in quantum circuits”. In:Physical Review A102.2 (2020), p. 022406

work page 2020
[66]

Graph-theoretic simplifica- tion of quantum circuits with the ZX-calculus

R. Duncan, A. Kissinger, S. Perdrix, and J. Van De Wetering. “Graph-theoretic simplifica- tion of quantum circuits with the ZX-calculus”. In:Quantum4 (2020), p. 279

work page 2020
[67]

Phase gadget synthesis for shallow circuits

A. Cowtan, S. Dilkes, R. Duncan, W. Simmons, and S. Sivarajah. “Phase gadget synthesis for shallow circuits”. In:16th International Conference on Quantum Physics and Logic

work page
[68]

2019, pp

Open Publishing Association. 2019, pp. 213–228

work page 2019
[69]

Graphical quantum Clifford-encoder compilers from the ZX calculus

A. B. Khesin, J. Z. Lu, and P. W. Shor. “Graphical quantum Clifford-encoder compilers from the ZX calculus”. In:arXiv preprint arXiv:2301.02356(2023)

work page arXiv 2023
[70]

The ZX calculus is a language for surface code lattice surgery

N. de Beaudrap and D. Horsman. “The ZX calculus is a language for surface code lattice surgery”. In:Quantum4 (2020), p. 218. REFERENCES 161

work page 2020
[71]

Efficient magic state factories with a catalyzed|CCZ⟩to 2|T⟩transformation

C. Gidney and A. G. Fowler. “Efficient magic state factories with a catalyzed|CCZ⟩to 2|T⟩transformation”. In:Quantum3 (2019), p. 135

work page 2019
[72]

Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus

C. Zhao and X.-S. Gao. “Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus”. In:Quantum5 (2021), p. 466

work page 2021
[73]

Differentiating and integrating ZX diagrams with applications to quantum machine learning

Q. Wang, R. Yeung, and M. Koch. “Differentiating and integrating ZX diagrams with applications to quantum machine learning”. In:Quantum8 (2024), p. 1491

work page 2024
[74]

Universal MBQC with generalised parity-phase interactions and Pauli measurements

A. Kissinger and J. van de Wetering. “Universal MBQC with generalised parity-phase interactions and Pauli measurements”. In:Quantum3 (2019), p. 134

work page 2019
[75]

Complete flow-preserving rewrite rules for MBQC patterns with Pauli measurements

T. McElvanney and M. Backens. “Complete flow-preserving rewrite rules for MBQC patterns with Pauli measurements”. In:19th International Conference on Quantum Physics and Logic. Open Publishing Association. 2023, pp. 66–82

work page 2023
[76]

Categorical quantum mechanics II: classical-quantum interaction

B. Coecke and A. Kissinger. “Categorical quantum mechanics II: classical-quantum interaction”. In:International Journal of Quantum Information14.04 (2016), p. 1640020

work page 2016
[77]

ZX-calculus for the working quantum computer scientist

J. van de Wetering. “ZX-calculus for the working quantum computer scientist”. In:arXiv preprint arXiv:2012.13966(2020)

work page arXiv 2012
[78]

Kissinger and J

A. Kissinger and J. van de Wetering.Picturing Quantum Software: An Introduction to the ZX-Calculus and Quantum Compilation. Preprint, 2024

work page 2024
[79]

Interacting quantum observables

B. Coecke and R. Duncan. “Interacting quantum observables”. In:International Colloquium on Automata, Languages, and Programming. Springer. 2008, pp. 298–310

work page 2008
[80]

Interacting quantum observables: categorical algebra and diagrammatics

B. Coecke and R. Duncan. “Interacting quantum observables: categorical algebra and diagrammatics”. In:New Journal of Physics13.4 (2011), p. 043016

work page 2011

Showing first 80 references.