Pith. sign in

arXiv preprint arXiv:2003.09412 , year=

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. Here we study the structural properties of this group. We show that any Clifford operator can be uniquely written in the canonical form $F_1HSF_2$, where $H$ is a layer of Hadamard gates, $S$ is a permutation of qubits, and $F_i$ are parameterized Hadamard-free circuits chosen from suitable subgroups of the Clifford group. Our canonical form provides a one-to-one correspondence between Clifford operators and layered quantum circuits. We report a polynomial-time algorithm for computing the canonical form. We employ this canonical form to generate a random uniformly distributed $n$-qubit Clifford operator in runtime $O(n^2)$. The number of random bits consumed by the algorithm matches the information-theoretic lower bound. A surprising connection is highlighted between random uniform Clifford operators and the Mallows distribution on the symmetric group. The variants of the canonical form, one with a short Hadamard-free part and one allowing a circuit depth $9n$ implementation of arbitrary Clifford unitaries in the Linear Nearest Neighbor architecture are also discussed. Finally, we study computational quantum advantage where a classical reversible linear circuit can be implemented more efficiently using Clifford gates, and show an explicit example where such an advantage takes place.

fields

quant-ph 2

years

2026 1 2024 1

representative citing papers

Universal purification dynamics of monitored Clifford circuits

quant-ph · 2026-07-07 · accept · novelty 7.5

Purification of weakly monitored Clifford circuits on prime-dimensional qudits reduces exactly to a pure-death Markov process on the density-matrix rank, producing compact universal scaling functions for all Rényi entropies.

Magic state cultivation: growing T states as cheap as CNOT gates

quant-ph · 2024-09-26 · unverdicted · novelty 7.0

Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.

citing papers explorer

Showing 2 of 2 citing papers.

  • Universal purification dynamics of monitored Clifford circuits quant-ph · 2026-07-07 · accept · none · ref 80 · internal anchor

    Purification of weakly monitored Clifford circuits on prime-dimensional qudits reduces exactly to a pure-death Markov process on the density-matrix rank, producing compact universal scaling functions for all Rényi entropies.

  • Magic state cultivation: growing T states as cheap as CNOT gates quant-ph · 2024-09-26 · unverdicted · none · ref 122

    Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.