CONSTRUCTING 2D and 3D CLUSTER STATES WITH PHOTONIC MODULES

CONSTRUCTING 2D and 3D CLUSTER STATES WITH PHOTONIC MODULES

RADU IONICIOIU    WILLIAM J. MUNRO
Abstract

Large scale quantum information processing (QIP) and distributed quantum computation require the ability to perform entangling operations on a large number of qubits. We describe a new photonic module which prepares, deterministically, photonic cluster states using an atom in a cavity as an ancilla. Based on this module we design a network for constructing 2D cluster states and then we extend the architecture to 3D topological cluster states. Advantages of our design include a passive switching mechanism and the possibility of using global control pulses for the atoms in the cavity. The architecture described here is well suited for integrated photonic circuits on a chip and could be used as a basis of a future quantum optical processor or in a quantum repeater node.

Received Day Month Year

Revised Day Month Year

Keywords: Quantum computation; cluster states; photonic modules.

1 Introduction

Cluster state quantum computation has become recently an attractive alternative to the standard quantum network model, especially in the context of optical quantum computing. There are several advantages of using photonic qubits, including low decoherence, free-space propagation, availability of efficient single qubit gates and the prospect of miniaturization using optical silicon circuits. Cluster states with four and six photons have been experimentally prepared and characterized. Recently an 8-qubit photonic cluster state has been demonstrated in the context of topological quantum error correction.

In order to be useful in quantum algorithms, we need to scale up these promising results to clusters containing tens to hundreds of encoded qubits. One of the present roadblocks towards this goal is the probabilistic nature (which implies postselection) of all the above schemes. Although linear optics schemes (like the KLM model) are in theory scalable and universal, they require single photon sources, photon number discriminating detectors, post-selection, fast feed-forward and quantum memories – all these put severe experimental constraints. A possible solution to this problem is to have a deterministic architecture which avoids most of the aforementioned issues and can be easily scaled up.

The photonic module concept has been successful in showing how large cluster states can be prepared deterministically using a standard building block – an atom in a cavity – and classical switching. The atom in the cavity plays the role of an ancilla and provides the strong interaction required to couple the photons (the computational qubits). At this stage it is important to explore several designs in order to quantify resource requirements. Indeed, each particular architecture will involve complex trade-offs between design simplicity, total number of elementary operations and their accuracy plus other technological constraints (fabrication methods, operating environment etc).

Motivated by these considerations, in this article we explore an alternative architecture for constructing photonic cluster states with photonic modules. The original photonic module functions as a parity gate – given photons as input, it performs a nondestructive parity measurement on the arbitrary photonic state. This operation determines the blueprint of the optical circuit in terms of the number of layers and connectivity of basic building blocks, switching sequence, rerouting etc. In this article we examine an alternative photonic module build around the controlled- gate instead of the parity gate and see how the design changes with this choice.

The structure of the article is as follows. In Section 2 we begin by discussing the two main approaches for building cluster states, using either stabilizer/parity measurements or controlled- operations. These two paths lead to different photonic modules which we will call, respectively, the parity module and the module. In Section 3 we explore a new network design of a photonic circuit build around the module and we show how changing the fundamental entangling gate leads to a simplified circuit design for preparing a 2D cluster state. In Section 4 we introduce a passive switching mechanism and the corresponding network design. In Section 5 we describe how our scheme can be generalized to construct a 3D topological cluster state.

2 Cluster states and photonic modules: two approaches

At the core of the photonic module is the interaction between a photon and an atom in a cavity. In the model we are considering here the photons play the role of the computational qubits and the atom in the cavity serves as an ancilla mediating the coupling between the photons. As in the original photonic module concept, we assume the photon-atom interaction to perform a gate between the photonic (computational) and atomic (ancillary) degrees of freedom. This gate is then sufficient to entangle the photonic qubits, as we will discuss in the following.

There are two ways of describing a cluster state and each description provides a different way of preparing the state in the lab. First, we can view the cluster state as a stabilizer state, hence we can prepare it by measuring stabilizer operators, one for each qubit/vertex. The stabilizer operator of vertex is , where are the Pauli operators of a vertex and the product is over all nearest neighbours; thus for a 2D cluster state each stabilizer involves at most five photons. This is the approach taken in Refs. ?, ? where a cluster state (two- or three-dimensional) is prepared by sending unentangled photons through an array of parity modules (or -modules). A -module consists of a cavity with an atom in the center and performs a nondestructive parity measurement on the photons, i.e., it projects the initial photonic state onto even (odd) parity states. To prepare a 2D cluster state each photon has to pass through five cavities (for a 3D cluster state this number is four). The architecture of the full circuit is rather complex, consisting of several layers of photonic modules and routing switches directing the photons in and out of the cavities.

