Discrimination of Highly Entangled Zstates in IBM Quantum Computer
Abstract
Measurementbased quantum computation (MQC) is a leading paradigm for building a quantum computer. Cluster states being used in this context act as oneway quantum computers. Here, we consider Zstates as a type of highly entangled states like cluster states, which can be used for oneway or measurement based quantum computation. We define Zstate basis as a set of orthonormal states which are as equally entangled as the cluster states. We design new quantum circuits to nondestructively discriminate these highly entangled Zstates. The proposed quantum circuits can be generalized for Nqubit quantum system. We confirm the preservation of Zstates after the performance of the circuit by quantum state tomography process.
I Introduction
Entangled states have a wide range of application in the field of quantum computation and quantum information NCbook (). Using highly entangled states like Bell states, GHZ states, cluster states and Brown et al. states quantum information processing tasks such as quantum teleportation BENNETPRL1993 (); GhoshNJP2002 (); SMPRA2008 (); SCJPAMT2009 (); SMEPJD2011 (); PAULQIP2011 (), quantum secret sharing SMPRA2008 (); SCJPAMT2009 (); SMEPJD2011 (); JainEPL2009 (); PRASATHQP2012 (), quantum information splitting SMPRA2008 (); SMEPJD2011 (); PAULQIP2011 (); PKPPJP2009 (); SMOC2010 (), super dense coding SMPRA2008 (); PAULQIP2011 (); AGRAWALPRA2006 (), quantum cheque SRMQP2016 (); BKBQIP2017 () etc. have been performed. Recently, a set of schemes discriminating orthogonal entangled states GuptaIJQI2007 (); PKPACP2006 (); MunroJOBQSO2005 (); WangQIP2013 (); ZhengIJTP2016 () have been proposed.
Nondestructive discrimination of orthogonal entangled states is a significant variant of discrimination of orthogonal entangled states. Using this protocol, we can discriminate orthogonal entangled states without disturbing them using indirect measurements on ancillary qubits, which contain information about the entangled states. This protocol plays a pivotal role in quantum information processing and quantum computation NCbook (). This has been proposed for generalized orthonormal qudit Bell state discrimination PKPACP2006 () and has also been experimentally achieved for 2qubit Bell states using both NMR GuptaIJQI2007 (); SamalIOP2010 () and five qubit IBM quantum computer SisodiaPLA2017 (). Some of the schemes have also been realized in optical medium LiJPBAMOP2000 () by using Kerr type nonlinearity.
This Distributed measurement technique finds a number of applications in photonic systems, measurementbased quantum computation, quantum error correction, Bell state discrimination across a quantum network involving multiple parties and optimization of the quantum communication complexity for performing measurements in distributed quantum computing. Nondestructive discrimination of entangled states has found applications in secure quantum conversation as proposed by Jain et al. JainEPL2009 (), which involves two communicating parties. A more general scenario involving multiparties has also been demonstrated by Luo et al. LuoQIP2014 ().
On the other hand, cluster states also have many impressive applications, mainly in areas like measurementbased quantum computation (MQC) NielsenPLA2003 (); LeungIJQI2004 (); RoussendorfQIC2002 (); RoussendorfPRA2003 (); AliferisPRA2004 (); DanosJACM2007 (); ChildsPRA2005 (); BrowneNJP2007 (); VerstraetePRA2004 (); GrossPRL2007 () or oneway quantum computation. MQC provides a promising conceptual framework which can face the theoretical and experimental challenges for developing useful and practical quantum computers that can perform dailylife computational tasks and solve real world problems. The exciting feature of MQC is that it allows quantum information processing by cascaded measurements on qubits stored in a highly entangled state. The scheme of a oneway quantum computer was first introduced by Raussendorf and Briegel RaussendorfPRL2001 (), whose key physical resource was the cluster state BriegelPRL2001 (). The scheme used measurements which were central elements to perform quantum computation NielsenPRL1997 (); GottesmanNAT1999 (); KnillNAT2001 (). In the proposed scheme, the cluster state can be used only once as it does not preserve entanglement after onequbit measurements, hence the name oneway quantum computation.
Researchers are currently using IBM Quantum Experience to perform various quantum computational and quantum informational tasks RundlePRA2017 (); Solano2arXiv2017 (); GrimaldiSD2001 (); KarlaarXiv2017 (); GosharXiv2017 (); GangopadhyayarXiv2017 (); SchuldarXiv2017 (); MajumderarXiv2017 (); LiarXiv2017 (); SisodiaarXiv201794 (); VishnuarXiv2017 (); GedikarXiv2017 (); BKB6arXiv2017 (); BKB7arXiv2017 (); BKB8arXiv2017 (); SolanoQMQM2017 (). Test of LeggettGarg HuffmanPRA2017 () and Mermin inequality AlsinaPRA2016 (), nonAbelian braiding of surface code defects WoottonQST2017 (), entropic uncertainty and measurement reversibility BertaNJP2016 () and entanglement assisted invariance DeffnerHel2017 () have been illustrated. Estimation of molecular ground state energy KandalaNAT2017 () and error correction with 15 qubit repetition code WoottonarXiv2017 () have also been implemented using 16 qubit IBM quantum computer ibmqx5. Experimental realization of discrimination of Bell states has motivated us to define a new set of highly entangled orthogonal states as Zstates and to demonstrate their discrimination using IBM’s fivequbit real quantum processor ibmqx4. In the present work, we define Zstates which also form an orthonormal basis for the corresponding Nqubit quantum system. We then propose new quantum circuits to distinguish between those orthogonal states and experimentally verify our theoretical results using ibmqx4. We also generalize the quantum circuit for discrimnating Nqubit Zstates.
The rest of the paper is organized as follows. In Sec. LABEL:sec2, we define Zstates and design quantum circuits for creating these states. In Sec. LABEL:sec3, we propose a new quantum circuit for nondestructively discriminating Zstates. Following which, we explicate the experimental process by taking a particular Zstate and verify the results by quantum state tomography. Finally, we conclude our paper by discussing some future applications of Zstates which can be realized in a real quantum computer.
Ii Z States
The expression for Nqubit cluster state is given below.
(1) 
2qubit, 3qubit and 4qubit cluster states are expressed as,
(2) 
(3) 
(4)  
A circuit creating 3qubit cluster state is shown in Fig. 1.
For any given number of qubits, the cluster state is not the only highly entangled state. By applying an appropriate number of Z gates (phase flip gates) on different qubits we can generate Zstates. These states are as entangled as their corresponding cluster state. The Zstates are in an equal superposition of all the computational basis states, which form an orthonormal basis for the Hilbert space. The 2 qubit Zstates in the computational basis are as follows.
(5) 
(6) 
(7) 
(8) 
The Zstates for threequbit case are as shown below.
(9) 
(10) 
(11) 
(12) 
(13) 
(14) 
(15) 
(16) 
As stated above the Zstates can be created by applying Z gates to the appropriate qubits. For example, the circuit generating a 3qubit Zstate, is illustrated in Fig. 2.
Iii Quantum Circuits and Method Used for Nondestructive Discrimination of ZStates
Since the Zstates are as equally entangled as the cluster state, we should be able to use those states for almost every quantum computational task which uses cluster states. Hence being able to discriminate between the Zstates nondestructively is important. The circuit illustrating discrmination of 2 qubit, 3 qubit and 4 qubit Zstates are shown in Figs. 3, 4 and 5 respectively. The output of the circuit shown in Fig. 3 for each 2 qubit Zstate is shown in the Table 1.
S.No.  Zstate  Ancilla 

