Related papers: Normalizer circuits and a Gottesman-Knill theorem …
For a group $G$ and a subgroup $H$ of $G$ this article discusses the normalizer of $H$ in the units of a group ring $RG$. We prove that $H$ is only normalized by the `obvious' units, namely products of elements of $G$ normalizing $H$ and…
Verification of NISQ era quantum devices demands fast classical simulation of large noisy quantum circuits. We present an algorithm based on the stabilizer formalism that can efficiently simulate noisy stabilizer circuits. Additionally, the…
Quantum circuits with gates (local unitaries) respecting a global symmetry have broad applications in quantum information science and related fields, such as condensed matter theory and quantum thermodynamics. However, despite their…
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…
We construct a qubit regularization of the $O(3)$ non-linear sigma model in two and three spatial dimensions using a quantum Hamiltonian with two qubits per lattice site. Using a worldline formulation and worm algorithms, we show that in…
The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…
Quantum circuit model is the most popular paradigm for implementing complex quantum computation. Based on Cartan decomposition, we show that $2(N-1)$ generalized controlled-$X$ (GCX) gates, $6$ single-qubit rotations about the $y$- and…
Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves substantial speedups over existing simulators for a wide class of…
We study a sequence of quantum gates in finite-dimensional Hilbert spaces given by the normalized eigenvectors of the unitary operators. The corresponding sequence of the Hamilton operators is also given. From the Hamilton operators we…
Quantum dynamics with local interactions in lattice models display rich physics, but is notoriously hard to study. Dual-unitary circuits allow for exact answers to interesting physical questions in clean or disordered one- and…
We apply the generalized Wigner function formalism to detect and characterize a range of quantum phase transitions in several cyclic, finite-length, spin-$\frac{1}{2}$ one-dimensional spin-chain models, viz., the Ising and anisotropic $XY$…
The functional renormalisation group for the Einstein-Hilbert action is investigated for the case of four infinite (or large) and one compact dimension. The motivation for this study is given by the suggestion that gravity in more than four…
The Bernstein-Vazirani (BV) algorithm is frequently taught as a canonical example of quantum parallelism, yet the standard interference-based explanation often obscures its underlying simplicity. We present a geometric reframing in which…
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…
Let $\varphi\colon\Gamma\to G$ be a homomorphism of groups. We consider factorizations $\Gamma\xrightarrow{f} M\xrightarrow{g} G$ of $\varphi$ such that either $g$ or $f$ are universal normal maps (namely, crossed modules). These two…
We study the computational power of unitary Clifford circuits with solely magic state inputs (CM circuits), supplemented by classical efficient computation. We show that CM circuits are hard to classically simulate up to multiplicative…
Random matrices in the large N expansion and the so-called double scaling limit can be used as toy models for quantum gravity: 2D quantum gravity coupled to conformal matter. This has generated a tremendous expansion of random matrix…
Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional…
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true…
Renormalization group limit cycles may be a commonplace for quantum Hamiltonians requiring renormalization, in contrast to experience to date with classical models of critical points, where fixed points are far more common. We discuss the…