Universal bound on sampling bosons in linear optics and its computational implications

Towards the Simplest Model of Quantum Supremacy: Atomic Boson Sampling in a Box Trap

We describe boson sampling of interacting atoms from the noncondensed fraction of Bose-Einstein-condensed (BEC) gas confined in a box trap as a new platform for studying computational ♯P-hardness and quantum supremacy of many-body systems. We calculate the characteristic function and statistics of atom numbers via the newly found Hafnian master theorem. Using Bloch-Messiah reduction, we find that interatomic interactions give rise to two equally important entities-eigen-squeeze modes and eigen-energy quasiparticles-whose interplay with sampling atom states determines the behavior of the BEC gas. We infer that two necessary ingredients of ♯P-hardness, squeezing and interference, are self-generated in the gas and, contrary to Gaussian boson sampling in linear interferometers, external sources of squeezed bosons are not required.

Multi-Qubit Bose-Einstein Condensate Trap for Atomic Boson Sampling

We propose a multi-qubit Bose-Einstein-condensate (BEC) trap as a platform for studies of quantum statistical phenomena in many-body interacting systems. In particular, it could facilitate testing atomic boson sampling of the excited-state occupations and its quantum advantage over classical computing in a full, controllable and clear way. Contrary to a linear interferometer enabling Gaussian boson sampling of non-interacting non-equilibrium photons, the BEC trap platform pertains to an interacting equilibrium many-body system of atoms. We discuss a basic model and the main features of such a multi-qubit BEC trap.

Speedup in classical simulation of Gaussian boson sampling

Gaussian boson sampling is an alternative model for demonstrating quantum computational supremacy, where squeezed states are injected into every input mode, instead of applying single photons as in the case of standard boson sampling. Here by analyzing numerically the computational costs, we establish a lower bound for achieving quantum computational supremacy for a class of Gaussian boson-sampling problems. Specifically, we propose a more efficient method for calculating the transition probabilities, leading to a significant reduction of the simulation costs. Particularly, our numerical results indicate that one can simulate up to 18 photons for Gaussian boson sampling at the output subspace on a normal laptop, 20 photons on a commercial workstation with 256 cores, and about 30 photons for supercomputers. These numbers are significantly smaller than those in standard boson sampling, suggesting that Gaussian boson sampling could be experimentally-friendly for demonstrating quantum computational supremacy.

Unification of the Nature's Complexities via a Matrix Permanent-Critical Phenomena, Fractals, Quantum Computing, ♯P-Complexity

We reveal the analytic relations between a matrix permanent and major nature’s complexities manifested in critical phenomena, fractal structures and chaos, quantum information processes in many-body physics, number-theoretic complexity in mathematics, and ♯P-complete problems in the theory of computational complexity. They follow from a reduction of the Ising model of critical phenomena to the permanent and four integral representations of the permanent based on (i) the fractal Weierstrass-like functions, (ii) polynomials of complex variables, (iii) Laplace integral, and (iv) MacMahon master theorem.