Continuous-Variable Instantaneous Quantum Computing is Hard to Sample

T. Douce, D. Markham, E. Kashefi, E. Diamanti, T. Coudreau, P. Milman, P. van Loock, G. Ferrini

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

Instantaneous quantum computing is a subuniversal quantum complexity class, whose circuits have proven to be hard to simulate classically in the discrete-variable realm. We extend this proof to the continuous-variable (CV) domain by using squeezed states and homodyne detection, and by exploring the properties of postselected circuits. In order to treat postselection in CVs, we consider finitely resolved homodyne detectors, corresponding to a realistic scheme based on discrete probability distributions of the measurement outcomes. The unavoidable errors stemming from the use of finitely squeezed states are suppressed through a qubit-into-oscillator Gottesman-Kitaev-Preskill encoding of quantum information, which was previously shown to enable fault-tolerant CV quantum computation. Finally, we show that, in order to render postselected computational classes in CVs meaningful, a logarithmic scaling of the squeezing parameter with the circuit size is necessary, translating into a polynomial scaling of the input energy.
Original languageEnglish
Article number070503
Pages (from-to)1-6
Number of pages6
JournalPhysical Review Letters
Issue number7-17
Publication statusPublished - 17 Feb 2017


Dive into the research topics of 'Continuous-Variable Instantaneous Quantum Computing is Hard to Sample'. Together they form a unique fingerprint.

Cite this