Skip to content
DraconiticResearch
Search Sources API
206,698 studies31 sourcesUpdated 50 min ago
PreprintCC BY-NC-ND 4.0arXiv

A unifying framework for quantum algorithms for time-dependent non-unitary dynamics

Abstract

We present an improved autonomization method for quantum simulation of time-dependent homogeneous dissipative linear systems, combining a clock-variable reformulation with Schrödingerization to obtain a time-independent Hamiltonian system. To control both discretization error and recovery probability, we construct the clock profile from a compactly supported window function and a normalized Dirichlet kernel: the former imposes endpoint regularity, while the latter concentrates the sampled mass and keeps the discrete normalization bounded. For the subsequent Schrödingerization step, we use an exactly periodic version of an error-function initial profile, whose explicit Fourier coefficients allow direct error estimates and simplify the analysis of smooth initialization. By combining Fourier projection with weighted recovery, we retain a single logarithmic precision factor in the full algorithm. Under finite-order derivative bounds, sampled matrix access, and exact state-preparation access, we prepare the normalized solution at time T to accuracy ε with success probability Θ(1) using 𝒪 (gαATlog(gαAT/ε)) matrix queries and 𝒪(g) queries to each state-preparation oracle, where g=|x0|/|x(T)| and αA is the matrix-oracle normalization. We illustrate the construction and its recovery probabilities through a numerical experiment on a time-dependent two-cavity system.

Related

  1. Wavelength-Uniform Quantum Algorithms for Mixed-State Quantum Dynamics
    Shi Jin, Chuwen Ma
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Lean-QuantumAlg: A Framework for AI Agents to Produce Quantum Algorithms that Humans Can Trust
    Lei Zhang, Mingrui Jing, Yusheng Zhao +2
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. Towards large-scale ab initio Molecular Dynamics Simulation with Efficient Sampling-based Quantum Computing Algorithms
    Ankit Khandelwal, Nirmal M R, Aaryav Mishra +3
    arXivPreprintCC BY-NC-SA 4.0Full textQuantum physics & quantum informationarXiv
  4. oracq: A Modular Framework for Implementing and Analyzing Quantum Scientific Computing Algorithms
    Zhao-Yun Chen, Ming-Yang Tan, Guo-Ping Guo
    arXivPreprintCC BY-NC-SA 4.0Full textQuantum physics & quantum informationarXiv
  5. Quantum Algorithms for Computational Fluid Dynamics
    Mario Guillaume Cecile, Nis-Luca van Hülst, Tomohiro Hashizume +19
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
BibTeX
@misc{dong2026unifying,
  title = {{A unifying framework for quantum algorithms for time-dependent non-unitary dynamics}},
  author = {Xiaojing Dong and Chuwen Ma and Yizhe Peng and Yue Yu},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2608.07133},
  eprint = {2608.07133},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.07133},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - A unifying framework for quantum algorithms for time-dependent non-unitary dynamics
AU  - Xiaojing Dong
AU  - Chuwen Ma
AU  - Yizhe Peng
AU  - Yue Yu
PY  - 2026
DA  - 2026/09/21
PB  - arXiv
DO  - 10.48550/arxiv.2608.07133
UR  - https://arxiv.org/abs/2608.07133
AB  - We present an improved autonomization method for quantum simulation of time-dependent homogeneous dissipative linear systems, combining a clock-variable reformulation with Schrödingerization to obtain a time-independent Hamiltonian system. To control both discretization error and recovery probability, we construct the clock profile from a compactly supported window function and a normalized Dirichlet kernel: the former imposes endpoint regularity, while the latter concentrates the sampled mass and keeps the discrete normalization bounded. For the subsequent Schrödingerization step, we use an exactly periodic version of an error-function initial profile, whose explicit Fourier coefficients allow direct error estimates and simplify the analysis of smooth initialization. By combining Fourier projection with weighted recovery, we retain a single logarithmic precision factor in the full algorithm. Under finite-order derivative bounds, sampled matrix access, and exact state-preparation access, we prepare the normalized solution at time T to accuracy ε with success probability Θ(1) using 𝒪 (gα_ATlog(gα_AT/ε)) matrix queries and 𝒪(g) queries to each state-preparation oracle, where g=|x_0|/|x(T)| and α_A is the matrix-oracle normalization. We illustrate the construction and its recovery probabilities through a numerical experiment on a time-dependent two-cavity system.
ER  -