Quantum Circuit Unoptimization

Abstract

Optimization of circuits is an essential task for both quantum and classical computers to improve their efficiency. In contrast, classical logic optimization is known to be difficult, and a lot of heuristic approaches have been developed so far. In this study, we define and construct a quantum algorithmic primitive called quantum circuit unoptimization, which makes a given quantum circuit complex by introducing some redundancies while preserving circuit equivalence, i.e., the inverse operation of circuit optimization. Using quantum circuit unoptimization, we propose the quantum circuit equivalence test, a decision problem contained both in the NP and BQP classes but is not trivially included in the P class. Furthermore, as a practical application, we construct concrete unoptimization recipes to generate compiler benchmarks and evaluate circuit optimization performance using Qiskit and Pytket. Our numerical simulations demonstrate that quantum circuit unoptimizer systematically generates redundant circuits that are challenging for compilers to optimize, which can be used to compare the performance of different compilers and improve them. We also offer potential applications of quantum circuit unoptimization, such as generating quantum advantageous machine learning datasets and quantum computer fidelity benchmarks.

10 pages, 5 figures

References in corpus (16)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Machine Learning
• Characterizing Quantum Supremacy in Near-Term Devices
• Synthesis of Quantum Logic Circuits
• Quantum optimization using variational algorithms on near-term quantum devices
• Quantum Error Mitigation
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Minimal Universal Two-qubit Quantum Circuits
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• A universal quantum circuit for two-qubit transformations with three CNOT gates
• PyZX: Large Scale Automated Diagrammatic Reasoning
• staq -- A full-stack quantum processing toolkit
• Estimating distinguishability measures on quantum computers
• Classical verification of quantum circuits containing few basis changes

Cited by in corpus (1)

• Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation