Efficient classical simulation of optical quantum information circuits.

@article{Bartlett2002EfficientCS,
  title={Efficient classical simulation of optical quantum information circuits.},
  author={Stephen D. Bartlett and Barry C. Sanders},
  journal={Physical review letters},
  year={2002},
  volume={89 20},
  pages={
          207903
        }
}
We identify a broad class of physical processes in an optical quantum circuit that can be efficiently simulated on a classical computer: this class includes unitary transformations, amplification, noise, and measurements. This simulatability result places powerful constraints on the capability to realize exponential quantum speedups as well as on inducing an optical nonlinear transformation via linear optics, photodetection-based measurement, and classical feedforward of measurement results… 

Optical quantum computing with photons of arbitrarily low fidelity and purity

It is presented evidence that by increasing the size of the system the authors can implement a computationally hard algorithm even if their photons have arbitrarily low fidelity and purity, and make Boson-sampling LOQC within reach of present-day technology.

Efficient simulation scheme for a class of quantum optics experiments with non-negative Wigner representation

We provide a scheme for efficient simulation of a broad class of quantum optics experiments. Our efficient simulation extends the continuous variable Gottesman–Knill theorem to a large class of

Non-Gaussian states of light as an offline resource for universal continuous variable quantum information processing

We prove that continuous variable quantum information processing via Gaussian preserving operations, with Gaussian input states plus a (highly nonclassical) Fock number state, and subject to homodyne

Limitations on continuous variable quantum algorithms with Fourier transforms

We study quantum algorithms implemented within a single harmonic oscillator, or equivalently within a single mode of the electromagnetic field. Logical states correspond to functions of the canonical

Continuous‐variable quantum information processing

This paper is addressing the three main stages of a quantum information system; the preparation stage where quantum information is encoded into CVs of coherent states and single-photon states, the processing stage whereCV information is manipulated to carry out a specified protocol and a detection stage where CV information is measured using homodyne detection or photon counting.

Requirement for quantum computation

This work identifies "proper quantum computation" with computational processes that cannot be efficiently simulated on a classical computer and establishes "no-go" theorems for classes of quantum optical experiments that cannot yield proper quantum computation.

Error tolerance of the boson-sampling model for linear optics quantum computing

Evidence is provided that even lossy systems or systems with mode mismatch are likely to be classically hard to solve, and this is of practical interest to experimentalists wishing to demonstrate such systems since it suggests that, even with errors in their implementation, they are likely implementing an algorithm that is classicallyhard to solve.

Architecture and noise analysis of continuous-variable quantum gates using two-dimensional cluster states

A complete measurement-based quantum computing architecture for the implementation of a universal set of gates on the recently generated two-dimensional cluster states is proposed and it is found that, although they all allow for universal computation, the quad-rail lattice cluster state performs better than the other three states which all exhibit similar performance.

Gaussian quantum computation with oracle-decision problems

It is demonstrated that Gaussian modulation with optimized width parameter results in a lower error rate than for the top-hat encoding for the Deutsch–Jozsa problem.

Quantum path computing: computing architecture with propagation paths in multiple plane diffraction of classical sources of fermion and boson particles

This article introduces quantum path computing (QPC) setup as the simplest optical QC satisfying five fundamental properties all-in-one: exploiting only the coherent sources being either fermion or boson, simple setup of multiple plane diffraction (MPD) with multiple slits by creating distinct propagation paths.

References

SHOWING 1-10 OF 31 REFERENCES

Optical simulation of quantum logic

A constructive method for simulating small-scale quantum circuits by use of linear optical devices is presented. It relies on the representation of several quantum bits by a single photon, and on the

Simple quantum computer.

  • ChuangYamamoto
  • Physics, Computer Science
    Physical review. A, Atomic, molecular, and optical physics
  • 1995
We propose an implementation of a quantum computer to solve Deutsch's problem, which requires exponential time on a classical computer but only linear time with quantum parallelism. By using a

Efficient classical simulation of continuous variable quantum information processes.

It is obtained that any quantum process that begins with unentangled Gaussian states, performs only transformations generated by Hamiltonians that are quadratic in the canonical operators, and involves only measurements of canonical operators and suitable operations conditioned on these measurements can be simulated efficiently on a classical computer.

Quantum Computation over Continuous Variables

This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the

Universal continuous-variable quantum computation: Requirement of optical nonlinearity for photon counting

Although universal continuous-variable quantum computation cannot be achieved via linear optics (including squeezing), homodyne detection, and feed-forward, inclusion of ideal photon-counting

A scheme for efficient quantum computation with linear optics

It is shown that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors and are robust against errors from photon loss and detector inefficiency.

Cloning the quantum oscillator

A class of completely positive maps are constructed which perform an approximate cloning of arbitrary states of a multi-mode quantum oscillator. Inside this class we find the optimal maps which do

Quantum Theory of Multiport Optical Homodyning

Abstract Multiport optical homodyning concerns the combining of a local oscillator with N − 1 signals of the same frequency in a lossless 2N-port junction or an N × N directional coupler. An operator

Implementation of quantum search algorithm using classical Fourier optics.

An experiment on Grover's quantum search algorithm shows that classical waves can search a N-item database as efficiently as quantum mechanics can, although the lack of quantum entanglement limits the size of the database.

Optimal cloning of coherent states with a linear amplifier and beam splitters.

A transformation achieving the optimal symmetric N-->M cloning of coherent states is presented, which requires only a phase-insensitive linear amplifier and a network of beam splitters.