Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

Identifying the boundary beyond which quantum machines provide a computational
advantage over their classical counterparts is a crucial step in charting their usefulness …

Since the development of boson sampling, there has been a quest to construct more efficient
and experimentally feasible protocols to test the computational complexity of sampling from …

We present a comprehensive study of the impact of non-uniform, ie path-dependent,
photonic losses on the computational complexity of linear-optical processes. Our main result …

The permanent is pivotal to both complexity theory and combinatorics. In quantum
computing, the permanent appears in the expression of output amplitudes of linear optical …

We consider quantum statistical physics of many-body equilibrium fluctuations in an
interacting Bose-Einstein-condensed (BEC) gas. We find a universal analytic formula for a …

Boson sampling is a specialized algorithm native to the quantum photonic platform
developed for near-term demonstrations of quantum advantage over classical computers …

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 …

Boson sampling (BS) is viewed to be an accessible quantum computing paradigm to
demonstrate computational advantage compared to classical computers. In this context, the …

How much information does a fermionic state contain? To address this fundamental
question, we define the complexity of a particle-conserving many-fermion state as the …