The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Quantum picturalism
Open accessAbstract
Why did it take us 50 years since the birth of the quantum mechanical formalism to discover that unknown quantum states cannot be cloned? Yet, the proof of the ‘no-cloning theorem’ is easy, and its consequences and potential for applications are immense. Similarly, why did it take us 60 years to discover the conceptually intriguing and easily derivable physical phenomenon of ‘quantum teleportation’? We claim that the quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the arrays of 0s and 1s of the early days of computer programming practice. Using a technical term from computer science, the quantum mechanical formalism is ‘low-level’. In this review we present steps towards a diagrammatic ‘high-level’ alternative for the Hilbert space formalism, one which appeals to our intuition. The diagrammatic language as it currently stands allows for intuitive reasoning about interacting quantum systems, and trivialises many otherwise involved and tedious computations. It clearly exposes limitations such as the no-cloning theorem, and phenomena such as quantum teleportation. As a logic, it supports ‘automation’: it enables a (classical) computer to reason about interacting quantum systems, prove theorems, and design protocols. It allows for a wider variety of underlying theories, and can be easily modified, having the potential to provide the required step-stone towards a deeper conceptual understanding of quantum theory, as well as its unification with other physical theories. Specific applications discussed here are purely diagrammatic proofs of several quantum computational schemes, as well as an analysis of the structural origin of quantum non-locality. The underlying mathematical foundation of this high-level diagrammatic formalism relies on so-called monoidal categories, a product of a fairly recent development in mathematics. Its logical underpinning is linear logic, an even more recent product of research in logic and computer science. These monoidal categories do not only provide a natural foundation for physical theories, but also for proof theory, logic, programming languages, biology, cooking, … So the challenge is to discover the necessary additional pieces of structure that allow us to predict genuine quantum phenomena. These additional pieces of structure represent the capabilities nature has provided us with to manipulate entities subject to the laws of quantum theory.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Experimental Test of Bell's Inequalities Using Time- Varying Analyzers
Aspect, A., Dalibard, J., & Roger, G. (1982) · Physical Review Letters · doi:10.1103/physrevlett.49.1804 · Cited by 3,942
Three qubits can be entangled in two inequivalent ways
Dür, W., Vidal, G., & Cirac, J. I. (2000) · Physical Review A · doi:10.1103/physreva.62.062314 · Cited by 3,384
Bell’s theorem without inequalities
Greenberger, D. M., Horne, M. A., Shimony, A., & Zeilinger, A. (1990) · American Journal of Physics · doi:10.1119/1.16243 · Cited by 2,404
Cited by
Informational derivation of quantum theory
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2011) · Physical Review A · doi:10.1103/physreva.84.012311 · Cited by 619
Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning
Coecke, B., & Kissinger, A. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316219317 · Cited by 413
Self-citationA mathematical theory of resources
Coecke, B., Fritz, T., & Spekkens, R. W. (2016) · Information and Computation · doi:10.1016/j.ic.2016.02.008 · Cited by 301
Self-citationCosta, F., & Shrapnel, S. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/6/063032 · Cited by 259
Beyond Bell's theorem: correlation scenarios
Fritz, T. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/10/103001 · Cited by 243
Metadata
- Authors
- Coecke, B.
- Venue
- Contemporary Physics
- Publisher
- Informa UK Limited
- Published
- 2009-12-15
- Volume
- 51
- Issue
- 1
- Pages
- 59-83
- ISSN
- 0010-7514 (ISSN-L)
- 1366-5812
- OpenAlex
- W3037759832
- Cited by
- 176
- References
- 14
- FWCI
- 6.13
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum picturalism. https://app.cochat.ai/papers/10.1080/00107510903257624
- The paper
- Coecke, B. (2010). Quantum picturalism. Contemporary Physics. https://doi.org/10.1080/00107510903257624
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.