Non-linear Boson Sampling

• URL: http://arxiv.org/abs/2110.13788v1
• Date: Tue, 26 Oct 2021 15:41:51 GMT
• Title: Non-linear Boson Sampling
• Authors: Nicol\`o Spagnolo and Daniel J. Brod and Ernesto F. Galv\~ao and Fabio Sciarrino
• Abstract summary: We introduce the adoption of non-linear photon-photon interactions in the Boson Sampling framework. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the last few years, with demonstrations of small- and medium-scale devices, as well as implementations of variants such as Gaussian Boson Sampling. Besides the relevance of this class of computational models in the quest for unambiguous experimental demonstrations of quantum advantage, recent results have also proposed first applications for hybrid quantum computing. Here, we introduce the adoption of non-linear photon-photon interactions in the Boson Sampling framework, and analyze the enhancement in complexity via an explicit linear-optical simulation scheme. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities for this class of quantum devices. Hence, our results are expected to lead to new applications of near-term, restricted photonic quantum computers.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Complexity of Gaussian quantum optics with a limited number of non-linearities [4.532517021515834]
  We show that computing transition amplitudes of Gaussian processes with a single-layer of non-linearities is hard for classical computers. We show how an efficient algorithm to solve this problem could be used to efficiently approximate outcome probabilities of a Gaussian boson sampling experiment.
  arXiv  Detail & Related papers  (2023-10-09T18:00:04Z)
• Simulating Gaussian boson sampling quantum computers [68.8204255655161]
  We briefly review recent theoretical methods to simulate experimental Gaussian boson sampling networks. We focus mostly on methods that use phase-space representations of quantum mechanics. A brief overview of the theory of GBS, recent experiments and other types of methods are also presented.
  arXiv  Detail & Related papers  (2023-08-02T02:03:31Z)
• Testing of on-cloud Gaussian Boson Sampler "Borealis'' via graph theory [0.0]
  photonic-based sampling machines solving the Gaussian Boson Sampling problem play a central role in the experimental demonstration of a quantum computational advantage. In this work, we test the performances of the recently developed photonic machine Borealis as a sampling machine and its possible use cases in graph theory.
  arXiv  Detail & Related papers  (2023-06-21T09:02:55Z)
• 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)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• 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)
• Certification of Gaussian Boson Sampling via graph theory [4.063872661554895]
  We exploit a connection between photon counting of a genuine Gaussian Boson Sampling device and the number of perfect matchings in a graph. Within this framework, two approaches that exploit the distributions of graph feature vectors and graph kernels are presented.
  arXiv  Detail & Related papers  (2022-02-15T20:22:28Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Conditional preparation of non-Gaussian quantum optical states by mesoscopic measurement [62.997667081978825]
  Non-Gaussian states of an optical field are important as a proposed resource in quantum information applications. We propose a novel approach involving displacement of the ancilla field into the regime where mesoscopic detectors can be used. We conclude that states with strong Wigner negativity can be prepared at high rates by this technique under experimentally attainable conditions.
  arXiv  Detail & Related papers  (2021-03-29T16:59:18Z)
• Boson Sampling with Gaussian input states: efficient scaling and certification [0.0]
  intermediate models of quantum computation could challenge the Extended Church-ing. One of these models based on single photons interacting via linear optics is called Boson Sampling. We propose the combination of switchable dual-homodyne and single-photon detections, the temporal loop technique and scattershot-based Boson Sampling.
  arXiv  Detail & Related papers  (2018-12-21T07:15:03Z)

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.