2025/05/23 by Peleg Emanuel, Emanuel, Peleg, Eyal Cornfeld +6
Computer Science · #FOS: Physical sciences #Quantum Information and Cryptography #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2505.18256
openalex publication_date 2025/05/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Control of quantum operations is a crucial yet expensive construct for quantum computation. Efficient implementations of controlled operations often avoid applying control to certain subcircuits, which can significantly reduce the number of gates and overall circuit depth. However, these methods are specialized and circuits frequently need to be implemented manually. This paper presents a generic method for finding "skippable" patterns without having to tailor implementations for each algorithm. We prove that finding the optimal operations to be skipped is generally NP-hard. Nevertheless, sub-optimal, polynomial approximation algorithms that find skippable subcircuits can lead to over 50% improvement in circuit metrics for real-world applications.