# User:AKChapman/sandbox

# LOQC (complexity)

In computational complexity theory, **LOQC** (linear optics quantum computation) is the class of decision problems solvable in polynomial time by a computer that can efficiently sample from a probability distribution produced by a linear-optical quantum network - that is, an arrangement of beam splitters and phase shifters that preserves quantum coherence. Because photons cannot interact in this model, it is not believed to be universal for quantum or even classical computation. However, the question of whether or not simulation of this model is a classically tractable task remains open. For instance, it has been demonstrated^{[1]} that there exist problems within this class that a classical computer may not be able to solve efficiently, such as the additive approximation of permanents of matrices with complex-valued entries, which is known to be #P-complete. An affirmative answer to this question would thus imply a collapse of the polynomial hierarchy at the third level.^{[2]} Furthermore, thanks to a construction by Knill, Laflamme, and Milburn,^{[3]} it is known that this model with the additional freedom of postselection *is* equivalent to universal quantum computation (formally, **PostLOQC** = **BQP**). As a result, this class is of growing interest to the quantum information community, as it arguably represents the most experimentally realistic model of quantum computation to-date.

## Boson Sampling Model

When talking about linear optical networks, it is convenient to abstract away the individual photons' polarization degrees of freedom and instead only consider a model of non-interacting spin-less bosons. A network consists of an arrangement of beam splitters and phase shifters on modes, which may individually contain any number of bosons, though the total number of bosons in the network will remain fixed. To generate probability distributions, a configuration of bosons is input into the network, and the number of bosons in each mode is counted at the end. Running the circuit many times on the same input gives a probability distribution over the output photon number configurations.

The model is analogous^{[2]} to Galton's board, whereby balls are dropped onto an arrangement of pegs, at each of which the ball scatters randomly into one of two directions, generating a configuration of balls in the slots at the bottom. Here, the balls correspond to individual bosons, and the pegs correspond to optical elements. The problem of interest is encoded in the arrangement of pegs, and the output probability distribution is approximated by the configuration of balls at the bottom. There are however several crucial differences. The first is that the LOQC network is quantum, so each optical element coherently transfers a boson into a superposition of modes as opposed to sending it into one mode or the other. The second is that, in the LOQC model, we are allowed multiple input ports, as opposed to just one. Finally, the resulting probability distribution in the LOQC model is over the possible output *configurations* of bosons, whereas that in the Galton's board picture is over the possible slots in which the ball could end up. One run of the LOQC experiment - which may involve multiple bosons sent through the network simultaneously - thus corresponds to dropping just one ball through the Galton's board.

Formally, the Hilbert space of mode is spanned by the number states , etc. Beam splitters and phase shifters on the the joint state of all modes are generated by the following contributions to the Hamiltonian

where are the bosonic ladder operators on the th mode. Notice that both and conserve boson number. It is thus more convenient to consider the actions of unitaries on creation operators rather than directly on the state, as

where is the state with vacuum in each mode, and is another unitary matrix related to via homomorphism (see "Relationship to the permanent"), which acts on the set of modes as opposed to the the photon configuration states. The fact that conserves photon number is crucial here. To obtain the first equality, we used the fact that the only state with zero photons in each mode is , so , and the second equality comes from the fact that unitarily maps between different configurations with fixed total photon number. By inserting identities , we may generalize this to a configuration of bosons ( in the first mode, in the second mode, etc., such that ) as

That is, acts on each of the individual creation operators.

## Known Results

### Relationship to the Permanent

The permanent arises as a natural element of the homomorphism between the and the . Let , where , be a matrix of copies of the first row of , copies of the second row, etc., and copies of the first column of , copies of the second column, etc. One valid definition of ^{[2]} is such that

so computing a given circuit amplitude is no harder than computing the permanent of the associated matrix . We check the above formula for using equation (Template:EquationNote), as

where is the permutation group on elements. The second equality above follows from the fact that, upon expanding the product over , the only terms in the sum that survive the inner product are those for which each appears exactly once. These are the permutations on the columns of . The third line follows from the second being simply the definition of the permanent.

Furthermore, we see that when , and , for all , , is a sub-matrix of . Any complex-valued matrix may be extended to a unitary by suitably padding and renormalizing such that the rows and columns form orthonormal bases. Thus, the amplitudes of linear optical quantum circuits correspond to the the permanents of general complex-valued matrices. Because an LOQC circuit can only sample from its corresponding probability distribution, what we actually have is an additive approximation scheme to the absolute values of permanents of these matrices.

### Aaronson's Proof that the Permanent is #P-Hard

In 2011, Scott Aaronson gave a proof using a linear optical model of quantum computation that the permanent is #P-Hard^{[5]}. The proof relies on a reduction from the problem of counting solutions to a classically tractable Boolean function, which is #P-hard, to that of evaluating an LOQC circuit amplitude, which is the permanent of a complex-valued matrix.

The proof is as follows. Suppose we have a classical circuit that computes the Boolean function , and let

then is #P-hard. The circuit , where

is such that . This circuit amplitude may be calculated using the postselection construction of Knill, Laflamme, and Milburn ^{[3]} and is reducible to the permanent of a complex matrix, so all that remains is to show that, given , the circuit description of - or rather - can be produced in polynomial time. This is done using Charlie Bennett's "uncomputing trick"

where is a state encoding the history of a computation of , which can be produced in polynomial time, as is efficiently computable. In the first step, this state is generated on an ancilla register. In the next step, is extracted as an overall phase via phase kick-back (by application of a -gate, for example). The computation that originally produced is then performed in reverse, leading to the final state . This can be done coherently, and so a circuit description of of may be efficiently produced given . Therefore, given an oracle that efficiently computes the permanent of a complex-valued matrix, one may also compute the #P-hard problem .

### Hierarchy Collapse

Aaronson also showed that if the output of a boson sampling model can be efficiently exactly sampled by a classical computer, then , and thus the polynomial hierarchy collapses to the third level. Even if this could be done by a classical computer with an oracle for a polynomial hierarchy problem, then this would imply that , and so the polynomial hierarchy would still collapse by Toda's theorem. Because this collapse is believed to be unlikely, this is considered to be evidence that quantum computers can efficiently solve problems outside of the polynomial hierarchy. The proof relies on two facts, which Aaronson also proves:

- Approximating the probability of some particular output configuration from a boson sampling model is #P-hard.
- An exact polynomial-time algorithm for sampling from the output of a boson sampling model would imply a algorithm for multiplicative approximation of via a technique called universal hashing.

Together, these imply that if sampling from the output of a boson sampling model is classically tractable, then , and therefore the polynomial hierarchy collapses. ^{[2]}

## References

- ↑ Scheel, Stefan (2004). "Permanents in linear optical networks". arXiv:quant-ph/0406127v1
- ↑
^{2.0}^{2.1}^{2.2}^{2.3}Aaronson, Scott; Arkhipov, Alex (2011). "The Computational Complexity of Linear Optics".*Proceedings of the 43rd annual ACM symposium on Theory of computing*: 333-342. doi:0.1145/1993636.1993682 - ↑
^{3.0}^{3.1}E. Knill, R. Laflamme, and G. Milburn (2000). "Efficient Linear Optics Quantum Computation". arXiv:quant-ph/0006088v1 - ↑ Barile, Margherita and Weisstein, Eric W. "Galton Board." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/GaltonBoard.html
- ↑ Scott Aaronson (2011). "A Linear-Optical Proof that the Permanent is #P-Hard".
*Proceedings of the Royal Society A*. vol. 467 no. 2136: 3393-3405. doi:10.1098/rspa.2011.0232