Efficient Classical Simulation of Continuous Variable Quantum Information Processes
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum information. For a collection of harmonic oscillators, 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 (including finite losses) and suitable operations conditioned on these measurements can be simulated efficiently on a classical computer.
Unable to display preview. Download preview PDF.
- D. Gottesman, in Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics, edited by S. P. Corney et al., (International Press, Cambridge, MA, 1999), p. 32.Google Scholar
- E. Knill, quant-ph/0108033; B. M. Terhal and D. P. DiVincenzo, quantph/0108010.Google Scholar