相关论文: Pivoting makes the ZX-calculus complete for real s…

We introduce a new family of models for measurement-based quantum computation which are deterministic and approximately universal. The resource states which play the role of graph states are prepared via 2-qubit gates of the form…

We introduce the notion of geometric pseudo-quantisation based on geometric quantisation with a weakened curvature condition. We show how such a structure arises naturally from simple deformations of the symplectic structure and pullbacks…

We give a complete presentation for the fragment, ZX&, of the ZX-calculus generated by the Z and X spiders (corresponding to copying and addition) along with the not gate and the and gate. To prove completeness, we freely add a unit and…

The quantum logic gates used in the design of a quantum computer should be both universal, meaning arbitrary quantum computations can be performed, and fault-tolerant, meaning the gates keep errors from cascading out of control. A number of…

The Pauli-Fierz model $H(\alpha)$ in nonrelativistic quantum electrodynamics is considered. The external potential $V$ is sufficiently shallow and the dipole approximation is assumed. It is proven that there exist constants $0<\alpha_-<…

We show that, on a Hilbert space of odd dimension, the only pure states to possess a non-negative Wigner function are stabilizer states. The Clifford group is identified as the set of unitary operations which preserve positivity. The result…

We introduce a novel quantum algorithm for determining graph connectedness using a constant number of measurements. The algorithm can be extended to find connected components with a linear number of measurements. It relies on non-unitary…

We provide a prorepresenting object for the noncommutative derived deformation problem of deforming a module $X$ over a differential graded algebra. Roughly, we show that the corresponding deformation functor is homotopy prorepresented by…

Simulating Clifford and near-Clifford circuits using the extended stabilizer formalism has become increasingly popular, particularly in quantum error correction. Compared to the state-vector approach, the extended stabilizer formalism can…

We consider the computational model of IQP circuits (in which all computational steps are $X$ basis diagonal gates), supplemented by intermediate $X$ or $Z$ basis measurements. We show that if we allow non-adaptive or adaptive $X$ basis…

In this work, we present a comprehensive exploration of the entanglement and graph connectivity properties of graph states. We quantify the entanglement in pseudo graph states using the entanglement distance, a recently introduced measure…

In the near term, programming quantum computers will remain severely limited by low quantum volumes. Therefore, it is desirable to implement quantum circuits with the fewest resources possible. For the common Clifford+T circuits, most…

We describe generalizations of the Pauli group, the Clifford group and stabilizer states for qudits in a Hilbert space of arbitrary dimension d. We examine a link with modular arithmetic, which yields an efficient way of representing the…

Physical Gottesman-Kitaev-Preskill (GKP) states are inherently noisy as ideal ones would require infinite energy. While this is typically considered as a deficiency to be actively corrected, this work demonstrates that imperfect GKP…

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…

The aim of the paper is to extend the notion of $\alpha$-geometry in the classical and in the noncommutative case by introducing a more general class of pull-back metrics and to give concrete formulas for the scalar curvature of these…

The Zykov ring of signed finite simple graphs with topological join as addition and compatible multiplication is an integral domain but not a unique factorization domain. We know that because by taking graph complements, it becomes…

We examine the ability of gate-based continuous-variable quantum computers to outperform qubit or discrete-variable quantum computers. Gate-based continuous-variable operations refer to operations constructed using a polynomial sequence of…

Non-Clifford gates are frequently exclusively implemented on fault-tolerant architectures by first distilling magic states in specialised magic-state factories. In the rest of the architecture, the computational space, magic states can then…

The ZX-calculus, and the variant we consider in this paper (ZXH-calculus), are formal diagrammatic languages for qubit quantum computing. We show that it can also be used to describe SU(2) representation theory. To achieve this, we first…