No-go theorem for passive single-rail linear optical quantum computing.

Photonic quantum systems are among the most promising architectures for quantum computers. It is well known that for dual-rail photons effective non-linearities and near-deterministic non-trivial two-qubit gates can be achieved via the measurement process and by introducing ancillary photons. While in principle this opens a legitimate path to scalable linear optical quantum computing, the technical requirements are still very challenging and thus other optical encodings are being actively investigated. One of the alternatives is to use single-rail encoded photons, where entangled states can be deterministically generated. Here we prove that even for such systems universal optical quantum computing using only passive optical elements such as beam splitters and phase shifters is not possible. This no-go theorem proves that photon bunching cannot be passively suppressed even when extra ancilla modes and arbitrary number of photons are used. Our result provides useful guidance for the design of optical quantum computers.

Optical implementations of qubits have played an important role in quantum information science12. Photons exhibit an intrinsic lack of decoherence and are simple to control by standard off-the-shelf components. Furthermore, photonic qubits for quantum computation are particularly attractive because they can be used to interface to various quantum communication applications3. Due to the extremely small photon-photon coupling available in existing materials, it was at one point believed that optical qubits could not be used for scalable quantum computation. However, it is now understood that the process of photon detection itself can lead to effective photon-photon nonlinearities. In particular Knill, Laflamme, and Milburn (KLM)4 launched the field of linear optics quantum computing (LOQC) by showing that deterministic single-photon sources and high-efficiency single-photon detectors allow the realization of scalable, probabilistic quantum computation purely with linear optical elements. This holds in spite of the fact that using linear optics alone, the success probability of the nonlinear sign shift gate used in the KLM scheme cannot be improved above 1/456. Since the original KLM proposal, a number of authors have suggested various simplifications, modifications, and optimizations78910. Although these results formally show that scalable quantum computing is possible, the realization is very demanding in practice due to the large resource overhead arising from the required non-deterministic photon detection events. This becomes particularly apparent when considering beamsplitter-based two-photon gates, which are probabilistic in nature. In fact all optical two-qubit gates11, including the promising nondestructive CNOT gate1213, fail in the case where more than one photon is emitted into the same optical output mode, due to photon bunching. One proposal to actively suppress such gate failure events in the polarization encoding uses the quantum Zeno effect, by coupling to the output light fields to atomic transitions1415.

While the previous discussion concerned mostly dual-rail qubits, less is known about single-rail photonic qubits. Here we address the natural question of whether linear optical elements alone can be used to establish quantum interference such that the photon-bunching effect, and thus the probability of gate failure, can be eliminated for the case of single-rail encoding. We show that this cannot be achieved in the sense that one cannot simultaneously and deterministically implement a linear optical two-photon entangling gate and decouple the double-occupancy states (in this work we are not concerned with single-photon nonlocality16). We thus prove a no-go theorem for photon bunching suppression via all-unitary linear optics. Our result is complementary to the recent proof that the single-photon fraction in any of the single-mode states resulting from purely linear optical processing (even including conditioning on results of detections) cannot be made to exceed the efficiency of the best available photon source17. We stress that our proof applies in the setting of deterministic LOQC; we do not address the possibility of simultaneously optimizing the suppression of photon bunching and the success probability of LOQC gates in the single-rail setting. Nor do we address here what may be gained by adding measurements or other non-unitary operations18.

Results

Problem formulation

In the standard circuit model of quantum computing any unitary transformation on n qubits can be decomposed as a product of gates, each of which acts nontrivially on at most two qubits, and is the identity on the other qubits19. Likewise, in the linear optics model, any unitary transformation on M modes can be decomposed into a product of “linear optical elements,” each of which acts nontrivially on at most two modes, and is the identity on the other M – 2 modes2021. As linear optical operations we consider just passive elements, in particular phase shifters and beam splitters, as they generate all linear optical elements [i.e., all 2 × 2 unitaries, the group U(2)] when acting on the same pair of modes. Moreover, when they are allowed to act on overlapping pairs of modes, the linear optical elements generate all M × M unitaries [i.e., the group U(M)]20.

