Circuit optimization for IBM processors: A way to get higher fidelity and higher values of nonclassicality witnesses

Recently, various quantum computing and communication tasks have been implemented using IBM's superconductivity-based quantum computers which are available on the cloud. Here, we show that the circuits used in most of those works were not optimized and the use of the optimized circuits can considerably improve the possibility of observing unique features of quantum mechanics. Specifically, a systematic procedure is used here to obtain optimized circuits (circuits having reduced gate count and number of levels) for a large number of Clifford+T circuits which have already been implemented in the IBM quantum computers. Optimized circuits implementable in IBM quantum computers are also obtained for a set of reversible benchmark circuits. With a clear example, it is shown that the reduction in circuit costs enhances the fidelity of the output state (with respect to the theoretically expected state in the absence of noise) as lesser number of gates and levels introduce lesser amount of errors during evolution of the state. Further, considering Mermin inequality as an example, it's shown that the violation of classical limit is enhanced when we use an optimized circuit. Thus, the approach adopted here can be used to identify relatively weaker signature of quantumness and also to establish quantum supremacy in a stronger manner.

[1]  Gerhard W. Dueck,et al.  Optimization of Circuits for IBM's Five-Qubit Quantum Computers , 2018, 2018 21st Euromicro Conference on Digital System Design (DSD).

[2]  Diego Garc'ia-Mart'in,et al.  Five Experimental Tests on the 5-Qubit IBM Quantum Computer , 2017, 1712.05642.

[3]  Bikash K. Behera,et al.  Automated error correction in IBM quantum computer and explicit generalization , 2017, Quantum Inf. Process..

[4]  Anirban Pathak,et al.  Quantum Cryptography: Key Distribution and Beyond , 2017, 1802.05517.

[5]  J. Latorre,et al.  Experimental test of Mermin inequalities on a five-qubit quantum computer , 2016, 1605.04220.

[6]  Bikash K. Behera,et al.  Solving Linear Systems of Equations by Gaussian Elimination Method Using Grover's Search Algorithm: An IBM Quantum Experience , 2017, 1801.00778.

[7]  Robert Wille,et al.  Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares , 2008, 38th International Symposium on Multiple Valued Logic (ismvl 2008).

[8]  Anirban Pathak,et al.  Experimental realization of nondestructive discrimination of Bell states using a five-qubit quantum computer , 2017 .

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

[10]  Abhishek Shukla,et al.  Design and experimental realization of an optimal scheme for teleportation of an n-qubit quantum state , 2017, Quantum Information Processing.

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

[13]  Sebastian Deffner,et al.  Demonstration of entanglement assisted invariance on IBM's quantum experience , 2016, Heliyon.

[14]  Bikash K. Behera,et al.  Nondestructive discrimination of a new family of highly entangled states in IBM quantum computer , 2017, Quantum Inf. Process..

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

[16]  Bikash K. Behera,et al.  Demonstration of Optimal Fixed-Point Quantum Search Algorithm in IBM Quantum Computer , 2017, 1712.10231.

[17]  Anil Kumar,et al.  Experimental Demonstration of Non-Destructive Discrimination of Arbitrary Set of Orthogonal Quantum States Using 5-qubit IBM Quantum Computer on Cloud , 2018, 1803.06311.

[18]  Abhishek Shukla,et al.  Complete characterization of the single-qubit quantum gates used in the IBM quantum processors , 2018 .

[19]  Bikash K. Behera,et al.  Experimental demonstration of non-local controlled-unitary quantum gates using a five-qubit quantum computer , 2017, Quantum Inf. Process..

[20]  Bikash K. Behera,et al.  Demonstration of entanglement purification and swapping protocol to design quantum repeater in IBM quantum computer , 2017, Quantum Information Processing.

[21]  Bikash K. Behera,et al.  Experimental realization of quantum cheque using a five-qubit quantum computer , 2017, Quantum Information Processing.

[22]  Marek Zukowski,et al.  Experimental violation of local realism by four-photon Greenberger-Horne-Zeilinger entanglement. , 2003, Physical review letters.

[23]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[24]  Z. Gedik,et al.  Optimization and experimental realization of the quantum permutation algorithm , 2017, 1708.07900.

[25]  Stefan Frehse,et al.  RevKit: A Toolkit for Reversible Circuit Design , 2012, J. Multiple Valued Log. Soft Comput..

[26]  W Dür,et al.  Experimental violation of multipartite Bell inequalities with trapped ions. , 2013, Physical review letters.