Quantum time-marching algorithms adapt LCU for diffusive dynamics and use method of images or direct unitary encoding for boundaries, achieving optimal success probabilities and linear complexity, shown via heat equation simulations.
Preskill, Quantum 2, 79 (2018)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
A unified quantum framework computes n-th order nonlinear spectroscopies on near-term devices by reformulating multi-time responses as weighted sums of finite-amplitude expectation values via a generalized parameter shift rule.
Proposes variable-topology quantum circuits with evolutionary optimization and a pseudo-counterdiabatic term that outperforms VQE on set partitioning by avoiding stagnation without classical optimizers.
citing papers explorer
-
Quantum time-marching algorithms for solving linear transport problems including boundary conditions
Quantum time-marching algorithms adapt LCU for diffusive dynamics and use method of images or direct unitary encoding for boundaries, achieving optimal success probabilities and linear complexity, shown via heat equation simulations.
-
A unified framework for efficient quantum simulation of nonlinear spectroscopy
A unified quantum framework computes n-th order nonlinear spectroscopies on near-term devices by reformulating multi-time responses as weighted sums of finite-amplitude expectation values via a generalized parameter shift rule.
-
Quantum circuit evolutionary framework applied on set partitioning problem
Proposes variable-topology quantum circuits with evolutionary optimization and a pseudo-counterdiabatic term that outperforms VQE on set partitioning by avoiding stagnation without classical optimizers.