2013/07/31 by J. M. Farinholt, J M Farinholt · 1 voice
Computer Science · Mathematics · Physics and Astronomy · #Action (physics) #Algebra over a field #Algebraic and Geometric Analysis #Characterization (materials science) #Clifford algebra #Ideal (ethics) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Relation (database) #Set (abstract data type) #Topology (electrical circuits) #math-ph #math.MP #quant-ph
paper · pdf · doi:10.1088/1751-8113/47/30/305303
published as J. Phys. A: Math. Theor. 47 (2014) 305303 · 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
arxiv created 2014/07/15 · openalex publication_date 2014/07/15 · arxiv updated 2014/07/16 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
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.