Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 37 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 10 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 448 tok/s Pro
Claude Sonnet 4 31 tok/s Pro
2000 character limit reached

On Schrödingerization based quantum algorithms for linear dynamical systems with inhomogeneous terms (2402.14696v3)

Published 22 Feb 2024 in math.NA and cs.NA

Abstract: We analyze the Schr\"odingerization method for quantum simulation of a general class of non-unitary dynamics with inhomogeneous source terms. The Schr\"odingerization technique, introduced in [31], transforms any linear ordinary and partial differential equations with non-unitary dynamics into a system under unitary dynamics via a warped phase transition that maps the equations into a higher dimension, making them suitable for quantum simulation. This technique can also be applied to these equations with inhomogeneous terms modeling source or forcing terms, or boundary and interface conditions, and discrete dynamical systems such as iterative methods in numerical linear algebra, through extra equations in the system. Difficulty arises with the presence of inhomogeneous terms since they can change the stability of the original system. In this paper, we systematically study-both theoretically and numerically-the important issue of recovering the original variables from the Schr\"odingerized equations, even when the evolution operator contains unstable modes. We show that, even with unstable modes, one can still construct a stable scheme; however, to recover the original variable, one needs to use suitable data in the extended space. We analyze and compare both the discrete and continuous Fourier transforms used in the extended dimension and derive corresponding error estimates, which allow one to use the more appropriate transform for specific equations. We also provide a smoother initialization for the Schr\"odingerized system to gain higher-order accuracy in the extended space. We homogenize the inhomogeneous terms with a stretch transformation, making it easier to recover the original variable. Our recovery technique also provides a simple and generic framework to solve general ill-posed problems in a computationally stable way.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. B. Şahinoğlu and R. D. Somma. Hamiltonian simulation in the low-energy subspace. npj Quantum Information, 7(119), 2021.
  2. Time-dependent unbounded hamiltonian simulation with vector norm scaling. Quantum, 5(459), 2021.
  3. Time-dependent hamiltonian simulation of highly oscillatory dynamics and superconvergence for schrödinger equation. Quantum, 6(690), 2022.
  4. Linear combination of hamiltonian simulation for non-unitary dynamics with optimal state preparation cost. Phys. Rev. Lett., 131(15):150603, 2023.
  5. Efficient quantum algorithms for simulating sparse hamiltonians. Commun. Math. Phys., 270:359–371, 2007.
  6. Black-box hamiltonian simulation and unitary implementation. Quantum Inf. Comput., 12:39–62, 2012.
  7. Exponential improvement in precision for simulating sparse hamiltonians. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, page 283–292, 2014.
  8. Simulating hamiltonian dynamics with a truncatd taylor series. Phys. Rev. Lett., 090502, 2015.
  9. Hamiltonian simulation with nearly optimal dependence on all parameters. IEEE 56th annual symposium on foundations of computer science, 2015.
  10. Time-dependent hamiltonian simulation with l1-norm scaling. Quantum, 4(254), 2020.
  11. Gate-efficient discrete simulations of continuous-time quantum query algorithms. Quantum Inf. Comput., 14:1–30, 2014.
  12. D. W. Berry and L. Novo. Corrected quantum walk for optimal hamiltonian simulation. Quantum Inf. Comput., 1295:15–16, 2016.
  13. Quantum amplitude amplification and estimation. Contemp. Math., 305:53–74.
  14. E. Campbell. Random compiler for fast hamiltonian simulation. Phys. Rev. Lett., 123(7), 2019.
  15. Quantum simulation for time-dependent hamiltonians – with applications to non-autonomous ordinary and partial differential equations. arXiv:2312.02817v1, 2023.
  16. Toward the first quantum simulation with quantum speedup. Proc. Nat. Acad. Sci. India Sect. A, 115:9456–9461, 2018.
  17. D. DiVincenzo. Quantum computation. Science, 270(5234):255–261, 1995.
  18. Quantum algorithms: Entanglement-enhanced information processing. Philos. Trans. Royal Soc. A, 356(1743):1769–1782, 1998.
  19. L. C. Evans. Partial differential equations. American Mathematical Society, 2016.
  20. Matrix analysis. Cambridge university press, 2012.
  21. Quantum simulation for partial differential equations with physical boundary or interface conditions. J. Comput. Phys., 112707, 2024.
  22. S. Jin and N. Liu. Analog quantum simulation of partial differential equations. arXiv:2308.00646, 2023.
  23. S. Jin and N. Liu. Quantum simulation of discrete linear dynamical systems and simple iterative methods in linear algebra via schrodingerisation. arXiv:2304.02865, 2023.
  24. Quantum simulation for quantum dynamics with artificial boundary conditions. arXiv:2304.00667, 2023.
  25. Quantum simulation of maxwell’s equations via schrödingersation. arXiv:2308.08408, 2023.
  26. Quantum simulation of partial differential equations via schrodingerisation. arXiv preprint arXiv:2212.13969., 2022.
  27. Quantum simulation of partial differential equations via schrodingerisation: technical details. arXiv preprint arXiv:2212.14703, 2022.
  28. Quantum simulation of partial differential equations: Applications and detailed anlysis. Phys. Rev. A, 108(032603), 2023.
  29. Quantum simulation of discrete linear dynamical systems and simple iterative methods in linear algebra via schrodingerisation. arXiv preprint arXiv:2304.02865, 2023.
  30. C. S. Lam. Decomposition of time-ordered products and path-ordered exponentials. J. Math. Phys., (10):5543–5558, 1998.
  31. Optimal hamiltonian simulation by quantum signal processing. Phys. Rev. Lett., 118:010501, 2017.
  32. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
  33. L. Novo and D. W. Berry. Improved hamiltonian simulation via a truncated taylor series and corrections. Quantum Inf. Comput., 17:0623, 2017.
  34. Quantum simulation of time-dependent hamiltonians and the convenient illusion of hilbert space. Phys. Rev. Lett., 106:170501, 2011.
  35. Spectral methods. Springer-Verlag Berliln Heidelberg, 2011.
  36. P. W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. Proceedings 35th annual symposium on foundations of computer science. IEEE, pages 124–134, 1994.
  37. A. Steane. Quantum computing. Rep. Progr. Phys., 61(2):117–173, 1998.
  38. Computational electromagnetics: the finite-difference time-domain method. The Electrical Engineering Handbook, 3:629–670, 2005.
Citations (8)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up
Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Authors (3)

  1. Shi Jin
  2. Nana Liu
  3. Chuwen Ma