Quantum circuit compilation and hybrid computation using Pauli-based computation

Abstract

Pauli-based computation (PBC) is driven by a sequence of adaptively chosen, non-destructive measurements of Pauli observables. Any quantum circuit written in terms of the Clifford+$T$ gate set and having $t$ $T$ gates can be compiled into a PBC on $t$ qubits. Here we propose practical ways of implementing PBC as adaptive quantum circuits and provide code to do the required classical side-processing. Our schemes reduce the number of quantum gates to $O(t^2)$ (from a previous $O(t^3/\log t)$ scaling) and space/time trade-offs are discussed which lead to a reduction of the depth from $O(t\log t)$ to $O(t)$ within our schemes, at the cost of $t$ additional auxiliary qubits. We compile examples of random and hidden-shift quantum circuits into adaptive PBC circuits. We also simulate hybrid quantum computation, where a classical computer effectively extends the working memory of a small quantum computer by $k$ virtual qubits, at a cost exponential in $k$. Our results demonstrate the practical advantage of PBC techniques for circuit compilation and hybrid computation.

arXiv comment28 pages, 14 figures, includes links to a GitHub repository for Python software implementing all tasks discussed in the paper

References in corpus (45)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• Surface codes: Towards practical large-scale quantum computation
• Quantum computational advantage using photons
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Improved Simulation of Stabilizer Circuits
• Experimental One-Way Quantum Computing
• Characterizing Quantum Supremacy in Near-Term Devices
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Strong quantum computational advantage using a superconducting quantum processor
• Quantum algorithms: an overview
• Resource-efficient linear optical quantum computation
• Optical quantum computation using cluster states
• Roads towards fault-tolerant universal quantum computation
• Simulating quantum computation by contracting tensor networks
• Universal blind quantum computation
• 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
• High-speed linear optics quantum computing using active feed-forward
• Methodology for quantum logic gate constructions
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Trading classical and quantum computational resources
• Stabilizer Rényi entropy
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Automated optimization of large quantum circuits with continuous parameters
• Magic State Distillation: Not as Costly as You Think
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
• Reducing T-count with the ZX-calculus
• Robustness of Magic and Symmetries of the Stabiliser Polytope
• Circuit knitting with classical communication
• Phase Gadget Synthesis for Shallow Circuits
• Fast quantum circuit cutting with randomized measurements
• Phase space simulation method for quantum computation with magic states on qubits
• Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
• Computational speedups using small quantum devices
• Improved upper bounds on the stabilizer rank of magic states
• Quantum advantage of unitary Clifford circuits with magic state inputs
• On the Effect of Quantum Interaction Distance on Quantum Addition Circuits
• Clifford recompilation for faster classical simulation of quantum circuits
• Pauli-based model of quantum computation with higher-dimensional systems

Cited by in corpus (7)

• Dynamical Magic Transitions in Monitored Clifford+T Circuits
• Speedy Contraction of ZX Diagrams with Triangles via Stabiliser Decompositions
• Simulating quantum computation: how many "bits" for "it"?
• Simulation of quantum computation with magic states via Jordan-Wigner transformations
• Reducing depth and measurement weights in Pauli-based computation
• Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums
• Symmetry-Accelerated Classical Simulation of Clifford-Dominated Circuits