Pith. sign in

REVIEW 1 cited by

Quantum Supremacy Circuit Simulation on Sunway TaihuLight

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1804.04797 v3 pith:XJM2DL4F submitted 2018-04-13 quant-ph

classification quant-ph
keywords quantumcircuitcircuitscomputersdepthsimulationsimulatorsupremacy
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

With the rapid progress made by industry and academia, quantum computers with dozens of qubits or even larger size are being realized. However, the fidelity of existing quantum computers often sharply decreases as the circuit depth increases. Thus, an ideal quantum circuit simulator on classical computers, especially on high-performance computers, is needed for benchmarking and validation. We design a large-scale simulator of universal random quantum circuits, often called 'quantum supremacy circuits', and implement it on Sunway TaihuLight. The simulator can be used to accomplish the following two tasks: 1) Computing a complete output state-vector; 2) Calculating one or a few amplitudes. We target the simulation of 49-qubit circuits. For task 1), we successfully simulate such a circuit of depth 39, and for task 2) we reach the 55-depth level. To the best of our knowledge, both of the simulation results reach the largest depth for 49-qubit quantum supremacy circuits.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Speedup in Classical Simulation of Gaussian Boson Sampling

    quant-ph 2019-08 conditional novelty 7.0 of 10

    A classical sampling algorithm for Gaussian boson sampling decomposes Hafnians into smaller Hafnians and permanents, enabling simulation of 18-30 photons and lowering the estimated quantum-supremacy threshold.

Pith tools