REVIEW 3 cited by
Linear combination of Hamiltonian simulation for nonunitary dynamics with optimal state preparation cost
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
Signed reviews
read the original abstract
We propose a simple method for simulating a general class of non-unitary dynamics as a linear combination of Hamiltonian simulation (LCHS) problems. LCHS does not rely on converting the problem into a dilated linear system problem, or on the spectral mapping theorem. The latter is the mathematical foundation of many quantum algorithms for solving a wide variety of tasks involving non-unitary processes, such as the quantum singular value transformation (QSVT). The LCHS method can achieve optimal cost in terms of state preparation. We also demonstrate an application for open quantum dynamics simulation using the complex absorbing potential method with near-optimal dependence on all parameters.
Forward citations
Cited by 3 Pith papers
-
BELT: Block Encoding of Linear Transformation on Density Matrices
BELT block-encodes the output of an arbitrary linear map N applied to a density matrix, using a block encoding of the partially transposed Choi matrix of N.
-
Fixing Divergence in Carleman Linearization via Analytical Continuation
A regularized function inserted into Carleman linearization, derived from a Möbius conformal map, removes the long-time divergence for logistic, KPP-Fisher, and phase-field models and supports an LCU quantum implementation.
-
Circuit-Efficient Randomized Quantum Simulation of Non-Unitary Dynamics with Observable-Driven and Symmetry-Aware Designs
A randomized compilation of LCHS for non-unitary dynamics, with an observable-driven variant and a symmetry-aware sampler, claims reduced ancilla and circuit depth at the cost of more repetitions.
Discussion (0). Continue with ORCID to comment.