Related papers: Towards Quantum Supremacy with Lossy Scattershot B…
Boson is one of the most basic types of particles and preserves the commutation relation. An efficient way to measure a bosonic system is important not only for simulating complex physics phenomena of bosons (such as nuclei) on a qubit…
Boson sampling can provide strong evidence that the computational power of a quantum computer outperforms a classical one via currently feasible linear optics experiments. However, how to identify an actual boson sampling device against any…
Sampling from the output distribution of chaotic quantum evolutions, and of pseudo-random universal quantum circuits in particular, has been proposed as a prominent milestone for near-term quantum supremacy. The same paper notes that…
The problem of sampling outputs of quantum circuits has been proposed as a candidate for demonstrating a quantum computational advantage (sometimes referred to as quantum "supremacy"). In this work, we investigate whether quantum advantage…
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…
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…
This thesis focuses on three main questions in the continuous variable and optical settings: where does a quantum advantage, that is, the ability of quantum machines to outperform classical machines, come from? How to ensure the proper…
A critical question for the field of quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of state-of-the-art classical computers,…
A boson sampling device could efficiently sample from the output probability distribution of noninteracting bosons undergoing many-body interference. This problem is not only classically intractable, but its solution is also believed to be…
The implementation of large-scale universal quantum computation represents a challenging and ambitious task on the road to quantum processing of information. In recent years, an intermediate approach has been pursued to demonstrate quantum…
We propose a method to achieve quantum supremacy using ensembles of qubits, using only spin squeezing, basis rotations, and Fock state measurements. Each ensemble is assumed to be controllable only with its total spin. Using a repeated…
We present a classical algorithm that approximately samples from the output distribution of certain noisy Boson Sampling experiments. This algorithm is inspired by a recent result of Aharonov, Gao, Landau, Liu and Vazirani and makes use of…
It has been proven that Boson sampling is a much promising model of optical quantum computation, which has been applied to designing quantum computer successfully, such as "Jiuzhang". However, the meaningful randomness of Boson sampling…
Boson sampling is a specialised algorithm native to the quantum photonic platform developed for near-term demonstrations of quantum advantage over classical computers. While clear useful applications for such near-term pre-fault-tolerance…
Gaussian boson sampling exploits squeezed states to provide a highly efficient way to demonstrate quantum computational advantage. We perform experiments with 50 input single-mode squeezed states with high indistinguishability and squeezing…
Validation of quantum advantage claims in the context of Gaussian Boson Sampling (GBS) currently relies on providing evidence that the experimental samples genuinely follow their corresponding ground truth, i.e., the theoretical model of…
Boson sampling is a problem for which quantum devices could prove to go beyond classical computing using only linear optics and photon preparation and counting. While theoretically important, there is a lack of practical applications for…
BosonSampling, which we proposed three years ago, is a scheme for using linear-optical networks to solve sampling problems that appear to be intractable for a classical computer. In arXiv:1306.3995, Gogolin et al. claimed that even an ideal…
In order to find the outcome probabilities of quantum mechanical systems like the optical networks underlying Boson sampling, it is necessary to be able to compute the permanents of unitary matrices, a computationally hard task. Here we…
Randomness is an intrinsic feature of quantum theory. The outcome of any quantum measurement will be random, sampled from a probability distribution that is defined by the measured quantum state. The task of sampling from a prescribed…