Gaussian boson sampling at finite temperature
arXiv:2308.13291 · doi:10.1103/PhysRevA.109.013707
Abstract
Gaussian boson sampling (GBS) is a promising candidate for an experimental demonstration of quantum advantage using photons. However, sufficiently large noise might hinder a GBS implementation from entering the regime where quantum speedup is achievable. Here, we investigate how thermal noise affects the classical intractability of generic quantum optical sampling experiments, GBS being a particular instance of the latter. We do so by establishing sufficient conditions for an efficient simulation to be feasible, expressed in the form of inequalities between the relevant parameters that characterize the system and its imperfections. We demonstrate that the addition of thermal noise has the effect of tightening the constraints on the remaining noise parameters, required to show quantum advantage. Furthermore, we show that there exist a threshold temperature at which any quantum sampling experiment becomes classically simulable, and provide an intuitive physical interpretation by relating this occurrence with the disappearance of the quantum state's non-classical properties.
References in corpus (28)
- Resolving photon number states in a superconducting circuit
- 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
- Quantum Non-demolition Detection of Single Microwave Photons in a Circuit
- Quantum fidelity for arbitrary Gaussian states
- A detailed study of Gaussian Boson Sampling
- Gaussian states in continuous variable quantum information
- Measurement of the decay of Fock states in a superconducting quantum circuit
- Molecular Docking with Gaussian Boson Sampling
- Efficient multiphoton sampling of molecular vibronic spectra on a superconducting bosonic processor
- Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
- Using Gaussian Boson Sampling to Find Dense Subgraphs
- Gaussian Boson Sampling using threshold detectors
- Gaussian Boson Sampling for perfect matchings of arbitrary graphs
- What can quantum optics say about computational complexity theory?
- A quantum hardware-induced graph kernel based on Gaussian Boson Sampling
- Regimes of classical simulability for noisy Gaussian boson sampling
- Realization of near-deterministic arithmetic operations and quantum state engineering
- Solving Graph Problems Using Gaussian Boson Sampling
- Scalable and Programmable Phononic Network with Trapped Ions
- Microwave Boson Sampling
- A universal programmable Gaussian Boson Sampler for drug discovery
- The Complexity of Bipartite Gaussian Boson Sampling
- Simulability of Imperfect Gaussian and Superposition Boson Sampling
- Simulating lossy Gaussian boson sampling with matrix product operators
- Noise thresholds for classical simulability of non-linear Boson sampling