Deterministic creation of up to five-qubit W states demonstrated on a real quantum computer




The seminal article by DΓΌr, Vidal and Cirac [1] not only emphasizes the interest of entangling three qubits in a W state in quantum computing and cryptography, but also introduces the notion of generalization of a W state to a multi-qubits system. Numerous experimental achievements of GHZ multi-qubit entanglement are reported, for example the demonstration of a five-photon entanglement by Zhi Zhao et al [2]. However, to our knowledge, there is currently no reported demonstration of multi-entanglement of four or five qubits in W state, although the theoretical basis of the appropriate experimental schemes are proposed repeatedly in the literature. Among these theoretical contributions, a recent article by Firat Diker [3] proposes an algorithm in the form of nested boxes allowing the deterministic construction of W states of any size. The experimental setup proposed by the author is essentially an optical assembly including half-wave plates.
After having demonstrated somewhere else on this blog the production of 5-qubits GHZ states on the ibmqx4 for testing Mermin inequalities, it was tempting to see if the Diker algorithm could produce a similar type of multi-entanglement for W states on the same system. To do this, the theoretical presentation had to be adapted to meet the requirements of programming specific to the project "IBM Q experience". The model had also to be adapted to the connectivity map of the ibmqx4. This adaptation finally has the advantage of avoiding confusion between the formulation of Diker and that of the IBM Q experience, for example between Diker box U (which becomes box M) and universal gate U3.

Theoretical model

The creation of a circuit for obtaining a state W of n qubits requires a series of boxes Mk , k=2...n, nested in the manner of a set of Matryoshka dolls. The circuit for n = 5 for an ideal quantum computer where all the qubits are interconnected in a bidirectionnal manner is shown in FIG1. 

FIG1. Circuit to achieve a 5-qubit W state on an ideal quantum computer. The Matryoshka boxes are represented by frames of different colors: M2 M3 M4 M5. The Mk are each formed by a top operator Tk and a bottom operator Bk .
 Boperator is a chain of cNOT. A Mk box contains the Mk-1 box, except for the Mbox, the center one, which is welded and contains no other M box.

The nesting of the M boxes is described by the following set of equations:








(eq.1)


The schema of the Toperators is represented in FIG2. These operators include y-rotation gates and 2-qubit cZ gates. 

FIG2. Toperator. The target qubit (top line) is first rotated by a -πœƒ angle in the y direction of the Bloch sphere, then a 2-qubit cZ gate is applied with the qubit on the lower line as control. A y-rotation of an angle +πœƒ of the target qubit completes the process.


The y-rotations are obtained on the composer of the ibmqx4 by using the universal gate U3 with parameters πœƒ= πœƒk , πœ‘ = 0,  πœ† = 0, in accordance with the following equality:

Ry(πœƒ) = U3 (πœƒ,0,0)  (eq.2)

If qubitc is the control and qubitt is the target, a cZ gate consists of a sequence of a first H gate on qubitt, a cNOTct gate and a second H gate on qubitt. The angle πœƒk  for a Tk  operator is :

πœƒk = arc cos (1/√k)  (eq.3)

The Toperator corresponds to the Diker two-qubit F gate and works thus as follows:

(eq.4)


The Boperators are sequences of cNOT gates where the target is always the kth qubit, of the following form (the order does not matter) :


(eq.5)

In order to create a n qubits W stage  |Wn⟩, we first apply an X Pauli gate to the nth qubit to create the initial state:

(eq.6)

Using the equation set 1 and the equations 4 to 6, it is easy to show that, for any n ≥ 2:


(eq.7)


It should be noted that according to this formulation |W2⟩ is actually the well known Bell state
|Ξ¨+⟩.

Experimental setup


 In order to program the real quantum computer, it is necessary to substitute the connections that cannot be made by reverse gates and to perform qubit swapping at appropriate times. The gates used for this purpose are shown in FIG3. Details concerning the reverse cNOT and the swap gate can be found here: https://quantumexperience.ng.bluemix.net/qx/tutorial?sectionId=full-user-guide&page=004-Quantum_Algorithms~2F061-Basic_Circuit_Identities_and_Larger_Circuits


FIG3: Some useful gates used in the circuits

Armed with these instruments, it is then possible to adapt the ideal schema to the connectivity map of the ibmqx4 in order to realize real-world experiments (FIG4).
FIG4: Adaptation of the nested box model to the ibmqx4 quantum computer in order to create a 5-qubit W state. The color code for the set of Matryoshka dolls is the same as in FIG1: M2 M3 M4 M5.




Programming:

The programming for each of the circuits giving rise to the states |W2⟩ to |W5⟩ was done using the QISKit SDK python platform and the Composer module of the IBM Q experience.
Each program written in python was tested first on the local simulator (8192 runs), then on the ibmqx4 (1 run). From the OPENQASM listing obtained for the ibmqx4 pilot experiment, a modified listing adapted to the Composer was obtained by going through an editing phase in Microsoft Words. This version was then pasted into the QASM editor of the Composer. The partitions (FIG5) corresponding to this modified program were inspected to ensure the presence of adequate barriers between the H gates following each other. 





