相关论文: A complete theory of the Clifford commutant

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…

The n-qubit Pauli group and its normalizer the n-qubit Clifford group have applications in quantum error correction and device characterization. Recent applications have made use of the representation theory of the Clifford group. We apply…

We introduce an exact mapping of Clifford (stabilizer) random tensor networks (RTNs) and monitored quantum circuits, onto a statistical mechanics model. With Haar unitaries, the fundamental degrees of freedom ('spins') are permutations…

The Clifford group is a fundamental structure in quantum information with a wide variety of applications. We discuss the tensor representations of the $q$-qubit Clifford group, which is defined as the normalizer of the $q$-qubit Pauli group…

The Clifford hierarchy is a nested sequence of sets of quantum gates that can be fault-tolerantly performed using gate teleportation within standard quantum error correction schemes. The groups of Pauli and Clifford gates constitute the…

Schur-Weyl duality is a ubiquitous tool in quantum information. At its heart is the statement that the space of operators that commute with the tensor powers of all unitaries is spanned by the permutations of the tensor factors. In this…

Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and…

We introduce the Clifford entropy, a measure of how close an arbitrary unitary is to a Clifford unitary, which generalizes the stabilizer entropy for states. We show that this quantity vanishes if and only if a unitary is Clifford, is…

Clifford gates and transformations, which map products of elementary Pauli or Majorana operators to other such products, are foundational in quantum computing, underpinning the stabilizer formalism, error-correcting codes, magic state…

The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…

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…

We describe stabilizer states and Clifford group operations using linear operations and quadratic forms over binary vector spaces. We show how the n-qubit Clifford group is isomorphic to a group with an operation that is defined in terms of…

In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this paper, we study their analogues for systems composed of Majorana fermions. In this case, a crucial role…

In this paper is shown an application of Clifford algebras to the construction of computationally universal sets of quantum gates for $n$-qubit systems. It is based on the well-known application of Lie algebras together with the especially…

Stabilizer states along with Clifford manipulations (unitary transformations and measurements) thereof -- despite being efficiently simulable on a classical computer -- are an important tool in quantum information processing, with…

We have generalized the well-known statement that the Clifford group is a unitary 3-design into symmetric cases by extending the notion of unitary design. Concretely, we have proven that a symmetric Clifford group is a symmetric unitary…

Clifford group lies at the core of quantum computation -- it underlies quantum error correction, its elements can be used to perform magic state distillation and they form randomized benchmarking protocols, Clifford group is used to study…

The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access to certain standard resources. While the full structure of…

In fault-tolerant quantum computation and quantum error-correction one is interested on Pauli matrices that commute with a circuit/unitary. We provide a fast algorithm that decomposes any Clifford gate as a $\textit{minimal}$ product of…

Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result…