Clifford+T-based Fault-Tolerant Quantum Implementation of Code Converter Circuit

Design of high-scalable quantum information processor (QIP) towards achieving quantum supremacy is still now in infancy due to catastrophic obstacles from decoherence. In way to address this problem, the use of quantum error correction code (QECC) and fault-tolerant circuit is highly enticieable, which further promises not only to protect extreme fragile quantum state from decoherence but also from other noises. It is seen that the fault-tolerant property can be achieved by the use of transversal primitive unitary operators. Here, we show the design of fault-tolerant implementation of BCD-to-Excess-3 and 2’s complement code converter which is pivotal in the design of high-scalable QIP. In this transformation process, first we transform the input circuit to an intermediate form where we obtain its NCV-based representation. In the second phase, this design is extensively used to form the fault-tolerant design. We also have compared our design with some of the existing works and have registered 39% improvement in design cost. In terms of T-count and T-depth metrics, our proposed designs also provide near-optimal solution.

[1]  Rodney Van Meter,et al.  Faster quantum chemistry simulation on fault-tolerant quantum computers , 2012, 1204.0567.

[2]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[3]  M. Mariantoni,et al.  Surface codes: Towards practical large-scale quantum computation , 2012, 1208.0928.

[4]  Arindam Biswas,et al.  Design of Quantum Cost, Garbage Output and Delay Optimized BCD to Excess-3 and 2's Complement Code Converter , 2018, J. Circuits Syst. Comput..

[5]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[6]  D. DiVincenzo,et al.  The Physical Implementation of Quantum Computation , 2000, quant-ph/0002077.

[7]  Arindam Biswas,et al.  Design of BCD to Excess-3 code converter circuit with optimized quantum cost, garbage output and constant input using reversible gate , 2018 .

[8]  Lov K. Grover Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[9]  Adam Paetznick,et al.  Universal fault-tolerant quantum computation with only transversal gates and error correction. , 2013, Physical review letters.

[10]  Hafizur Rahaman,et al.  A template-based technique for efficient Clifford+T-based quantum circuit implementation , 2018, Microelectron. J..

[11]  R. Feynman Quantum mechanical computers , 1986 .

[12]  A. Fowler,et al.  High-threshold universal quantum computation on the surface code , 2008, 0803.0272.

[13]  Alán Aspuru-Guzik,et al.  Faster quantum chemistry simulation on fault-tolerant quantum computers , 2012 .

[14]  W. Wootters,et al.  A single quantum cannot be cloned , 1982, Nature.

[15]  M. Saravanan,et al.  Energy efficient code converters using reversible logic gates , 2013, 2013 International Conference on Green High Performance Computing (ICGHPC).

[16]  Majid Haghparast,et al.  On the Synthesis of Different Nanometric Reversible Converters , 2011 .

[17]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[18]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[19]  J. Preskill Fault-tolerant quantum computation , 1997, quant-ph/9712048.

[20]  N. Ranganathan,et al.  Design of Testable Reversible Sequential Circuits , 2013, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.