Related papers: Integrable spin chains and the Clifford group
Though Cliffords and matchgates are both examples of classically simulable circuits, they are considered simulable for different reasons. The celebrated Gottesman-Knill explains the simulability Cliffords, and the efficient simulability of…
We significantly enhance the simulation accuracy of initial Trotter circuits for Hamiltonian simulation of quantum systems by integrating first-order Riemannian optimization with tensor network methods. Unlike previous approaches, our…
We discuss a general approach permitting the identification of a broad class of sets of Poisson-commuting Hamiltonians, which are integrable in the sense of Liouville. It is shown that all such Hamiltonians can be solved explicitly by a…
We consider (self-adjoint) families of infinite matrices of noncommutative random variables such that the joint distribution of their entries is invariant under conjugation by a free quantum group. For the free orthogonal and…
We investigate the power of quantum systems for the simulation of Hamiltonian time evolutions on a cubic lattice under the constraint of translational invariance. Given a set of translationally invariant local Hamiltonians and short range…
We report here on the structure of reversible quantum cellular automata with the additional restriction that these are also Clifford operations. This means that tensor products of Weyl operators (projective representation of a finite…
We introduce a general method to construct one-dimensional translationally invariant valence bond solid states with a built-in Lie group $G$ and derive their matrix product representations. The general strategies to find their parent…
A lattice model of critical dense polymers is solved exactly for arbitrary system size on the torus. More generally, an infinite family of lattice loop models is studied on the torus and related to the corresponding Fortuin-Kasteleyn random…
The structure of subspaces of a Hilbert space that are invariant under unitary representations of a discrete group is related to a notion of Hilbert modules endowed with inner products taking values in spaces of unbounded operators. A…
We consider systems where dynamical variables are the generators of the SU(2) group. A subset of these Hamiltonians is exactly solvable using the Bethe ansatz techniques. We show that Bethe ansatz equations are equivalent to polynomial…
In this paper we study Clifford and harmonic analysis on some conformal flat spin manifolds. In particular we treat manifolds that can be parametrized by $U / \Gamma$ where $U$ is a simply connected subdomain of either $S^{n}$ or $R^{n}$…
A group theoretical description of basic discrete symmetries (space inversion P, time reversal T and charge conjugation C) is given. Discrete subgroups of orthogonal groups of multidimensional spaces over the fields of real and complex…
The spin network simulator model represents a bridge between (generalized) circuit schemes for standard quantum computation and approaches based on notions from Topological Quantum Field Theories (TQFT). More precisely, when working with…
Using a technique \cite{holgernorma2002} to construct a basis for spinors and ``families'' of spinors in terms of Clifford algebra objects, we define other Clifford algebra objects, which transform the state of one ''family'' of spinors…
This paper is a review of the works devoted to understanding and reinterpretation of the theory of quantum integrable models solvable by Bethe ansatz in terms of the theory of purely classical soliton equations. Remarkably, studying…
The topological framework of circuit topology has recently been introduced to complement knot theory and to help in understanding the physics of molecular folding. Naturally evolved linear molecular chains, such as proteins and nucleic…
Investigating translationally invariant qudit spin chains with a low local dimension, we ask what is the best possible tradeoff between the scaling of the entanglement entropy of a large block and the inverse-polynomial scaling of the…
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…
Recently, there has been an increasing interest in the study of hypercomplex signals and their Fourier transforms. This paper aims to study such integral transforms from general principles, using 4 different yet equivalent definitions of…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…