Single photon optical qubits come primarily in two varieties: single-rail2223, where a qubit is represented by the absence or presence of a single photon of fixed polarization in one optical mode, and dual-rail19, where each qubit is encoded into the presence of a single photon in one or the other of two spatial optical modes. Polarization qubits24—where each qubit is represented by two orthogonal polarization modes—are formally equivalent to dual-rail qubits11, so we will use both interchangeably (see Figure 1). Most LOQC proposals, including the original KLM scheme, use dual-rail qubits, but there is considerable interest in the single-rail encoding scheme as well, as evidenced by the numerous experiments devoted to preparation of arbitrary states of single-rail qubits2526272829. In the dual-rail encoding single-qubit operations are straightforward while non-trivial two-qubits are challenging and are implemented probabilistically4. The reverse is true for single-rail encoding: it is easy to generate two-qubit entanglement deterministically, while single-qubit gates can be implemented probabilistically30. In both the single and dual-rail encodings two-qubit gate failure due to photon bunching is a major challenge standing in the way of scalability. Let us next explain this in more detail.

Figure 1

Encoding of optical qubits.

(a) Single-rail encoded qubits are represented by the absence or presence of a single photon of fixed polarization in one optical mode. This encoding allows for the deterministic generation of entangled states, but with the caveat that single-qubit gates can only be achieved probabilistically. (b) Dual-rail encoded qubits are represented by the presence of a single photon in one or the other of two spatial optical modes. Formally, polarization-encoded qubits are equivalent to the dual-rail encoding due to the basis comprising two orthogonal polarization modes, e.g., by defining |1〉|0〉 = |H〉 and |0〉|1〉 = |V〉 where |H〉 and |V〉 corresponds to a horizontally and vertically polarized photon state, respectively.

The subspace of interest in the single-rail encoding is spanned by the 6-dimensional Fock state basis where

Here |0〉 is the global vacuum, , a, and n are the creation, annihilation, and number operator for mode i, respectively, satisfying the standard bosonic commutation relations. The subspace is spanned by the computational basis of single-photon states in each of the two modes, while is the subspace of “bunched” two photon states in either one of the two modes (double-occupation states). The latter are the problematic states causing computational errors in the single-rail encoding.

To define a basis for the polarization (i.e., dual rail) encoding consider the creation operators , where i ∈ {1, 2} is the spatial mode index, p ∈ {H, V} is the polarization mode index, and all commute for all values of i and p. The ith qubit basis states are then and , so that the computational and double-occupation (error) subspaces are, respectively,

It is well known that linear optics is insufficient for generating non-trivial (entangling) two-qubit gates in the dual-rail encoding. Indeed, this, together with the inherent weakness of nonlinear photonic interactions such as the Kerr effect, is the raison d'être of the KLM scheme. The reason is a straightforward group-theoretic counting argument. Consider m = 2K optical modes. If dual-rail linear optics could generate an entangling gate between one pair of qubits, which could then be swapped to all other pairs of qubits using beam splitters, the set of linear optical elements would generate the group U(2). However, this contradicts the fact that the set of linear optical elements can only generate U(2K)2031. This means that it is impossible to generate an entangling gate in the subspace , irrespective of what happens in . Another perspective on this is offered by results showing the unfeasibility of a linear optics Bell state analyzer, which rule out the implementation of a deterministic CNOT gate using dual-rail qubits3233. However, these arguments cannot be applied in the single-rail case where a beam splitter suffices to generate two-qubit entanglement in the subspace . Since we are concerned in this work with deterministic gates we shall not consider the possibility of photon-bunching suppression and concurrent enhancement of the success probability of two-qubit gates in the dual-rail case. Instead, we devote the remainder of this work to the no-go theorem for deterministic gates in the single-rail case.

No-go theorem for two modes

We now proceed to prove the following no-go theorem: it is not possible to implement a deterministic entangling gate between two single-rail qubits while at the same time removing the “bunched” two-photon states using only linear optics. In this section we assume that only two photons in two modes are used; in the following section we allow for an arbitrary number of photons and modes.

The Hermitian beam-splitter generator is and the Hermitian phase shifter generators are, for each mode, Let us also define Then it is easily checked using the identities in the Methods section that the set of Hermitian operators {X, Y, Z} is closed under commutation and moreover satisfies su(2) commutation relations. Therefore the beam-splitter generator X and the phase shifter generators (combined as Z) generate U(2). The most general unitary evolution operator we can then construct according to the Euler decomposition is the following composite gate: where we have allowed a more general linear combination of the two phase shifter generators than Z, since they can be independently tuned.