In the second description the cluster state is prepared in two steps: (a) all qubits are initialized in the state , with ; (b) a controlled- operation is applied to each pair of qubits sharing a link in the underlying graph : .

Fig. 1: (a)-(d): equivalent quantum networks for a controlled gate acting on qubits . Since the ancilla starts in the state, the SWAP gates in (b) are reduced to a pair of CNOT gates as in (c). In (d), the second CNOT in (c) (disentangling the ancilla) can be replaced by a measurement of the ancilla in the Fourier basis followed by a postprocessing gate on the first qubit.

This puts into perspective the difference between the two approaches – in the first one the central resource is the parity gate, whereas in the second the gate. For photons measuring parity is in general easier than performing a gate. As photons do not interact directly, the usual way to perform a deterministic controlled- gate between the two photons is to use an ancilla (e.g., an atom in a cavity) coupled to both, as in Fig. 1. The well-known solution is to first swap the first qubit and the ancilla, perform the gate between the ancilla and the second qubit, and then swap back the ancilla and the first qubit; if the ancilla is prepared in the state, this sequence requires only two CNOT gates and one gate, as in Fig. 1 (a)-(c). This procedure has been used to entangle two photons (the qubits) using an atom in a cavity (the ancilla). The problem with this scheme is that the first photon has to interact twice with the cavity, first to entangle and subsequently to disentangle it from the ancilla, Fig. 1(c). This requires a photonic buffer to store the first photon until the appropriate time and then redirect it to the cavity, increasing the complexity. For this the reason the parity module was prefered as the central building block in previous schemes for constructing 2D and 3D photonic cluster states.

In this article we focus on the second approach of preparing a cluster state and use the gate as the main resource – we call this the module. The first step is to notice that the second CNOT gate in Fig. 1(c) is not necessary, and that we can disentangle the first photon and the ancilla by measuring the ancilla in the basis, Fig. 1(d). Let’s see how the quantum network in Fig. 1(d) works. After the first two gates, CNOT and , the initial state is transformed to . In order to disentangle the ancilla from the control qubit, we apply a Hadamard and then measure the ancilla; the previous state is first transformed to (after ) and then to (after measurement, assuming the result is ). The extra phase is then removed by applying to the first qubit a feed-forward , such that the network in Fig. 1(d) performs the following transformation

(1)

thus proving the circuit to be equivalent to a between and . Note that is an arbitrary state of qubits/qudits. Since and gates commute, we can apply the corrective action at the very end of the cluster state preparation, further simplifying the network.

Fig. 2: Two types of photonic modules implementing: (i) a gate, (ii) a parity gate. The qubits are photons, each interacting with an atom in a cavity ancilla (middle) initialized in the state. A postprocessing gate is applied to the first qubit depending on the result of the measurement. In the case of the module the corrective gate can be applied at the end of the cluster state preparation since commutes with subsequent gates.

Fig. 2 shows the difference between the module and the parity module, as discussed above. The difference between the two is minimal – only a Hadamard gate on the ancilla after the first qubit interaction. However, this minimal modification leads to a simplified circuit implementing a cluster state, as we will describe next.

3 Building a 2D cluster: circuit design

In this section we show how to use the module described above to build a 2D square lattice cluster state. As this state is a universal resource for quantum computation one can used it to perform an arbitrary quantum algorithm.

Fig. 3: Left: Building a 2D photonic cluster state. Photons (red dots) enter from the left, prepared in the state. Each photons passes through two and two modules. The applies a gate between a photon and its left/right (top/bottom) neighbours; these are indicated by black lines in the final cluster state. Right: The modules can be implemented as -switched cavities. The module has also two active switches which redirect the photons to the central cavity area and then back to their rails after interaction. The two switches are synchronous and can be controlled by a single flip-flop circuit.

Fig. 4: Time sequence of the action performed by two modules. The first (second) module applies a gate between photon pairs and , respectively. The result is a linear cluster state which is then passed to modules to complete the 2D structure by adding the vertical links between qubits. are Hadamard gates, see Fig.2(i).

