Probabilistic fault-tolerant universal quantum computation and sampling problems in continuous variables
Paper in proceeding, 2019

We define a quantum computational model with continuous variables composed of vacuum input states, a finite set of gates and homodyne detection. We prove universality, fault tolerance and, as a sampling problem, quantum advantage.

computer simulation

quantum computation

Author

Tom Douce

University of Edinburgh

Damian Markham

Pierre and Marie Curie University (UPMC)

Elham Kashefi

Pierre and Marie Curie University (UPMC)

University of Edinburgh

Peter Van Loock

Johannes Gutenberg University Mainz

Giulia Ferrini

Johannes Gutenberg University Mainz

Chalmers, Microtechnology and Nanoscience (MC2), Applied Quantum Physics

Optics InfoBase Conference Papers

21622701 (eISSN)

Vol. Part F165-QIM 2019 F3A.2
978-1-943580-56-9 (ISBN)

Quantum Information and Measurement
Rom, Italy,

Subject Categories

Computer Engineering

Computational Mathematics

DOI

10.1364/QIM.2019.F3A.2

More information

Latest update

1/3/2024 9