We are interested in the (reducible) representation of the unitary operator (6) in the 6-dimensional Fock state basis . We shall now show that if one demands that U does not couple and , then without further assumptions it is not possible to implement an entangling gate between the two single-rail qubits. In the basis we have where diag denotes a diagonal matrix and where Note that consists of three blocks (1, A2, and B2) of dimensions 1 (vacuum), 2 (one photon), and 3 (two photons), respectively. Therefore repeated applications of the composite gate U with different values for the angles α, β, γ, δ, will still have the same triple block structure. Hence our construction is general in the sense that we need only consider a single composite gate U.

Now, the problem is that the two-photon block includes . We would like to decouple these two states from the other four. Clearly, this can be done by setting the matrix elements U4,5, U4,6, U5,4 and U6,4 [i.e., the (1, 2), (1, 3), (2, 1), (3, 1) elements of B2] to zero. As is clear from Eq. (8), a necessary and sufficient condition for this is This is achieved whenever is an integer multiple of π/2. If we pick an even multiple 2n of π/2 we have If we pick an odd multiple 2n + 1 of π/2 we have where

In both cases U has a block-diagonal structure where the two-photons per mode states are decoupled from the other four states. Considering just the 4-dimensional block acting on span, we have for the even case i.e., a tensor product of two single-qubit phase gates. Similarly, for the odd case we have where , a non-entangling gate. Unfortunately this means that, having decoupled span, the action of U on the subspace is equivalent to a tensor product of two single-qubit phase gates, and therefore is no longer entangling.

The reason for this no-go result is straightforward: we are forced to set equal to a multiple of π/2 in order to prevent coupling to the span subspace. Once we do this we are left with only four independent parameters (α, β, γ, δ), which are the parameters of the two phase shifters [see Eq. (6)]. The latter can only generate phase gates. To circumvent this result would require the use of some type of nonlinear optical element (see Figure 2).

Figure 2

Two-qubit operations for single-rail encoded qubits.

(a) Only the restricted set of trivial two-qubit gates prohibits photon-bunching. (b) When using non-trivial two-qubit gates, such as the control-NOT or control-Phase gate, photon-bunching cannot be avoided and thus leads to gate errors or probabilistic success rates.

No-go theorem for M > 2 modes

One might wonder whether the inclusion of additional modes and photons allows to circumvent the no-go theorem. In this section we show that this is not the case.

Consider a linear optical system with M modes containing an arbitrary number of photons, of which only two modes–supporting two qubits–are the target of linear optical quantum computation. We therefore refer to these two modes as the “computational modes.” Clearly the choice of which two modes are identified as the computational modes is immaterial, so that without loss of generality we use the first two modes to this end. The computational basis still comprises only those states having either zero or one photons per mode in the first two modes, except that now an arbitrary number of photons is allowed in the ancillary modes 3, …, M. , where the occupation numbers are arbitrary. Then the computational basis states are the set . The basis set for the problematic subspace of bunched states is now . We assume that the photonic system is initialized in span. Furthermore, we assume that the initial state is a product state between the computational and ancilla modes, i.e., there is no initial entanglement between these two set of modes. Our proof does not apply otherwise, so that initialization errors are outside of the scope of this work and will have to be dealt with by other means.

Now let V be some arbitrary passive linear unitary optical transformation on all, or some subset, of the M modes. For example, V could be a product of phase shifters and beam splitters coupling any pair of modes. Its most general form is an arbitrary element of U(M)20. The operator V replaces U [Eq. (6)] from our earlier two-mode discussion, and we shall show that even it cannot be used to decouple the computational basis states from the bunched states while simultaneously implementing an arbitrary unitary transformation on the computational modes. V has the following unitary representation in terms of the matrix v = {v}, in the basis of bosonic creation operators (see Methods): Note that V commutes with the number operator, i.e., its only non-vanishing matrix elements are between Fock states with equal occupation numbers. Note also that if we write V = exp(iΩ) where , then Ω|0〉 = 0 due to the annihilation operator a, so that V|0〉 = |0〉, and hence 〈0|V|0〉 = 1.

At first sight it might appear that the inclusion of ancilla modes could be useful. For example, one might hope that the bunched state |200〉 (for M = 3) can be transformed into the computational state |002〉, where the two photons have been transferred to the ancilla mode. However, this approach fails for passive all-unitary linear optics. The reason is that we must rule out the reverse process, i.e., we must impose the following necessary “don't cause errors” condition:

