Related papers: Clifford circuits over non-cyclic abelian groups

Clifford circuits over non-cyclic abelian groups

URL: http://arxiv.org/abs/2402.13994v1
Date: Wed, 21 Feb 2024 18:26:25 GMT
Title: Clifford circuits over non-cyclic abelian groups
Authors: Milo Moses, Jacek Horecki, Konrad Deka, Jan Tulowiecki
Abstract summary: We show that every Clifford circuit can be efficiently classically simulated. We additionally provide circuits for a universal quantum computing scheme based on local two-qudit Clifford gates and magic states.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: We present a discussion of the generalized Clifford group over non-cyclic finite abelian groups. These Clifford groups appear naturally in the theory of topological error correction and abelian anyon models. We demonstrate a generalized Gottesman-Knill theorem, stating that every Clifford circuit can be efficiently classically simulated. We additionally provide circuits for a universal quantum computing scheme based on local two-qudit Clifford gates and magic states.

Related papers

Extending Simulability of Cliffords and Matchgates [0.0]
We study simulability of marginals as well as Pauli expectation values of Clifford and matchgate hybrid circuits. Most importantly, we show that the known simulability of Pauli expectation values of Clifford circuits acting on product states can be generalized to Clifford circuits acting after any matchgate circuit.
arXiv Detail & Related papers (2024-10-14T01:21:50Z)
Clifford Dressed Time-Dependent Variational Principle [39.58317527488534]
We propose an enhanced Time-Dependent Variational Principle (TDVP) algorithm for Matrix Product States (MPS) By leveraging the Clifford group, we introduce a Clifford dressed single-site 1-TDVP scheme. We validate the new algorithm numerically using various quantum many-body models, including both integrable and non-integrable systems.
arXiv Detail & Related papers (2024-07-01T18:04:25Z)
Low-depth Clifford circuits approximately solve MaxCut [44.99833362998488]
We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. Our algorithm finds an approximate solution of MaxCut on an $N$-vertex graph by building a depth $O(N)$ Clifford circuit.
arXiv Detail & Related papers (2023-10-23T15:20:03Z)
The Clifford theory of the $n$-qubit Clifford group [0.0]
Recent applications have made use of the representation theory of the Clifford group. We find an unexpected correspondence between irreducible characters of the $n$-qubit Clifford group and those of the $(n+1)$-qubit Clifford group.
arXiv Detail & Related papers (2023-07-11T21:21:31Z)
Homotopy Classification of loops of Clifford unitaries [0.0]
We study Clifford quantum circuits acting on $mathsfd$-dimensional lattices of prime $p$-dimensional qudits. We calculate homotopy classes of such loops for any odd $p$ and $mathsfd=0,1,2,3$, and $4$. We observe that the homotopy classes of loops of Clifford circuits in $(mathsfd+1)$-dimensions coincide with the quotient of the group of Clifford Quantum Cellular Automata modulo shallow circuits and lattice translations in $mathsfd$-dimensions
arXiv Detail & Related papers (2023-06-16T15:31:34Z)
Representing and Learning Functions Invariant Under Crystallographic Groups [18.6870237776672]
Crystallographic groups describe the symmetries of crystals and other repetitive structures encountered in nature and the sciences. We derive linear and nonlinear representations of functions that are (1) smooth and (2) invariant under such a group. We show that such a basis exists for each crystallographic group, that it is orthonormal in the relevant $L$ space, and recover the standard Fourier basis as a special case for pure shift groups.
arXiv Detail & Related papers (2023-06-08T15:02:04Z)
Clifford Group Equivariant Neural Networks [14.260561321140976]
We introduce Clifford Group Equivariant Neural Networks, a novel approach for constructing $mathrmO(n)$- and $mathrmE(n)$-equivariant models. We demonstrate, notably from a single core implementation, state-of-the-art performance on several distinct tasks.
arXiv Detail & Related papers (2023-05-18T17:35:35Z)
On Groups in the Qubit Clifford Hierarchy [0.0]
unitary groups can be constructed using elements from the qubit Clifford Hierarchy. We classify all such groups that can be constructed using generalized semi-Clifford elements in the Clifford Hierarchy.
arXiv Detail & Related papers (2022-12-11T03:37:19Z)
Adaptive constant-depth circuits for manipulating non-abelian anyons [65.62256987706128]
Kitaev's quantum double model based on a finite group $G$. We describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated by an arbitrary distance, and (c) non-destructive topological charge measurement.
arXiv Detail & Related papers (2022-05-04T08:10:36Z)
Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
arXiv Detail & Related papers (2022-03-21T17:57:02Z)
Hadamard-free circuits expose the structure of the Clifford group [9.480212602202517]
The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. We show that any Clifford operator can be uniquely written in the canonical form $F_HSF$. A surprising connection is highlighted between random uniform Clifford operators and the Mallows distribution on the symmetric group.
arXiv Detail & Related papers (2020-03-20T17:51:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.