Pith. sign in

REVIEW 5 cited by

Simulations of Quantum Circuits with Approximate Noise using qsim and Cirq

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 2111.02396 v1 pith:SXVTXXMB submitted 2021-11-03 quant-ph

classification quant-ph
keywords quantumcircuitsgooglemultinodenoiseqsimsimulationsapproximate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce multinode quantum trajectory simulations with qsim, an open source high performance simulator of quantum circuits. qsim can be used as a backend of Cirq, a Python software library for writing quantum circuits. We present a novel delayed inner product algorithm for quantum trajectories which can result in an order of magnitude speedup for low noise simulation. We also provide tools to use this framework in Google Cloud Platform, with high performance virtual machines in a single mode or multinode setting. Multinode configurations are well suited to simulate noisy quantum circuits with quantum trajectories. Finally, we introduce an approximate noise model for Google's experimental quantum computing platform and compare the results of noisy simulations with experiments for several quantum algorithms on Google's Quantum Computing Service.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning

    cs.ET 2026-08 conditional novelty 6.0 of 10

    A Feynman path-sum simulator reduces the history space via boundary-value propagation and checkpointing, enabling exact sparse-output simulation of 100-qubit quantum walks.

  2. Matrix Product Evolution: A Method for Simulating Quantum Circuits Using Tensor Networks

    quant-ph 2026-08 conditional novelty 5.0 of 10

    A depth-oriented tensor-network contraction method, called MPE, is introduced and shown to gain accuracy from post-selection, complementing standard MPS simulation.

  3. A High-Performance Pauli-Algebra Framework for Large-Scale Quantum Simulations

    quant-ph 2026-06 unverdicted novelty 5.0 of 10

    BinSim accelerates Pauli multiplication, Hamiltonian construction, and operator–state products via binary symplectic encoding and bit-flip grouping, enabling large-active-space VQE and dynamics on multicore CPUs and GPUs.

  4. Taxonomy of migration scenarios for Qiskit refactoring using LLMs

    cs.SE 2025-06 conditional novelty 5.0 of 10

    LLMs can generate a structured taxonomy of Qiskit migration and refactoring scenarios that largely overlaps with an expert-built taxonomy and adds some scenarios.

  5. SLURM Heterogeneous Jobs for Hybrid Classical-Quantum Workflows

    cs.DC 2025-06 conditional novelty 4.0 of 10

    Splitting hybrid classical-quantum workflows into sub-jobs and using MPI dynamic process management lets SLURM release the quantum device earlier, potentially reducing quantum idle time and total wall time.

Pith tools