Dead Gate Elimination

Abstract

Hybrid quantum algorithms combine the strengths of quantum and classical computing. Many quantum algorithms, such as the variational quantum eigensolver (VQE), leverage this synergy. However, quantum circuits are executed in full, even when only subsets of measurement outcomes contribute to subsequent classical computations. In this manuscript, we propose a novel circuit optimization technique that identifies and removes dead gates. We prove that the removal of dead gates has no influence on the probability distribution of the measurement outcomes that contribute to the subsequent calculation result. We implemented and evaluated our optimization on a VQE instance, a quantum phase estimation (QPE) instance, and hybrid programs embedded with random circuits of varying circuit width, confirming its capability to remove a non-trivial number of dead gates in real-world algorithms. The effect of our optimization scales up as more measurement outcomes are identified as non-contributory, resulting in a proportionally greater reduction of dead gates.

Accepted by 25th International Conference on Computational Science, 2025

References in corpus (8)

• A variational eigenvalue solver on a quantum processor
• The theory of variational hybrid quantum-classical algorithms
• Analyzing Quantum Programs with LintQ: A Static Analysis Framework for Qiskit
• Quantum Generative Adversarial Networks For Anomaly Detection In High Energy Physics
• Partial Equivalence Checking of Quantum Circuits
• A Hybrid Quantum-Classical Approach to the Electric Mobility Problem
• QuTracer: Mitigating Quantum Gate and Measurement Errors by Tracing Subsets of Qubits
• Quantum Algorithms for tensor-SVD