Zermelo's navigation problem through the lens of quantum annealing: How the Landau-Zener approximation leads to an efficient classical solution

• URL: http://arxiv.org/abs/2606.09602v1
• Date: Mon, 08 Jun 2026 15:13:11 GMT
• Title: Zermelo's navigation problem through the lens of quantum annealing: How the Landau-Zener approximation leads to an efficient classical solution
• Abstract summary: The river-crossing problem, also known as Zermelo's navigation problem, is a classic example of an optimization problem with practical relevance.<n>We state a version of Zermelo's problem and then solve it as an adiabatic quantum-computing problem using quantum trits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The river-crossing problem, also known as Zermelo's navigation problem, is a classic example of an optimization problem with practical relevance and a scalable degree of complexity. It asks for the optimal trajectory of a vessel moving through a water flow field and provides a setting in which physics, variational methods, and optimization are naturally intertwined. We state a version of Zermelo's problem and then solve it as formulate it as an adiabatic quantum-computing problem using quantum trits, or qutrits for short. The construction includes a penalty term that enforces the prescribed boundary conditions and an exploration term that allows the system to move through intermediate configurations toward the optimal feasible path. In the adiabatic description, the evolution proceeds through a sequence of avoided crossings, so that the resulting fidelity can be estimated using the Landau-Zener formula. Remarkably, the regime in which this approximation is valid also provides a deterministic way to identify the correct solution with computational effort that scales only quadratically with the problem size. Thus, a quantum formulation initially motivated by the apparent exponential complexity of the problem reveals an underlying classical structure that can be exploited efficiently. Our approach also provides a pedagogical illustration of how a real-world optimization problem can be cast into a quantum-annealing framework and then analyzed using the Schrödinger equation, avoided crossings, and Landau-Zener theory.

Related papers

• Quantum simulation of the Liouville equation in classical mechanics with discontinuous potential via Schrödingerization [42.22857110018992]
  We develop quantum simulation algorithms for the Liouville equation of classical mechanics with discontinuous potential.<n>We combine Hamiltonian-preserving schemes by Jin and Wen in Commun. Math. Sci. 3(3), 285-315 (2005) with the Schrdingerization method, which embeds the resulting nonunitary semi-discrete dynamics into a unitary Schrdinger type system.
  arXiv  Detail & Related papers  (2026-06-13T02:49:05Z)
• Impact-Driven Quantum Decomposition for Traffic Zone Partitioning: A Hybrid Gate-Model Framework [2.988555995010699]
  This paper proposes an impact-driven hybrid quantum-classical optimization framework for traffic zone partitioning.<n> Experiments show that impact-guided decomposition improves convergence behavior and produces more coherent spatial partitions.<n>Although the hybrid method does not outperform the best direct quantum solution, it demonstrates a practical pathway toward scalable hybrid optimization for transportation applications.
  arXiv  Detail & Related papers  (2026-05-01T21:54:13Z)
• Quantum simulation of Liouville equation in geometrical optics with partial transmission and reflection via Schrödingerization [42.22857110018992]
  This paper investigates quantum simulation algorithms for the Liouville equation in geometrical optics with partial transmission and reflection at sharp interfaces.<n>By means of a warped phase transformation in one higher dimension, the Schrdingerization method converts linear partial differential equations into a system of Schrdinger-type equations with unitary evolution.<n>We present detailed constructions of the resulting quantum algorithms and show through complexity analysis that the proposed methods achieve quantum advantage in the precision parameter $$ over their classical counterparts.
  arXiv  Detail & Related papers  (2026-03-12T14:47:16Z)
• A Theoretical Framework for an Efficient Normalizing Flow-Based Solution to the Electronic Schrodinger Equation [8.648660469053342]
  A central problem in quantum mechanics involves solving the Electronic Schrodinger Equation for a molecule or material.<n>We propose a solution via an ansatz which is cheap to sample from, yet satisfies the requisite quantum mechanical properties.
  arXiv  Detail & Related papers  (2024-05-28T15:42:15Z)
• Curve fitting on a quantum annealer for an advanced navigation method [0.0]
  We consider a function that approximates a given set of data points and is written as a finite linear combination of standardized functions.<n>In a real-world use case, we discuss the problem to find an optimized speed profile for a vessel using the framework of dynamic programming.
  arXiv  Detail & Related papers  (2024-02-23T13:13:28Z)
• A Computational Framework for Solving Wasserstein Lagrangian Flows [48.87656245464521]
  In general, the optimal density path is unknown, and solving these variational problems can be computationally challenging. We propose a novel deep learning based framework approaching all of these problems from a unified perspective. We showcase the versatility of the proposed framework by outperforming previous approaches for the single-cell trajectory inference.
  arXiv  Detail & Related papers  (2023-10-16T17:59:54Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• Bernstein-Greene-Kruskal approach for the quantum Vlasov equation [91.3755431537592]
  The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables. In the semiclassical case where quantum tunneling effects are small, an infinite series solution is developed.
  arXiv  Detail & Related papers  (2021-02-18T20:55:04Z)
• Dominant Reaction Pathways by Quantum Computing [0.0]
  Characterizing thermally activated transitions in high-dimensional rugged energy surfaces is a challenging task for classical computers. We develop a quantum annealing scheme to solve this problem. We pave the way towards future biophysical applications of quantum computing based on realistic all-atom models.
  arXiv  Detail & Related papers  (2020-07-27T18:05:05Z)
• Optimizing adiabatic quantum pathways via a learning algorithm [10.664271328456728]
  We propose a gradient-free learning algorithm with pulse smoothing technique to search optimal adiabatic quantum pathways. The proposed method can be used to solve more complex and real adiabatic quantum computation problems.
  arXiv  Detail & Related papers  (2020-06-27T06:57:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.