Each node (qubit) in a square lattice has four neighbours so we need to apply four gates to each photon. The circuit architecture is shown in Fig. 3. Photons are prepared in the state and pass through two and two modules. The temporal delay between photons on the same line is ; photons on adjacent lines of the cluster are delayed by half period in order to avoid them arriving simultaneously at the interaction region. We assume that is large enough such that the full cycle of operations of the cavity atom, between initialization and measurement, is contained within . Each module contains an atom in a cavity. The modules act on the same line and apply a gate between a given photon and its left and right neighbours. In Fig. 4 we show a time sequence of this action. The modules perform the same function between photons on different lines, hence they contain two switches to direct the photons from, and respectively back to, their rails before and after interacting with the cavity. The two switches are synchronous (there are both up or down at the same time) and can be controlled by a single flip-flop circuit.

Let’s see now what are the resource requirements to prepare a cluster state, with the horizontal dimension of the cluster, equal to the number of time steps. For each horizontal line we need two and one modules, hence the total number of and modules is, respectively, and (the -1 comes from boundary effects). Each edge in the cluster involves a measurement of the atom in the cavity, hence the total number of measurements is .

4 Passive switching

As we discussed before, the network in Fig. 3 uses active switching in the modules. Although this can be implemented by a classical flip-flop (since both switches are synchronous), it requires external pulses and additional wiring, adding an extra layer of complexity. In this section we show how this classical routing can be eliminated completely by using passive switching.

Suppose the photons have an additional, non-computational, degree of freedom. We call it a ’tag’ and for our purpose it is sufficient that it takes only two values. In order to have a passive switch, we need two conditions: (i) the atom-photon interaction is independent of and does not change this degree of freedom (i.e., it preserves the value of the tag) and (ii) there is a simple passive device which routes the photons according to their tag: say 0 on upper path and 1 on the lower path; equivalently, it reflects photons with tag 0 and transmits photons with tag 1. Conceptually, the network in Fig. 3 can be described in the same framework: the photon time bin is the tag (remember photons on neighbouring rails are temporally offset) and the switch is the flip-flop, directing each photon according to their time stamp (but in this case the flip-flop does not qualify as ’passive’).

The typical example we will use in the following is the polarization degree of freedom and a polarizing beam splitter (PBS): the PBS transmits - and reflects -polarized photons. Another example is a dichroic mirror which reflects, e.g., green photons and transmits red ones (however in this case it is difficult to engineer the atom-photon interaction such that the cavity is insensitive to photons’ colour). A third example is orbital angular momentum and holographic plates which transmit/reflect photons according to their orbital angular momentum. Of course, one can imagine various implementations of this scheme using other degrees of freedom.

Fig. 5: Left: Passive switching architecture for a 2D photonic cluster state. We show only the 1-rails of a dual rail encoding. Photons have an extra degree of freedom (tag) which is orthogonal for nearest-neighbours. If this tag is the polarization, photons are either - or - polarized (red and green, respectively). Assuming the atom-photon interaction is polarization preserving, switching in modules can be done passively with polarization beam splitters (PBS). Right: An alternative way of constructing the modules by reflecting a photon from a cavity using a circulator ; this construction, due to Duan and Kimble, eliminates -switching of the cavities.

In the following we use the polarization as a tag and the PBS as a passive switch. This requires two things. First, we need to use a mode (i.e., path encoded) qubit as the computational one. Second, the atom-photon interaction should be polarization preserving; an example of such interaction is , with the total number of photons.

Using path encoding qubits implies the photonic chip has to be placed between two beam-splitters in the 1-arm of a Mach-Zehnder interferometer. In Fig. 5 we show the new architecture of the chip – note that only the 1-rails in the dual rail encoding are shown; the 0-rails are situated in a parallel plane of the chip. The operations are identical to the ones described before. The only difference is switching in the modules which is done passively by the PBSs. Since in this architecture all classical routing is done passively (i.e., without external control), the only control signals are build in modules, as modules are nothing but plus two switches, see Fig. 5.

It is worth mentioning another feature of this design. The modules in the two (vertical) layers containing the modules are synchronized so the control signals for the cavities (initialization, Hadamard gates) can be done by a global control pulse applied to all modules. The only step in which individual control is still needed is the final readout of the cavities at the end of the gate (see Fig. 2(i)). One can still have a global readout pulse, provided each module has a local 1-bit memory which stores the measurement result of each cavity. With an appropriate design (we need to take into account the offset between green and red photons) one can envisage global control of all modules in the optical chip. In this case we can eliminate the individual control lines for each module; this becomes especially important in a 3D layout (see next section), when addressing a particular module buried inside the chip is difficult.

