2000 character limit reached
Symbolic Verification of Quantum Circuits (2010.03032v1)
Published 5 Oct 2020 in quant-ph, cs.AR, and cs.ET
Abstract: This short note proposes a symbolic approach for representing and reasoning about quantum circuits using complex, vector or matrix-valued Boolean expressions. A major benefit of this approach is that it allows us to directly borrow the existing techniques and tools for verification of classical logic circuits in reasoning about quantum circuits.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
