Extension of a pattern recognition validation approach for noisy boson sampling
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Boson sampling is one of the main quantum computation models to demonstrate the quantum computational advantage. However, this aim may be hard to realize considering two main kinds of noises, which are photon distinguishability and photon loss. Inspired by the Bayesian validation extended to evaluate whether distinguishability is too high to demonstrate this advantage, the pattern recognition validation is extended for boson sampling, considering both distinguishability and loss. Based on clusters constructed with the K means + + method, where parameters are carefully adjusted to optimize the extended validation performances, the distribution of outcomes is nearly monotonically changed with indistinguishability, especially when photons are close to be indistinguishable. However, this regulation may be suppressed by photon loss. The intrinsic data structure of output events is analyzed through calculating probability distributions and mean 2-norm distances of the sorted outputs. An approximation algorithm is also used to show the data structure changes with noises.