Related papers: Pivoting makes the ZX-calculus complete for real s…
In this paper, we demonstrate a direct correspondence between phase-free ZX diagrams, a graphical notation for representing and manipulating a certain class of linear maps on qubits, and Calderbank-Shor-Steane (CSS) codes, a large family of…
We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group,…
Quantum computing is an emerging technology in which quantum mechanical properties are suitably utilized to perform certain compute-intensive operations faster than classical computers. Quantum algorithms are designed as a combination of…
Quantum circuit cutting refers to a series of techniques that allow one to partition a quantum computation on a large quantum computer into several quantum computations on smaller devices. This usually comes at the price of a sampling…
A powerful feature of stabiliser error correcting codes is the fact that stabiliser measurement projects arbitrary errors to Pauli errors, greatly simplifying the physical error correction process as well as classical simulations of code…
Given a smooth and separated K(pi,1) variety X over a field k, we associate a "cycle class" in etale cohomology with compact supports to any continuous section of the natural map from the arithmetic fundamental group of X to the absolute…
The Gottesman-Knill theorem established that stabilizer states and operations can be efficiently simulated classically. For qudits with dimension three and greater, stabilizer states and Clifford operations have been found to correspond to…
In this article we develop a graphical calculus for stable invariants of Riemannian manifolds akin to the graphical calculus for Rozansky-Witten invariants for hyperk\"ahler manifolds; based on interpreting trivalent graphs with colored…
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…
The traditional standard theory of quantum mechanics is unable to solve the spin-statistics problem, i.e. to justify the utterly important \qo{Pauli Exclusion Principle} but by the adoption of the complex standard relativistic quantum field…
In open quantum systems with strong symmetries, the global scaled cumulant generating function (SCGF) is generally nonanalytic, so the G\"artner-Ellis theorem cannot directly yield the genuine large-deviation rate function. To address this…
There are several models of quantum computation which exhibit shared fundamental fault-tolerance properties. This article makes commonalities explicit by presenting these different models in a unifying framework based on the ZX calculus. We…
We review here the quantum mechanics of some noncommutative theories in which no state saturates simultaneously all the non trivial Heisenberg uncertainty relations. We show how the difference of structure between the Poisson brackets and…
Joint measurability of sharp quantum observables is determined pairwise, and so can be captured in a graph. We prove the converse: any graph, whose vertices represent sharp observables, and whose edges represent joint measurability, is…
In this work, we present a novel method to express the stabilizer of a k-uniform complete hypergraph state as a linear combination of local operators. Quantum hypergraph states generalize graph states and exhibit properties that are not…
In the realm of fault-tolerant quantum computing, stabilizer operations play a pivotal role, characterized by their remarkable efficiency in classical simulation. This efficiency sets them apart from non-stabilizer operations within the…
We establish Maximum Principles which apply to vectorial approximate minimizers of the general integral functional of Calculus of Variations. Our main result is a version of the Convex Hull Property. The primary advance compared to results…
We construct a canonical stabilizer reduction $\widetilde{X}$ for any derived $1$-algebraic stack $X$ over $\mathbb{C}$ as a sequence of derived Kirwan blow-ups, under mild natural conditions that include the existence of a good moduli…
We show how it is possible to formulate Euclidean two-dimensional quantum gravity as the scaling limit of an ordinary statistical system by means of dynamical triangulations, which can be viewed as a discretization in the space of…
We present an algorithm for verifying the local unitary (LU) equivalence of graph and stabilizer states. Our approach reduces the problem to solving a system of linear equations in modular arithmetic. Furthermore, we demonstrate that any LU…