Asset Details
Do you wish to reserve the book?
Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity
Do you wish to request the book?
Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity
2017
Overview
Toffoli gates are natural elements for the circuit model based quantum computation. We investigate general resource requirements for arbitrary n-qubit Toffoli gate. These resources consist of the nontrivial Clifford gate (CNOT), non-Clifford gate (T gate), ancillary qubits, and circuit depth. To implement n-qubit Toffoli gates, we consider two cases: only one auxiliary qubit and unlimited auxiliary qubits. The key of the first case is to decompose an n-qubit Toffoli gate into the reduced Toffoli gate modulo phase shift using the Clifford gates and one ancillary qubit. With this construction, it only requires O(n) number of general resources for an n-qubit Toffoli gate. For the second case, an approximate Toffoli gate is constructed to obtain efficient decomposition of a Toffoli gate. The new decomposition can further reduce general resources except auxiliary qubits.
Publisher
Springer Nature B.V
