The english version of the website of the School of Medicine is under development


Continuous-Variable Instantaneous Quantum Computing is Hard to Sample.

TitleContinuous-Variable Instantaneous Quantum Computing is Hard to Sample.
Publication TypeJournal Article
Year of Publication2017
AuthorsDouce, T., Markham D., Kashefi E., Diamanti E., Coudreau T., Milman P., van Loock P., & Ferrini G.
JournalPhys Rev Lett
Date Published2017 Feb 17

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.

Alternate JournalPhys. Rev. Lett.
PubMed ID28256857


Secretariat of the School of Medicine


Schoole of Medicince presence in social networks
Follow Us or Connect with us.