A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware

Abstract

Here we present qFlex, a flexible tensor network based quantum circuit simulator. qFlex can compute both exact amplitudes, essential for the verification of the quantum hardware, as well as low fidelity amplitudes, in order to mimic sampling from Noisy Intermediate-Scale Quantum (NISQ) devices. In this work, we focus on random quantum circuits (RQCs) in the range of sizes expected for supremacy experiments. Fidelity $f$ simulations are performed at a cost that is $1/f$ lower than perfect fidelity ones. We also present a technique to eliminate the overhead introduced by rejection sampling in most tensor network approaches. We benchmark the simulation of square lattices and Google's Bristlecone QPU. Our analysis is supported by extensive simulations on NASA HPC clusters Pleiades and Electra. For our most computationally demanding simulation, the two clusters combined reached a peak of 20 PFLOPS (single precision), i.e., $64\%$ of their maximum achievable performance, which represents the largest numerical computation in terms of sustained FLOPs and number of nodes utilized ever run on NASA HPC clusters. Finally, we introduce a novel multithreaded, cache-efficient tensor index permutation algorithm of general application.

Paper published on NPJ Quantum Information

References in corpus (38)

• Quantum Computing in the NISQ era and beyond
• Surface codes: Towards practical large-scale quantum computation
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Simulated Quantum Computation of Molecular Energies
• Characterizing Quantum Supremacy in Near-Term Devices
• Randomized Benchmarking of Quantum Gates
• Quantum Computational Supremacy
• Robust randomized benchmarking of quantum processes
• Scalable Noise Estimation with Random Unitary Operators
• Simulating quantum computation by contracting tensor networks
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Digital quantum simulation of fermionic models with a superconducting circuit
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Average-case complexity versus approximate simulation of commuting quantum computations
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Low Depth Quantum Simulation of Electronic Structure
• QuEST and High Performance Simulation of Quantum Computers
• Massive Parallel Quantum Computer Simulator
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit
• Quantum algorithms to simulate many-body physics of correlated fermions
• Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
• 64-Qubit Quantum Circuit Simulation
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Massively parallel quantum computer simulator, eleven years later
• qHiPSTER: The Quantum High Performance Software Testing Environment
• General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
• Simulation of low-depth quantum circuits as complex undirected graphical models
• Classical Simulation of Intermediate-Size Quantum Circuits
• Quantum Supremacy Is Both Closer and Farther than It Appears
• Gaussian Noise Sensitivity and BosonSampling
• Quantum Teleportation-Inspired Algorithm for Sampling Large Random Quantum Circuits
• Efficient classical simulation of noisy quantum computation
• Quantum Supremacy Circuit Simulation on Sunway TaihuLight
• Fourier analysis of sampling from noisy chaotic quantum circuits
• Efficient unitary paths and quantum computational supremacy: A proof of average-case hardness of Random Circuit Sampling
• Can Chaotic Quantum Circuits Maintain Quantum Supremacy under Noise?

Cited by in corpus (78)

• Strong quantum computational advantage using a superconducting quantum processor
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Information Scrambling in Computationally Complex Quantum Circuits
• QuEST and High Performance Simulation of Quantum Computers
• MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
• Hyper-optimized tensor network contraction
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
• Solving the sampling problem of the Sycamore quantum circuits
• Qibo: a framework for quantum simulation with hardware acceleration
• Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
• Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
• Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
• Phase transition in Random Circuit Sampling
• Intel Quantum Simulator: A cloud-ready high-performance simulator of quantum circuits
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Classical Simulation of Quantum Supremacy Circuits
• General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
• NISQ Computers: A Path to Quantum Supremacy
• Is quantum computing green? An estimate for an energy-efficiency quantum advantage
• The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing
• Boundaries of quantum supremacy via random circuit sampling
• Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction
• Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
• Simulating the Sycamore quantum supremacy circuits
• Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
• GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
• Accrediting outputs of noisy intermediate-scale quantum computing devices
• Fast estimation of outcome probabilities for quantum circuits
• Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
• Quantum Divide and Compute: Exploring The Effect of Different Noise Sources
• The computational power of random quantum circuits in arbitrary geometries
• Bootstrapping quantum process tomography via a perturbative ansatz
• Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm
• Hyper-optimized approximate contraction of tensor networks with arbitrary geometry
• Decision Diagrams for Quantum Computing
• Benchmarking Quantum Computer Simulation Software Packages: State Vector Simulators
• Towards an Automated Framework for Realizing Quantum Computing Solutions
• Tensor networks for quantum computing
• Tensor Networks for Lattice Gauge Theories beyond one dimension: a Roadmap
• Quantum algorithms for scientific computing
• As Accurate as Needed, as Efficient as Possible: Approximations in DD-based Quantum Circuit Simulation
• Qibolab: an open-source hybrid quantum operating system
• Simulation of quantum optics by coherent state decomposition
• Validating quantum-supremacy experiments with exact and fast tensor network contraction
• On the sampling complexity of open quantum systems
• From Ansätze to Z-gates: a NASA View of Quantum Computing
• Fast Classical Simulation of Hamiltonian Dynamics by Simultaneous Diagonalization Using Clifford Transformation with Parallel Computation
• Towards an Automatic Framework for Solving Optimization Problems with Quantum Computers
• Fast simulation of quantum algorithms using circuit optimization
• Entanglement bounds on the performance of quantum computing architectures
• Qsun: an open-source platform towards practical quantum machine learning applications
• Entanglement entropy scaling of noisy random quantum circuits in two dimensions
• Entanglement and complexity of interacting qubits subject to asymmetric noise
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits
• Simulator Demonstration of Large Scale Variational Quantum Algorithm on HPC Cluster
• Quantum Circuit Parameters Learning with Gradient Descent Using Backpropagation
• Loop Series Expansions for Tensor Networks
• RosneT: A Block Tensor Algebra Library for Out-of-Core Quantum Computing Simulation
• A Predictive Approach for Selecting the Best Quantum Solver for an Optimization Problem
• Quantum Circuit Simulation with Fast Tensor Decision Diagram
• Methods for Classically Simulating Noisy Networked Quantum Architectures
• The resource cost of large scale quantum computing
• HybridQ: A Hybrid Simulator for Quantum Circuits
• QuOp_MPI: a framework for parallel simulation of quantum variational algorithms
• Efficient approximation of experimental Gaussian boson sampling
• Exact Model Reduction for Continuous-Time Open Quantum Dynamics
• Hiperwalk: Simulation of Quantum Walks with Heterogeneous High-Performance Computing
• Efficient Construction of Functional Representations for Quantum Algorithms
• Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits
• Matrix Product State on a Quantum Computer
• Quantum Computation
• Dynamical cluster-based strategy for improving tensor network algorithms in quantum circuit simulations
• Considering Decoherence Errors in the Simulation of Quantum Circuits Using Decision Diagrams
• High-performance parallel classical scheme for simulating shallow quantum circuits
• Model Checking for Verification of Quantum Circuits
• Integrating Neural Networks and Tensor Networks for Computing Free Energy
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits
• A Multilayer Network Approach to Quantum Computing