Title: Implementation of neareast neighbor quantum circuit with low quantum cost
Abstract: Primary purpose behind this work is to develop a type of quantum gate C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> (iZ)/C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> (-iZ) derived from unitary quantum gate C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> (-I) by finding its 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">nd</sup> root. This newly introduced gate is nearest-neighbor compliant with a unit quantum cost. The main objective in deriving this quantum gate C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> (iZ)/C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> (-iZ) is to generate low cost MCT gates which eventually produces cost optimized NNC free reversible circuits. For systematic mapping and a fair comparison with prior works, we formed a quantum gate library that includes CNOT, NOT, H, CH, C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> (-I) and C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> (iZ)/C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> (-iZ) gates. A mapping algorithm including the complete gate library is proposed alongwith necessary mathematical proofs. Using the gate library, we show significant cost savings is achievable over the state-of-the-art approaches, when mapping n-control Toffoli gates and chosen benchmark functions.
Publication Year: 2018
Publication Date: 2018-03-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot