Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity

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 i...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal of theoretical physics Ročník 56; číslo 7; s. 2350 - 2361
Hlavní autori: He, Yong, Luo, Ming-Xing, Zhang, E., Wang, Hong-Ke, Wang, Xiao-Feng
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.07.2017
Springer Nature B.V
Predmet:
Circuits
Complexity
Computation
Decomposition
Elementary Particles
Gates
Gates (circuits)
Mathematical and Computational Physics
Phase shift
Physics
Physics and Astronomy
Quantum Field Theory
Quantum Physics
Qubits (quantum computing)
Theoretical
circuit complexity
Toffoli gate
Quantum circuit
Clifford gates
ISSN:0020-7748, 1572-9575
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7748
1572-9575
DOI:10.1007/s10773-017-3389-4