arXiv subjects

Bikash K. Behera

Publications and source records attributed to Bikash K. Behera.

At least 55 records · Page 3Linked to original sources

arXiv2021

Quantum Simulation of Hawking Radiation Using VQE Algorithm on IBM Quantum Computer

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 obtain the minimum energy eigenvalue for a given Hamiltonian. Three different custom ansatzes are used in the VQE algorithm from which the results for the case with minimum errors are studied. We obtain the plots for temperature and power from the minimum energy eigenvalue recorded for different values of mass and distance from the center of the black hole. The final result is then analyzed and compared against already existing data on Hawking radiation.

quant-ph↗

arXiv2021

Demonstration of Optimal Fixed-Point Quantum Search Algorithm in IBM Quantum Computer

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 IBMQ simulator developed by IBM corporation. We perform the search algorithm for one-iteration for two, three, four and five qubit systems and confirm the accuracy of our results through histogram.

quant-ph↗

arXiv2021

Experimental Demonstration of Quantum Tunneling in IBM Quantum Computer

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 experimental results. One may extend the proposed quantum circuits and simulation techniques used here for observing the tunneling phenomena for multi-particle systems in different potentials.

quant-ph↗

arXiv2021

Investigation of Quantum Support Vector Machine for Classification in NISQ era

Quantum machine learning is at the crossroads of two of the most exciting current areas of research; quantum computing and classical machine learning. It explores the interaction between quantum computing and machine learning, investigating how results and techniques from one field can be used to solve the problems of the other. Here, we investigate quantum support vector machine (QSVM) algorithm and its circuit version on present quantum computers. We propose a general encoding procedure extending QSVM algorithm, which would allow one to feed vectors with higher dimension in the training-data oracle of QSVM. We compute the efficiency of the QSVM circuit implementation method by encoding training and testing data sample in quantum circuits and running them on quantum simulator and real chip for two datasets; 6/9 and banknote. We highlight the technical difficulties one would face while applying the QSVM algorithm on current NISQ era devices. Then we propose a new method to classify these datasets with enhanced efficiencies for the above datasets both on simulator and real chips.

quant-ph↗

arXiv2021

Experimental realization of BB84 protocol with different phase gates and SARG04 protocol

Cryptography in the modern era is very important to prevent a cyber attack, as the world tends to be more and more digitalized. Classical cryptographic protocols mainly depend on the mathematical complicacy of encoding functions and the shared key, like RSA protocol in which security depends upon the fact that factoring a big number is a hard problem to the current computers. This means that high computing power can help you crack traditional encryption methods. Quantum machines claim to have this kind of power in many instances. Factorization of big numbers may be possible with Shor's algorithm with quantum machines in considerable time. Apart from this, the main problem is key sharing i.e., how to securely share the key the first time to validate the encryption. Here comes quantum key distribution. Two parties who are interested in communication with each other, create a process, which claims considerable security against an eavesdropper, by encoding and decoding information in quantum states to construct and share a secret key. Quantum key distribution may be done in a variety of ways. This paper begins with experimental verification of the BB84 procedure utilizing four bases (using phase gates) followed by the experimental realization of the SARG04 protocol which was derived from BB84 Protocol to overcome PNS attack. The possibility of a third-party attack and the effect of noise is considered and implemented. The IBM Quantum Experience platform was used for all of the implementations.

quant-ph↗

arXiv2021

Efficient Verification of Boson Sampling Using a Quantum Computer

Boson sampling is a sub-universal model used to show quantum speed-up. However, the methods of validation to prove quantum speedup are not robust and accurate. All verification methods involve additional or little studied assumptions. Here, we use the protocols given in the paper [arXiv:2006.03520] to construct a boson sampling experiment using discrete quantum states on IBM quantum computer and verify the fidelity of the output states using heterodyne detection. We demonstrate the protocols for single mode fidelity estimation, multi mode fidelity estimation and a verification protocol using IBMQ "athens" chip. Moreover, we illustrate the use of this verification protocol in the quantum key distribution (QKD) process for estimating the fidelity of different types of encoding-decoding basis. This shows that the verification protocols can be used to enable efficient and reliable certification of highly entangled multi-particle states.

quant-ph↗

arXiv2021

Complexity analysis of quantum teleportation via different entangled channels in the presence of noise

