On Clifford groups in quantum computing

Abstract

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 Hadamard, $\pi /4$-phase and controlled-X gates. Because of this restriction the Clifford model of quantum computation can be efficiently simulated on a classical computer (the Gottesmann-Knill theorem). However, this fact does not diminish the importance of the Clifford model, since it may serve as a suitable starting point for a full-fledged quantum computation. In the general case of a single or composite quantum system with finite-dimensional Hilbert space the finite Weyl-Heisenberg group of unitary operators defines the quantum kinematics and the states of the quantum register. Then the corresponding Clifford group is defined as the group of unitary operators leaving the Weyl-Heisenberg group invariant. The aim of this contribution is to show that our comprehensive results on symmetries of the Pauli gradings of quantum operator algebras -- covering any single as well as composite finite quantum systems -- directly correspond to Clifford groups defined as quotients with respect to $\U(1)$.

Presented at the conference "Symmetries in Science XVII", Bregenz, Austria, July 30 - August 4, 2017

References in corpus (2)

• Symmetries of finite Heisenberg groups for multipartite systems
• A classification of finite quantum kinematics

Cited by in corpus (15)

• Decoding algorithms for surface codes
• Systematic study of High $E_J/E_C$ transmon qudits up to $d=12$
• Exploring Ququart Computation on a Transmon using Optimal Control
• Randomized benchmarking for qudit Clifford gates
• Partitioning Quantum Chemistry Simulations with Clifford Circuits
• Graph Optimization Perspective for Low-Depth Trotter-Suzuki Decomposition
• On Some Lie Groups in Degenerate Clifford Geometric Algebras
• Log-Convex set of Lindblad semigroups acting on $N$-level system
• OPAQUE: Obfuscating Phase in Quantum Circuit Compilation for Efficient IP Protection
• Clifford operations and homological codes for rotors and oscillators
• Clifford group is not a semidirect product in dimensions $N$ divisible by four
• Quantum Compiling by Deep Reinforcement Learning
• Partition of 3-qubits using local gates
• Four qubits generated by Clifford gates
• Qudit non-Clifford interleaved benchmarking