142 citations · 345 across the 15 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
quant-ph2009★ 6 cited
Fast Equivalence-checking for Quantum Circuits
Shigeru Yamashita, Igor L. Markov
We perform formal verification of quantum circuits by integrating several techniques specialized to particular classes of circuits. Our verification methodology is based on the new…
quant-ph2009★ 3 cited
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi +4
This paper considers the query complexity of the functions in the family F_{N,M} of N-variable Boolean functions with onset size M, i.e., the number of inputs for which the functio…