Papers
Topics
Authors
Recent
Search
2000 character limit reached

Constructor Theory as Process Theory

Published 14 Dec 2023 in math.CT, math-ph, math.MP, and quant-ph | (2401.05364v1)

Abstract: Constructor theory is a meta-theoretic approach that seeks to characterise concrete theories of physics in terms of the (im)possibility to implement certain abstract "tasks" by means of physical processes. Process theory, on the other hand, pursues analogous characterisation goals in terms of the compositional structure of said processes, concretely presented through the lens of (symmetric monoidal) category theory. In this work, we show how to formulate fundamental notions of constructor theory within the canvas of process theory. Specifically, we exploit the functorial interplay between the symmetric monoidal structure of the category of sets and relations, where the abstract tasks live, and that of symmetric monoidal categories from physics, where concrete processes can be found to implement said tasks. Through this, we answer the question of how constructor theory relates to the broader body of process-theoretic literature, and provide the impetus for future collaborative work between the fields.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (35)
  1. S. Abramsky & B. Coecke (2004): A categorical semantics of quantum protocols. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 415–425, 10.5555/1018438.1021878. arXiv:quant-ph/0402130.
  2. 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022), 10.4230/LIPIcs.FSCD.2022.29. Available at http://www.scopus.com/inward/record.url?scp=85133671634&partnerID=8YFLogxK. Publisher: Schloss Dagstuhl.
  3. John C. Baez & Jade Master (2020): Open Petri Nets. Mathematical Structures in Computer Science 30(3), pp. 314–341, 10.1017/S0960129520000043. Available at http://arxiv.org/abs/1808.05415. ArXiv:1808.05415 [cs, math].
  4. Guillaume Boisseau & Paweł Sobociński (2022): String Diagrammatic Electrical Circuit Theory. Electronic Proceedings in Theoretical Computer Science 372, pp. 178–191, 10.4204/EPTCS.372.13. Available at http://arxiv.org/abs/2106.07763. ArXiv:2106.07763 [cs].
  5. In: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp. 1–12, 10.1109/LICS.2019.8785877.
  6. Filippo Bonchi, Pawel Sobocinski & Fabio Zanasi (2017): Interacting Hopf Algebras. Journal of Pure and Applied Algebra 221(1), pp. 144–184, 10.1016/j.jpaa.2016.06.002. Available at http://arxiv.org/abs/1403.7048. ArXiv:1403.7048 [cs, math].
  7. Filippo Bonchi, Pawel Sobociński & Fabio Zanasi (2014): A Categorical Semantics of Signal Flow Graphs. CONCUR 2014 - Concurrency Theory - 25th International Conference, 10.1007/978-3-662-44584-6_30. Available at https://hal.science/hal-02134182.
  8. Kenta Cho & Bart Jacobs (2019): Disintegration and Bayesian Inversion via String Diagrams. Mathematical Structures in Computer Science 29(7), pp. 938–971, 10.1017/S0960129518000488. Available at http://arxiv.org/abs/1709.00322. ArXiv:1709.00322 [cs].
  9. B. Coecke (2000): Structural characterization of compoundness. International Journal of Theoretical Physics 39, pp. 585–594, 10.1023/A:1003677418744.
  10. B. Coecke & R. Duncan (2011): Interacting quantum observables: categorical algebra and diagrammatics. New Journal of Physics 13, p. 043016, 10.1088/1367-2630/13/4/043016. arXiv:quant-ph/09064725.
  11. B. Coecke, D.J. Moore & I. Stubbe (2001): Quantaloids describing causation and propagation of physical properties. Foundations of Physics Letters 14, pp. 133–146, 10.1023/A:1012377520222. ArXiv:quant-ph/0009100.
  12. B. Coecke, É. O. Paquette & D. Pavlović (2010): Classical and quantum structuralism. In S. Gay & I. Mackie, editors: Semantic Techniques in Quantum Computation, Cambridge University Press, pp. 29–69, 10.1017/CBO9781139193313.003. arXiv:0904.1997.
  13. B. Coecke & D. Pavlovic (2007): Quantum measurements without sums. In G. Chen, L. Kauffman & S. Lamonaco, editors: Mathematics of Quantum Computing and Technology, Taylor and Francis, pp. 567–604, 10.1201/9781584889007. arXiv:quant-ph/0608035.
  14. Bob Coecke & Stefano Gogioso (2023): Quantum in Pictures: A New Way to Understand the Quantum World. Cambridge Quantum.
  15. Bob Coecke & Aleks Kissinger (2017): Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning. Cambridge University Press, Cambridge, 10.1017/9781316219317. Available at https://www.cambridge.org/core/books/picturing-quantum-processes/1119568B3101F3A685BE832FEEC53E52.
  16. In: Programming Languages and Systems: 31st European Symposium on Programming, ESOP 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, Springer International Publishing Cham, pp. 1–28, 10.1007/978-3-030-99336-8_1.
  17. David Deutsch (2013): Constructor theory. Synthese 190(18), pp. 4331–4359, 10.1007/s11229-013-0279-z.
  18. David Deutsch & Chiara Marletto (2015): Constructor theory of information. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471, p. 20140540, 10.1098/rspa.2014.0540.
  19. C.-A. Faure, D. J. Moore & C. Piron (1995): Deterministic evolutions and Schrödinger flows. Helvetica Physica Acta 68(2), pp. 150–157.
  20. Tobias Fritz, Tomáš Gonda & Paolo Perrone (2021): De Finetti’s Theorem in Categorical Probability. Journal of Stochastic Analysis 2(4), 10.31390/josa.2.4.06. Available at http://arxiv.org/abs/2105.02639. ArXiv:2105.02639 [cs, math, stat].
  21. Dan R. Ghica & Achim Jung (2016): Categorical semantics of digital circuits. In: Proceedings of the 16th Conference on Formal Methods in Computer-Aided Design, FMCAD ’16, FMCAD Inc, Austin, Texas, pp. 41–48, 10.1109/FMCAD.2016.7886659.
  22. Stefano Gogioso (2019): A process-theoretic church of the larger hilbert space. arXiv preprint arXiv:1905.13117, 10.48550/arXiv.1905.13117.
  23. L. Hardy (2011): Foliable operational structures for general probabilistic theories. In H. Halvorson, editor: Deep Beauty: Understanding the Quantum World through Mathematical Innovation, Cambridge University Press, pp. 409–442, 10.1017/CBO9780511976971.013. arXiv:0912.4740.
  24. Nathan Haydon & Paweł Sobociński (2020): Compositional Diagrammatic First-Order Logic. In Ahti-Veikko Pietarinen, Peter Chapman, Leonie Bosveld-de Smet, Valeria Giardino, James Corter & Sven Linker, editors: Diagrammatic Representation and Inference, Lecture Notes in Computer Science, Springer International Publishing, Cham, pp. 402–418, 10.1007/978-3-030-54249-8_32.
  25. Jules Hedges (2015): String diagrams for game theory, 10.48550/arXiv.1503.06072. Available at http://arxiv.org/abs/1503.06072. ArXiv:1503.06072 [cs, math].
  26. Available at http://arxiv.org/abs/2004.10741. ArXiv:2004.10741 [quant-ph].
  27. C. A. R. Hoare & J. He (1987): The weakest prespecification. Information Processing Letters 24, pp. 127–132, 10.1016/0020-0190(87)90106-2.
  28. Available at http://arxiv.org/abs/1811.08338. ArXiv:1811.08338 [cs, math].
  29. J. M. Jauch (1968): Mathematical Foundations of Quantum Mechanics. Addison-Wesley.
  30. Chiara Marletto (2021): The Science of Can and Can’t: A Physicist’s Journey Through the Land of Counterfactuals. Allen Lane, 10.1016/S0262-4079(21)00658-8.
  31. D. J. Moore (1999): On state spaces and property lattices. Studies in History and Philosophy of Modern Physics 30(1), pp. 61–83, 10.1016/S1355-2198(98)00033-1.
  32. C. Piron (1976): Foundations of quantum physics. W. A. Benjamin.
  33. J. H. Selby, C. M. Scandolo & B. Coecke (2018): Reconstructing quantum theory from diagrammatic postulates. arXiv preprint arXiv:1802.00367, 10.22331/q-2021-04-28-445.
  34. Vincent Wang-Mascianica & Bob Coecke (2021): Talking Space: inference from spatial linguistic meanings, 10.48550/arXiv.2109.06554. Available at http://arxiv.org/abs/2109.06554. ArXiv:2109.06554 [cs].
  35. Electronic Proceedings in Theoretical Computer Science 333, pp. 1–18, 10.4204/EPTCS.333.1. Available at http://arxiv.org/abs/2005.05293. ArXiv:2005.05293 [quant-ph].
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 5 tweets with 739 likes about this paper.