Pith. sign in

REVIEW 4 cited by

Simulating Markovian open quantum systems using higher-order series expansion

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 2212.02051 v2 pith:ED2TUS3W submitted 2022-12-05 quant-ph

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

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. The performance of our algorithm is similar to the previous state-of-the-art quantum algorithm, i.e., it scales linearly in evolution time and poly-logarithmically in inverse precision. However, our algorithm is conceptually cleaner, and it only uses simple quantum primitives without compressed encoding. Our approach is based on a novel mathematical treatment of the evolution map, which involves a higher-order series expansion based on Duhamel's principle and approximating multiple integrals using scaled Gaussian quadrature. Our method easily generalizes to simulating quantum dynamics with time-dependent Lindbladians. Furthermore, our method of approximating multiple integrals using scaled Gaussian quadrature could potentially be used to produce a more efficient approximation of time-ordered integrals, and therefore can simplify existing quantum algorithms for simulating time-dependent Hamiltonians based on a truncated Dyson series.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Super-bath Quantum Eigensolver

    quant-ph 2024-12 conditional novelty 7.0 of 10

    The authors propose the super-bath quantum eigensolver (SQE), a dissipation-based quantum algorithm that prepares ground states with polynomial resources whenever a physical sub-bath exists, and provide a rigorous err...

  2. Semantic Prompting: Agentic Incremental Narrative Refinement through Spatial Semantic Interaction

    cs.HC 2026-04 unverdicted novelty 6.0 of 10

    The paper extends KMS-detailed-balance Lindbladian constructions beyond Gibbs states to prepare general stationary states σ=f(H)/Tr[f(H)], including microcanonical window states, with polynomial-time quantum circuit i...

  3. Quantum algorithm for dephasing of coupled systems: decoupling and IQP duality

    quant-ph 2026-01 conditional novelty 6.0 of 10

    A quantum algorithm simulates unital dephasing dynamics by sampling stochastic unitaries and decouples coupled fermion-boson dephasing into an IQP circuit that controls the fermion evolution.

  4. Optimising Trotter-Suzuki Simulations of Markovian Open Quantum Systems via Classical Search

    quant-ph 2026-07 accept novelty 5.0 of 10

    Binary search on diamond-norm error functions yields far fewer Trotter steps than closed-form analytic bounds for deterministic and randomised TS product formulas on Markovian open systems, with second-order randomise...

Pith tools