Related papers: Gaussian-boson-sampling-enhanced dense subgraph fi…
The continuous variable quantum computing platform constitutes a promising candidate for realizing quantum advantage, as exemplified in Gaussian Boson Sampling. While noise in the experiments makes the computation attainable for classical…
This paper deals with Gibbs samplers that include high dimensional conditional Gaussian distributions. It proposes an efficient algorithm that avoids the high dimensional Gaussian sampling and relies on a random excursion along a small set…
Gaussian Boson Sampling (GBS) exhibits a unique ability to solve graph problems, such as finding cliques in complex graphs. It is noteworthy that many drug discovery tasks can be viewed as the clique-finding process, making them potentially…
Gaussian boson sampling (GBS) is a model of nonuniversal quantum computation that claims to demonstrate quantum supremacy with current technologies. This model entails sampling photocounting events from a multimode Gaussian state at the…
A Gaussian boson sampler (GBS) is a special-purpose quantum computer that can be practically realized at large scale in optics. Here we report on experiments in which we used a frequency-multiplexed GBS with $>400$ modes as the reservoir in…
Binary optimization is a fundamental area in computational science, with wide-ranging applications from logistics to cryptography, where the tasks are often formulated as Quadratic or Polynomial Unconstrained Binary Optimization problems…
Gaussian Boson Sampling (GBS) provides a route toward demonstrating quantum computational advantage. However, optical loss, which reduces the entanglement in the system, can render GBS results classically simulable. We propose a nonlinear…
Quantum mechanics promises computational powers beyond the reach of classical computers. Current technology is on the brink of an experimental demonstration of the superior power of quantum computation compared to classical devices. For…
A growing cohort of experimental linear photonic networks implementing Gaussian boson sampling (GBS) have now claimed quantum advantage. However, many open questions remain on how to effectively verify these experimental results, as…
Gaussian Boson Sampling is a non-universal model for quantum computing inspired by the original formulation of the Boson Sampling problem. Nowadays, it represents a paradigmatic quantum platform to reach the quantum advantage regime in a…
Scientists in quantum technology aspire to quantum advantage: a computational result unattainable with classical computers. Gaussian boson sampling experiment has been already claimed to achieve this goal. In this setup squeezed light…
Boson Sampling represents a promising approach to obtain an evidence of the supremacy of quantum systems as a resource for the solution of computational problems. The classical hardness of Boson Sampling has been related to the so called…
The tantalizing promise of quantum computational speedup in solving certain problems has been strongly supported by recent experimental evidence from a high-fidelity 53-qubit superconducting processor1 and Gaussian boson sampling (GBS) with…
The creation of large-scale, high-fidelity quantum computers is not only a fundamental scientific endeavour in itself, but also provides increasingly robust proofs of quantum computational advantage (QCA) in the presence of unavoidable…
We pose a generalized Boson Sampling problem. Strong evidence exists that such a problem becomes intractable on a classical computer as a function of the number of Bosons. We describe a quantum optical processor that can solve this problem…
Quantum photonic processors are emerging as promising platforms to prove preliminary evidence of quantum computational advantage towards the realization of universal quantum computers. In the context of non-universal noisy intermediate…
Since its introduction Boson Sampling has been the subject of intense study in the world of quantum computing. The task is to sample independently from the set of all $n \times n$ submatrices built from possibly repeated rows of a larger $m…
Boson sampling, a computational task believed to be classically hard to simulate, is expected to hold promise for demonstrating quantum computational advantage using near-term quantum devices. However, noise in experimental implementations…
Boson Sampling has emerged as a tool to explore the advantages of quantum over classical computers as it does not require a universal control over the quantum system, which favours current photonic experimental platforms.Here, we introduce…
Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful…