Continuous-Variable Instantaneous Quantum Computing is Hard to Sample

Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01644066
Contributor : Damian Markham <>
Submitted on : Tuesday, November 21, 2017 - 9:55:11 PM
Last modification on : Thursday, March 21, 2019 - 2:26:17 PM

Links full text

Identifiers

Citation

Tom Douce, Damian Markham, Elham Kashefi, Eleni Diamanti, Thomas Coudreau, et al.. Continuous-Variable Instantaneous Quantum Computing is Hard to Sample. Physical Review Letters, American Physical Society, 2017, 118 (7), 〈10.1103/PhysRevLett.118.070503〉. 〈hal-01644066〉

Share

Metrics

Record views

112