Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 30 Dec 2018 in quant-ph | (1812.11602v1)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.