An optimized quantum circuit for converting from sign–magnitude to two’s complement

Nowadays, one of the critical issues to implement quantum algorithms is the required number of elementary gates, qubits and delay. Current quantum computers and simulators are mainly prototypes, and there is a lack of computational resources. Therefore, it is necessary to optimize the quantum operations to reduce the necessary number of gates and qubits. This work presents a novel reversible circuit which is able to convert signed binary numbers to two’s complement of N digits in a quantum environment. The depth of the circuit is O(log N). It is based on the fastest out-of-place carry look-ahead addition quantum circuit currently available. This addition circuit has been adapted to make the conversion using the minimum number of gates and qubits, being faster than other adder circuits. A robust metric has been used to measure the quantum cost, delay, ancilla inputs and garbage outputs of the proposed converter. Moreover, it has been compared with others described in the literature.

[1]  Marco Barbieri,et al.  Simplifying quantum logic using higher-dimensional Hilbert spaces , 2009 .

[2]  Himanshu Thapliyal,et al.  Mapping of Subtractor and Adder-Subtractor Circuits on Reversible Quantum Gates , 2016, Trans. Comput. Sci..

[3]  Jan Soubusta,et al.  Experimental implementation of optimal linear-optical controlled-unitary gates. , 2014, Physical review letters.

[5]  Guowu Yang,et al.  Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  H. V. Jayashree,et al.  Progress in Reversible Processor Design: A Novel Methodology for Reversible Carry Look-Ahead Adder , 2013, Trans. Comput. Sci..

[7]  Feng Wang,et al.  Improved quantum ripple-carry addition circuit , 2016, Science China Information Sciences.

[8]  Aakash Gupta,et al.  An Improved Structure Of Reversible Adder And Subtractor , 2013, ArXiv.

[9]  Israel Koren.  Computer arithmetic algorithms , 1993 .

[10]  Colin P. Williams.  Explorations in Quantum Computing, Second Edition , 2011, Texts in Computer Science.

[11]  Yasuhiro Takahashi,et al.  A linear-size quantum circuit for addition with no ancillary qubits , 2005, Quantum Inf. Comput..

[12]  Reza Sabbaghi-Nadooshan,et al.  Novel 8-bit reversible full adder/subtractor using a QCA reversible gate , 2017 .

[13]  Bruce A. Wooley,et al.  A Two's Complement Parallel Array Multiplication Algorithm , 1973, IEEE Transactions on Computers.

[14]  Atal Chaudhuri,et al.  A novel reversible two's complement gate (TCG) and its quantum mapping , 2017, 2017 Devices for Integrated Circuit (DevIC).

[15]  Ken Choi,et al.  A carry look-ahead adder designed by reversible logic , 2014, 2014 International SoC Design Conference (ISOCC).

[16]  Faranak Rabiei,et al.  DESIGN OF NOVEL EFFICIENT FULL ADDER ARCHITECTURE FOR QUANTUM-DOT CELLULAR AUTOMATA TECHNOLOGY , 2018 .

[17]  Maryam Rahmati,et al.  Novel designs of a carry/borrow look-ahead adder/subtractor using reversible gates , 2017 .

[18]  K. V. Ramanathan,et al.  Quantum-information processing by nuclear magnetic resonance: Experimental implementation of half-adder and subtractor operations using an oriented spin-7/2 system , 2002 .

[19]  Muhammad Mahbubur Rahman,et al.  Fault tolerant reversible logic synthesis: Carry look-ahead and carry-skip adders , 2009, 2009 International Conference on Advances in Computational Tools for Engineering Applications.

[20]  Huey Ling.  High Speed Binary Adder , 1981, IBM J. Res. Dev..

[21]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[22]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

[23]  Ahmed Younes,et al.  New Design of Reversible Full Adder/Subtractor Using R Gate , 2017, International Journal of Theoretical Physics.

[24]  Sadiq M. Sait,et al.  Design of Fault Tolerant Adders: A Review , 2018 .

[25]  Behjat Forouzandeh,et al.  Quantum Division Circuit Based on Restoring Division Algorithm , 2011, 2011 Eighth International Conference on Information Technology: New Generations.

[26]  Chitrita Chaudhuri,et al.  A reversible approach to two’s complement addition using a novel reversible TCG gate and its 4 dot 2 electron QCA architecture , 2018, Microsystem Technologies.

[27]  Thomas G. Draper,et al.  A new quantum ripple-carry addition circuit , 2004, quant-ph/0410184.

[28]  Keivan Navi,et al.  Design of a Novel Reversible Multiplier Circuit Using HNG Gate in Nanotechnology , 2008 .

[29]  Thomas G. Draper,et al.  A logarithmic-depth quantum carry-lookahead adder , 2006, Quantum Inf. Comput..

[30]  Hafiz Md. Hasan Babu,et al.  Design of a Compact Reversible Carry Look-Ahead Adder Using Dynamic Programming , 2015, 2015 28th International Conference on VLSI Design.

[31]  Majid Mohammadi,et al.  On figures of merit in reversible and quantum logic designs , 2009, Quantum Inf. Process..

[32]  James Harland,et al.  What Factors Impact Student-Content Interaction in Fully Online Courses , 2015 .

[33]  Yasuhiro Takahashi,et al.  Quantum addition circuits and unbounded fan-out , 2009, Quantum Inf. Comput..

[34]  L. Lamata,et al.  Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience , 2016, 1611.07851.

[35]  Mohammad Reza Reshadinezhad,et al.  A Novel 4×4 Universal Reversible Gate as a Cost Efficient Full Adder/Subtractor in Terms of Reversible and Quantum Metrics , 2015 .

[36]  Earl E. Swartzlander,et al.  Adder and Multiplier Design in Quantum-Dot Cellular Automata , 2009, IEEE Transactions on Computers.

[37]  Yasuhiro Takahashi,et al.  A fast quantum circuit for addition with few qubits , 2008, Quantum Inf. Comput..