arXiv subjects

Titouan Carette

Publications and source records attributed to Titouan Carette.

At least 19 recordsLinked to original sources

arXiv2025

The decohered ZX-calculus

The discard ZX-calculus is known to be complete and universal for mixed-state quantum mechanics, allowing for both quantum and classical processes. However, if the quantum aspects of ZX-calculus have been explored in depth, little work has been done on the classical side. In this paper, we investigate a fragment of discard ZX-calculus obtained by decohering the usual generators of ZX-calculus. We show that this calculus is universal and complete for affinely supported probability distributions over $\mathbb{F}_{2}^{n}$. To do so, we exhibit a normal form, mixing ideas from the graphical linear algebra program and diagrammatic Fourier transforms. Our results both clarify how to handle hybrid classical-quantum processes in the discard ZX-calculus and pave the way to the picturing of more general random variables and probabilistic processes.

quant-ph↗

arXiv2025

Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words

Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility of a unified formalism. We propose finite states non-deterministic transducer as a lingua franca for automata theory, transition systems, and sofic subshifts. We introduce a compositional diagrammatical syntax for transducers in form of string diagrams interpreted as relations. This syntax comes with sound rewriting rules allowing diagrammatical reasoning. Our main result is the completeness of our equational theory, ensuring that language-equivalence, trace-equivalence, or subshift equivalence can always be proved using our rewriting rules.

cs.LO↗

arXiv2024

Complete equational theories for classical and quantum Gaussian relations

We give generators and relations for the hypergraph props of Gaussian relations and positive affine Lagrangian relations. The former extends Gaussian probabilistic processes by completely-uninformative priors, and the latter extends Gaussian quantum mechanics with infinitely-squeezed states. These presentations are given by adding a generator to the presentation of real affine relations and of real affine Lagrangian relations which freely codiscards effects, as well as certain rotations. The presentation of positive affine Lagrangian relations provides a rigorous justification for many common yet informal calculations in the quantum physics literature involving infinite-squeezing. Our presentation naturally extends Menicucci et al.'s graph-theoretic representation of Gaussian quantum states with a representation for Gaussian transformations. Using this graphical calculus, we also give a graphical proof of Braunstein and Kimble's continuous-variable quantum teleportation protocol. We also interpret the LOv-calculus, a diagrammatic calculus for reasoning about passive linear-optical quantum circuits in our graphical calculus. Moreover, we show how our presentation allows for additional optical operations such as active squeezing.

cs.LO↗

arXiv2024

Graphical Symplectic Algebra

We give complete presentations for the dagger-compact props of affine Lagrangian and coisotropic relations over an arbitrary field. This provides a unified family of graphical languages for both affinely constrained classical mechanical systems, as well as odd-prime-dimensional stabiliser quantum circuits. To this end, we present affine Lagrangian relations by a particular class of undirected coloured graphs. In order to reason about composite systems, we introduce a powerful scalable notation where the vertices of these graphs are themselves coloured by graphs. In the setting of stabiliser quantum mechanics, this scalable notation gives an extremely concise description of graph states, which can be composed via ``phased spider fusion.'' Likewise, in the classical mechanical setting of electrical circuits, we show that impedance matrices for reciprocal networks are presented in essentially the same way.

cs.LO↗

arXiv2023

The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification

We present a smorgasbord of results on the stabiliser ZX-calculus for odd prime-dimensional qudits (i.e. qupits). We derive a simplified rule set that closely resembles the original rules of qubit ZX-calculus. Using these rules, we demonstrate analogues of the spider-removing local complementation and pivoting rules. This allows for efficient reduction of diagrams to the affine with phases normal form. We also demonstrate a reduction to a unique form, providing an alternative and simpler proof of completeness. Furthermore, we introduce a different reduction to the graph state with local Cliffords normal form, which leads to a novel layered decomposition for qupit Clifford unitaries. Additionally, we propose a new approach to handle scalars formally, closely reflecting their practical usage. Finally, we have implemented many of these findings in DiZX, a new open-source Python library for qudit ZX-diagrammatic reasoning.

quant-ph↗

arXiv2023

Complete Graphical Language for Hermiticity-Preserving Superoperators

Universal and complete graphical languages have been successfully designed for pure state quantum mechanics, corresponding to linear maps between Hilbert spaces, and mixed states quantum mechanics, corresponding to completely positive superoperators. In this paper, we go one step further and present a universal and complete graphical language for Hermiticity-preserving superoperators. Such a language opens the possibility of diagrammatic compositional investigations of antilinear transformations featured in various physical situations, such as the Choi-Jamiołkowski isomorphism, spin-flip, or entanglement witnesses. Our construction relies on an extension of the ZW-calculus exhibiting a normal form for Hermitian matrices.

quant-ph↗

arXiv2023

Operational Quantum Reference Frame Transformations

Quantum reference frames are needed in quantum theory for much the same reasons that reference frames are in classical theories: to manifest invariance in line with fundamental relativity principles and to provide a basis for the definition of observable quantities. Though around since the 1960s, and used in a wide range of applications, only recently has the means for transforming descriptions between different quantum reference frames been tackled in detail. In this work, we provide a general, operationally motivated framework for quantum reference frames and their transformations, holding for locally compact groups. The work is built around the notion of operational equivalence, in which quantum states that cannot be physically distinguished are identified. For example, we describe the collection of relative observables as a subspace of the algebra of invariants on the composite of system and frame, and from here the set of relative states is constructed through the identification of states which cannot be distinguished by relative observables. Through the notion of framed observables -- the formation of joint observables of system and frame -- of which the relative observables can be understood as examples, quantum reference frame transformations are then maps between equivalence classes of relative states which respect the framing. We give an explicit realisation in the setting that the initial frame admits a highly localized state with respect to the frame observable. The transformations are invertible exactly when the final frame also has such a localizability property. The procedure we present is in operational agreement with other recent inequivalent constructions on the domain of common applicability, but extends them in a number of ways, and weakens claims of entanglement generation through frame changes.

quant-ph↗

arXiv2023

Complete ZX-calculi for the stabiliser fragment in odd prime dimensions

We introduce a family of ZX-calculi which axiomatise the stabiliser fragment of quantum theory in odd prime dimensions. These calculi recover many of the nice features of the qubit ZX-calculus which were lost in previous proposals for higher-dimensional systems. We then prove that these calculi are complete, i.e. provide a set of rewrite rules which can be used to prove any equality of stabiliser quantum operations. Adding a discard construction, we obtain a calculus complete for mixed state stabiliser quantum mechanics in odd prime dimensions, and this furthermore gives a complete axiomatisation for the related diagrammatic language for affine co-isotropic relations.

quant-ph↗

arXiv2023

Compositionality of planar perfect matchings

We exhibit a strong connection between the matchgate formalism introduced by Valiant and the ZW-calculus of Coecke and Kissinger. This connection provides a natural compositional framework for matchgate theory as well as a direct combinatorial interpretation of the diagrams of ZW-calculus through the perfect matchings of their underlying graphs. We identify a precise fragment of ZW-calculus, the planar W-calculus, that we prove to be complete and universal for matchgates, that are linear maps satisfying the matchgate identities. Computing scalars of the planar W-calculus corresponds to counting perfect matchings of planar graphs, and so can be carried in polynomial time using the FKT algorithm, making the planar W-calculus an efficiently simulable fragment of the ZW-calculus, in a similar way that the Clifford fragment is for ZX-calculus. This work opens new directions for the investigation of the combinatorial properties of ZW-calculus as well as the study of perfect matching counting through compositional diagrammatical technics.

quant-ph↗

arXiv2023

Aperiodicity in Quantum Wang Tilings

By reformulating Wang tiles with tensors, we propose a natural generalization to the probabilistic and quantum setting. In this new framework, we introduce notions of tilings and periodicity directly extending their classical counterparts. In the one dimensional case, we recover the decidability of the generalized domino problem by linking it to the trace characterization of nilpotent matrices. In the two-dimensional case, we provide extension of weak and strong aperiodicity respectively and show the equivalence of those generalized notions, extending the well known equivalence in the classical case. We also exhibit a quantum tile set being aperiodic while its underlying classical tile set is not, proving that quantum interference can suppress periodic patterns and paving the way to the investigation of a new kind of aperiodicity. Finally, we highlight the many new research directions opened by this generalization of Wang tiles, related to (quantum) cellular automata, condensed matter physics, symbolic dynamics and more.

quant-ph↗

arXiv2022

Fact-nets: towards a mathematical framework for relational quantum mechanics

The relational interpretation of quantum mechanics (RQM) has received a growing interest since its first formulation in 1996. Usually presented as an interpretational layer over the usual quantum mechanics formalism, it appears as a philosophical perspective without proper mathematical counterparts. This state of affairs has direct consequences on the scientific debate on RQM which still suffers from misunderstandings and imprecise statements. In an attempt to clarify those debates, the present paper proposes a radical reformulation of the mathematical framework of quantum mechanics which is relational from the start: fact-nets. The core idea is that all statements about the world, facts, are binary entities involving two systems that can be symmetrically thought of as observed and observer. We initiate a study of the fact-nets formalism and outline how it can shed new relational light on some familiar quantum features.