Quantum communication is one of the hot topics in quantum computing, where teleportation of a quantum state has a slight edge and gained significant attention from researchers. A large number of teleportation schemes have already been introduced so far. Here, we compare the teleportation of a single qubit message among different entangled channels such as the two-qubit Bell channel, three-qubit GHZ channel, two- and three-qubit cluster states, the highly entangled five-qubit Brown \emph{et al.} state and the six-qubit Borras \emph{et al.} state. We calculate and compare the quantum costs in each of the cases. Furthermore, we study the effects of six noise models, namely bit-flip noise, phase-flip noise, bit-phase flip noise, amplitude damping, phase damping and the depolarizing error that may affect the communication channel used for the teleportation. An investigation on the variation of the initial state's fidelity with respect to the teleported state in the presence of the noise model is performed. A visual representation of the variation of fidelity for various values of the noise parameter $η$ is done through a graph plot. It is observed that as the value of noise parameter in the range $η\in [0,0.5]$, the fidelity decreases in all the entangled channels under all the noise models. After that, in the Bell channel, GHZ channel and three-qubit cluster state channel, the fidelity shows an upward trend under all the noise models. However, in the other three channels, the fidelity substantially decreases in the case of amplitude damping, phase damping and depolarizing noise, and even it reaches zero for $η= 1$ in Brown \emph{et al.} and Borras \emph{et al.} channels.

quant-ph↗

arXiv2021

Masking of Quantum Information into Restricted Set of states

Masking of data is a method to protect information by shielding it from a third party, however keeping it usable for further usages like application development, building program extensions to name a few. Whereas it is possible for classical information encoded in composite quantum states to be completely masked from reduced sub-systems, it has to be checked if quantum information can also be masked when the future possibilities of a quantum computer are increasing day by day. Newly proposed no-masking theorem [Phys. Rev. Lett. 120, 230501 (2018)], one of the no-go theorems, demands that except for some restricted sets of non-orthogonal states, it's impossible to mask arbitrary quantum states. Here, we explore the possibility of masking in the IBM quantum experience platform by designing the quantum circuits and running them on the 5-qubit quantum computer. We choose two particular states considering both the orthogonal and non-orthogonal basis states and illustrate their masking through both the theoretical calculation as well as verification in the quantum computer. By quantum state tomography, it is concluded that the experimental results are collected with high fidelity and hence the possibility of masking is realized.

quant-ph↗

arXiv2021

Simulation of Lennard-Jones Potential on a Quantum Computer

Simulation of time dynamical physical problems has been a challenge for classical computers due to their time-complexity. To demonstrate the dominance of quantum computers over classical computers in this regime, here we simulate a semi-empirical model where two neutral particles interact through Lennard-Jones potential in a one-dimensional system. We implement the above scenario on the IBM quantum experience platform using a 5-qubit real device. We construct the Hamiltonian and then efficiently map it to quantum operators onto quantum gates using the time-evolutionary unitary matrix obtained from the Hamiltonian. We verify the results collected from the QASM-simulator and compare it with that of the 5-qubit real chip ibmqx2.

quant-ph↗

arXiv2020

Experimental Realization of Quantum Darwinism State on Quantum Computers

It is well-known that decoherence is a crucial barrier in realizing various quantum information processing tasks; on the other hand, it plays a pivotal role in explaining how a quantum system's fragile state leads to the robust classical state. Zurek [Nat. Phys. 5, 181-188 (2009)] has developed the theory which successfully describes the emergence of classical objectivity of quantum system via decoherence, introduced by the environment. Here, we consider two systems for a model universe, in which the first system shows a random quantum state, and the other represents the environment. We take 2-, 3-, 4-, 5- and 6-qubit quantum circuits, where the system consists of one qubit and the rest qubits represent the environment qubits. We experimentally realize the Darwinism state constructed by this system's ensemble on two real devices, ibmq_athens and ibmq_16_melbourne. We then use the results to investigate quantum-classical correlation and the mutual information present between the system and the environment.

quant-ph↗

arXiv2020

Solving diner's dilemma game, circuit implementation, and verification on IBMQ simulator

Diners dilemma is one of the most interesting problems in both economic and game theories. Here, we solve this problem for n (number of players) =4 with quantum rules and we are able to remove the dilemma of diners between the Pareto optimal and Nash equilibrium points of the game. We find the quantum strategy that gives maximum payoff for each diner without affecting the payoff and strategy of others. We use the quantum principles of superposition and entanglement that gives supremacy over any classical strategies. We present the circuit implementation for the game, design it on the IBM quantum simulator and verify the strategies in the quantum model.

quant-ph↗

arXiv2020

Quantum Circuit Design Methodology for Multiple Linear Regression

Multiple linear regression assumes an imperative role in supervised machine learning. In 2009, Harrow et al. [Phys. Rev. Lett. 103, 150502 (2009)] showed that their HHL algorithm can be used to sample the solution of a linear system $\mathbf{Ax=b}$ exponentially faster than any existing classical algorithm, with some manageable caveats. The entire field of quantum machine learning gained considerable traction after the discovery of this celebrated algorithm. However, effective practical applications and experimental implementations of HHL are still sparse in the literature. Here, we demonstrate a potential practical utility of HHL, in the context of regression analysis, using the remarkable fact that there exists a natural reduction of any multiple linear regression problem to an equivalent linear systems problem. We put forward a $7$-qubit quantum circuit design, motivated from an earlier work by Cao et al. [Mol. Phys. 110, 1675 (2012)], to solve a $3$-variable regression problem, using only elementary quantum gates. We also implement the Group Leaders Optimization Algorithm (GLOA) [Mol. Phys. 109 (5), 761 (2011)] and elaborate on the advantages of using such stochastic algorithms in creating low-cost circuit approximations for the Hamiltonian simulation. We believe that this application of GLOA and similar stochastic algorithms in circuit approximation will boost time- and cost-efficient circuit designing for various quantum machine learning protocols. Further, we discuss our Qiskit simulation and explore certain generalizations to the circuit design.