One can think of two different designs for implementing the gate between the atom and the photon. The first uses a -switched cavity, as in Fig. 3: photons enter the cavity through the left, interact with the atom and then are -switched out to the right. The second employs the scheme of Duan and Kimble – photons are reflected from the cavity (the lower mirror is partially reflective) and exit through the same port (Fig. 5, right). In this case an optical circulator redirects the photons to the exit rail. As a consequence, in this variant of the design we eliminate both the classical routing and the -switching of the cavities.

5 Preparing a 3D topological cluster state

Topological cluster state computation pioneered by Raussendorf, Harrington and Goyal has attracted recently considerable interest as a fault-tolerant architecture for constructing photonic cluster states. Here we briefly discuss how to adapt the previous 2D network design to a 3D setup.

Fig. 6: Starting with a regular cubic lattice (left), we construct the 3D topological code (right) by removing the blue photons together with all their links.

The 3D topological cluster state can be constructed from a regular cubic lattice (Fig. 6, left) by removing the blue qubits together with all their links, as in Fig. 6, right. One way of doing this is to construct first a 3D cubic cluster state and subsequently measure the blue qubits in the basis. The measurement eliminates the blue photons and their links from the lattice, but is not efficient since it involves feed-forward (we have to take into account the result of the measurement).

A better way of obtaining the same result is the following. Suppose we have photonic module which prepares a regular cubic cluster state. We can extend the 2D module described in the last section in a straightforward way to a 3D geometry by adding two extra layers of modules in order to couple each photon to its nearest neighbours along the third spatial direction, orthogonal to the -plane, as in Fig. 7. However, instead of eliminating the blue photons by measurement after the photonic modules, we remove the blue photons at the injection stage, i.e., we run the photonic module with some of the photons missing. Thus the photon sources injecting the green photons run at half the frequency of the sources injecting the red photons, as in Fig. 7. Moreover, since the green photons don’t have links with other green photons, we can eliminate completely the modules on the green lines. Each green photon will pass through four modules, two for the links in the -plan and the other two for the links in the -plan. The red photons pass thorough six modules, two for each spatial direction, in a straightforward generalization of the 2D case. However, since now half of the green photons are missing, each red photon will have only four links: two links in the direction (always) and another two with the green photons, either along or axis. The resulting state (Fig. 6, right) is exactly the 3D topological cluster state from Ref. ?. Once prepared, the 3D topological cluster state can be used as a universal, fault-tolerant resource for QIP.

Fig. 7: Left: network for a 3D topological cluster state, viewed in the -plane; photons flow along axis. The yellow modules are oriented in the plane and couple two adjacent photons in the direction. The green photons are doubly spaced compared to the red ones; note there are no modules on the green lines. Right: schematics of a 3D topological cluster state; each photon has only 4 links.

6 Conclusions

In this article we described a scheme for preparing large scale photonic cluster states with photonic modules. In our model we implement directly a gate between two photons using as an ancilla an atom in a cavity. Compared to the original photonic module design which uses a parity gate, this choice of entangling gate leads to a simplified architecture with fewer modules ( compared to for a 2D cluster, with the width of the cluster) and classical switching. Moreover, if the atom-photon interaction is polarization preserving there is no need for active switching at all. In this case one can have only passive switching, e.g., using polarising beam splitters and photons in neighbouring rails having orthogonal (H/V) polarization. This passive switching completely eliminates the need of an active switching mechanism synchronized with the photons, thus reducing the complexity and the associated decoherence. Another feature of the present design is the possibility of using global control of all modules in the optical chip. This becomes especially important in a 3D layout, when addressing a particular module buried inside the chip is difficult.

The model discussed here paves the way towards integrated photonic circuits on a chip as a basis for future quantum optical processors. Even with a small to medium number of photonic qubits available, such a chip will be useful as a quantum repeater or as an element in a future quantum internet architecture.

Acknowledgments

We acknowledge financial support from EU projects QAP and HIP and Japan MEXT.

