Quantum circuits with many photons on a programmable nanophotonic chip.

Growing interest in quantum computing for practical applications has led to a surge in the availability of programmable machines for executing quantum algorithms1,2. Present-day photonic quantum computers3-7 have been limited either to non-deterministic operation, low photon numbers and rates, or fixed random gate sequences. Here we introduce a full-stack hardware-software system for executing many-photon quantum circuit operations using integrated nanophotonics: a programmable chip, operating at room temperature and interfaced with a fully automated control system. The system enables remote users to execute quantum algorithms that require up to eight modes of strongly squeezed vacuum initialized as two-mode squeezed states in single temporal modes, a fully general and programmable four-mode interferometer, and photon number-resolving readout on all outputs. Detection of multi-photon events with photon numbers and rates exceeding any previous programmable quantum optical demonstration is made possible by strong squeezing and high sampling rates. We verify the non-classicality of the device output, and use the platform to carry out proof-of-principle demonstrations of three quantum algorithms: Gaussian boson sampling, molecular vibronic spectra and graph similarity8. These demonstrations validate the platform as a launchpad for scaling photonic technologies for quantum information processing.

Tsirelson's bound and supersymmetric entangled states.

A superqubit, belonging to a (2|1)-dimensional super-Hilbert space, constitutes the minimal supersymmetric extension of the conventional qubit. In order to see whether superqubits are more non-local than ordinary qubits, we construct a class of two-superqubit entangled states as a non-local resource in the CHSH game. Since super Hilbert space amplitudes are Grassmann numbers, the result depends on how we extract real probabilities and we examine three choices of map: (1) DeWitt (2) Trigonometric and (3) Modified Rogers. In cases (1) and (2), the winning probability reaches the Tsirelson bound [Formula: see text] of standard quantum mechanics. Case (3) crosses Tsirelson's bound with pwin≃0.9265. Although all states used in the game involve probabilities lying between 0 and 1, case (3) permits other changes of basis inducing negative transition probabilities.