{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/reducing-depth-and-measurement-weights-in","title":"Reducing Depth and Measurement Weights in Pauli-based Computation","arxiv_id":"2408.04007","date":"2024-08-07","proceeding":null,"authors":["Filipa C. R. Peres","Ernesto F. Galvão"],"abstract":"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.","url_abs":"https://arxiv.org/abs/2408.04007v1","url_pdf":"https://arxiv.org/pdf/2408.04007v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"reducing-depth-and-measurement-weights-in","repo_url":"https://github.com/fcrperes/comphybpbc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}