Optimal realizations of simplified Toffoli gates

Authors:
Guang Song;Andreas Klappenecker
Affiliations:
L.H. Baker Center for Bioinformatics and Biological Statistics, Iowa State University, Ames, IA;Department of Computer Science, Texas A&M University, College Station, TX
Venue:
Quantum Information & Computation
Year:
2004

Citing 2
Cited 2

Universal cellular automata based on the collisions of soft spheres

Collision-based computing
Optimal realizations of controlled unitary gates

Quantum Information & Computation

Checking equivalence of quantum circuits and states

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
On the CNOT-cost of TOFFOLI gates

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simplified Toffoli gate coincides with the Toffoli gate except that the result is allowed to differ on one computational basis state by a phase factor. We prove that the simplified Toffoli gate implementation by Margolus is optimal, in the sense that it attains a lower bound of three controlled-not gates, and subject to that, a sharp lower bound of four single-qubit gates. We also discuss optimal implementations of other simplified Toffoli gates, and explain why the phase factor -1 invariably occurs in such implementations.