Physical Review Letters · 2017 · 61 citations · 41 references
ComputingComputer SciencePhysicsInformation TheoryQuantum ComputingQuantum MechanicsFault-tolerant Quantum ComputingQuantum CircuitsQuantum ComputationQuantum Information TheoryQuantum MeasurementQuantum StatesCircuit Size ComplexityContinuous-variable Quantum CommunicationDetectorsDiscrete Probability DistributionsFault-tolerant Quantum ComputationHomodyne DetectionQuantum Circuit Fault ToleranceQuantum Complexity
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.
41
Robert Raussendorf, Hans J. Briegel · Physical Review Letters · 2001 · 4.5K citations
Seth Lloyd · Science · 1996 · 3.1K citations
Encoding a qubit in an oscillator
Daniel Gottesman, Alexei Kitaev, John Preskill · Physical Review A · 2001 · 1.5K citations · Full text
Measuring the Quantum State of Light
Ulf Leonhardt, M. Beck · American Journal of Physics · 1998 · 1K citations
Natural Sciences, Physics, Optics +11