Nonadaptive fault-tolerant verification of quantum supremacy with noise

Quantum samplers are believed capable of sampling efficiently from distributions that are classically hard to sample from. We consider a sampler inspired by the classical Ising model. It is nonadaptive and therefore experimentally amenable. Under a plausible conjecture, classical sampling upto additive errors from this model is known to be hard. We present a trap-based verification scheme for quantum supremacy that only requires the verifier to prepare single-qubit states. The verification is done on the same model as the original sampler, a square lattice, with only a constant overhead. We next revamp our verification scheme in two distinct ways using fault tolerance that preserves the nonadaptivity. The first has a lower overhead based on error correction with the same threshold as universal quantum computation. The second has a higher overhead but an improved threshold (1.97%) based on error detection. We show that classically sampling upto additive errors is likely hard in both these schemes. Our results are applicable to other sampling problems such as the Instantaneous Quantum Polynomial-time (IQP) computation model. They should also assist near-term attempts at experimentally demonstrating quantum supremacy and guide long-term ones

Achieving quantum supremacy with sparse and noisy commuting quantum computations

The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence of physically motivated constraints. First, we show that there is a family of sparse IQP circuits that can be implemented on a square lattice of n qubits in depth O(sqrt(n) log n), and which is likely hard to simulate classically. Next, we show that, if an arbitrarily small constant amount of noise is applied to each qubit at the end of any IQP circuit whose output probability distribution is sufficiently anticoncentrated, there is a polynomial-time classical algorithm that simulates sampling from the resulting distribution, up to constant accuracy in total variation distance. However, we show that purely classical error-correction techniques can be used to design IQP circuits which remain hard to simulate classically, even in the presence of arbitrary amounts of noise of this form. These results demonstrate the challenges faced by experiments designed to demonstrate quantum supremacy over classical computation, and how these challenges can be overcome

Quantum Information in Rydberg-Dressed Atoms

In any physical platform, two ingredients are essential for quantum information processing: single-qubit control, and entangling interactions between qubits. Neutral atoms can be individually controlled with high fidelity and are resilient to environmental noise, making them attractive candidates for implementing quantum information protocols. However, achieving strong interactions remains a major obstacle. One way to increase the interaction strength between neutral atoms is to excite them into high-lying Rydberg states, which exhibit large electric dipole moments (and by extension, strong electric dipole-dipole interactions). By slowly ramping up the Rydberg level coupling in a system, one can dress\u27\u27 the atomic ground states with some Rydberg character; this maps the Rydberg dipole interaction to an effective interaction between ground states. Such Rydberg-dressed interaction is the focus of this dissertation. After describing the physics of the Rydberg-dressed interaction, we propose three protocols that demonstrate its versatility and provide a framework for considering some of the details of realistic implementation. In all three cases, Rydberg dressing --- along with some form of single-atom control --- is used to generate highly entangled states of interest. Our first proposal relates to the adiabatic model of quantum computing, in which solutions to problems are encoded in the ground states of carefully engineered Hamiltonians. The Rydberg-dressed interaction can provide nonlinear Hamiltonian terms, allowing us to encode NP-hard and other interesting problems. We model this protocol in the presence of decoherence, and find that computational fidelities of ~0.98 for four atoms should be possible with currently realistic experimental parameters. Our second proposal is also related to quantum computing, this time in the circuit model. The Rydberg-dressed interaction can be used to generate a controlled-NOT logic gate which, when interwoven with single-qubit gates, can perform universal quantum computation. Experimentally, noise due to atomic thermal motion has been a primary limitation on the fidelities of these gates. We show that a Doppler-free setup, with counterpropagating lasers, effectively suppresses this type of noise, allowing simulated fidelities of up to ~0.998 per gate. Such strong suppression is only possible because the Doppler-free configuration can harness the natural robustness of adiabatic dressing; other gate schemes using, e.g., resonant pulses, do not exhibit the same degree of improvement. Finally, we consider exploiting the many-body character of the Rydberg-dressed interaction to generate collective entanglement in mesoscopic ensembles of neutral atoms. An atomic ensemble uniformly illuminated by a single Rydberg-exciting laser is isomorphic to the well-known Jaynes-Cummings model. In addition to adapting generic Jaynes-Cummings entanglement protocols developed in other platforms, one can apply microwaves to drive entanglement in a way that is unique to the atomic platform. We prove that by allowing the microwave phase to vary in time, one can generate arbitrary symmetric states of the ensemble. While this method compares favorably with other entanglement protocols in many ways, the required frequency of phase switching presents a fundamental limitation on its effectiveness. To mitigate this, we propose a variant scheme in which parameters are chosen to only allow excitations within the system\u27s dressed-ground subspace; this effectively cuts phase switching demands in half. All three protocols serve to illustrate the power of the Rydberg-dressed interaction and suggest directions for future study

Analog Photonics Computing for Information Processing, Inference and Optimisation

This review presents an overview of the current state-of-the-art in photonics computing, which leverages photons, photons coupled with matter, and optics-related technologies for effective and efficient computational purposes. It covers the history and development of photonics computing and modern analogue computing platforms and architectures, focusing on optimization tasks and neural network implementations. The authors examine special-purpose optimizers, mathematical descriptions of photonics optimizers, and their various interconnections. Disparate applications are discussed, including direct encoding, logistics, finance, phase retrieval, machine learning, neural networks, probabilistic graphical models, and image processing, among many others. The main directions of technological advancement and associated challenges in photonics computing are explored, along with an assessment of its efficiency. Finally, the paper discusses prospects and the field of optical quantum computing, providing insights into the potential applications of this technology.Comment: Invited submission by Journal of Advanced Quantum Technologies; accepted version 5/06/202