Compact Toffoli gate using weighted graph states
arXiv:0809.1513 · doi:10.1103/PhysRevA.79.020302
Abstract
We introduce three compact graph states that can be used to perform a measurement-based Toffoli gate. Given a weighted graph of six, seven or eight qubits, we show that success probabilities of 1/4, 1/2 and 1 respectively can be achieved. Our study puts a measurement-based version of this important quantum logic gate within the reach of current experiments. As the graphs are setup-independent, they could be realized in a variety of systems, including linear optics and ion-traps.
4 pages, 3 figures, RevTeX4; Accepted version
References in corpus (8)
- Resource-efficient linear optical quantum computation
- Experimental entanglement of six photons in graph states
- High-speed linear optics quantum computing using active feed-forward
- Efficient Toffoli Gates Using Qudits
- Experimental Analysis of a 4-Qubit Cluster State
- Realization and characterization of a 2-photon 4-qubit linear cluster state
- Fundamentals of universality in one-way quantum computation
- Experimental realization of a quantum game on a one-way quantum computer