V cannot transfer any photons from the ancillary modes into the computational modes in a manner which transforms a valid computational basis state into a bunched state.

For example, V is not allowed to take the computational basis state to (ignoring normalization). Thus, we impose the necessary conditions for all i ∈ {3, …, M}

Then, where to arrive at (18b) we used Eq. (16), and to arrive at (18c) we used V|0〉 = |0〉 along with the standard bosonic commutation relations, and to arrive at (18d) we used the fact that both sums in (18c) vanish due to . We can thus conclude that v1 must vanish for all i ∈ {3, …, M}. After we impose the additional necessary condition , we find that v2 must vanish for all i ∈ {3, …, M}. In addition, it follows from unitarity of v that then also v1 and v2 must vanish for all i ∈ {3, …, M} (see Methods). That is, we have proved that the “don't cause errors” condition implies that v has a block-diagonal structure: where v is a 2 × 2 block (over the computational modes i, j ∈ {1, 2}) and v is an (M – 2) × (M – 2) block (over the ancilla modes i, j ∈ {3, …, M}). This, in turn, can be interpreted as “don't couple”. It states that, subject to the “don't cause errors” condition, V cannot couple the computational and ancilla modes, and in particular cannot cause photons to leak from the ancilla modes into the computational, or vice versa. For example, V cannot couple the two computational basis states |001〉 and |100〉 (M = 3). It is conceptually clear that this implies that nothing is gained by the introduction of the ancilla modes. However, let us provide a formal proof as well.

Assume, as before, that the system is initially in a factorized state between the computational and ancilla modes: , where F and G are arbitrary polynomials in the creation operators, e.g., , where are arbitrary coefficients. Note that because of the block-diagonal structure of v it follows that where F′ is a new polynomial. Here the key point is that the ancilla modes do not appear in F′. A similar calculation reveals that , where G′ is a new polynomial. Therefore the action of V on an arbitrary factorized initial state is For the computational modes this is equivalent to , where the no-go theorem for M = 2 holds.

Discussion

We have shown that using linear optics alone it is not possible to cancel the photon bunching effect while at the same time implementing a deterministic universal set of logic gates using single-rail photonic qubits. In spirit our result agrees with previous theoretical work concerning the dual-rail encoding case43233, showing that passive linear optics does not involve particle interactions other than those imposed by statistics, and can be understood in terms of classical wave mechanics. One approach is to then consider additional nonlinear operations such as photon-detection or absorption14, the Kerr effect, or light squeezing, in order to enable universal linear optical quantum computing. However, our work leaves open the possibility that a more general analysis than we have considered here, in particular one which accounts for the possibility of a probabilistic enhancement (or even optimization) of both photon-bunching suppression and linear optical gate fidelity, might circumvent our no-go theorem. Nor did we consider measurements of the ancilla modes or other non-unitary transformations. For example, one might consider a non-unitary transformation with maps the bunched state |200〉 (on a total of three modes) to the computational basis state |002〉, without at the same time mapping |002〉 back into the computational subspace. In this sense the results presented here are thus a starting point for a study of the use of additional resources in linear optics quantum computing using single-rail qubits.

Methods

Unitary representation of V in the creation operator basis

To prove that the representation of V in Eq. (16) is unitary one can use the standard bosonic commutation relations along with the Baker-Hausdorff formula where [] : = [A, [−1A, B]] and [1A, B] ≡ [A, B], for arbitrary operators A and B, and , to establish that v = e, where θ = {θ} is the orthogonal matrix of angles appearing in Eq. (15). Indeed, setting α = i, , and using the identity , we have: etc., so that . Thus so that v = [e], whence v = e as claimed.

Proof that “don't cause errors” implies “don't couple”

Consider a unitary matrix v with the block structure where x and z are square and y can be rectangular. The unitarity condition v†v = I yields so that x†x = I and x†y = 0. By unitarity of v the matrix X cannot be zero, so x−1 = x† and hence also xx† = I. Thus xx†y = y = 0. In the context of our proof in the last section, we showed that the “don't cause errors” condition implies that both v1 = v2 = 0 for all i ∈ {3, …, M}. This is the 0 block in Eq. (25). The vanishing of the y block then implies that also v1 = v2 = 0 for all i ∈ {3, …, M}, which is the “don't couple” result.

Author Contributions

All authors contributed equally.