Implementing a Toffoli gate in an n-qubit linear nearest neighbor array
MetadataShow full item record
Daraeizadeh, Saman. 2014. Implementing a Toffoli Gate in an N-Qubit Linear Nearest Neighbor Array. -- In Proceedings: 10th Annual Symposium on Graduate Research and Scholarly Projects. Wichita, Ks: Wichita State University, p. 75
Most proposals for quantum computers are based on linear nearest neighbor (LNN) arrangements where qubits only interact with neighbors. A Toffoli gate is a three-qubit operation, which is used in many quantum applications such as error correction, and algorithms like Shor's factorization. Typically, to implement a Toffoli gate in an LNN architecture, additional operations called swap gates are required to bring the qubits adjacent to each other. We propose a new method to implement a Toffoli gate in LNN arrays without using swap gates. As such, compared to other circuits, the quantum cost of our circuit is much lower.
Presented to the 10th Annual Symposium on Graduate Research and Scholarly Projects (GRASP) held at the Heskett Center, Wichita State University, April 25, 2014.
Research completed at Department of Electrical Engineering and Computer Science, College of Engineering