quant-ph↗

arXiv2020

Demonstrating Quantum Zeno Effect on IBM Quantum Experience

Quantum Zeno Effect (QZE) has been one of the most interesting phenomena in quantum mechanics ever since its discovery in 1977 by Misra and Sudarshan [J. Math. Phys. \textbf{18}, 756 (1977)]. There have been many attempts for experimental realization of the same. Here, we present the first ever simulation of QZE on IBM quantum experience platform. We simulate a two-level system for Rabi-driven oscillation and then disturb the time evolution by intermediate repetitive measurements using quantum gates to increase the survival probability of the qubit in the initial state. The circuits are designed along with the added intermediate measurements and executed on IBM quantum simulator, and the outcomes are shown to be consistent with the predictions. The increasing survival probability with the number of intermediate measurements demonstrates QZE. Furthermore, some alternative explanations for the obtained results are provided which leads to some ambiguity in giving the exact reasoning for the observed outcomes.

quant-ph↗

arXiv2020

Measurement-device-independent QSDC protocol using Bell and GHZ states on quantum simulator

Secure cryptographic protocols are indispensable for modern communication systems. It is realized through an encryption process in cryptography. In quantum cryptography, Quantum Key Distribution (QKD) is a widely popular quantum communication scheme that enables two parties to establish a shared secret key that can be used to encrypt and decrypt messages. But security loopholes still exist in this cryptographic protocol, as an eavesdropper can in principle still intercept all the ciphertext to perform cryptanalysis and the key may get leaked to the eavesdropper, although it happens very rarely. However, there exists a more secure quantum cryptographic scheme known as Quantum Secure Direct Communication (QSDC) protocol that eliminates the necessity of key, encryption and ciphertext transmission. It is a unique quantum communication scheme where secret information is transmitted directly over a quantum communication channel. We make use of measurement-device-independent (MDI) protocol in this scheme where all the measurements of quantum states during communication are performed by a third party that can be untrusted or even an eavesdropper. This eliminates all loopholes in practical measurement devices. Here, we realize this MDI-QSDC protocol using Bell and GHZ states in the IBM Quantum Experience platform and implement swapping circuits for security check.

quant-ph↗

arXiv2020

Generation of perfect W-state and demonstration of its application to quantum information splitting

We report the first experimental realization of perfect W-state in a superconducting qubit based system. In contrast to maximally entangled state, the perfect W state is different in weights and phases of the terms contained in the maximally entangled W-state. The prefect W state finds important applications in quantum information processing tasks such as perfect teleportation, superdense coding, secret sharing etc. The efficiency of generation is quantified by fidelity which is calculated by performing full quantum state tomography. To verify the presence of genuine nonlocality in the generated state, we experimentally perform Mermin's inequality tests. Further, we have also demonstrated splitting and sharing of quantum information using the experimentally generated state.

quant-ph↗

arXiv2020

Simulation of single photon dynamics in coupled cavities through IBM quantum computer

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.

quant-ph↗

arXiv2020

Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer

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 analyzed through the technique of quantum state tomography, and the fidelity of states is calculated for a different number of executions made in the device.

quant-ph↗

arXiv2020

A simulational model for witnessing quantum effects of gravity using IBM quantum computer

Witnessing quantum effects in the gravitational field is found to be exceptionally difficult in practice due to lack of empirical evidence. Hence, a debate is going on among physicists whether gravity has a quantum domain or not. There had been no successful experiments at all to show the quantum nature of gravity till two recent independent works by Bose et al. [Phys. Rev. Lett. 119, 240401 (2017)] and by Marletto and Vedral [Phy. Rev. Lett. 119, 240402 (2017)]. The authors have proposed schemes to test the quantumness of gravity in two small test masses by entangling two spatially separated objects using gravitational interactions. They provide a method to witness the entanglement using spin correlation measurements, which could imply evidence for gravity being a quantum coherent mediator. Here we propose a simulational model by providing a new quantum circuit for verifying the above schemes. We simulate the schemes for the first time in IBM's 5-qubit quantum chip 'ibmqx4' by developing a quantum system which shows effects analogous to quantum gravity and calculates the degree of entanglement of the spin correlation. The entanglement witness over a range is obtained for different experimental parameters.

quant-ph↗