Related papers: Generalised Clifford groups and simulation of asso…
We consider recent works on the simulation of quantum circuits using the formalism of matrix product states and the formalism of contracting tensor networks. We provide simplified direct proofs of many of these results, extending an…
The performance of computational methods for many-body physics and chemistry is strongly dependent on the choice of basis used to cast the problem; hence, the search for better bases and similarity transformations is important for progress…
In this paper we show how all the quantum properties of Schroedinger and Pauli particles can be described entirely from within a Clifford algebra taken over the reals. There is no need to appeal to any `wave function'. To describe a quantum…
We develop the method of averaging in Clifford (geometric) algebras suggested by the author in previous papers. We consider operators constructed using two different sets of anticommuting elements of real or complexified Clifford algebras.…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
We show that states obtained from deep random Clifford circuits doped with non-Clifford phase gates (including T-gates and $\sqrt{\mathrm{T}}$-gates) can be disentangled completely, provided the number of non-Clifford gates is smaller or…
A unitary t-design is a set of unitaries that is "evenly distributed" in the sense that the average of any t-th order polynomial over the design equals the average over the entire unitary group. In various fields -- e.g. quantum information…
We introduce a complete equational theory for the fragment of quantum circuits generated by the real Clifford gates plus the two-qubit controlled-Hadamard gate. That is, we give a simple set of equalities between circuits of this fragment,…
(Abridged.) Quantum computers promise to solve some problems exponentially faster than traditional computers, but we still do not fully understand why this is the case. While the most studied model of quantum computation uses qubits, which…
The representation theory of the Clifford group is playing an increasingly prominent role in quantum information theory, including in such diverse use cases as the construction of protocols for quantum system certification, quantum…
We prove a `Whitney' presentation, and a `Coulomb branch' presentation, for the torus equivariant quantum K theory of the Grassmann manifold $\mathrm{Gr}(k;n)$, inspired from physics, and stated in an earlier paper. The first presentation…
We show how to use Clifford algebra techniques to describe the de Rham cohomology ring of equal rank compact symmetric spaces $G/K$. In particular, for $G/K=U(n)/U(k)\times U(n-k)$, we obtain a new way of multiplying Schur polynomials,…
Groupoidification is a form of categorification in which vector spaces are replaced by groupoids, and linear operators are replaced by spans of groupoids. We introduce this idea with a detailed exposition of 'degroupoidification': a…
The Clifford algebra over the three-dimensional real linear space includes its linear structure and its exterior algebra, the subspaces spanned by multivectors of the same degree determine a gradation of the Clifford algebra. Through these…
The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access to certain standard resources. While the full structure of…
Quantum computing has potential to provide exponential speedups over classical computing for many important applications. However, today's quantum computers are in their early stages, and hardware quality issues hinder the scale of program…
We provide a careful analysis of the structure theorem for the $n$-qudit projective Clifford group and various encoding schemes for its elements. In particular, we derive formulas for evaluation, composition, and inversion. Our results…
When can a quantum system of finite dimension be used to simulate another quantum system of finite dimension? What restricts the capacity of one system to simulate another? In this paper we complete the program of studying what simulations…
This study introduces a method for simulating quantum systems using electrical networks. Our approach leverages a generalized similarity transformation, which connects different Hamiltonians, enabling well-defined paths for quantum system…
Clifford theory establishes a relation between the representation theory of a finite group and its normal subgroups. In this paper, we establish the Clifford theory for the modular representations of finite groups. The proofs are based on…