Pith. sign in

REVIEW 2 cited by

Harnessing CUDA-Q's MPS for Tensor Network Simulations of Large-Scale Quantum Circuits

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 2501.15939 v1 pith:B62V7YIR submitted 2025-01-27 quant-ph cs.DC

Harnessing CUDA-Q's MPS for Tensor Network Simulations of Large-Scale Quantum Circuits

classification quant-ph cs.DC
keywords quantumsimulatorstensorcomputerscuda-qcurrentnetworkqubits
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Quantum computer simulators are an indispensable tool for prototyping quantum algorithms and verifying the functioning of existing quantum computer hardware. The current largest quantum computers feature more than one thousand qubits, challenging their classical simulators. State-vector quantum simulators are challenged by the exponential increase of representable quantum states with respect to the number of qubits, making more than fifty qubits practically unfeasible. A more appealing approach for simulating quantum computers is adopting the tensor network approach, whose memory requirements fundamentally depend on the level of entanglement in the quantum circuit, and allows simulating the current largest quantum computers. This work investigates and evaluates the CUDA-Q tensor network simulators on an Nvidia Grace Hopper system, particularly the Matrix Product State (MPS) formulation. We compare the performance of the CUDA-Q state vector implementation and validate the correctness of MPS simulations. Our results highlight that tensor network-based methods provide a significant opportunity to simulate large-qubit circuits, albeit approximately. We also show that current GPU-accelerated computation cannot fully utilize GPU efficiently in the case of MPS simulations.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm

    quant-ph 2026-06 unverdicted novelty 6.0

    Introduces a parallelizable hybrid tensor network algorithm for time-evolving matrix product states that combines classical BUG integration with quantum methods without synchronization barriers.

  2. Benchmarking Zero-Setup Quantum Circuit Simulators

    quant-ph 2026-07 conditional novelty 5.5

    GPU-accelerated zero-setup simulators show sub-quadratic MPS bond-dimension scaling and up to 1,400× PPS speedups, uniquely reaching fine truncation accuracy on the 127-qubit kicked Ising circuit.