Closing the “Quantum Supremacy” Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer

  title={Closing the “Quantum Supremacy” Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer},
  author={Yong Liu and Xin Liu and Fang Li and Haohuan Fu and Yuling Yang and Jiawei Song and Pengpeng Zhao and Zhen Wang and Dajia Peng and Huarong Chen and Chu Guo and He-Liang Huang and Wenzhao Wu and Dexun Chen},
  journal={SC21: International Conference for High Performance Computing, Networking, Storage and Analysis},
  • Yong LiuXin Liu Dexun Chen
  • Published 27 October 2021
  • Computer Science
  • SC21: International Conference for High Performance Computing, Networking, Storage and Analysis
We develop a high-performance tensor-based simulator for random quantum circuits(RQCs) on the new Sunway supercomputer. Our major innovations include: (1) a near-optimal slicing scheme, and a path-optimization strategy that considers both complexity and compute density; (2) a three-level parallelization scheme that scales to about 42 million cores; (3) a fused permutation and multiplication design that improves the compute efficiency for a wide range of tensor contraction scenarios; and (4) a… 

A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity

We develop a density-matrix renormalization group (DMRG) algorithm for the simulation of quantum circuits. This algorithm can be seen as the extension of time-dependent DMRG from the usual situation

ScaleQC: A Scalable Framework for Hybrid Computation on Quantum and Classical Processors

The tool, called ScaleQC, addresses the bottlenecks by developing novel algorithmic techniques including a quantum states merging framework that quickly locates the solution states of large quantum circuits and a tensor network based post-processing that mini-mizes the classical overhead.

Lifetime-based Method for Quantum Simulation on a New Sunway Supercomputer

Novel lifetime-based methods to reduce the slicing overhead and improve the slicingency are proposed, including: interpretation for slicing overhead, an in place slicing strategy to the smallest slicing set, a corresponding iterative method, and an adaptive path refiner customized for Sunway architecture.

swAFL: A library of High-Performance Activation Function for the Sunway Architecture

Two activation function algorithms with different computing accuracies were developed in this study, and an efficient implementation scheme was designed using the single instruction/multiple data extension and multiply–add instructions of the platform.

swMPAS-A: Scaling MPAS-A to 39 Million Heterogeneous Cores on the New Generation Sunway Supercomputer

A custom data reorganization method is applied to enable N-to-M I/O mode to exploit the parallel file system's performance and limit the data transfer among MPI ranks to a restricted scope to alleviate communication overhead.

An optimized framework for Matrix Factorization on the New Sunway many-core Platform

This work proposes a new framework for implementing matrix factorization functions on the new Sunway many-core platform, facilitating the in-LDM panel factorization, and implemented three functions based on the framework, and compared its work with a \(CPE\_BLAS \) version.

Non-Kolmogorovian Probabilities and Quantum Technologies

In this work, we focus on the philosophical aspects and technical challenges that underlie the axiomatization of the non-Kolmogorovian probability framework, in connection with the problem of quantum

Noise in the Clouds: Influence of Network Performance Variability on Application Scalability

This work analyzes network performance, scalability, and cost of running HPC workloads on cloud systems by considering latency, bandwidth, and collective communication patterns in detailed small-scale measurements, and then simulating network performance at a larger scale.

HPC Forecast: Cloudy and Uncertain

Building the next generation of leading edge HPC systems will require rethinking many fundamentals and historical approaches by embracing end-to-end co-design; custom hardware configurations and packaging; large-scale prototyping, as was common thirty years ago; and collaborative partnerships with the dominant computing ecosystem companies.

SoK: Benchmarking the Performance of a Quantum Computer

This paper reviews the existing performance benchmarking protocols, models, and metrics of the quantum computer, and classifies the benchmarking techniques into three categories: physical benchmarking, aggregative benchmarked, and application-level benchmarking.



Announcing Supercomputer Summit

Summit will deliver more than five times the computational performance of Titan’s 18,688 nodes, using only approximately 3,400 nodes when it arrives in 2017.

Simulation of low-depth quantum circuits as complex undirected graphical models

Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond

A flexible high-performance simulator for the verification and benchmarking of quantum circuits implemented on real hardware

A flexible tensor network based simulator for quantum circuits on different topologies, including the Google Bristlecone QPU, that enables the simulation of sampling on quantum circuits that were out of reach for previous approaches is presented.

Simulating the Sycamore quantum supremacy circuits

A general tensor network method for simulating quantum circuits is proposed, employing a small computational cluster containing 60 graphical processing units (GPUs) and generated one million correlated bitstrings from Google's Sycamore circuit, which is much higher than those in Google's quantum supremacy experiments.

Classical Simulation of Quantum Supremacy Circuits

It is shown that achieving quantum supremacy may require a period of continuing quantum hardware developments without an unequivocal first demonstration, and an orders-of-magnitude reduction in classical simulation time is indicated.

Classical Simulation of Intermediate-Size Quantum Circuits

By successfully simulating quantum supremacy circuits of size, this work gives evidence that noisy random circuits with realistic physical parameters may be simulated classically, and suggests that either harder circuits or error-correction may be vital for achieving quantum supremacy from random circuit sampling.

Tensor Networks in a Nutshell

This tutorial concludes the tutorial with tensor contractions evaluating combinatorial counting problems and Penrose's tensor contraction algorithm, returning the number of edge-colorings of regular planar graphs.

Solving the sampling problem of the Sycamore quantum supremacy circuits

A new method is proposed to classically solve the problem of generating independent samples from the output distribution of Google’s Sycamore quantum circuits by contracting the corresponding tensor network just once, and is massively more efficient than existing methods in obtaining a large number of uncorrelated samples with a target fidelity.

Multi-Tensor Contraction for XEB Verification of Quantum Circuits

The computational advantage of noisy quantum computers has been demonstrated by sampling the bitstrings of quantum random circuits by exploiting the noise in the input and output of these circuits.

Quantum walks on a programmable two-dimensional 62-qubit superconducting processor

An 8-by-8 two-dimensional square superconducting qubit square lattice containing 62 functional qubits is used to show how multiple (two) walkers traverse a 2D qubit array, interfering as they go, and implemented a Mach-Zehnder interferometer where the quantum walker coherently traverses in two paths before interfering and exiting.