Noise thresholds for classical simulability of non-linear Boson sampling

Abstract

Boson sampling, a computational problem conjectured to be hard to simulate on a classical machine, is a promising candidate for an experimental demonstration of quantum advantage using bosons. However, inevitable experimental noise and imperfections, such as loss in the interferometer and random counts at the detectors, could challenge the sampling task from entering the regime where quantum advantage is achievable. In this work we introduce higher order non-linearities as a mean to enhance the computational complexity of the problem and the protocol's robustness against noise, i.e. increase the noise threshold that allows to perform an efficient classical simulation of the problem. Using a phase-space method based on the negativity volume of the relevant quasi-probability distributions, we establish a necessary non-classicality condition that any experimental proof of quantum advantage must satisfy. Our results indicate that the addition of single-mode Kerr non-linearity at the input state preparation level, while retaining a linear-optical evolution, makes the Boson sampling protocol more robust against noise and consequently relaxes the constraints on noise parameters required to show quantum advantage.

References in corpus (21)

• Quantum computational advantage using photons
• Photonic quantum information processing: a review
• Gaussian Boson Sampling
• Positive Wigner functions render classical simulation of quantum computation efficient
• Negative Quasi-Probability as a Resource for Quantum Computation
• Boson Sampling for Molecular Vibronic Spectra
• Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
• Efficient algorithm for boson sampling with partially distinguishable photons
• Simulating boson sampling in lossy architectures
• Gaussian Boson Sampling for perfect matchings of arbitrary graphs
• The Boundary for Quantum Advantage in Gaussian Boson Sampling
• A quantum hardware-induced graph kernel based on Gaussian Boson Sampling
• A Linear-Optical Proof that the Permanent is #P-Hard
• Regimes of classical simulability for noisy Gaussian boson sampling
• Classical simulation of photonic linear optics with lost particles
• BosonSampling with Lost Photons
• Sufficient bound on the mode mismatch of single photons for scalability of the boson sampling computer
• Sampling arbitrary photon-added or photon-subtracted squeezed states is in the same complexity class as boson sampling
• Boson sampling with displaced single-photon Fock states versus single-photon-added coherent states---The quantum-classical divide and computational-complexity transitions in linear optics
• Boson-sampling with photons of arbitrary spectral structure
• Sampling generalized cat states with linear optics is probably hard

Cited by in corpus (5)

• Riemannian optimization of photonic quantum circuits in phase and Fock space
• Gaussian boson sampling at finite temperature
• What's my phase again? Computing the vacuum-to-vacuum amplitude of quadratic bosonic evolution
• Gaussian boson sampling with click-counting detectors
• Variational Tensor Network Simulation of Gaussian Boson Sampling and Beyond