quant-ph↗

arXiv2022

Propification and the Scalable Comonad

String diagrams can nicely express numerous computations in symmetric strict monoidal categories (SSMC). To be entirely exact, this is only true for props: the SSMCs whose monoid of objects are free. In this paper, we show a propification theorem asserting that any SSMC is monoidally equivalent to a coloured prop. As a consequence, all SSMCs are within reach of diagrammatical methods. We introduce a diagrammatical calculus of bureaucracy isomorphisms, allowing us to handle graphically non-free monoids of objects. We also connect this construction with the scalable notations previously introduced to tackle large-scale diagrammatic reasoning.

math.CT↗

arXiv2022

Large-scale quantum diagrammatic reasoning tools, !-boxes vs. scalable notations

The application of diagrammatic reasoning techniques to large-scale quantum processes needs specific tools to describe families of diagrams of arbitrary size. For now, large-scale diagrammatic reasoning tools in ZH-calculus come in two flavours, !-boxes and scalable notations. This paper investigates the interactions between the two approaches by exhibiting correspondences through various examples from the literature, focusing on (hyper)graph states and diagrammatic transforms. In doing so, we set up a path toward a neat and tidy large-scale diagrammatic reasoning toolbox.

quant-ph↗

arXiv2021

Quantum Algorithms and Oracles with the Scalable ZX-calculus

The ZX-calculus was introduced as a graphical language able to represent specific quantum primitives in an intuitive way. The recent completeness results have shown the theoretical possibility of a purely graphical description of quantum processes. However, in practice, such approaches are limited by the intrinsic low level nature of ZX calculus. The scalable notations have been proposed as an attempt to recover an higher level point of view while maintaining the topological rewriting rules of a graphical language. We demonstrate that the scalable ZX-calculus provides a formal, intuitive, and compact framework to describe and prove quantum algorithms. As a proof of concept, we consider the standard oracle-based quantum algorithms: Deutsch-Jozsa, Bernstein-Vazirani, Simon, and Grover algorithms, and we show they can be described and proved graphically.

quant-ph↗

arXiv2021

When Only Topology Matters

Graphical languages are symmetric monoidal categories presented by generators and equations. The string diagrams notation allows to transform numerous axioms into low dimension topological rules we are comfortable with as three dimensional space citizens. This aspect is often referred to by the Only Topology Matters paradigm (OTM). However OTM remains quite informal and its exact meaning in terms of rewriting rules is ambiguous. In this paper we define three precise aspects of the OTM paradigm, namely flexsymmetry, flexcyclicity and flexibility of Frobenius algebras. We investigate how this new framework can simplify the presentation of known graphical languages based on Frobenius algebras.

math.CT↗

arXiv2021

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory

Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite number of qubits. Meanwhile, delayed traces have been used as a graphical way to represent finite-memory computations on streams, in a classical setting (cartesian data types). We merge those two approaches and describe a general construction that extends any graphical language, equipped with a notion of discarding, to a graphical language of finite memory computations. In order to handle cases like the ZX-calculus, which is complete for post-selected quantum mechanics, we extend the delayed trace formalism beyond the causal case, refining the notion of causality for stream transformers. We design a stream semantics based on stateful morphism sequences and, under some assumptions, show universality and completeness results. Finally, we investigate the links of our framework with previous works on cartesian data types, signal flow graphs, and quantum channels with memories.

quant-ph↗

arXiv2020

A note on diagonal gates in SZX-calculus

This note describes how the the scalable ZXH calculus can be used to represent in a compact way the quantum gates that are diagonal in the computational basis. This includes controlled and multi-controlled Z gates, their generalizations, respectively graph and hypergraph operators, and also phase gadgets.

quant-ph↗

arXiv2020

On a recipe for quantum graphical languages

Different graphical calculi have been proposed to represent quantum computation. First the ZX- calculus [4], followed by the ZW-calculus [12] and then the ZH-calculus [1]. We can wonder if new Z*-calculi will continue to be proposed forever. This article answers negatively. All those language share a common core structure we call Z*-algebras. We classify Z*-algebras up to isomorphism in two dimensional Hilbert spaces and show that they are all variations of the aforementioned calculi. We do the same for linear relations and show that the calculus of [2] is essentially the unique one.

cs.LO↗