FIG5. Two-qubit to five-qubit W-state circuits




Once a correct program was established and confirmed on the local simulator (FIG6), an experiment of 8192 runs was performed on the ibmqx4  and this using the QUISkit platform as well as the Composer.

FIG 6. Histograms obtained using QISKit SDK python program with the local_qasm_simulator as backend



Results:

An overview of the results obtained using the QISKit SDK python programs on the real quantum computer is presented in FIG7.



FIG7. Histograms obtained using QISKit SDK python program with the ibmqx4 as backend
For the circuits  |W2⟩ to |W4⟩, the predominance in terms of frequency of the results compatible with a W state is obvious.
For  the |W5⟩ circuit, the highest frequency observed is for the non-compatible result c5=00000 but the three following results in terms of frequency are : 10000, 00100 and 01000, all compatible with a W state. The two remaining compatible results 00001 and 00010 are more rarely observed.


FIG8 shows the histograms obtained for the circuits |W2⟩ to  |W5⟩ using the Composer on the ibmqx4.







FIG8. Histograms (8192 runs) for |W2 ⟩ to  |W5 ⟩ on the ibmqx4 real computer. The orange bars correspond to the measurements compatible with a W state, and the blue bars correspond to the non-compatible measurements.


The predominance of the results compatible with a W state is again obvious for the circuits |W2⟩ and |W3⟩. For |W4⟩ however, the non-compatible c4=0000 result seizes the fourth position and the compatible result 0010 passes in fifth position in the order of the observed frequencies.

For the |W5 ⟩ circuit, the highest frequency observed is for the compatible result c5=00100. The non-compatible result 00000 is in second position, followed by the compatible results 10000 and 01000. Although absent from the leading pack, the compatible results 00001 and 00010 rank among the top nine in terms of frequency.


An estimation of the classical fidelity was obtained by calculating the Bhattacharyya coefficients for the measurement performed by running circuits |W2⟩ to  |W5⟩ (FIG9).

FIG9 Estimation of the classical fidelity

Discussion:

As might be expected, the frequency of the results compatible with a state  |Wn⟩ decreases as a function of n. One obvious cause is the increase in the number of gates. For an ideal quantum computer, where all the qubits are connected together bidirectionally, the number of cNOT gates, Ry gates and H gates increases linearly for the operators Tk, while for the operators Bk, the number of cNOT gates which are their only constituents increases in a quadratic way, following the triangular numbers sequence. It follows that the total of the cNOT gates of a circuit creating  |Wn ⟩ will be: ½(n² + n) - 1 in such an ideal machine.
For a real computer, it is necessary to add the number of  cNOT and H gates constituting the reverse cNOT gates and the necessary swappings. For the ibmqx4, for example, these additional gates are visualized in the diagram of FIG4.
Another cause of error may be the interval between successive values of πœƒk which decreases significantly as n increases, as can be calculated according to eq.3. The equivalent for an optical setup of this possible experimental imperfection was already pointed out by Diker [3], who mentioned that a small change of the angle of a single half-wave plate can lead to failure to creation process.
It must also be taken into account that the experiments reported here were performed on a superconducting quantum computing system using transmon qubits in ground and excited states, while those proposed in ref.[3] are planned for an optical system using a source of photons horizontally and vertically polarized. This makes any comparison of expected or observed error rates between the two approaches highly questionable.

Conclusion:

The deterministic creation of W states up to five qubits has been demonstrated here experimentally on a real superconducting quantum computing system.

The Matrioshka doll-like nesting box algorithm proposed by Firat Diker appears to be both relatively simple and powerful.

However the algorithmic power mounts against a limit for the number of involved qubits. This is  probably due mainly to the quadratic growth of the number of gates necessary to constitute multi-entanglement circuits concerning more and more qubits, but also to the need for y-rotations less and less distinguishable from each other.

There is good chance that such an algorithm will find its place during the development of quantum computers, for the transmission and preservation of data in particular, but also in quantum cryptography.

Some features of this working algorithm, e.g. the fact that it is nested and also that the amount of components grows according to the triangular numbers sequence opens the way to an intriguing assumption: some natural structures could be a spontaneous source of W states, in particular among heterostructures made of crystalline material or even highly complex structures encountered in living organisms.

References:

[1] W. DΓΌr, G. Vidal, and J. I. Cirac, Physical Review A 62, 062314+ (2000), ISSN 1050-2947, quant-ph/0005115, URL http://dx.doi.org/10.1103/physreva.62.062314.
[2] Z. Zhao, Y.-A. Chen, A.-N. Zhang, T. Yang, H. Briegel, and J.-W. Pan, Nature 430, 54 (2004), ISSN 0028-0836, quant-ph/0402096, URL http://dx.doi.org/10.1038/nature02643.
[3] F. Diker, Deterministic construction of arbitrary w states with quadratically increasing number of two-qubit gates (2016), 1606.09290, URL http://arxiv.org/abs/1606.09290.



I acknowledge use of the IBM Quantum Experience for the works presented here. The views expressed are those of the author and do not reflect the official policy or position of IBM or the IBM Quantum Experience team.

Comments