Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
arXiv:2306.15970 · doi:10.1016/j.future.2023.12.002
Abstract
Today's experimental noisy quantum processors can compete with and surpass all known algorithms on state-of-the-art supercomputers for the computational benchmark task of Random Circuit Sampling [1-5]. Additionally, a circuit-based quantum simulation of quantum information scrambling [6], which measures a local observable, has already outperformed standard full wave function simulation algorithms, e.g., exact Schrodinger evolution and Matrix Product States (MPS). However, this experiment has not yet surpassed tensor network contraction for computing the value of the observable. Based on those studies, we provide a unified framework that utilizes the underlying effective circuit volume to explain the tradeoff between the experimentally achievable signal-to-noise ratio for a specific observable, and the corresponding computational cost. We apply this framework to recent quantum processor experiments of Random Circuit Sampling [5], quantum information scrambling [6], and a Floquet circuit unitary [7]. This allows us to reproduce the results of Ref. [7] in less than one second per data point using one GPU.
References in corpus (41)
- Fault-tolerant quantum computation by anyons
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Simulated Quantum Computation of Molecular Energies
- Characterizing Quantum Supremacy in Near-Term Devices
- Strong quantum computational advantage using a superconducting quantum processor
- Suppressing quantum errors by scaling a surface code logical qubit
- Fault-tolerant quantum computation with high threshold in two dimensions
- Stabilizer Codes and Quantum Error Correction
- Hartree-Fock on a superconducting qubit quantum computer
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Quantum advantage in learning from experiments
- Simulating quantum computation by contracting tensor networks
- Exponentially slow heating in periodically driven many-body systems
- Observation of Time-Crystalline Eigenstate Order on a Quantum Processor
- Realization of an Error-Correcting Surface Code with Superconducting Qubits
- Information Scrambling in Computationally Complex Quantum Circuits
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
- Hyper-optimized tensor network contraction
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Solving the sampling problem of the Sycamore quantum circuits
- Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
- Massively parallel quantum computer simulator, eleven years later
- Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
- Noise-resilient Edge Modes on a Chain of Superconducting Qubits
- Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
- Formation of robust bound states of interacting microwave photons
- Classical Simulation of Quantum Supremacy Circuits
- Simulation of low-depth quantum circuits as complex undirected graphical models
- A polynomial-time classical algorithm for noisy random circuit sampling
- Classical Simulation of Intermediate-Size Quantum Circuits
- Efficient tensor network simulation of IBM's largest quantum processors
- How to simulate quantum measurement without computing marginals
- Benchmarking near-term quantum computers via random circuit sampling
- Fast classical simulation of evidence for the utility of quantum computing before fault tolerance
- Multi-Tensor Contraction for XEB Verification of Quantum Circuits
- Classical benchmarking of zero noise extrapolation beyond the exactly-verifiable regime
- Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator
- On Certified Randomness from Fourier Sampling or Random Circuit Sampling
Cited by in corpus (27)
- Beyond-classical computation in quantum simulation
- Phase transition in Random Circuit Sampling
- Early Fault-Tolerant Quantum Computing
- Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
- Benchmarking highly entangled states on a 60-atom analog quantum simulator
- Real-time operator evolution in two and three dimensions via sparse Pauli dynamics
- Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
- Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
- The Quantum House Of Cards
- Pauli path simulations of noisy quantum circuits beyond average case
- Benchmarking quantum gates and circuits
- Operator dynamics in Floquet many-body systems
- Noise-induced shallow circuits and absence of barren plateaus
- Quantum Vulnerability Analysis to Accurate Estimate the Quantum Algorithm Success Rate
- Hubbard physics with Rydberg atoms: using a quantum spin simulator to simulate strong fermionic correlations
- Simulating quantum dynamics in two-dimensional lattices with tensor network influence functional belief propagation
- Noise-Robust Detection of Quantum Phase Transitions
- Exponential Qubit Reduction in Optimization for Financial Transaction Settlement
- Simulating quantum circuits with arbitrary local noise using Pauli Propagation
- Dilution of error in digital Hamiltonian simulation
- Lindblad engineering for quantum Gibbs state preparation under the eigenstate thermalization hypothesis
- Counting collisions in random circuit sampling for benchmarking quantum computers
- Gravitational-wave matched filtering on a quantum computer
- Harnessing Quantum Dynamics for Robust and Scalable Quantum Extreme Learning Machines
- Neural-network-assisted Monte Carlo sampling trained by Quantum Approximate Optimization Algorithm
- Preparing the Gutzwiller wave function for attractive SU(3) fermions on a quantum computer
- Dynamical complexity of non-Gaussian many-body systems with dissipation