Pauli-based model of quantum computation with higher-dimensional systems

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 $n$ $p$-dimensional qudits to adaptive circuits on $n+1$ qudits with $O\left(p{n}^2/2\right)$ $\mathrm{SUM}$ gates and depth. Alternatively, we can carry out the same computation with $O\left(pn/2\right)$ depth at the expense of an increased circuit width. Finally, we show that the sampling complexity associated with simulating a number $k$ of virtual qudits is related to the robustness of magic of the input states. Computation of this magic monotone for qutrit and ququint states leads to sampling complexity upper bounds of, respectively, $O\left(3^{1.0848k}{\epsilon }^{-2}\right)$ and $O\left(5^{1.4022k}{\epsilon }^{-2}\right)$, for a desired precision $\epsilon$. We further establish lower bounds to this sampling complexity for qubits, qutrits, and ququints: $\Omega \left(2^{0.5431k}{\epsilon }^{-2}\right)$, $\Omega \left(3^{0.7236k}{\epsilon }^{-2}\right)$, and $\Omega \left(5^{0.8544k}{\epsilon }^{-2}\right)$, respectively.

arXiv comment15 pages, 4 figures

References in corpus (37)

• Bell inequalities for arbitrarily high dimensional systems
• Quantum cryptography with 3-state systems
• Optimal eavesdropping in cryptography with three-dimensional quantum states
• Quantum teleportation in high dimensions
• Application of a resource theory for magic states to fault-tolerant quantum computing
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• A universal qudit quantum processor with trapped ions
• Methodology for quantum logic gate constructions
• Trading classical and quantum computational resources
• Efficient Toffoli Gates Using Qudits
• Building a fault-tolerant quantum computer using concatenated cat codes
• Stabilizer Rényi entropy
• Quantum Information Scrambling in a Superconducting Qutrit Processor
• Experimental high-dimensional quantum teleportation
• Accelerated Variational Quantum Eigensolver
• Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark
• Optimal Quantum Measurements of Expectation Values of Observables
• Manipulating biphotonic qutrits
• Control and Tomography of a Three Level Superconducting Artificial Atom
• Quantum computation based on d-level cluster states
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Fault-Tolerant Quantum Computation with Higher-Dimensional Systems
• Qutrit randomized benchmarking
• Methodology for replacing indirect measurements with direct measurements
• Experimental Realization of a Quantum Integer-Spin Chain with Controllable Interactions
• Robustness of Magic and Symmetries of the Stabiliser Polytope
• Qudit versions of the qubit "pi-over-eight" gate
• Computational speed-up in a single qudit NMR quantum information processor
• Computational speed-up with a single qudit
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Catalysis and activation of magic states in fault tolerant architectures
• A hidden variable model for universal quantum computation with magic states on qubits
• Quantum advantage of unitary Clifford circuits with magic state inputs
• Strengthening weak measurements of qubit out-of-time-order correlators
• Valence bond solid formalism for d-level one-way quantum computation
• Efficient quantum gate teleportation in higher dimensions

Cited by in corpus (4)

• Quantum circuit compilation and hybrid computation using Pauli-based computation
• Fusion for High-Dimensional Linear Optical Quantum Computing with Improved Success Probability
• Simulating quantum computation: how many "bits" for "it"?
• Reducing depth and measurement weights in Pauli-based computation