Pith. sign in

REVIEW 1 cited by

SW-TNC : Reaching the Most Complex Random Quantum Circuit via Tensor Network Contraction

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 2504.09186 v1 pith:6WUCFFDK submitted 2025-04-12 cs.DC

classification cs.DC
keywords quantumsimulationclassicalcircuitcomplexcomplexitycontractiondata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Classical simulation is essential in quantum algorithm development and quantum device verification. With the increasing complexity and diversity of quantum circuit structures, existing classical simulation algorithms need to be improved and extended. In this work, we propose novel strategies for tensor network contraction based simulator on Sunway architecture. Our approach addresses three main aspects: complexity, computational paradigms and fine-grained optimization. Data reuse schemes are designed to reduce floating-point operations, and memory organization techniques are employed to eliminate slicing overhead while maintaining parallelism. Step fusion strategy is extended by multi-core cooperation to improve the data locality and computation intensity. Fine-grained optimizations, such as in-kernel vectorized permutations, and split-K operators, are developed as well to address the challenges in new hotspot distribution and topological structure. These innovations can accelerate the simulation of the Zuchongzhi-60-24 by more than 10 times, using more than 1024 Sunway nodes (399,360 cores). Our work demonstrates the potential for enabling efficient classical simulation of increasingly complex quantum 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. GenTT: Generate Vectorized Codes for General Tensor Permutation

    cs.DS 2025-06 conditional novelty 6.0 of 10

    GenTT generates optimized SIMD code for arbitrary tensor permutations by tiling the tensor into blocks that are contiguous in both input and output and performing in-register butterfly shuffles.

Pith tools