Papers › Reducing Depth and Measurement Weights in Pauli-based Computation
Reducing Depth and Measurement Weights in Pauli-based Computation
Filipa C. R. Peres, Ernesto F. Galvão
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Pauli-based computation (PBC) is a universal measurement-based quantum computation model steered by an adaptive sequence of independent and compatible Pauli measurements on separable magic-state qubits. Here, we propose several new techniques for reducing the weight of the Pauli measurements and their associated \textsc{cnot} complexity; we also demonstrate how to decrease this model's computational depth. We start by proving new upper bounds on the required weights and computational depth, obtained via a pre-compilation step. We also propose a heuristic algorithm that can contribute reductions of over 30\% to the average weight of Pauli measurements (and associated \textsc{cnot} count) when simulating and compiling Clifford-dominated random quantum circuits with up to 22 T gates and over 20\% for instances with larger T counts. This PBC-compilation scheme, boosted by the heuristic algorithm, outperforms state-of-the-art compilers for the former circuits, reducing the \textsc{cnot} count by 18\% to 96\% compared with the values achieved by other techniques. In contrast, for the latter circuits with larger T counts, it leads to a number of \textsc{cnot}s roughly 30\% larger. Finally, inspired by known state-transfer methods, we introduce incPBC, a universal model for quantum computation requiring a larger number of (now incompatible) Pauli measurements of weight at most 2.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections