Boson sampling cannot be faithfully simulated by only the lower-order multi-boson interferences

• URL: http://arxiv.org/abs/2204.07792v1
• Date: Sat, 16 Apr 2022 12:53:10 GMT
• Title: Boson sampling cannot be faithfully simulated by only the lower-order multi-boson interferences
• Authors: Valery Shchesnovich
• Abstract summary: I show that the output data from any such classical simulations can be efficiently distinguished from that of the quantum device they try to simulate. I present more accessible account of the main result enhanced by additional insight on the contribution from the higher-order multi-boson interferences in presence of noise.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To simulate noisy boson sampling approximating it by only the lower-order multi-boson interferences (e.g., by a smaller number of interfering bosons and classical particles) is very popular idea. I show that the output data from any such classical simulations can be efficiently distinguished from that of the quantum device they try to simulate, even with finite noise in the latter. The distinguishing datasets can be the experimental estimates of some large probabilities, a wide class of such is presented. This is a sequel of \textit{Quantum} \textbf{5}, 423 (2021), where I present more accessible account of the main result enhanced by additional insight on the contribution from the higher-order multi-boson interferences in presence of noise.

Related papers

• Sampling (noisy) quantum circuits through randomized rounding [6.09006146869448]
  We show how to replicate noisy quantum circuits for optimisation problems.<n>We run large-scale simulations and experiments on IBMQ hardware.<n>We provide a benchmark for future error-mitigated or fault-tolerant demonstrations of quantum advantage.
  arXiv  Detail & Related papers  (2025-07-29T14:56:17Z)
• Error mitigation of shot-to-shot fluctuations in analog quantum simulators [46.54051337735883]
  We introduce an error mitigation technique that addresses shot-to-shot fluctuations in the parameters for the Hamiltonian governing the system dynamics.<n>We rigorously prove that amplifying this shot-to-shot noise and extrapolating to the zero-noise limit recovers noiseless results for realistic noise distributions.<n> Numerically, we predict a significant enhancement in the effective many-body coherence time for Rydberg atom arrays under realistic conditions.
  arXiv  Detail & Related papers  (2025-06-19T18:00:00Z)
• Quantum computational advantage of noisy boson sampling with partially distinguishable photons [0.0]
  We identify the level of partial distinguishability noise that upholds the classical intractability of boson sampling. We find that boson sampling with on average $O(log N)$ number of distinguishable photons out of $N$ input photons maintains the equivalent complexity to the ideal boson sampling case.
  arXiv  Detail & Related papers  (2025-01-23T07:37:29Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Already Moderate Population Sizes Provably Yield Strong Robustness to Noise [53.27802701790209]
  We show that two evolutionary algorithms can tolerate constant noise probabilities without increasing the runtime on the OneMax benchmark. Our results are based on a novel proof argument that the noiseless offspring can be seen as a biased uniform crossover between the parent and the noisy offspring.
  arXiv  Detail & Related papers  (2024-04-02T16:35:52Z)
• Classical sampling from noisy Boson Sampling and the negative probabilities [0.0]
  It is known that, by accounting for the multiboson interferences up to a finite order, the output distribution of noisy Boson Sampling can be approximately sampled from approximation in a time in the total number of bosons. The quantum probability factors in a convex-sum expression, if truncated to a finite order of multiboson interference, have, on average, a finite amount of negativity in a random interferometer. The conclusion that the negativity issue is inherent to all efficient classicals to noisy Boson Sampling may be premature.
  arXiv  Detail & Related papers  (2023-07-11T15:33:37Z)
• Benchmarking a boson sampler with Hamming nets [1.0555513406636092]
  We propose a machine-learning-based protocol to benchmark a boson sampler with unknown scattering matrix. Our framework can be directly applied for characterizing boson sampling devices that are currently available in experiments.
  arXiv  Detail & Related papers  (2023-05-18T13:07:02Z)
• On classical simulation algorithms for noisy Boson Sampling [2.8655318786364408]
  We present a classical algorithm that approximately samples from the output distribution of certain noisy Boson Sampling experiments. This is inspired by a recent result of Aharonov, Gao, Landau, Liu and Vazirani and makes use of an observation originally due to Kalai Kindler.
  arXiv  Detail & Related papers  (2023-01-27T04:42:59Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• High-Order Qubit Dephasing at Sweet Spots by Non-Gaussian Fluctuators: Symmetry Breaking and Floquet Protection [55.41644538483948]
  We study the qubit dephasing caused by the non-Gaussian fluctuators. We predict a symmetry-breaking effect that is unique to the non-Gaussian noise.
  arXiv  Detail & Related papers  (2022-06-06T18:02:38Z)
• The Optimal Noise in Noise-Contrastive Learning Is Not What You Think [80.07065346699005]
  We show that deviating from this assumption can actually lead to better statistical estimators. In particular, the optimal noise distribution is different from the data's and even from a different family.
  arXiv  Detail & Related papers  (2022-03-02T13:59:20Z)
• Noise thresholds for classical simulability of non-linear Boson sampling [4.812718493682455]
  We introduce higher order non-linearities as a mean to enhance the computational complexity of the problem and the protocol's robustness against noise. 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.
  arXiv  Detail & Related papers  (2022-02-24T12:17:28Z)
• Simulating quench dynamics on a digital quantum computer with data-driven error mitigation [62.997667081978825]
  We present one of the first implementations of several Clifford data regression based methods which are used to mitigate the effect of noise in real quantum data. We find in general Clifford data regression based techniques are advantageous in comparison with zero-noise extrapolation. This is the largest systems investigated so far in a study of this type.
  arXiv  Detail & Related papers  (2021-03-23T16:56:14Z)
• Amplitude estimation via maximum likelihood on noisy quantum computer [3.5462326830737805]
  We give an experimental demonstration on a superconducting IBM Quantum device. We show that the proposed maximum likelihood estimator achieves quantum speedup in the number of queries.
  arXiv  Detail & Related papers  (2020-06-29T17:44:04Z)
• Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles [65.9694455739978]
  We study contextual linear bandit problems under feature uncertainty, where the features are noisy and have missing entries. Our analysis reveals that the optimal hypothesis can significantly deviate from the underlying realizability function, depending on the noise characteristics. This implies that classical approaches cannot guarantee a non-trivial regret bound.
  arXiv  Detail & Related papers  (2017-03-03T21:39:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.