The Computational Complexity of Linear Optics

Abstract

We give new evidence that quantum computers-moreover, rudimentary quantum computers built entirely out of linear-optical elements-cannot be efficiently simulated by classical computers. In particular, we define a model of computation in which identical photons are generated, sent through a linear-optical network, then nonadaptively measured to count the number of photons in each mode. This model is not known or believed to be universal for quantum computation, and indeed, we discuss the prospects for realizing the model using current technology. On the other hand, we prove that the model is able to solve sampling problems and search problems that are classically intractable under plausible assumptions.Our first result says that, if there exists a polynomial-time classical algorithm that samples from the same probability distribution as a linear-optical network, then P #P = BPP NP , and hence the polynomial hierarchy collapses to the third level. Unfortunately, this result assumes an extremely accurate simulation.Our main result suggests that even an approximate or noisy classical simulation would already imply a collapse of the polynomial hierarchy. For this, we need two unproven conjectures: the Permanent-of-Gaussians Conjecture, which says that it is #P-hard to approximate the permanent of a matrix A of independent N (0, 1) Gaussian entries, with high probability over A; and the Permanent Anti-Concentration Conjecture, which says that |Per (A)| ≥ √ n!/ poly (n) with high probability over A. We present evidence for these conjectures, both of which seem interesting even apart from our application. This paper does not assume knowledge of quantum optics. Indeed, part of its goal is to develop the beautiful theory of noninteracting bosons underlying our model, and its connection to the permanent function, in a self-contained way accessible to theoretical computer scientists.

Non-Linear Distance Transformation Algorithm and its Application in Medical Image Processing in Healthcare

“…However, the problem can be considered as the NP-hard for any definite non-constant v. an NP-hardness result can be obtained for a very simple class of non-linear systems, if we focus on the particular case where v is the sign function. It has been reported that these types of systems can be arouse when a non-linear system is controlled by using a controller whereas they also illustrate one of the simplest types of non-linear systems [11,12].…”

“…The non-linear simple mathematical example would be for noticeable for x in the (n+1) th state which rely on the square of the observable x in the n th state is + = . These relations are termed as mappings and this is a simple and general example of a nonlinear map that exist in the n th state to the (n+1) th state [12].…”

Decoherence and interferometric sensitivity of boson sampling in superconducting resonator networks

“…It is very important to benchmark the quality of entanglement achieved and to steadily expand the size of the systems under study. As such entanglement grows larger, it becomes a resource for potential sensing applications [6,7] and, more fundamentally, challenges various models of spontaneous collapse [8,9] or correlated error [10].A relatively simple (experimentally) platform for such explorations is the recently reformulated problem of quantum walks and associated BosonSampling [11]. Indistinguishable bosons are placed in a coupled array of resonators and allowed to interfere via the noninteracting coherent quantum walk of the particles among the resonators.…”

“…The resulting distribution of occupation probabilities in the different resonators is (thought to be) both exponentially hard to compute and verify classically [11]. This means the problem belongs to the complexity class #P, which is considered larger and more difficult than the notorious NP class.…”

“…A relatively simple (experimentally) platform for such explorations is the recently reformulated problem of quantum walks and associated BosonSampling [11]. Indistinguishable bosons are placed in a coupled array of resonators and allowed to interfere via the noninteracting coherent quantum walk of the particles among the resonators.…”