scispace - formally typeset
Open AccessPosted Content

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

TLDR
A systematic procedure is used 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.
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.

read more

Citations
More filters
Journal Article

Demonstration of entanglement assisted invariance on IBM's Quantum Experience

TL;DR: In this article, the authors report several experiments performed on IBM's Quantum Experience demonstrating envariance, a recently discovered symmetry of composite quantum systems, which is at the foundational origin of physics and a quantum phenomenon of pure states.
Posted Content

Quantum-Computation and Applications

TL;DR: This research notebook on quantum computation and applications for quantum engineers, researchers, and scientists discusses and summarized the core principles and practical application areas of quantum computation, and describes a substantial difference between quantum and classical computation paradigm.
Posted Content

Design and Analysis of Communication Protocols using Quantum Resources

TL;DR: A specific attention of the present thesis is to study the quantum teleportation schemes with entangled orthogonal and nonorthogonal states and their experimental realization, but not limited to it.
Journal ArticleDOI

A new scheme of quantum teleportation using highly entangled brown et al. state: an IBM quantum experience

TL;DR: Three- qubit and four-qubit quantum teleportation is achieved using a highly entangled Brown et al. state and this concept is extended to generalize N-qubits teleportation which comprises of two cases, N being odd and even.
Proceedings ArticleDOI

Towards exploring the potential of alternative quantum computing architectures

TL;DR: This work introduces several schemes for the generation of alternative coupling graphs that still might be able to satisfy physical constraints but, at the same time, allow for a more efficient realization of the desired quantum functionality.
References
More filters
Journal ArticleDOI

Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels

TL;DR: An unknown quantum state \ensuremath{\Vert}\ensure Math{\varphi}〉 can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical Einstein-Podolsky-Rosen (EPR) correlations.
Journal ArticleDOI

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for these two problems, which takes a number of steps polynomial in the input size of the integer to be factored.
Journal ArticleDOI

Quantum Mechanics Helps in Searching for a Needle in a Haystack

TL;DR: In this article, a phone directory containing $N$ names arranged in completely random order is presented, and the desired phone number can be obtained in only O(sqrt{N})$ accesses to the database.
Journal ArticleDOI

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Peter W. Shor
- 01 Jun 1999 - 
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.
Journal ArticleDOI

Experimental violation of local realism by four-photon Greenberger-Horne-Zeilinger entanglement.

TL;DR: The experiment reports the first experimental violation of local realism by four-photon Greenberger-Horne-Zeilinger (GHZ) entanglement, and demonstrates a strong violation of Mermin-Ardehali-Belinskii-Klyshko inequality.
Related Papers (5)