English
Related papers

Related papers: The Clifford group forms a unitary 3-design

200 papers

Kliuchnikov, Maslov, and Mosca proved in 2012 that a $2\times 2$ unitary matrix $V$ can be exactly represented by a single-qubit Clifford+$T$ circuit if and only if the entries of $V$ belong to the ring $\mathbb{Z}[1/\sqrt{2},i]$. Later…

Quantum Physics · Physics 2020-04-08 Matthew Amy , Andrew N. Glaudell , Neil J. Ross

Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later development [quant-ph/0012009] of the similar idea for a non-binary…

Quantum Physics · Physics 2007-05-23 Alexander Yu. Vlasov

We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with code distance being the linear system size, is decomposed by a local Clifford…

Quantum Physics · Physics 2021-01-06 Jeongwan Haah

We prove that $poly(t) \cdot n^{1/D}$-depth local random quantum circuits with two qudit nearest-neighbor gates on a $D$-dimensional lattice with n qudits are approximate $t$-designs in various measures. These include the "monomial"…

Quantum Physics · Physics 2023-05-05 Aram Harrow , Saeed Mehraban

Over the past several years, numerous authors have explored model theoretically motivated combinatorial conditions that ensure that a graph has an efficient regular decomposition in the sense of Szemer\'edi. In this paper we set out a…

Combinatorics · Mathematics 2025-03-18 C. Terry , J. Wolf

Clifford group lies at the core of quantum computation -- it underlies quantum error correction, its elements can be used to perform magic state distillation and they form randomized benchmarking protocols, Clifford group is used to study…

Quantum Physics · Physics 2022-08-26 Sergey Bravyi , Joseph A. Latone , Dmitri Maslov

We study the communication complexity of multiplying $k\times t$ elements from the group $H=\text{SL}(2,q)$ in the number-on-forehead model with $k$ parties. We prove a lower bound of $(t\log H)/c^{k}$. This is an exponential improvement…

Computational Complexity · Computer Science 2024-09-12 Harm Derksen , Chin Ho Lee , Emanuele Viola

We describe the structure of the extended Clifford Group (defined to be the group consisting of all operators, unitary and anti-unitary, which normalize the generalized Pauli group (or Weyl-Heisenberg group as it is often called)). We also…

Quantum Physics · Physics 2015-06-26 D. M. Appleby

Distributed inner product estimation (DIPE) is a fundamental task in quantum information, aiming to estimate the inner product between two unknown quantum states prepared on distributed quantum platforms. Existing rigorous sample complexity…

Quantum Physics · Physics 2026-02-03 Congcong Zheng , Kun Wang , Xutao Yu , Ping Xu , Zaichen Zhang

We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…

Computational Complexity · Computer Science 2024-10-29 Pravesh K. Kothari , Peter Manohar

Associated with a symmetric Clifford system $\{P_0, P_1,\cdots, P_{m}\}$ on $\mathbb{R}^{2l}$, there is a canonical vector bundle $\eta$ over $S^{l-1}$. For $m=4$ and $8$, we construct explicitly its characteristic map, and determine…

Differential Geometry · Mathematics 2022-08-24 Chao Qian , Zizhou Tang , Wenjiao Yan

The theory of representations of Clifford algebras is extended to employ the division algebra of the octonions or Cayley numbers. In particular, questions that arise from the non-associativity and non-commutativity of this division algebra…

High Energy Physics - Theory · Physics 2015-06-26 Jörg Schray , Corinne A. Manogue

Let $G$ be a finite group and $G'$ its commutator subgroup. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered…

Commutative Algebra · Mathematics 2019-05-06 Jun Seok Oh

Division algebras have demonstrated their utility in studying non-associative algebras and their connection to the Standard Model through complex Clifford algebras. This article focuses on exploring the connection between these complex…

High Energy Physics - Theory · Physics 2023-12-19 Armando Reynoso

We introduce the Non-commutative Subset Convolution - a convolution of functions useful when working with determinant-based algorithms. In order to compute it efficiently, we take advantage of Clifford algebras, a generalization of…

Data Structures and Algorithms · Computer Science 2018-08-13 Michał Włodarczyk

We discuss a Clifford algebra framework for discrete symmetry groups (such as reflection, Coxeter, conformal and modular groups), leading to a surprising number of new results. Clifford algebras allow for a particularly simple description…

Representation Theory · Mathematics 2018-10-12 Pierre-Philippe Dechant

We study the representation theoretic results of the binary cubic generic Clifford algebra $\mathcal C$, which is an Artin-Schelter regular algebra of global dimension five. In particular, we show that $\mathcal C$ is a PI algebra of PI…

Rings and Algebras · Mathematics 2019-09-23 Linhong Wang , Xingting Wang

We introduce $\bar G$-fusions of local pointed groups on a block extension $A=b\mathcal{O}G$, where $H$ is a normal subgroup of the finite group $G$, $\bar G=G/H$, and $b$ is a $G$-invariant block of $\mathcal{O}H$. We show that certain…

Representation Theory · Mathematics 2018-09-26 Tiberiu Coconet , Andrei Marcus , Constantin-Cosmin Todea

We investigate the representation theory of domestic group schemes $\mathcal{G}$ over an algebraically closed field of characteristic $p > 2$. We present results about filtrations of induced modules, actions on support varieties, Clifford…

Representation Theory · Mathematics 2016-04-04 Dirk Kirchhoff

The capacity to randomly pick a unitary across the whole unitary group is a powerful tool across physics and quantum information. A unitary $t$-design is designed to tackle this challenge in an efficient way, yet constructions to date rely…

Quantum Physics · Physics 2020-02-19 Rawad Mezher , Joe Ghalbouni , Joseph Dgheim , Damian Markham
‹ Prev 1 4 5 6 7 8 10 Next ›