Presentation
Dead Gate Elimination
DescriptionHybrid algorithms combine the strengths of quantum and classical computing. However, quantum circuits are executed entirely, even when only subsets of measurement outcomes contribute to subsequent calculations. In this manuscript, we propose a novel circuit optimization technique that identifies and removes dead gates. We prove that removing dead gates has no influence on the probability distribution of the measurement outcomes that contribute to the subsequent calculation result. The evaluation of our optimization on instances of variational quantum eigensolver and quantum phase estimation, and random circuits, confirms its capability to remove a non-trivial number of dead gates in real-world algorithms.
Event Type
Networking
Work-in-Progress Poster
TimeMonday, June 236:00pm - 7:00pm PDT
LocationLevel 2 Lobby