1.  00  
2.  01  
3.  10  
4.  11 
In Fig. 5, the part of the circuit shown in black refers to the creation of one of the sixteen 4qubit Zstates. From the circuits discriminating 3 qubit and 4 qubit Zstates, we can see a pattern arising. It is clear that the methodology for getting information for the first and the last ancillary qubits remains the same. The pattern that emerges applies for rest of the ancillary qubits. We can see that for all the ancillary qubits except the first and the last, two CNOTs act on it with control qubits as qubits exactly one above and below the ancillary qubit’s corresponding Zstate qubit. Then we apply a Hadamard on the ancillary qubit, CNOT on the corresponding qubit (which appears to be sandwiched between the controls of previous two CNOTs) with the ancillary qubit as control, followed by a Hadamard. This “sandwich” pattern is enveloped in the red box.
For discriminating between the Zstates of higher number of qubits we can simply keep repeating this sandwich pattern for the ancillary qubits other than the first and the last, while the circuit for the first and the last ancillary qubits remains the same.
Iv Results
We initially prepare the two qubit Zstate, with two ancillas in state . Then the necessary single qubit and two qubit quantum gates are applied on the Zstate and the ancillas. After the performance of the quantum circuit the above Zstate is measured to check the non destructiveness of the proposed protocol. For this purpose quantum state tomography is performed and it is observed that the Zstate remains undisturbed throughout the execution of the quantum circuit. Fig. 6 depicts the implementation of the proposed algorithm for non destructive discrimination of state using ibmqx4.
The quantum circuit has been run and simulated 8192 times with different measurement basis and the following results have been obtained.
The theoretical () and experimental (simulational, and run)
density matrices are provided below.
The corresponding density matrices are plotted in the following Fig. 7
We measure the ancilla qubits for obtaining the information about the Zstate. Fig. 8 illustrates the the quantum circuit for measuring the ancilla states. As the input Zstate is , from the Table 1, it is predicted that the ancilla state should be in state. Hence, the theoretical density matrix for ancilla state () is given as, . The experimental density matrices (simulational, and run) for the same are provided in the following. The comparison of density matrices is depicted in the Fig. 9.
V Discussion and conclusion
To conclude, we have defined here a new type of highly entangled state named as Zstate. We have proposed a new quantum circuit for nondestructively discriminating Zstates. We run the quantum circuit in the IBM quantum computer and verify the results by quantum state tomography. It is found that we have experimentally prepared the nondestructive Zstates with a fidelity of 0.815. We hope, Zstates can be applied to the branch of measurementbased quantum computation. We also could find the application of nondestructive discrimination of orthogonal entangled states in distributed quantum computing in a quantum network.
Acknowledgements. B.K.B. is financially supported by DST Inspire Fellowship. SS and KS acknowledge the support of HBCSE and TIFR for conducting National Initiative on Undergraduate Sciences (NIUS) Physics camp. We are extremely grateful to IBM team and IBM QE project. The discussions and opinions developed in this paper are only those of the authors and do not reflect the opinions of IBM or IBM QE team.
References

