Probabilistic fault-tolerant universal quantum computation and sampling problems in continuous variables
Artikel i vetenskaplig tidskrift, 2019

Continuous-variable (CV) devices are a promising platform for demonstrating large-scale quantum information protocols. In this framework we define a general quantum computational model based on a CV hardware. It consists of vacuum input states, a finite set of gates-including non-Gaussian elements-and homodyne detection. We show that this model incorporates encodings sufficient for probabilistic fault-tolerant universal quantum computing. Furthermore, we show that this model can be adapted to yield sampling problems that cannot be simulated efficiently with a classical computer, unless the polynomial hierarchy collapses. This allows us to provide a simple paradigm for experiments to probe quantum advantage relying on Gaussian states, homodyne detection, and some form of non-Gaussian evolution. We finally address the recently introduced model of instantaneous quantum computing in CV, and prove that the hardness statement is robust with respect to some experimentally relevant simplifications in the definition of that model.

Författare

Tom Douce

University of Edinburgh

Damian Markham

Sorbonne Université

Elham Kashefi

Sorbonne Université

University of Edinburgh

Peter van Loock

Johannes Gutenberg-Universität Mainz

Giulia Ferrini

Johannes Gutenberg-Universität Mainz

Chalmers, Mikroteknologi och nanovetenskap (MC2), Tillämpad kvantfysik

Physical Review A

2469-9926 (ISSN) 2469-9934 (eISSN)

Vol. 99 1 012344

Ämneskategorier

Beräkningsmatematik

Bioinformatik (beräkningsbiologi)

Reglerteknik

DOI

10.1103/PhysRevA.99.012344

Mer information

Senast uppdaterat

2019-02-18