pith. sign in

arxiv: quant-ph/0403053 · v1 · pith:VEPTIT5Hnew · submitted 2004-03-05 · 🪐 quant-ph

Improved Quantum Cost for n-bit Toffoli Gates

classification 🪐 quant-ph
keywords gatesquantumtoffolicircuitcostgaten-bitbarenco
0
0 comments X
read the original abstract

We present an n-bit Toffoli gate quantum circuit based on the realization proposed by Barenco, where some of the Toffoli gates in their construction are replaced with Peres gates. This results in a significant cost reduction. Our main contribution is a quantum circuit which simulates the (m+1)-bit Toffoli gate with 32m-96 elementary quantum gates and one garbage bit which is passed unchanged. This paper is a corrected and expanded version of our recent journal publication.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.