English
Related papers

Related papers: An Entropic Lens on Stabilizer States

200 papers

Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault-tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be…

Quantum Physics · Physics 2013-10-04 Sergey Bravyi , Robert Koenig

The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. This group plays a prominent role in quantum error correction, randomized benchmarking protocols, and the study of…

Quantum Physics · Physics 2021-11-17 Sergey Bravyi , Ruslan Shaydulin , Shaohan Hu , Dmitri Maslov

Graph states are the main computational building blocks of measurement-based computation and a useful tool for error correction in the gate model architecture. The graph states form a class of quantum states which are eigenvectors for the…

Quantum Physics · Physics 2022-12-26 Sebastiano Corli , Enrico Prati

We consider four-dimensional qudits as qubit pairs and their qudit Pauli operators as qubit Clifford operators. This introduces a nesting, $C_1^2 \subset C_2^4 \subset C_3^2$, where $C_n^m$ is the $n$th level of the $m$-dimensional qudit…

Quantum Physics · Physics 2016-10-18 Jonathan E. Moussa

One learned from Gottesman-Knill theorem that the Clifford model of quantum computing \cite{Clark07} may be generated from a few quantum gates, the Hadamard, Phase and Controlled-Z gates, and efficiently simulated on a classical computer.…

Quantum Physics · Physics 2010-04-20 Michel Planat

This work classifies stabilizer codes by the set of diagonal Clifford gates that can be implemented transversally on them. We show that, for any stabilizer code, its group of diagonal transversal Clifford gates on $\ell$ code blocks must be…

Quantum Physics · Physics 2025-07-15 Shival Dasu , Simon Burton

This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by…

Quantum Physics · Physics 2010-08-23 Michel Planat , Maurice R. Kibler

Graph states, which include for example Bell states, GHZ states and cluster states, form a well-known class of quantum states with applications ranging from quantum networks to error-correction. Deciding whether two graph states are…

Quantum Physics · Physics 2020-08-05 Axel Dahlberg , Jonas Helsen , Stephanie Wehner

We introduce a new family of models for measurement-based quantum computation which are deterministic and approximately universal. The resource states which play the role of graph states are prepared via 2-qubit gates of the form…

Quantum Physics · Physics 2019-05-01 Aleks Kissinger , John van de Wetering

We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that only exploits the elementary properties of the Clifford…

Quantum Physics · Physics 2025-01-15 Timothée Goubault de Brugière , Simon Martiel , Christophe Vuillot

Any 8-qubit graph state belongs to one of the 101 equivalence classes under local unitary operations within the Clifford group. For each of these classes we obtain a representative which requires the minimum number of controlled-Z gates for…

Quantum Physics · Physics 2010-07-26 Adan Cabello , Antonio J. Lopez-Tarrida , Pilar Moreno , Jose R. Portillo

Given their potential for fault-tolerant operations, topological quantum states are currently the focus of intense activity. Of particular interest are topological quantum error correction codes, such as the surface and planar stabilizer…

Quantum Physics · Physics 2021-08-04 Pengcheng Liao , David L. Feder

Since quantum computing is currently in the NISQ-Era, compilation strategies to reduce the number of gates executed on specific hardware are required. In this work, we utilize the concept of synthesis of a data structure called Clifford…

Quantum Physics · Physics 2024-10-31 David Winderl , Qunsheng Huang , Arianne Meijer-van de Griend , Richie Yeung

The recent proposal (M Planat and M Kibler, Preprint 0807.3650 [quantph]) of representing Clifford quantum gates in terms of unitary reflections is revisited. In this essay, the geometry of a Clifford group G is expressed as a BN-pair, i.e.…

Quantum Physics · Physics 2009-11-13 Michel Planat , Patrick Solé

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…

Quantum Physics · Physics 2025-01-15 Nadish de Silva , Oscar Lautsch

The equivalence of stabilizer states under local transformations is of fundamental interest in understanding properties and uses of entanglement. Two stabilizer states are equivalent under the usual stochastic local operations and classical…

Quantum Physics · Physics 2015-06-26 Bei Zeng , Hyeyoun Chung , Andrew W. Cross , Isaac L. Chuang

It was recently found that the stabilizer and hypergraph entropy cones coincide for four parties, leading to a conjecture of their equivalence at higher party numbers. In this note, we show this conjecture to be false by proving new…

Quantum Physics · Physics 2021-12-21 Ning Bao , Newton Cheng , Sergio Hernández-Cuenca , Vincent Paul Su

In this paper, we construct a symmetric group ${\rm Sym}_{2(4^n-1)}$, which contains a subgroup isomorphic to the $n$-qubit projective Clifford group $\mathcal{C}_n$. To establish this result, we investigate the centralizers of the $z$ gate…

Group Theory · Mathematics 2024-10-29 Chin-Yen Lee

The class of entangled $N$-qubit states known as graph states, and the corresponding stabilizer groups of $N$-qubit Pauli observables, have found a wide range of applications in quantum information processing and the foundations of quantum…

Quantum Physics · Physics 2014-09-26 Mordecai Waegell

The non-linear binary Kerdock codes are known to be Gray images of certain extended cyclic codes of length $N = 2^m$ over $\mathbb{Z}_4$. We show that exponentiating these $\mathbb{Z}_4$-valued codewords by $\imath \triangleq \sqrt{-1}$…

Information Theory · Computer Science 2021-08-20 Trung Can , Narayanan Rengaswamy , Robert Calderbank , Henry D. Pfister