Related papers: Diagonal gates in the Clifford hierarchy
We study the algebra of complex polynomials which remain invariant under the action of the local Clifford group under conjugation. Within this algebra, we consider the linear spaces of homogeneous polynomials degree by degree and construct…
A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily implemented on many fault-tolerant architectures. For qutrits, there is an equivalent T gate, that, like its qubit analogue, makes…
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 propose models of quantum neural networks through Clifford algebras, which are capable of capturing geometric features of systems and to produce entanglement. Due to their representations in terms of Pauli matrices, the Clifford algebras…
Classical Clifford theory studies the decomposition of simple $G$-modules into simple $H$-modules for some normal subgroup $H \triangleleft G$. In this paper we deal with chains of normal subgroups $1 \triangleleft G_1 \triangleleft \cdots…
NOTE: PAPER WITHDRAWN (See Comments) The Clifford and Local Clifford groups for $d > 2$ dimensional systems have been topics of recent interest due to their applications in graph states, quantum codes, and possible applications in fast…
Geometric and holonomic quantum computation utilizes intrinsic geometric properties of quantum-mechanical state spaces to realize quantum logic gates. Since both geometric phases and quantum holonomies are global quantities depending only…
Fault-tolerant logic gates will consume a large proportion of the resources of a two-dimensional quantum computing architecture. Here we show how to perform a fault-tolerant non-Clifford gate with the surface code; a quantum…
The necessary appearance of Clifford algebras in the quantum description of fermions has prompted us to re-examine the fundamental role played by the quaternion Clifford algebra, C(0,2). This algebra is essentially the geometric algebra…
Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…
To build large-scale quantum computers while minimizing resource requirements, one may want to use high-rate quantum error-correcting codes that can efficiently encode information. However, realizing an addressable gate$\unicode{x2014}$a…
Clifford-Legendre and Clifford-Gegenbauer polynomials are eigenfunctions of certain differential operators acting on functions defined on $m$-dimensional euclidean space ${\mathbb R}^m$ and taking values in the associated Clifford algebra…
Arithmetic operations are an important component of many quantum algorithms. As such, coming up with optimized quantum circuits for these operations leads to more efficient implementations of the corresponding algorithms. In this paper, we…
We describe a fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions. Topologically protected quantum gates are realized by choosing appropriate boundary conditions on the cluster. We…
The term Clifford group was introduced in 1998 by D. Gottesmann in his investigation of quantum error-correcting codes. The simplest Clifford group in multiqubit quantum computation is generated by a restricted set of unitary Clifford gates…
The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. Here we study the structural properties of this group. We show that any Clifford operator can be uniquely…
In principle a 1D array of nearest-neighbour linked qubits is compatible with fault tolerant quantum computing. However such a restricted topology necessitates a large overhead for shuffling qubits and consequently the fault tolerance…
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…
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…