Experimental demonstration of non-local controlled-unitary quantum gates using a five-qubit quantum computer

Vishnu, P K; Joy, Dintomon; Behera, Bikash K.; Panigrahi, Prasanta K.

doi:10.1007/s11128-018-2051-2

Cited by 52 publications

(35 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(17) ρ T = |ψ��ψ|. www.nature.com/scientificreports/ On the other hand, the experimental density matrix for N-qubit system is given as 67,69,92,93 where σ j i with i ∈ {1, 2, . .…”

Section: Quantum State Tomographymentioning

confidence: 99%

Experimental realization of controlled quantum teleportation of arbitrary qubit states via cluster states

Kumar

Haddadi

Pourkarimi

et al. 2020

Sci Rep

Self Cite

View full text Add to dashboard Cite

controlled quantum teleportation involves a third party as a controller for the teleportation of state. Here, we present the novel protocols for controlling teleportation of the arbitrary two-qubit and three-qubit states through five-qubit and seven-qubit cluster states respectively. In these schemes, Alice sends the arbitrary qubit states to the remote receiver Bob through the cluster states as quantum channels under the control of charlie. Bob can recover the mentioned states by making appropriate unitary operations, and we point out that the efficiency in our schemes is 100%. In the process of our analysis, we find the classical communication cost in our protocols is remarkably reduced when compared to the previous protocols. We perform the experimental realization of the above protocols on "IBM 16 Melbourne" quantum computer and "IBM quantum simulator" and we calculate the fidelity. We also examine the security analysis against Charlie, and these schemes which we considered here are secure against charlie's attacks. Following the idea of Bennett et al. 1,2 on quantum teleportation, we use entanglement 3 for the quantum communication protocols 4-19. Such as teleportation of qubits 20 , quantum key distribution (QKD) 21,22 , quantum secret sharing 23,24 , etc. 25-34 Entanglement can be seen in many states likes Bell states 35,36 , GHZ states 37 , and W states 38,39 , and so far several measures have been proposed to quantify entanglement 40-45. Various research works have been developed in the field of multi-party quantum teleportation 46-48. As far as we know, the first quantum teleportation between three parties is proposed by Karlsson et al. 49 in 1998 using GHZ state. Also, Dong et al. 50 performed a controlled communication between the three-party using GHZ state and imperfect Bell state measurement. Furthermore, Hassanpour et al. 51 performed controlled quantum secure direct communication protocol using GHZ-like states. Quantum teleportation involving cluster states 7,52-55 is a multiparty protocol. Cluster states are a kind of highly entangled quantum states, and they can be prepared in the following ways: (a) Cluster states can be generated in lattices of spin qubits by interacting them with "Ising type Hamiltonian" 56 , (b) Cluster states can be generated by spontaneous parametric down-conversion involving photon polarization and non-linear optics 57. (c) The cluster states are considered as a particular case of graph states 58-61. Cluster states have great importance over quantum teleportation, and they can be used for one-way quantum computing 55,57 , bidirectional quantum computing 62 , and cyclic quantum computing 63. In our protocols, we use the cluster states as a one-way quantum computing channel. Quantum correlation is used as a resource to establish entanglement between the particles. For an entangled state, the entanglement of formation 42 specifies the amount of resource used to generate the particular entanglement between the particles. The amount of resource used for generating entanglemen...

show abstract

Section: Quantum State Tomographymentioning

confidence: 99%

Experimental realization of controlled quantum teleportation of arbitrary qubit states via cluster states

Kumar

Haddadi

Pourkarimi

et al. 2020

Sci Rep

Self Cite

View full text Add to dashboard Cite

show abstract

“…Our proposed algorithm relies on four quantum gates including Hadamard [8], Pauli X [9], controlled Hadamard [10], and controlled NOT [11] gate.…”

Section: Quantum Gatesmentioning

confidence: 99%

A Generalized Quantum Algorithm for Assuring Fairness in Random Selection Among 2N Participants

Kumar¹

2020

SN COMPUT. SCI.

View full text Add to dashboard Cite

Quantum computing promises to provide a tremendous boost to the computational power of our machines by utilizing superposition and entanglement phenomenon of quantum mechanics. Few quantum algorithms are known which are taking advantage of these quantum phenomena and are providing solutions to problems having significant importance. In this paper, we have proposed a generalized method for designing 2 N qubits circuit such that during measurement only one qubit will be in state-1, while remaining other qubits will hold state-0. Apart from adding fair randomness to the selection process in distributed quantum computing, these generalized quantum circuits can be found very useful in commercial domains requiring transparency and trust in systems requiring fair randomness in decision-making such as in a lottery system. The critical advantage of using our proposed method is that it allows individual's results to be teleported to them, hence making an end-to-end system whose fairness is quantum assured.

show abstract

“…IBM Q [12] is a superconducting qubit based operating system which offers open global access to a wide class of researchers and has found significant applications [13,14,15,16,17,18] in an user-friendly interface. In this paper, we use a five-qubit quantum computer as well as a 32-qubit simulator provided by IBM to implement teleportation using quantum walks on graphs.…”

Section: Introductionmentioning

confidence: 99%

Experimental realization of quantum teleportation using coined quantum walks

Chatterjee

Devrari

Behera

et al. 2019

Quantum Inf Process

Self Cite

View full text Add to dashboard Cite

The goal of teleportation is to transfer the state of one particle to another particle. In coined quantum walks, conditional shift operators can introduce entanglement between position space and coin space. This entanglement resource can be used as a quantum channel for teleportation, as proposed by Wang, Shang and Xue [Quantum Inf. Process. 16, 221 (2017)]. Here, we demonstrate the implementation of quantum teleportation using quantum walks on a five-qubit quantum computer and a 32-qubit simulator provided by IBM quantum experience beta platform. We show the teleportation of singlequbit, two-qubit and three-qubit quantum states with circuit implementation on the quantum devices. The teleportation of Bell, W and GHZ states has also been demonstrated as special cases of the above states.

show abstract

Experimental demonstration of non-local controlled-unitary quantum gates using a five-qubit quantum computer

Cited by 52 publications

References 53 publications

Experimental realization of controlled quantum teleportation of arbitrary qubit states via cluster states

Experimental realization of controlled quantum teleportation of arbitrary qubit states via cluster states

A Generalized Quantum Algorithm for Assuring Fairness in Random Selection Among 2N Participants

Experimental realization of quantum teleportation using coined quantum walks

Contact Info

Product

Resources

About