Gaussian Boson Sampling with Pseudo-Photon-Number-Resolving Detectors and Quantum Computational Advantage.

We report new Gaussian boson sampling experiments with pseudo-photon-number-resolving detection, which register up to 255 photon-click events. We consider partial photon distinguishability and develop a more complete model for the characterization of the noisy Gaussian boson sampling. In the quantum computational advantage regime, we use Bayesian tests and correlation function analysis to validate the samples against all current classical spoofing mockups. Estimating with the best classical algorithms to date, generating a single ideal sample from the same distribution on the supercomputer Frontier would take ∼600 yr using exact methods, whereas our quantum computer, Jiǔzhang 3.0, takes only 1.27 µs to produce a sample. Generating the hardest sample from the experiment using an exact algorithm would take Frontier∼3.1×10^{10} yr.

Solving Graph Problems Using Gaussian Boson Sampling.

Gaussian boson sampling (GBS) is not only a feasible protocol for demonstrating quantum computational advantage, but also mathematically associated with certain graph-related and quantum chemistry problems. In particular, it is proposed that the generated samples from the GBS could be harnessed to enhance the classical stochastic algorithms in searching some graph features. Here, we use Jiǔzhang, a noisy intermediate-scale quantum computer, to solve graph problems. The samples are generated from a 144-mode fully connected photonic processor, with photon click up to 80 in the quantum computational advantage regime. We investigate the open question of whether the GBS enhancement over the classical stochastic algorithms persists-and how it scales-with an increasing system size on noisy quantum devices in the computationally interesting regime. We experimentally observe the presence of GBS enhancement with a large photon-click number and a robustness of the enhancement under certain noise. Our work is a step toward testing real-world problems using the existing noisy intermediate-scale quantum computers and hopes to stimulate the development of more efficient classical and quantum-inspired algorithms.

Unconditional and Robust Quantum Metrological Advantage beyond N00N States.

Quantum metrology employs quantum resources to enhance the measurement sensitivity beyond that can be achieved classically. While multiphoton entangled N00N states can in principle beat the shot-noise limit and reach the Heisenberg limit, high N00N states are difficult to prepare and fragile to photon loss which hinders them from reaching unconditional quantum metrological advantages. Here, we combine the idea of unconventional nonlinear interferometers and stimulated emission of squeezed light, previously developed for the photonic quantum computer Jiuzhang, to propose and realize a new scheme that achieves a scalable, unconditional, and robust quantum metrological advantage. We observe a 5.8(1)-fold enhancement above the shot-noise limit in the Fisher information extracted per photon, without discounting for photon loss and imperfections, which outperforms ideal 5-N00N states. The Heisenberg-limited scaling, the robustness to external photon loss, and the ease-of-use of our method make it applicable in practical quantum metrology at a low photon flux regime.

Experimental Refutation of Real-Valued Quantum Mechanics under Strict Locality Conditions.

Quantum mechanics is commonly formulated in a complex, rather than real, Hilbert space. However, whether quantum theory really needs the participation of complex numbers has been debated ever since its birth. Recently, a Bell-like test in an entanglement-swapping scenario has been proposed to distinguish standard quantum mechanics from its real-valued analog. Previous experiments have conceptually demonstrated, yet not satisfied, the central requirement of independent state preparation and measurements and leave several loopholes. Here, we implement such a Bell-like test with two separated independent sources delivering entangled photons to three separated parties under strict locality conditions that are enforced by spacelike separation of the relevant events, rapid random setting generation, and fast measurement. With the fair-sampling assumption and closed loopholes of independent source, locality, and measurement independence simultaneously, we violate the constraints of real-valued quantum mechanics by 5.30 standard deviations. Our results disprove the real-valued quantum theory to describe nature and ensure the indispensable role of complex numbers in quantum mechanics.

Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light.

We report phase-programmable Gaussian boson sampling (GBS) which produces up to 113 photon detection events out of a 144-mode photonic circuit. A new high-brightness and scalable quantum light source is developed, exploring the idea of stimulated emission of squeezed photons, which has simultaneously near-unity purity and efficiency. This GBS is programmable by tuning the phase of the input squeezed states. The obtained samples are efficiently validated by inferring from computationally friendly subsystems, which rules out hypotheses including distinguishable photons and thermal states. We show that our GBS experiment passes a nonclassicality test based on inequality constraints, and we reveal nontrivial genuine high-order correlations in the GBS samples, which are evidence of robustness against possible classical simulation schemes. This photonic quantum computer, Jiuzhang 2.0, yields a Hilbert space dimension up to ∼10^{43}, and a sampling rate ∼10^{24} faster than using brute-force simulation on classical supercomputers.