(1)
M. Nielsen, I. Chuang
Quantum Computation and Quantum Information
Cambridge University Press (2000) 
(2)
C.H. Bennett, G. Brassard, C. Crepeau, R. Jozsa, A. Peres, W.K. Wootters
Teleporting an unknown quantum state via dual classical and EinsteinPodolskyRosen channels
Phys. Rev. A, 70 (1993), p. 1895 
(3)
S. Ghosh, G. Kar, A. Roy, D. Sarkar, U. Sen
Entanglement teleportation through GHZclass states
New J. Phys., 4 (2002), p. 48 
(4)
S. Muralidharan, P.K. Panigrahi
Perfect teleportation, quantumstate sharing, and superdense coding through a genuinely entangled fivequbit state
Phys. Rev. A, 77 (2008), p. 032321 
(5)
S. Choudhury, S. Muralidharan, P.K. Panigrahi
Quantum teleportation and state sharing using a genuinely entangled sixqubit state
J. Phys. A: Math. Theor., 42 (2009), p. 115303 
(6)
S. Muralidharan, S. Karumanchi, S. Jain, R. Srikanth, and P.K. Panigrahi
2N qubit “mirror states” for optimal quantum communication
Eur. Phys. J. D, 61 (2011), pp. 757763 
(7)
N. Paul, J.V. Menon, S. Karumanchi, S. Muralidharan, P.K. Panigrahi
Quantum tasks using six qubit cluster states
Quantum Inf. Process., 10 (2011), pp. 619632 
(8)
S. Jain, S. Muralidharan, P.K. Panigrahi
Secure quantum conversation through nondestructive discrimination of highly entangled multipartite states
Euro. Phys. Lett., 87 (2009), Article 60008 
(9)
E.S. Prasath, S. Muralidharan, C. Mitra, P.K. Panigrahi
Multipartite entangled magnon states as quantum communication channels
Quantum Inf. Process., 11 (2012), pp. 397410 
(10)
P.K. Panigrahi, S. Karumanchi, S. Muralidharan
Minimal classical communication and measurement complexity for quantum information splitting of a twoqubit state
Pramana  J. Phys., 73 (2009), pp. 499504 
(11)
S. Muralidharan, P.K. Panigrahi
Quantuminformation splitting using multipartite cluster states
Phys. Rev. A, 78 (2008), p. 062333 
(12)
P. Agrawal, A. Pati
Perfect teleportation and superdense coding with W states
Phys. Rev. A, 74 (2006), p. 062320 
(13)
S.R. Moulick, P.K. Panigrahi
Quantum cheques
Quantum Inf. Process., 15 (2016), pp. 2475–2486 
(14)
B.K. Behera, A. Banerjee, P.K. Panigrahi
Experimental realization of quantum cheque using a fivequbit quantum computer
Quantum Inf. Process., 16 (2017), p. 312 
(15)
M. Gupta, A. Pathak, R. Srikanth, P.K. Panigrahi
General circuits for indirecting and distributing measurement in quantum computation
Int. J. Quantum Inf., 5 (2007), pp. 627640 
(16)
P.K. Panigrahi, M. Gupta, A. Pathak, R. Srikanth
Circuits for distributing quantum measurement
AIP Conf. Proc., 864 (2006), pp. 197207 
(17)
W.J. Munro, K. Nemoto, T.P. Spiller, et al.
Efficient optical quantum information processing
J. Opt. B, Quantum Semiclass. Opt., 7 (2005), p. S135 
(18)
X.W. Wang, D.Y. Zhang, S.Q. Tang, L.J. Xie
Nondestructive GreenbergerHorneZeilingerstate analyzer
Quantum Inf. Process., 12 (2013), pp. 10651075 
(19)
C. Zheng, Y. Gu, W. Li, Z. Wang, J. Zhang
Complete distributed hyperentangledbellstate analysis and quantum super dense coding
Int. J. Theor. Phys., 55 (2016), pp. 10191027 
(20)
J.R. Samal, M. Gupta, P.K. Panigrahi, A. Kumar
Nondestructive discrimination of Bell states by NMR using a single ancilla qubit
J. Phys. B: Atom. Molecul. Opt. Phys., 43 (2010), p. 095508 
(21)
M. Sisodia, A. Shukla, A. Pathak
Experimental realization of nondestructive discrimination of Bell states using a fivequbit quantum computer
Phys. Lett. A, 381 (2017), pp. 38603874 
(22)
J. Li, B.S. Shi, Y.K. Jiang, X.F. Fan, G.C. Guo
A nondestructive discrimination scheme on 2npartite GHZ bases
J. Phys. B, At. Mol. Opt. Phys., 33 (2000), p. 3215 
(23)
Q.b. Luo, G.w. Yang, K. She, W.n. Niu, Y.q. Wang
Multiparty quantum private comparison protocol based on ddimensional entangled states
Quantum Inf. Process., 13 (2014), pp. 23432352 
(24)
M.A. Nielsen
Quantum computation by measurement and quantum memory
Phys. Lett. A, 308 (2003), pp. 96100 
(25)
D.W. Leung
Quantum computation by measurements
Int. J. Quantum Inf., 2 (2004), pp. 3343 
(26)
R. Raussendorf, H.J. Briegel
Computational model underlying the oneway quantum computer
Quantum Inf. Comput., 2 (2002), pp. 443486 
(27)
R. Raussendorf, D.E. Browne, H.J. Briegel
Measurementbased quantum computation using cluster states
Phys. Rev. A, 68 (2003), p. 022312 
(28)
P. Aliferis, D.W. Leung
Computation by measurements: A unifying picture
Phys. Rev. A, 70 (2004), p. 062314 
(29)
V. Danos, E. Kashefi, P. Panangaden
The measurement calculus
J. Assoc. Comput. Mach., 54 (2007), p. 8 
(30)
A.M. Childs, D.W. Leung, M.A. Nielsen
Unified derivations of measurementbased schemes for quantum computation
Phys. Rev. A, 71 (2005), p. 032318 
(31)
D.E. Browne, E. Kashefi, M. Mhalla, S. Perdrix
Generalized flow and determinism in measurementbased quantum computation
New J. Phys., 9 (20007), p. 250 
(32)
F. Verstraete, J.I. Cirac
Valencebond states for quantum computation
Phys. Rev. A, 70 (2004), p. 060302 
(33)
D. Gross, J. Eisert
Novel schemes for measurementbased quantum computation
Phys. Rev. Lett., 98 (2007), p. 220503 
(34)
R. Raussendorf, H.J. Briegel
A OneWay Quantum Computer
Phys. Rev. Lett., 86 (2001), p. 5188 
(35)
H.J. Briegel, R. Raussendorf
Persistent Entanglement in Arrays of Interacting Particles
Phys. Rev. Lett., 86 (2001), p. 910 
(36)
M.A. Nielsen, I.L. Chuang
Programmable Quantum Gate Arrays
Phys. Rev. Lett., 79 (1997), p. 321 
(37)
D. Gottesman, I.L. Chuang
Demonstrating the viability of universal quantum computation using teleportation and singlequbit operations
Nature, 402 (1999), pp. 390393 
(38)
E. Knill, R. Laflamme, G.J. Milburn
A scheme for efficient quantum computation with linear optics
Nature, 409 (2001), pp. 4652 
(39)
R.P. Rundle, P.W. Mills, T. Tilma, J.H. Samson, M.J. Everitt
Simple procedure for phasespace measurement and entanglement validation
Phys. Rev. A, 96 (2017), p. 022117 
(40)
U. AlvarezRodriguez, M. Sanz, L. Lamata, E. Solano
Artificial Life in Quantum Technologies
arXiv preprint
arxiv:1505.03775 (2016) 
(41)
D. Grimaldi, M. Marinov
Distributed measurement systems
Measurement, 30 (2001), pp. 279287 
(42)
A.R. Kalra, S. Prakash, B.K. Behera, P.K. Panigrahi
Experimental Demonstration of the No Hiding Theorem Using a 5 Qubit Quantum Computer
arXiv preprint
arXiv:1707.09462 (2017) 
(43)
D. Ghosh, P. Agarwal, P. Pandey, B.K. Behera, P.K. Panigrahi
Automated Error Correction in IBM Quantum Computer and Explicit Generalization
arXiv preprint
arXiv:1708.02297 (2017) 
(44)
S. Gangopadhyay, Manabputra, B.K. Behera, P.K. Panigrahi
Generalization and Partial Demonstration of an Entanglement Based DeutschJozsa Like Algorithm Using a 5Qubit Quantum Computer
arXiv preprint
arXiv:1708.06375 (2017) 
(45)
M. Schuld, M. Fingerhuth, F. Petruccione
Implementing a distancebased classifier with a quantum interference circuit
arXiv preprint
arXiv:1703.10793 (2017) 
(46)
A. Majumder, S. Mohapatra, A. Kumar
Experimental Realization of Secure Multiparty Quantum Summation Using FiveQubit IBM Quantum Computer on Cloud
arXiv preprint
arXiv:1707.07460 (2017) 
(47)
R. Li, U. AlvarezRodriguez, L. Lamata, E. Solano
Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience
arXiv preprint
arXiv:1611.07851 (2017) 
(48)
M. Sisodia, A. Shukla, K. Thapliyal, A. Pathak
Design and experimental realization of an optimal scheme for teleportion of an nqubit quantum state
arXiv preprint
arXiv:1704.05294 (2017) 
(49)
Vishnu P.K., D. Joy, B.K. Behera, P.K. Panigrahi
Experimental Demonstration of Nonlocal ControlledUnitary Quantum Gates Using a Fivequbit Quantum Computer
arXiv preprint
arXiv:1709.05697 (2017) 
(50)
İ. Yalçınkaya, Z. Gedik
Optimization and experimental realization of quantum permutation algorithm
arXiv preprint
arXiv:1708.07900 (2017) 
(51)
A. Dash, S. Rout, B.K. Behera, P.K. Panigrahi
A Verification Algorithm and Its Application to Quantum Locker in IBM Quantum Computer
arXiv preprint
arXiv:1710.05196 (2017) 
(52)
S. Roy, B.K. Behera, P.K. Panigrahi
Demonstration of Entropic Noncontextual Inequality Using IBM Quantum Computer
arXiv preprint
arXiv:1710.10717 (2017) 
(53)
B.K. Behera, S. Seth, A. Das, P.K. Panigrahi
Experimental Demonstration of Quantum Repeater in IBM Quantum Computer
arXiv preprint
arXiv:1712.00854 (2017) 
(54)
R. Li, U. AlvarezRodriguez, L. Lamata, E. Solano
Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience
Quantum Meas. Quantum Metrol., 4 (2017), pp. 17 
(55)
E. Huffman, A. Mizel
Violation of noninvasive macrorealism by a superconducting qubit: Implementation of a LeggettGarg test that addresses the clumsiness loophole
Phys. Rev. A, 95 (2017), p. 032131 
(56)
D. Alsina, J.I. Latorre
Experimental test of Mermin inequalities on a fivequbit quantum computer Phys. Rev. A, 94 (2016), p. 012314 
(57)
J. R. Wootton
Demonstrating nonAbelian braiding of surface code defects in a five qubit experiment
Quantum Sci. Technol., 2 (2017), p. 015006 
(58)
M. Berta, S. Wehner, M.M. Wilde
Entropic uncertainty and measurement reversibility
New J. Phys., 18 (2016), p. 073004 
(59)
S. Deffner
Demonstration of entanglement assisted invariance on IBM’s quantum experience
Heliyon, 3 (2016), p. e00444 
(60)
A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J.M. Chow, J.M. Gambetta
Hardwareefficient variational quantum eigensolver for small molecules and quantum magnets
Nature, 549 (2017), pp. 242246 
(61)
J.R. Wootton, D. Loss
A repetition code of 15 qubits
arXiv preprint
arXiv:1709.00990 (2017)