An Ideal Characterization of the Clifford Operators

Abstract

The Clifford operators are an important and well-studied subset of quantum operations, in both the qubit and higher-dimensional qudit cases. While there are many ways to characterize this set, this paper aims to provide an ideal characterization, in the sense that it has the same characterization in every finite dimension, is characterized by a minimal set of gates, is constructive, and does not make any assumptions about non-Clifford operations or resources (such as the use of ancillas or the ability to make measurements). While most characterizations satisfy some of these properties, this appears to be the first characterization satisfying all of the above. As an application, we use these results to briefly analyze characterizations of Clifford embeddings, that is, the action of logical Clifford operations acting on qunits embedded in higher-dimensional qudits, inside the qudit Clifford framework.

18 pages, 1 figure, 2 appendices; Updates: v3: New title that better embodies the focus of the research; new abstract and introduction that more clearly motivate the research; new section added at the end on Clifford embeddings. All results unchanged. v4: Minor edits and additional references. This is close to the published version

References in corpus (1)

• Quantum logic gates for superconducting resonator qudits

Cited by in corpus (23)

• Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
• Quantum Computing with Parafermions
• Uniqueness of noncontextual models for stabilizer subtheories
• Multi-qubit Randomized Benchmarking Using Few Samples
• Transversal Clifford gates on folded surface codes
• Entanglement from Topology in Chern-Simons Theory
• Efficient simulatability of continuous-variable circuits with large Wigner negativity
• Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates
• Parafermions in a Kagome lattice of qubits for topological quantum computation
• Randomized benchmarking for qudit Clifford gates
• Classical simulation of quantum circuits by half Gauss sums
• Representations of the multi-qubit Clifford group
• Holographic Software for Quantum Networks
• Transformations of Stabilizer States in Quantum Networks
• Bridging magic and non-Gaussian resources via Gottesman-Kitaev-Preskill encoding
• Local unitary classification for sets of generalized Bell states
• Ancilla-driven quantum computation for qudits and continuous variables
• Finding out all locally indistinguishable sets of generalized Bell states
• Measurement-based quantum computing with qudit stabilizer states
• Local unitary classification of sets of generalized Bell states in ${\mathbb{C}}^d\otimes {\mathbb{C}}^d$
• Blind quantum computing with different qudit resource state architectures
• Duality theory for Clifford tensor powers
• Classical representation of local Clifford operators