The Many-Worlds Calculus
- URL: http://arxiv.org/abs/2206.10234v3
- Date: Thu, 30 Nov 2023 11:27:51 GMT
- Title: The Many-Worlds Calculus
- Authors: Kostia Chardonnet, Marc de Visme, Beno\^it Valiron, Renaud Vilmart
- Abstract summary: We propose a new typed graphical language for quantum computation, based on compact categories with biproducts.
Our language generalizes existing approaches such as ZX-calculus and quantum circuits, while offering a natural framework to support quantum control.
The language comes equipped with a denotational semantics based on linear applications, and an equational theory.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We propose a new typed graphical language for quantum computation, based on
compact categories with biproducts. Our language generalizes existing
approaches such as ZX-calculus and quantum circuits, while offering a natural
framework to support quantum control: it natively supports "quantum tests". The
language comes equipped with a denotational semantics based on linear
applications, and an equational theory. Through the use of normal forms for the
diagrams, we prove the language to be universal, and the equational theory to
be complete with respect to the semantics.
Related papers
- Regular language quantum states [0.5499796332553706]
We introduce regular language states, a family of quantum many-body states.
They are built from a special class of formal languages, called regular.
We exploit the theory of tensor networks to find an efficient criterion to determine when regular languages are shift-invariant.
arXiv Detail & Related papers (2024-07-24T21:09:22Z) - Hybrid Quantum-Classical Machine Learning with String Diagrams [49.1574468325115]
This paper develops a formal framework for describing hybrid algorithms in terms of string diagrams.
A notable feature of our string diagrams is the use of functor boxes, which correspond to a quantum-classical interfaces.
arXiv Detail & Related papers (2024-07-04T06:37:16Z) - Categories of quantum cpos [0.0]
We find a noncommutative generalization of $omega$-complete partial orders (cpos) called quantum cpos.
quantum cpos may form the backbone of a future quantum domain theory.
arXiv Detail & Related papers (2024-06-03T22:13:32Z) - Completeness of qufinite ZXW calculus, a graphical language for
finite-dimensional quantum theory [0.11049608786515838]
We introduce the qufinite ZXW calculus - a graphical language for reasoning about finite-dimensional quantum theory.
We prove the completeness of this calculus by demonstrating that any qufinite ZXW diagram can be rewritten into its normal form.
Our work paves the way for a comprehensive diagrammatic description of quantum physics, opening the doors of this area to the wider public.
arXiv Detail & Related papers (2023-09-22T17:23:58Z) - Qudit lattice surgery [91.3755431537592]
We observe that lattice surgery, a model of fault-tolerant qubit computation, generalises straightforwardly to arbitrary finite-dimensional qudits.
We relate the model to the ZX-calculus, a diagrammatic language based on Hopf-Frobenius algebras.
arXiv Detail & Related papers (2022-04-27T23:41:04Z) - LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits [58.720142291102135]
We introduce the LOv-calculus, a graphical language for reasoning about linear optical quantum circuits.
Two LOv-circuits represent the same quantum process if and only if one can be transformed into the other with the rules of the LOv-calculus.
arXiv Detail & Related papers (2022-04-25T16:59:26Z) - LQP: The Dynamic Logic of Quantum Information [77.34726150561087]
This paper introduces a dynamic logic formalism for reasoning about information flow in composite quantum systems.
We present a finitary syntax, a relational semantics and a sound proof system for this logic.
As applications, we use our system to give formal correctness for the Teleportation protocol and for a standard Quantum Secret Sharing protocol.
arXiv Detail & Related papers (2021-10-04T12:20:23Z) - The Logic of Quantum Programs [77.34726150561087]
We present a logical calculus for reasoning about information flow in quantum programs.
In particular we introduce a dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound quantum systems.
arXiv Detail & Related papers (2021-09-14T16:08:37Z) - Foundations for Near-Term Quantum Natural Language Processing [0.17205106391379021]
We provide conceptual and mathematical foundations for near-term quantum natural language processing (QNLP)
We recall how the quantum model for natural language that we employ canonically combines linguistic meanings with rich linguistic structure.
We provide references for supporting empirical evidence and formal statements concerning mathematical generality.
arXiv Detail & Related papers (2020-12-07T14:49:33Z) - Linear Dependent Type Theory for Quantum Programming Languages [1.7166794984161973]
Modern quantum programming languages integrate quantum resources and classical control.
They must be linearly typed to reflect the no-cloning property of quantum resources.
High-level and practical languages should also support quantum circuits as first-class citizens.
arXiv Detail & Related papers (2020-04-28T13:11:06Z) - PBS-Calculus: A Graphical Language for Coherent Control of Quantum
Computations [77.34726150561087]
We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations.
We equip the language with an equational theory, which is proved to be sound and complete.
We consider applications like the implementation of controlled permutations and the unrolling of loops.
arXiv Detail & Related papers (2020-02-21T16:15:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.