Representations of the multi-qubit Clifford group
From MaRDI portal
Publication:4583101
Abstract: The Clifford group is a fundamental structure in quantum information with a wide variety of applications. We discuss the tensor representations of the -qubit Clifford group, which is defined as the normalizer of the -qubit Pauli group in . In particular, we characterize all irreducible subrepresentations of the two-copy representation of the Clifford group on the matrix space with . In an upcoming companion paper we applied this result to cut down the number of samples necessary to perform randomised benchmarking, a method for characterising quantum systems.
Recommendations
- The monomial representations of the Clifford group
- Stabilizer states and Clifford operations for systems of arbitrary dimensions and modular arithmetic
- How to efficiently select an arbitrary Clifford group element
- Generalized Clifford groups and simulation of associated quantum circuits
- Generators and relations for \(n\)-qubit Clifford operators
Cites work
- scientific article; zbMATH DE number 5863326 (Why is no real title available?)
- An ideal characterization of the Clifford operators
- Evenly distributed unitaries: On the structure of unitary designs
- Large deviation bounds for \(k\)-designs
- Quantum data hiding
- Randomized benchmarking with confidence
- Symmetry, Representations, and Invariants
Cited in
(16)- Multiplicative group of quantum representations of signals
- SIC POVMs and Clifford groups in prime dimensions
- Group theory for quantum gates and quantum coherence
- Constructive simulation and topological design of protocols
- Clifford group is not a semidirect product in dimensions N divisible by four
- Stabilizer states and Clifford operations for systems of arbitrary dimensions and modular arithmetic
- Generators and relations for \(n\)-qubit Clifford operators
- Approximate randomized benchmarking for finite groups
- On an infinite family of integral Cayley graphs of Pauli groups
- Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations
- An ideal characterization of the Clifford operators
- Generators and Relations for 3-Qubit Clifford+CS Operators
- Efficient unitary designs with a system-size independent number of non-Clifford gates
- How to efficiently select an arbitrary Clifford group element
- Rank-deficient representations in the theta correspondence over finite fields arise from quantum codes
- The monomial representations of the Clifford group
This page was built for publication: Representations of the multi-qubit Clifford group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583101)