The development of universal quantum computers has achieved remarkable success in recent years, culminating with the quantum supremacy reported by Google. Now is possible to implement short-depth quantum circuits with dozens of qubits and to obtain results with significant fidelity. Quantum walks are good candidates to be implemented on the available quantum computers. In this work, we implement discrete-time quantum walks with one and two interacting walkers on cycles, two-dimensional lattices, and complete graphs on IBM quantum computers. We are able to obtain meaningful results using the cycle, the two-dimensional lattice, and the complete graph with 16 nodes each, which require 4-qubit quantum circuits up to depth 100.
We discuss an efficient physical realization of topological quantum walks on a finite lattice. The $N$-point lattice is realized with $\log_2 N$ qubits, and the quantum circuit utilizes a number of quantum gates which is polynomial in the number of qubits. In a certain scaling limit, we show that a large number of steps is implemented with a number of quantum gates which is independent of the number of steps. We ran the quantum algorithm on the IBM-Q five-qubit quantum computer, thus experimentally demonstrating topological features, such as boundary bound states, on a lattice with $N=4$ point…
The announcement of a quantum computer that can be accessed remotely by anyone from its laptop is a big event for the quantum computation scientist. In this work we present the International Business Machines (IBM) quantum computer and its platform IBM Quantum Experience (IBM-QE) as a didactic proposal in quantum computation and information. In addition we also consider this paper as scientific divulgation of the IMB advertisement. In this paper we show the main tool (quantum gates) present in the IBM-QE and, through a simple strategy, we discuss about a possible decoherence source in the IBM …
The 5-qubit quantum computer prototypes that IBM has given open access to on the cloud allow the implementation of real experiments on a quantum processor. We present the results obtained in five experimental tests performed on these computers: dense coding, quantum Fourier transforms, Bell's inequality, Mermin's inequalities (up to $n=5$) and the construction of the prime state $|p_3\rangle$. These results serve to assess the functioning of the IBM 5Q chips.
In quantum information theory, entropic inequalities act as the necessary and sufficient conditions to noncontextuality. Here, we first experimentally demonstrate the violation of the entropic noncontextual inequality in a four-level quantum system, by using the five-qubit IBM quantum computer. The experimental result disproves the existence of a local realist model.
We design a quantum circuit in IBM quantum computer that mimics the dynamics of single photon in a coupled cavity system. By suitably choosing the gate parameters in the quantum circuit, we could transfer an unknown qubit state between the qubits. The condition for perfect state transfer is obtained by solving the unitary time dynamics governed by the Hamiltonian of the coupled cavity system. We then demonstrate the dynamics of entanglement between the two-qubits and show violation of Bell's inequality in IBM quantum computer.
A quantum algorithm for the calculation of $π$ is proposed and implemented on the five-qubit IBM quantum computer with superconducting qubits. We find $π=3.157\pm0.017$. The error is due to the noise of quantum one-qubit operations and measurements. The results can be used for estimating the errors of the quantum computer and suggest that the errors are purely random.
We consider graph states generated by operator of evolution with Ising Hamiltonian. The geometric measure of entanglement of a spin with other spins in the graph state is obtained analytically and quantified on IBM's quantum computer, IBM Q Valencia. The results of quantum calculations are in good agreement with the theoretical ones. We conclude that the geometric measure of entanglement of a spin with other spins in the graph state is related with degree of vertex representing the spin in the corresponding graph.
A protocol for non-destructive descrimination of arbitrary set of orthogonal quantum states was proposed by V. S. Manu et al., using an algorithm based on quantum phase estimation. IBM Corporation has released a superconductivity based 5-qubit (5-qubit transmon bowtie chip 3 and IBM 5-qubit real processor) quantum computer named Quantum Experience and placed it on cloud. In this paper we take advantage of the online availability of those real quantum processors(ibmqx2 amd ibmqx4) and carry out the above protocol that has experimentally demonstrated earlier using NMR quantum processor. Here, we…
Entanglement is an important evidence that a quantum device can potentially solve problems intractable for classical computers. In this paper, we prepare connected graph states involving 8 to 16 qubits on ibmqx5, a 16-qubit superconducting quantum processor accessible via IBM cloud,using low-depth circuits. We demonstrate that the prepared state is fully entangled, i.e. the state is inseparable with respect to any fixed partition.
We report the experimental nondemolition measurement of coherence, predictability and concurrence on a system of two qubits. The quantum circuits proposed by De Melo et al. are implemented on IBM Q (superconducting circuit) and IonQ (trapped ion) quantum computers. Three criteria are used to compare the performance of the different machines on this task: measurement accuracy, nondemolition of the observable, and quantum state preparation. We find that the IonQ quantum computer provides constant state fidelity through the nondemolition process, outperforming IBM Q systems on which the fidelity …
Experimental realization of automated error correction is demonstrated through IBM Quantum Experience for Bell and GHZ states using a measurement based approach upon ancilla qubits. The measurement automatically activates error correcting unitary operations to restore the system to its original entangled state. We illustrate the algorithm for the maximally entangled qudit case by applying appropriate Hadamard and Controlled-NOT gates.
We experimentally verify the link existing between entanglement and the amount of wave-particle duality in a bipartite quantum system, with superconducting qubits in the IBM Q quantum computer. We consider both pure and mixed states, and study the influence of state purity on the observation of the complementarity "triality" relation of Jakob and Bergou. This work confirms the quantitative completion of local Bohr's complementarity principle by the nonlocal quantum entanglement typical of a truly bipartite quantum system.
The ability of pulse-shaping devices to generate accurately quantum optimal control is a strong limitation to the development of quantum technologies. We propose and demonstrate a systematic procedure to design robust digital control processes adapted to such experimental constraints. We show to what extent this digital pulse can be obtained from its continuous-time counterpart. A remarkable efficiency can be achieved even for a limited number of pulse parameters. We experimentally implement the protocols on IBM quantum computers for a single qubit, obtaining an optimal robust transfer in a ti…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. Quantum search algorithm can be described as the rotation of state vectors in a Hilbert space. The state vectors uniformly rotate by iterative sequences until they hit the target position. To optimize the algorithm, it is necessary to have the precise knowledge about some parameters like the number of target positions and total number of states. Here, we demonstrate the implementation of optimal fixed-point quantum search algorithm in…
Quantum pigeonhole principle states that if there are three pigeons and two boxes then there are instances where no two pigeons are in the same box which seems to defy classical pigeonhole counting principle. Here, we investigate the quantum pigeonhole effect on the ibmqx2 superconducting chip with five physical qubits. We also observe the same effect in a proposed non-local circuit which avoid any direct physical interactions between the qubits which may lead to some unknown local effects. We use the standard quantum gate operations and measurement to construct the required quantum circuits o…
A scheme for secure multiparty quantum summation was proposed by Run-hau Shi et al.,(SCIENTIFIC REPORTS, 6:19655, DOI:10.1038/srep19655). IBM Corporation has released a superconductivity based 5-qubit quantum computer named "Quantum Experience" and placed it on "cloud". In this paper we take advantage of the online availability of this real quantum processor(ibmqx2) and carry out the above protocol that has never been experimentally demonstrated earlier. Here, we set up experiments for secure quantum summation of one-qubit secret states . Besides, we propose a protocol for square and cubic sum…
Topological data analysis is a rapidly developing area of data science where one tries to discover topological patterns in data sets to generate insight and knowledge discovery. In this project we use quantum walk algorithms to discover features of a data graph on which the walk takes place. This can be done faster on quantum computers where all paths can be explored using superposition. We begin with simple walks on a polygon and move up to graphs described by higher dimensional meshes. We use insight from the physics description of quantum walks defined in terms of probability amplitudes to …
We use quantum detector tomography to characterize the qubit readout in terms of measurement POVMs on IBM Quantum Computers IBM Q 5 Tenerife and IBM Q 5 Yorktown. Our results suggest that the characterized detector model deviates from the ideal projectors by a few percent. Further improvement on this characterization can be made by adopting two- or more-qubit detector models instead of independent single-qubit detectors for all the qubits in one device. An unexpected behavior was seen in the physical qubit labelled as qubit 3 of IBM Q 5 Tenerife, which can be a consequence of detector crosstal…
Quantum computers are the promising candidates for simulation of large quantum systems, which is a daunting task to perform in a classical computer. Here, we report the experimental realization of quantum tunneling of a single particle through different types of potential barriers by performing digital quantum simulations using IBM quantum computers. We consider two and three-qubit systems to visualize the tunneling process and illustrate its unique quantum nature. We observe the tunneling and oscillations of the particles in a step-well, double-well, and multi-well potentials through our expe…
Quantum error correcting codes (QECC) are the key ingredients both for fault-tolerant quantum computation and quantum communication. Teleportation-based error correction (TEC) helps in detecting and correcting operational and erasure errors by performing X and Z measurements during teleportation. Here we demonstrate the TEC protocol for the detection and correction of a single bit-flip error by proposing a new quantum circuit. A single phase-flip error can also be detected and corrected using the above protocol. For the first time, we illustrate detection and correction of erasure error in the…
We report the digital quantum simulation of a hamiltonian involved in the generation of quantum entanglement by gravitational means. In particular, we focus on a pair of quantum harmonic oscillators, whose interaction via a quantum gravitational field generates single-mode squeezing in both modes at the same time, a non-standard process in quantum optics. We perform a boson-qubit mapping and a digital gate decomposition specific for IBM quantum devices. We use error mitigation and post-selection to achieve high-fidelity, accessing a parameter regime out of direct experimental reach.
The present tutorial aims to provide a comprehensible and easily accessible introduction into the theory and implementation of the famous Quantum Approximate Optimization Algorithm (QAOA). We lay our focus on practical aspects and step-by-step guide through the realization of a proof of concept quantum application based on a real-world use case. In every step we first explain the underlying theory and subsequently provide the implementation using IBM's Qiskit. In this way we provide a thorough understanding of the mathematical modelling and the (quantum) algorithms as well as the equally impor…
Two qubit density matrices, which are of X-shape, are a natural generalization of Bell Diagonal States (BDSs) recently simulated on the IBM quantum device. We generalize the previous results and propose a quantum circuit for simulation of a general two qubit X-state, implement it on the same quantum device, and study its entanglement for several values of the extended parameter space. We also show that their X-shape is approximately robust against noisy quantum gates. To further physically motivate this study, we invoke the two-spin Heisenberg XYZ system and show that for a wide class of initi…
In May 2016 IBM released access to its 5-qubit quantum computer to the scientific community, its "IBM Quantum Experience" since acquiring over 25,000 users from students, educators and researchers around the globe. In the short time since the "IBM Quantum Experience" became available, a flurry of research results on 5-qubit systems have been published derived from the platform hardware. Quintuple is an open-source object-oriented Python module implementing the simulation of the "IBM Quantum Experience" hardware. Quintuple quantum algorithms can be programmed and run via a custom language fully…
We perform comprehensive experimental tests of various composite pulse sequences using one of open-access IBM's quantum processors, based on superconducting transmon qubits. We implement explicit pulse control of the qubit by making use of the opportunity of low-level access to the backend, provided by IBM Quantum. We obtain the excitation profiles for a huge variety of broadband, narrowband, and passband composite pulses, producing any pre-chosen target probabilities, ranging from zero to one. We also test universal composite pulses which compensate errors in any experimental parameter. In al…
Though algorithms for quantum simulation of Quantum Harmonic Oscillator (QHO) have been proposed, still they have not yet been experimentally verified. Here, for the first time, we demonstrate a quantum simulation of QHO in the presence of both time-varying and constant force field for both one and two dimensional case. New quantum circuits are developed to simulate both the one and two-dimensional QHO and are implemented on the real quantum chip "ibmqx4". Experimental data, clearly illustrating the dynamics of QHO in the presence of time-dependent force field, are presented in graphs for diff…
We present results on the digital quantum simulations of beam-splitter and squeezing interactions. The bosonic hamiltonians are mapped to qubits and then digitalized in order to implement them in the IBM quantum devices. We use error mitigation and post-selection to achieve high-fidelity digital quantum simulations of single-mode and two-mode interactions, as evidenced -- where possible -- by full tomography of the resulting states. We achieve fidelities above 90 \% in the case of single-mode squeezing with low squeezing values and ranging from 60 \% to 90 \% for large squeezing and in the mor…
Quantum secret sharing is a way to share secret messages among the clients in a group with complete security. For the first time, Hillery et al. (Phys Rev A 59:1829, 1999) proposed the quantum version of the classical secret sharing protocol using GHZ states. Here, we implement the above quantum secret sharing protocol in 'IBM Q 5 Tenerife' quantum processor and compare the experimentally obtained results with the theoretically predicted ones. Further, a new quantum binary voting protocol is proposed and implemented in the 14-qubit 'IBM Q 14 Melbourne' quantum processor. The results are analyz…
The performance of quantum computers today can be studied by analyzing the effect of errors in the result of simple quantum algorithms. The modeling and characterization of these errors is relevant to correct them, for example, with quantum correcting codes. In this article we characterize the error of the five qubits quantum computer ibmqx4 (IBM Q), using a Deutsch algorithm and modeling the error by Generalized Amplitude Damping (GAD) and a unitary misalignment operation. Keywords: Quantum Deutsch's algorithm, Quantum error models, IBM Quantum Experience
Currently available quantum computers are prone to errors. Circuit optimization and error mitigation methods are needed to design quantum circuits to achieve better fidelity when executed on NISQ hardware. Dynamical decoupling (DD) is generally used to suppress the decoherence error and different DD strategies have been proposed. Moreover, the circuit fidelity can be improved by pulse-level optimization, such as creating hardware-native pulse-efficient gates. This paper implements all the popular DD sequences and evaluates their performances on IBM quantum chips with different characteristics …
We propose efficient algorithms with logarithmic step complexities for the generation of entangled $GHZ_N$ and $W_N$ states useful for quantum networks, and we demonstrate an implementation on the IBM quantum computer up to $N=16$. Improved quality is then investigated using full quantum tomography for low-$N$ GHZ and W states. This is completed by parity oscillations and histogram distance for large $N$ GHZ and W states respectively. We are capable to robustly build states with about twice the number of quantum bits which were previously achieved. Finally we attempt quantum error correction o…
We investigate the counterparts of random walk in universal quantum computing and their implementation using standard quantum circuits. Quantum walk have been recently well investigated for traversing graphs with certain oracles. We focus our study on traversing a 1-D graph, namely a circle, and show how to implement discrete circular quantum walk in quantum circuits built with universal CNOT and single quit gates. We review elementary quantum gates and circuit decomposition and propose a a generalized version of the all CNOT based quantum discrete circular walk. We simulated these circuits on…
CALA-$n$: A Quantum Library for Realizing Cost-Effective 2-, 3-, 4-, and 5-bit Gates on IBM Quantum Computers using Bloch Sphere Approach, Clifford+T Gates, and Layouts
The negative hydrogen ion is the first three body quantum problem whose ground state energy is calculated using the `Chandrasekhar Wavefunction' that accounts for the electron-electron correlation. Solving multi-body systems is a daunting task in quantum mechanics as it includes choosing a trial wavefunction and the calculation of integrals for the system that becomes almost impossible for systems with three or more particles. This difficulty can be addressed by quantum computers. They have emerged as a tool to address different electronic structure problems with remarkable efficiency. They ha…
Efficient simulation of quantum mechanical problems can be performed in a quantum computer where the interactions of qubits lead to the realization of various problems possessing quantum nature. Spin-Boson Model (SBM) is one of the striking models in quantum physics that enables to describe the dynamics of most of the two-level quantum systems through the bath of harmonic oscillators. Here we simulate the SBM and illustrate its applications in a biological system by designing appropriate quantum circuits for the Hamiltonian of photosynthetic reaction centers in IBM's 5-qubit quantum computer. …
Solving for molecular excited states remains one of the key challenges of modern quantum chemistry. Traditional methods are constrained by existing computational capabilities, limiting the complexity of the molecules that can be studied or the accuracy of the results that can be obtained. Several quantum computing methods have been suggested to address this limitation. However, these typically have hardware requirements which may not be achieved in the near term. We propose a variational quantum machine learning based method to determine molecular excited states aiming at being as resilient as…
In the past years, quantum computers more and more have evolved from an academic idea to an upcoming reality. IBM's project IBM Q can be seen as evidence of this progress. Launched in March 2017 with the goal to provide access to quantum computers for a broad audience, this allowed users to conduct quantum experiments on a 5-qubit and, since June 2017, also on a 16-qubit quantum computer (called IBM QX2 and IBM QX3, respectively). Revised versions of these 5-qubit and 16-qubit quantum computers (named IBM QX4 and IBM QX5, respectively) are available since September 2017. In order to use these,…
As superconducting qubits continue to advance technologically, the realization of quantum algorithms from theoretical abstraction to physical implementation requires knowledge of both quantum circuit construction as well as hardware limitations. In this study we present results from experiments run on IBM's 20-qubit `Poughkeepsie' architecture, with the goal of demonstrating various qubit qualities and challenges that arise in designing quantum algorithms. These include experimentally measuring $T_1$ and $T_2$ coherence times, gate fidelities, sequential CNOT gates, techniques for handling anc…
Measurement-based quantum computation (MQC) is a leading paradigm for building a quantum computer. Cluster states being used in this context act as one-way quantum computers. Here, we consider Z-states as a type of highly entangled states like cluster states, which can be used for one-way or measurement based quantum computation. We define Z-state basis as a set of orthonormal states which are as equally entangled as the cluster states. We design new quantum circuits to non-destructively discriminate these highly entangled Z-states. The proposed quantum circuits can be generalized for N-qubit …
Spin-1 tunneling and splitting of energy levels as a result of tunneling are observed explicitly on IBM's quantum computer, ibmq-bogota. The spin-1 is realized with two spins-1/2. We detect oscillations of spin-1 between the states $|1\rangle$, $|-1\rangle$ in the result of tunneling on the basis of studies of the time dependence of the mean value of z-component of spin-1 on the quantum device. The energy level splitting is observed quantifying on the IBM's quantum computer the eigenvalues of Hamiltonian which describes the spin tunneling.
Simulating quantum systems is believed to be one of the first applications for which quantum computers may demonstrate a useful advantage. For many problems in physics, we are interested in studying the evolution of the electron-phonon Hamiltonian, for which efficient digital quantum computing schemes exist. Yet to date, no accurate simulation of this system has been produced on real quantum hardware. In this work, we consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems as dictated by the number of Trotter steps and bosonic energy levels necess…
Quantum no-Hiding theorem, first proposed by Braunstein and Pati [Phys. Rev. Lett. 98, 080502 (2007)], was verified experimentally by Samal et al. [Phys. Rev. Lett. 186, 080401 (2011)] using NMR quantum processor. Till then, this fundamental test has not been explored in any of the experimental architecture. Here, we demonstrate the above no-hiding theorem using the IBM 5Q quantum processor. Categorical algebra developed by Coecke and Duncan [New J. Phys. 13, 043016 (2011)] has been used for better visualization of the no-hiding theorem by analyzing the quantum circuit using the ZX calculus. T…
Many researchers have been heavily investigated on quantum phase estimation (QPE) algorithms to find the unknown phase, since QPE is the core building block of the most quantum algorithms such as the Shor's factoring algorithm, quantum sampling algorithms, and finding the eigenvalues of unitary matrices. Kitaev's algorithm and QPE algorithms using inverse Quantum Fourier transform were proposed and widely used by researchers as a key component for their quantum algorithms. In this paper, we explore the experimental challenges of QPE algorithms on Noisy Intermediate-Scale Quantum (NISQ) compute…
Quantum error detection has always been a fundamental challenge in a fault-tolerant quantum computer. Hence, it is of immense importance to detect and deal with arbitrary errors to efficiently perform quantum computation. Several error detection codes have been proposed and realized for lower number of qubit systems. Here we present an error detection code for a (2n+1)-qubit entangled state using two syndrome qubits and simulate it on IBM's 16-qubit quantum computer for a 13-qubit entangled system. The code is able to detect an arbitrary quantum error in any one of the first 2n qubits of the (…
Schrieffer-Wolff transformation (SWT) has been extensively used in quantum many-body physics to calculate the low energy effective Hamiltonian. It provides a perturbative method to comprehend the renormalization effects of strong correlations in the quantum many-body models. The generator for Schrieffer-Wolff transformation is calculated usually by heuristic methods. Recently, a systematic and elegant method for the calculation of this extremely significant transformation has been reported [1]. Given the huge significance of SWT for many areas including quantum condensed matter physics, quantu…
In recent years, quantum walks have been widely researched and have shown exciting properties. One such is a quadratic speed-up in hitting time compared to its classical counterpart. In this paper, we design a quantum circuit for the MNRS algorithm, which finds a marked node in a graph with a quantum walk, and use it to find a hitting time for the marked nodes in the walk. We do this by implementing the circuit on IBM quantum simulators and show that the execution on a noise-free simulator results in hitting times that agree with the theoretical expectations. We also run the algorithm on a moc…
Quantum communication is a secure way to transfer quantum information and to communicate with legitimate parties over distant places in a network. Although communication over a long distance has already been attained, technical problem arises due to unavoidable loss of information through the transmission channel. Quantum repeaters can extend the distance scale using entanglement swapping and purification scheme. Here we demonstrate the working of a quantum repeater by the above two processes. We use IBM's real quantum processor `ibmqx4' to create two pair of entangled qubits and design an equ…
Recently, Yu et al., (Commun. Theor. Phys. 73 (2021) 085103) has proposed a scheme for "multi-output quantum teleportation" and has implemented the scheme using an IBM quantum computer. In their so called multicast-based quantum teleportation scheme, a sender (Alice) teleported two different quantum states (one of which is a m-qubit GHZ class state and the other is a (m+1)-qubit GHZ class state) to the two receivers. To perform the task, a five-qubit cluster state was used as a quantum channel, and the scheme was realized using IBM quantum computer for m = 1. In this comment, it is shown that …
Quantum computers have an exponential speed-up advantage over classical computers. One of the most prominent utilities of quantum computers is their ability to study complex quantum systems in various fields using quantum computational algorithms. Quantum computational algorithms can be used to study cosmological systems and how they behave with variations in the different parameters of the system. Here, we use the variational quantum eigensolver (VQE) algorithm to simulate the Hawking radiation phenomenon. VQE algorithm is a combination of quantum and classical computation methods used to obt…
