Classical modelling of a bosonic sampler with photon collisions

• URL: http://arxiv.org/abs/2209.00855v1
• Date: Fri, 2 Sep 2022 07:21:43 GMT
• Title: Classical modelling of a bosonic sampler with photon collisions
• Authors: M. Umanskii, A.N. Rubtsov
• Abstract summary: We present a classical algorithm that simulates a bosonic sampler. It calculates the probability of a given photon distribution at the interferometer outputs for a given distribution at the inputs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: When the problem of boson sampling was first proposed, it was assumed that little or no photon collisions occur. However, modern experimental realizations rely on setups where collisions are quite common, i.e. the number of photons $M$ injected into the circuit is close to the number of detectors $N$. Here we present a classical algorithm that simulates a bosonic sampler: it calculates the probability of a given photon distribution at the interferometer outputs for a given distribution at the inputs. This algorithm is most effective in cases with multiple photon collisions, and in those cases it outperforms known algorithms.

Related papers

• Realistic photon-number resolution in Gaussian boson sampling [0.0]
  Gaussian boson sampling (GBS) is a model of nonuniversal quantum computation that claims to demonstrate quantum supremacy with current technologies. We derive a the photocounting probability distribution in GBS schemes which is applicable for use with general detectors and photocounting techniques.
  arXiv  Detail & Related papers  (2024-03-05T18:20:59Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Gaussian boson sampling with click-counting detectors [4.437382576172235]
  We investigate the problem of sampling from a general multi-mode Gaussian state using click-counting detectors. We show that the probability of obtaining a given outcome is related to a new matrix function dubbed as the Kensingtonian.
  arXiv  Detail & Related papers  (2023-05-01T14:48:54Z)
• Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage [28.449634706456898]
  We report new Gaussian boson sampling experiments with pseudo-photon-number-resolving detection. We develop a more complete model for the characterization of the noisy Gaussian boson sampling.
  arXiv  Detail & Related papers  (2023-04-24T16:29:25Z)
• Experimental realization of deterministic and selective photon addition in a bosonic mode assisted by an ancillary qubit [50.591267188664666]
  Bosonic quantum error correcting codes are primarily designed to protect against single-photon loss. Error correction requires a recovery operation that maps the error states -- which have opposite parity -- back onto the code states. Here, we realize a collection of photon-number-selective, simultaneous photon addition operations on a bosonic mode.
  arXiv  Detail & Related papers  (2022-12-22T23:32:21Z)
• 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)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Multi-bit quantum random number generator from path-entangled single photons [2.095553036791944]
  Measurement outcomes on quantum systems exhibit inherent randomness and are fundamentally nondeterministic. We present a scheme for the generation of multi-bit random numbers using path-entangled single photons.
  arXiv  Detail & Related papers  (2022-02-22T14:37:17Z)
• Assessing the quality of near-term photonic quantum devices [0.0]
  We present a method to certify that noise levels are low enough to allow potentially useful applications to be carried out. We propose a series of benchmark tests targetting two main sources of noise, namely photon loss and distinguishability. Our method results in a single-number metric, the Photonic Quality Factor, defined as the largest number of input photons for which the output statistics pass all tests.
  arXiv  Detail & Related papers  (2022-02-09T21:32:27Z)
• Classical simulation of boson sampling based on graph structure [2.5496329090462626]
  We present classical sampling algorithms for single-photon and Gaussian input states that take advantage of a graph structure of a linear-optical circuit. We show that when the circuit depth is less than the quadratic in the lattice spacing, the efficient simulation is possible with an exponentially small error. We implement a likelihood test with a recent numerically Gaussian boson sampling experiment and show that the treewidth-based algorithm with a limited treewidth renders a larger likelihood than the experimental data.
  arXiv  Detail & Related papers  (2021-10-04T17:02:35Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.