Benchmarking Quantum Simulators Using Ergodic Quantum Dynamics

Benchmarking highly entangled states on a 60-atom analogue quantum simulator

Quantum systems have entered a competitive regime in which classical computers must make approximations to represent highly entangled quantum states1,2. However, in this beyond-classically-exact regime, fidelity comparisons between quantum and classical systems have so far been limited to digital quantum devices2-5, and it remains unsolved how to estimate the actual entanglement content of experiments6. Here, we perform fidelity benchmarking and mixed-state entanglement estimation with a 60-atom analogue Rydberg quantum simulator, reaching a high-entanglement entropy regime in which exact classical simulation becomes impractical. Our benchmarking protocol involves extrapolation from comparisons against an approximate classical algorithm, introduced here, with varying entanglement limits. We then develop and demonstrate an estimator of the experimental mixed-state entanglement6, finding our experiment is competitive with state-of-the-art digital quantum devices performing random circuit evolution2-5. Finally, we compare the experimental fidelity against that achieved by various approximate classical algorithms, and find that only the algorithm we introduce is able to keep pace with the experiment on the classical hardware we use. Our results enable a new model for evaluating the ability of both analogue and digital quantum devices to generate entanglement in the beyond-classically-exact regime, and highlight the evolving divide between quantum and classical systems.

An elementary review on basic principles and developments of qubits for quantum computing

An elementary review on principles of qubits and their prospects for quantum computing is provided. Due to its rapid development, quantum computing has attracted considerable attention as a core technology for the next generation and has demonstrated its potential in simulations of exotic materials, molecular structures, and theoretical computer science. To achieve fully error-corrected quantum computers, building a logical qubit from multiple physical qubits is crucial. The number of physical qubits needed depends on their error rates, making error reduction in physical qubits vital. Numerous efforts to reduce errors are ongoing in both existing and emerging quantum systems. Here, the principle and development of qubits, as well as the current status of the field, are reviewed to provide information to researchers from various fields and give insights into this promising technology.

A von-Neumann-like photonic processor and its application in studying quantum signature of chaos

Photonic quantum computation plays an important role and offers unique advantages. Two decades after the milestone work of Knill-Laflamme-Milburn, various architectures of photonic processors have been proposed, and quantum advantage over classical computers has also been demonstrated. It is now the opportune time to apply this technology to real-world applications. However, at current technology level, this aim is restricted by either programmability in bulk optics or loss in integrated optics for the existing architectures of processors, for which the resource cost is also a problem. Here we present a von-Neumann-like architecture based on temporal-mode encoding and looped structure on table, which is capable of multimode-universal programmability, resource-efficiency, phase-stability and software-scalability. In order to illustrate these merits, we execute two different programs with varying resource requirements on the same processor, to investigate quantum signature of chaos from two aspects: the signature behaviors exhibited in phase space (13 modes), and the Fermi golden rule which has not been experimentally studied in quantitative way before (26 modes). The maximal program contains an optical interferometer network with 1694 freely-adjustable phases. Considering current state-of-the-art, our architecture stands as the most promising candidate for real-world applications.

Accreditation of analogue quantum simulators

We present an accreditation protocol for analogue, i.e., continuous-time, quantum simulators. For a given simulation task, it provides an upper bound on the variation distance between the probability distributions at the output of an erroneous and error-free analogue quantum simulator. As its overheads are independent of the size and nature of the simulation, the protocol is ready for immediate usage and practical for the long term. It builds on the recent theoretical advances of strongly universal Hamiltonians and quantum accreditation as well as experimental progress toward the realization of programmable hybrid analogue-digital quantum simulators.