• Corpus ID: 232076129

High-performance parallel classical scheme for simulating shallow quantum circuits

  title={High-performance parallel classical scheme for simulating shallow quantum circuits},
  author={Shihao Zhang and Jiacheng Bao and Yifan Sun and Lvzhou Li and Houjun Sun and Xiangdong Zhang},
Recently, constant-depth quantum circuits are proved more powerful than their classical counterparts at solving certain problems, e.g., the two-dimensional (2D) hidden linear function (HLF) problem regarding a symmetric binary matrix. To further investigate the boundary between classical and quantum computing models, in this work we propose a high-performance two-stage classical scheme to solve a full-sampling variant of the 2D HLF problem, which combines traditional classical parallel… 

Figures from this paper


Quantum advantage with shallow circuits
It is shown that parallel quantum algorithms running in a constant time period are strictly more powerful than their classical counterparts; they are provably better at solving certain linear algebra problems associated with binary quadratic forms.
A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
Here we present qFlex, a flexible tensor network-based quantum circuit simulator. qFlex can compute both the exact amplitudes, essential for the verification of the quantum hardware, as well as
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
The Parity Halving Problem is constructed by constructing a new problem in QNC^0, which is easier to work with, and it is proved that AC^0 lower bounds for this problem are proved, and that it reduces to the 2D HLF problem.
Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
HPC simulations of hard random quantum circuits (RQC), which have been recently used as a benchmark for the first experimental demonstration of Quantum Supremacy, sustaining an average performance of 281 Pflop/s on Summit, currently the fastest supercomputer in the World, are reported.
64-qubit quantum circuit simulation
This work presents a scheme of simulation which can extract a large amount of measurement outcomes within a short time, achieving a 64-qubit simulation of a universal random circuit of depth 22 using a 128-node cluster, and 56- and 42- qubit circuits on a single PC.
Characterizing quantum supremacy in near-term devices
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of
Quantum-Teleportation-Inspired Algorithm for Sampling Large Random Quantum Circuits.
It is shown, for the first time, that the concept of teleportation can also be used to facilitate an important classical computing task, sampling random quantum circuits, which is highly relevant to prove the near-term demonstration of quantum computational supremacy.
Quantum supremacy: some fundamental concepts
  • M. Yung
  • Medicine, Computer Science
    National science review
  • 2019
The foundation of quantum computation cannot be established without a proof showing that BQP is strictly larger than P, which is as interesting as the famous challenge of proving P = NP (non-deterministic polynomial time).
Experimental comparison of two quantum computing architectures
It is shown that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits, and suggested that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.
Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond
It is shown how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form), which provides a simple proof of the Gottesman-Knill theorem without resorting to stabilizer techniques.