相关论文: Exponential improvements to the average-case hardn…

Results on the hardness of approximate sampling are seen as important stepping stones towards a convincing demonstration of the superior computational power of quantum devices. The most prominent suggestions for such experiments include…

Optical losses are the main obstacle to demonstrating a quantum advantage via boson sampling without leaving open the possibility of classical spoofing. We propose a method for generating low-depth optical circuits suitable for boson…

We study the hardness of classically simulating Gaussian boson sampling at nonzero photon distinguishability. We find that similar to regular boson sampling, distinguishability causes exponential attenuation of the many-photon interference…

Noise is the defining feature of the NISQ era, but it remains unclear if noisy quantum devices are capable of quantum speedups. Quantum supremacy experiments have been a major step forward, but gaps remain between the theory behind these…

A boson sampling device is a specialised quantum computer that solves a problem which is strongly believed to be computationally hard for classical computers. Recently a number of small-scale implementations have been reported, all based on…

The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to outperform dramatically their classical counterparts, is an important milestone in the field of quantum…

Boson sampling is the problem of generating a quantum bit stream whose average is the permanent of a $n\times n$ matrix. The bitstream is created as the output of a prototype quantum computing device with $n$ input photons. It is a…

Recent experiments demonstrated quantum computational advantage in random circuit sampling and Gaussian boson sampling. However, it is unclear whether these experiments can lead to practical applications even after considerable research…

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…

There is a large body of evidence for the potential of greater computational power using information carriers that are quantum mechanical over those governed by the laws of classical mechanics. But the question of the exact nature of the…

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…

Quantum computation, aiming at tackling hard problems beyond classical approaches, has been flourishing with each passing day. Unfortunately, a fully scalable and fault-tolerant universal quantum computer remains challenging based on the…

Boson sampling has emerged as an important tool to demonstrate the difference between quantum and classical computers and has attracted the interest of experimentalists and theoreticians. In this work we study Boson sampling from general,…

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 the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that, subject to certain computational…

Quantum computers are unnecessary for exponentially-efficient computation or simulation if the Extended Church-Turing thesis---a foundational tenet of computer science---is correct. The thesis would be directly contradicted by a physical…

The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…

We make the case for studying the complexity of approximately simulating (sampling) quantum systems for reasons beyond that of quantum computational supremacy, such as diagnosing phase transitions. We consider the sampling complexity as a…

As a promising candidate for exhibiting quantum computational supremacy, Gaussian Boson Sampling (GBS) is designed to exploit the ease of experimental preparation of Gaussian states. However, sufficiently large and inevitable experimental…

BosonSampling is a restricted model of quantum computation proposed recently, where a non-adaptive linear-optical network is used to solve a sampling problem that seems to be hard for classical computers. Here we show that, even if the…