Optimal implementation of quantum gates with two controls. (English) Zbl 07850920
Summary: We give a detailed proof of a well-known theorem in quantum computing. The theorem characterizes the number of two-qubit gates that is necessary for implementing three-qubit quantum gates with two controls. For example, the theorem implies that five 2-qubit gates are necessary for implementing the Toffoli gate. No detailed proof was available earlier.
References:
| [1] | Nielsen, Michael A.; Chuang, Isaac L., Quantum Computation and Quantum Information, 2000, Cambridge University Press · Zbl 1049.81015 |
| [2] | Sleator, Tycho; Weinfurter, Harald, Realizable universal quantum logic gates, Phys. Rev. Lett., 74, 1995 · Zbl 1020.81552 |
| [3] | Yu, Nengkun; Duan, Runyao; Ying, Mingsheng, Five two-qubit gates are necessary for implementing Toffoli gate, Phys. Rev. A, 2013 |
| [4] | Yu, Nengkun; Ying, Mingsheng, Optimal simulation of Deutsch gates and the Fredkin gate, Phys. Rev. A, 2015 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
