相关论文: The qudit Pauli group: non-commuting pairs, non-co…
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…
A moduli space of stable quotients of the rank n trivial sheaf on stable curves is introduced. Over nonsingular curves, the moduli space is Grothendieck's Quot scheme. Over nodal curves, a relative construction is made to keep the torsion…
Qubits are a great way to build a quantum computer, but a limited way to program one. We replace the usual "states and gates" formalism with a "props and ops" (propositions and operators) model in which (a) the C*-algebra of observables…
We consider groupoids constructed from a finite number of commuting local homeomorphisms acting on a compact metric space, and study generalized Ruelle operators and $ C^{\ast} $-algebras associated to these groupoids. We provide a new…
In fault-tolerant quantum computation, the preparation of logical states is a ubiquitous subroutine, yet significant challenges persist even for the simplest states required. In the present work, we present a unitary, scalable,…
We study the GIT compactifications of pairs formed by a hypersurface and a hyperplane. We provide a general setting to characterize all polarizations which give rise to different GIT quotients. Furthermore, we describe a finite set of…
Analysis of quantum error correcting codes is typically done using a stochastic, Pauli channel error model for describing the noise on physical qubits. However, it was recently found that coherent errors (systematic rotations) on physical…
We present the Quantum Paldus Transform: an efficient quantum algorithm for block-diagonalising fermionic, spin-free Hamiltonians in the second quantisation. Our algorithm implements an isometry between the occupation number basis of a…
The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman-Knill theorem.…
Despite the exponential overhead to describe general multi-qubit quantum states and processes, efficient methods for certain state families and operations have been developed and utilised. The stabilizer formalism and the Gottesman-Knill…
Given a representation of a finite group $G$ over some commutative base ring $\mathbf{k}$, the cofixed space is the largest quotient of the representation on which the group acts trivially. If $G$ acts by $\mathbf{k}$-algebra automorphisms,…
We present a software library for the commutation of Pauli operators through quantum Clifford circuits, which is called Pauli tracking. Tracking Pauli operators allows one to reduce the number of Pauli gates that must be executed on quantum…
Estimating expectation values on near-term quantum computers often requires a prohibitively large number of measurements. One widely-used strategy to mitigate this problem has been to partition an operator's Pauli terms into sets of…
In fault-tolerant quantum computation and quantum error-correction one is interested on Pauli matrices that commute with a circuit/unitary. We provide a fast algorithm that decomposes any Clifford gate as a $\textit{minimal}$ product of…
The Heisenberg-Weyl group $HW(d)$ related to a $d$-dimensional Hilbert space $H(d)$, is enlarged into the Heisenberg-Weyl-parity group $HWP(d)$ that incorporates parity transformations. It consists of $2d^3$ elements, of which $d^3$…
Quantum computation strongly relies on the realisation, manipulation and control of qubits. A central method for realizing qubits is by creating a double-well potential system with a significant gap between the first two eigenvalues and the…
Clifford quantum circuits are elementary invertible transformations of quantum systems that map Pauli operators to Pauli operators. We study periodic one-parameter families of Clifford circuits, called loops of Clifford circuits, acting on…
We study equivariant projective compactifications of reductive groups obtained by closing the image of a group in the space of operators of a projective representation. We describe the structure and the mutual position of their orbits under…
We develop a framework to construct moduli spaces of $\mathbb{Q}$-Gorenstein pairs. To do so, we fix certain invariants; these choices are encoded in the notion of $\mathbb{Q}$-stable pair. We show that these choices give a proper moduli…
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…