References

  • 1. R. Raussendorf and H.J. Briegel, Phys. Rev. Lett. 86 (2001) 5188.
  • 2. H.J. Briegel, D.E. Browne, W. Dür, R. Raussendorf and M. Van den Nest, Nature Physics 5 (2009) 19.
  • 3. D. Deutsch, Proc. Roy. Soc. Lon. A 425 (1989) 73.
  • 4. M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, UK 2000).
  • 5. M.A. Nielsen, Phys. Rev. Lett. 93 (2004) 040503.
  • 6. D.E. Browne and T. Rudolf, Phys. Rev. Lett. 95 (2005) 010501.
  • 7. S.C. Benjamin, Phys. Rev. A 72 (2005) 056302.
  • 8. S.C. Benjamin, J. Eisert, and T.M. Stace, New J. Phys. 7 (2005) 195.
  • 9. K. Kieling, D. Gross, and J. Eisert, J. Opt. Soc. Am. B 24 (2007) 184.
  • 10. S.D. Barrett and P. Kok, Phys. Rev. A 71 (2005) 060310(R).
  • 11. Y.L. Lim, S.D. Barrett, A. Beige, P. Kok, and L.C. Kwek, Phys. Rev. A 73 (2006) 012304.
  • 12. P. Kok, W.J. Munro, K. Nemoto, T.C. Ralph, J.P. Dowling, G.J. Milburn, Rev. Mod. Phys. 79 (2007) 135.
  • 13. S.G.R. Louis, K. Nemoto, W.J. Munro and T.P. Spiller, New J. Phys. 9 (2007) 193.
  • 14. A. Politi, M.J. Cryan, J.G. Rarity, S. Yu, and J.L. O’Brien, Science 320 (2008) 646.
  • 15. P. Walther, K.J. Resch, T. Rudolph, E. Schenck, H. Weinfurter, V. Vedral, M. Aspelmeyer, P. Walther, A. Zeilinger, Nature 434 (2005) 169.
  • 16. C.-Y. Lu X.-Q. Zhou, O. Gühne, W.-B. Gao, J. Zhang, Z.-S. Yuan, A. Goebel, T. Yang, C.-Y. Lu, J.-W. Pan, Nature Physics 3 (2007) 91.
  • 17. W.-B. Gao, A.G. Fowler, R. Raussendorf, X.-C. Yao, H. Lu, P. Xu, C.-Y. Lu, C.-Z. Peng, Y. Deng, Z.-B. Chen, J.-W. Pan, arXiv:0905.1542.
  • 18. E. Knill, R. Laflamme, and G. Milburn, Nature 409 (2001) 46.
  • 19. C.-H.Su, A.D.Greentree, W.J.Munro, K.Nemoto, and L.C.L.Hollenberg, Phys. Rev. A 78 (2008) 062336.
  • 20. S.J. Devitt, A.D. Greentree, R.Ionicioiu, J.L. O’Brien, W.J. Munro, L.C.L. Hollenberg, Phys. Rev. A 76 (2007) 052312.
  • 21. A.M. Stephens, Z.W.E. Evans, S.J. Devitt, A.D. Greentree, A.G. Fowler, W.J.Munro, J.L.O’Brien, K. Nemoto, L.C.L.Hollenberg, Phys. Rev. A 78 (2008) 032318.
  • 22. S.J. Devitt, A.G. Fowler, A.M. Stephens, A.D. Greentree, L.C.L. Hollenberg, W.J. Munro, K. Nemoto, arXiv:0808.1782.
  • 23. S.J. Devitt, W.J. Munro, K. Nemoto, arXiv:0810.2444.
  • 24. E. Nagali, F. Sciarrino, F. De Martini, B. Piccirillo, E. Karimi, L. Marrucci, E. Santamato, arXiv:0902.0740.
  • 25. L.-M. Duan and H.J. Kimble, Phys. Rev. Lett. 92 (2004) 127902.
  • 26. R. Raussendorf, J. Harrington, and K. Goyal, Ann. Phys. 321 (2006) 2242.
  • 27. R. Raussendorf, J. Harrington, and K. Goyal, New J. Phys. 9 (2007) 199.
  • 28. L.-M. Duan, M.D. Lukin, J.I. Cirac, and P. Zoller, Nature 414 (2001) 413.
  • 29. L. Jiang, J.M. Taylor, K. Nemoto, W.J. Munro, R. Van Meter, M.D. Lukin, arXiv:0809.3629.
  • 30. W.J. Munro, R. Van Meter, S.G.R. Louis, K. Nemoto, Phys. Rev. Lett. 101 (2008) 040502.
  • 31. H.J. Kimble, Nature 453 (2008) 1023.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
112473
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description