Optimizing quantum gates towards the scale of logical qubits.

A foundational assumption of quantum error correction theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Two major challenges that could become fundamental roadblocks are manufacturing high-performance quantum hardware and engineering a control system that can reach its performance limits. The control challenge of scaling quantum gates from small to large processors without degrading performance often maps to non-convex, high-constraint, and time-dynamic control optimization over an exponentially expanding configuration space. Here we report on a control optimization strategy that can scalably overcome the complexity of such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunable superconducting qubits to execute single- and two-qubit gates while mitigating computational errors. When combined with a comprehensive model of physical errors across our processor, the strategy suppresses physical error rates by ~3.7× compared with the case of no optimization. Furthermore, it is projected to achieve a similar performance advantage on a distance-23 surface code logical qubit with 1057 physical qubits. Our control optimization strategy solves a generic scaling challenge in a way that can be adapted to a variety of quantum operations, algorithms, and computing architectures.

Entangling Quantum Generative Adversarial Networks.

Generative adversarial networks (GANs) are one of the most widely adopted machine learning methods for data generation. In this work, we propose a new type of architecture for quantum generative adversarial networks (an entangling quantum GAN, EQ-GAN) that overcomes limitations of previously proposed quantum GANs. Leveraging the entangling power of quantum circuits, the EQ-GAN converges to the Nash equilibrium by performing entangling operations between both the generator output and true quantum data. In the first multiqubit experimental demonstration of a fully quantum GAN with a provably optimal Nash equilibrium, we use the EQ-GAN on a Google Sycamore superconducting quantum processor to mitigate uncharacterized errors, and we numerically confirm successful error mitigation with simulations up to 18 qubits. Finally, we present an application of the EQ-GAN to prepare an approximate quantum random access memory and for the training of quantum neural networks via variational datasets.

Indistinguishable single-mode photons from spectrally engineered biphotons.

We use pulsed spontaneous parametric down-conversion in KTiOPO 4, with a Gaussian phase-matching function and a transform-limited Gaussian pump, to achieve near-unity spectral purity in heralded single photons at telecommunication wavelength. Theory shows that these phase-matching and pump conditions are sufficient to ensure that a biphoton state with a circularly symmetric joint spectral intensity profile is transform limited and factorable. We verify the heralded-state spectral purity in a four-fold coincidence measurement by performing Hong-Ou-Mandel interference between two independently generated heralded photons. With a mild spectral filter we obtain an interference visibility of 98.4±1.1% which corresponds to a heralded-state purity of 99.2%. Our heralded photon source is potentially an essential resource for measurement-based quantum information processing and quantum network applications.

Qudit-Basis Universal Quantum Computation Using χ

We prove that universal quantum computation can be realized-using only linear optics and χ^{(2)} (three-wave mixing) interactions-in any (n+1)-dimensional qudit basis of the n-pump-photon subspace. First, we exhibit a strictly universal gate set for the qubit basis in the one-pump-photon subspace. Next, we demonstrate qutrit-basis universality by proving that χ^{(2)} Hamiltonians and photon-number operators generate the full u(3) Lie algebra in the two-pump-photon subspace, and showing how the qutrit controlled-Z gate can be implemented with only linear optics and χ^{(2)} interactions. We then use proof by induction to obtain our general qudit result. Our induction proof relies on coherent photon injection or subtraction, a technique enabled by χ^{(2)} interaction between the encoding modes and ancillary modes. Finally, we show that coherent photon injection is more than a conceptual tool, in that it offers a route to preparing high-photon-number Fock states from single-photon Fock states.

Efficient generation and characterization of spectrally factorable biphotons.

Spectrally unentangled biphotons with high single-spatiotemporal-mode purity are highly desirable for many quantum information processing tasks. We generate biphotons with an inferred heralded-state spectral purity of 99%, the highest to date without any spectral filtering, by pulsed spontaneous parametric downconversion in a custom-fabricated periodically-poled KTiOPO4 crystal under extended Gaussian phase-matching conditions. To efficiently characterize the joint spectral intensity of the generated biphotons at high spectral resolution, we employ a commercially available dispersion compensation module (DCM) with a dispersion equivalent to 100 km of standard optical fiber and with an insertion loss of only 2.8 dB. Compared with the typical method of using two temperature-stabilized equal-length fibers that incurs an insertion loss of 20 dB per fiber, the DCM approach achieves high spectral resolution in a much shorter measurement time. Because the dispersion amount and center wavelengths of DCMs can be easily customized, spectral characterization in a wide range of quantum photonic applications should benefit significantly from this technique.

Unity-Efficiency Parametric Down-Conversion via Amplitude Amplification.

We propose an optical scheme, employing optical parametric down-converters interlaced with nonlinear sign gates (NSGs), that completely converts an n-photon Fock-state pump to n signal-idler photon pairs when the down-converters' crystal lengths are chosen appropriately. The proof of this assertion relies on amplitude amplification, analogous to that employed in Grover search, applied to the full quantum dynamics of single-mode parametric down-conversion. When we require that all Grover iterations use the same crystal, and account for potential experimental limitations on crystal-length precision, our optimized conversion efficiencies reach unity for 1≤n≤5, after which they decrease monotonically for n values up to 50, which is the upper limit of our numerical dynamics evaluations. Nevertheless, our conversion efficiencies remain higher than those for a conventional (no NSGs) down-converter.