Quantum Depth Compression via Local Dynamic Circuits
ORAL
Abstract
We report a general compilation framework that utilizes dynamic circuits to reduce arbitrary
quantum circuits to depth linear in the number of non-Clifford gates. The framework also maps
circuits with arbitrary connectivity to grid connectivity without the need for expensive SWAP-
networks. The framework consists of pushing Clifford gates to the end of the circuit, resulting in a
sub-circuit of non-Clifford Pauli-phasors and an all-Clifford sub-circuit, both of which are reduced
to constant depth and mapped to grid connectivity. We apply our compiler to random Pauli-phasor VQAs (variational quantum ansatzes), showing how the depth and CNOT count of the compiled VQAs decrease with increasing Cliffordness. Finally, we present noisy simulations showing that compiling the VQAs via
our framework increases their fidelity.
quantum circuits to depth linear in the number of non-Clifford gates. The framework also maps
circuits with arbitrary connectivity to grid connectivity without the need for expensive SWAP-
networks. The framework consists of pushing Clifford gates to the end of the circuit, resulting in a
sub-circuit of non-Clifford Pauli-phasors and an all-Clifford sub-circuit, both of which are reduced
to constant depth and mapped to grid connectivity. We apply our compiler to random Pauli-phasor VQAs (variational quantum ansatzes), showing how the depth and CNOT count of the compiled VQAs decrease with increasing Cliffordness. Finally, we present noisy simulations showing that compiling the VQAs via
our framework increases their fidelity.
*This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, under Award Numbers DE-SC0021526.
–
Presenters
-
Benjamin Prescott Hall
- Infleqtion