Related papers: On the classical complexity of sampling from quant…
Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…
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…
Sampling from probability distributions of quantum circuits is a fundamentally and practically important task which can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In the present work, we examine…
Gaussian boson sampling (GBS) is a promising candidate for an experimental demonstration of quantum advantage using photons. However, sufficiently large noise might hinder a GBS implementation from entering the regime where quantum speedup…
The determination of the computational complexity of the boson sampling problem with single boson sources has opened a novel research direction in the quantum computing field. Some research effort has also been devoted towards the use of…
Boson sampling has been theoretically proposed and experimentally demonstrated to show quantum computational advantages. However, it still lacks the deep understanding of the practical applications of boson sampling. Here we propose that…
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…
This thesis is based upon the work I have done during my PhD candidature at Macquarie University. In this work we develop quantum technologies that are directed towards realising a quantum computer. Specifically, we have made many…
BosonSampling and Random Circuit Sampling are important both as a theoretical tool for separating quantum and classical computation, and as an experimental means of demonstrating quantum speedups. Prior works have shown that average-case…
This thesis is intended in part to summarize and also to contribute to the newest developments in passive linear optics that have resulted, directly or indirectly, from the somewhat shocking discovery in 2010 that the BosonSampling problem…
Sampling the distribution of bosons that have undergone a random unitary evolution is strongly believed to be a computationally hard problem. Key to outperforming classical simulations of this task is to increase both the number of input…
We show that counting the number of collisions (re-sampled bitstrings) when measuring a random quantum circuit provides a practical benchmark for the quality of a quantum computer and a quantitative noise characterization method. We…
Using tools from representation theory, we derive expressions for the coincidence rate of partially-distinguishable particles in an interferometry experiment. Our expressions are valid for either bosons or fermions, and for any number of…
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…
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…
Quantum simulation in its current state faces experimental overhead in terms of physical space and cooling. We propose boson sampling as an alternative compact synthetic platform performing at room temperature. Identifying the capability of…
The goal of demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity…
Gaussian boson sampling is a promising model for demonstrating quantum computational supremacy, which eases the experimental challenge of the standard boson-sampling proposal. Here by analyzing the computational costs of classical…
Gaussian Boson Sampling is a model of photonic quantum computing where single-mode squeezed states are sent through linear-optical interferometers and measured using single-photon detectors. In this work, we employ a recent exact sampling…
Photonic interference is a key quantum resource for optical quantum computation, and in particular for so-called boson sampling machines. In interferometers with certain symmetries, genuine multiphoton quantum interference effectively…