Pauli-based model of quantum computation with higher-dimensional systems
Filipa C. R. Peres

TL;DR
This paper extends Pauli-based quantum computation to odd-prime-dimensional systems, demonstrating universality, implementation strategies on hardware, and analyzing the sampling complexity related to the magic resource states.
Contribution
It generalizes Pauli-based computation to higher-dimensional qudits, provides implementation methods, and analyzes the complexity of simulating such systems based on magic states.
Findings
Universal for odd-prime-dimensional systems.
Implementation methods with different trade-offs in depth and width.
Sampling complexity bounds related to magic states.
Abstract
Pauli-based computation (PBC) is a universal model for quantum computation with qubits where the input state is a magic (resource) state and the computation is driven by a sequence of adaptively chosen and compatible multiqubit Pauli measurements. Here we generalize PBC for odd-prime-dimensional systems and demonstrate its universality. Additionally, we discuss how any qudit-based PBC can be implemented on actual, circuit-based quantum hardware. Our results show that we can translate a PBC on -dimensional qudits to adaptive circuits on qudits with gates and depth. Alternatively, we can carry out the same computation with depth at the expense of an increased circuit width. Finally, we show that the sampling complexity associated with simulating a number of virtual qudits is related to the robustness of magic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum and electron transport phenomena · Quantum Information and Cryptography
