Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Solving Noncomputable Problems Using Quantum-Classical Hybrid.

Michail A. Zak

Published Feb 1, 2017• 0 citations
OpenAlex

Abstract

The challenge of this paper is to relate quantum-inspired dynamics represented by a self-supervised system, to solutions of noncomputable problems. In the self-supervised systems, the role of actuators is played by the probability produced by the corresponding Liouville equation. Following the Madelung equation that belongs to this class, non-Newtonian properties such as randomness, entanglement, and probability interference typical for quantum systems have been described in [1]. It has been demonstrated there, that such systems exist in the mathematical world: they are presented by ODE coupled with their Liouville equation, but they belong neither to Newtonian nor to quantum physics. The central point of this paper is the application of the self-supervised systems to finding global maximum of functions that is no-where differential, but everywhere continuous (such as Weierstrass functions)

Related papers

Solving NP-Complete Problems by Self-Supervised Dynamics.

Michail A. Zak

The challenge of this paper is to relate quantum-inspired dynamics represented by a self- supervised system, to solutions of noncomputable problems. In the self-supervised systems, the role of actuators is played by the probability produced by the corresponding Liouville equation. Following the Madelung equation that belongs to this class, non- Newtonian properties such as randomness, entanglement, and probability interference typical for quantum systems have been described in [1]. It has been demonstrated there, that such systems exist in the mathematical world: they are presented by ODE coupled with their Liouville equation, but they belong neither to Newtonian nor to quantum physics. The central point of this paper is the application of the self-supervised systems to solve traveling salesman problem.

•Feb 1, 2017•0 citations

Self-Controlled Dynamics

Michail A. Zak

A new class of dynamical system described by ODE coupled with their Liouville equation has been introduced and discussed. These systems called self-controlled, or self-supervised since the role of actuators is played by the probability produced by the Liouville equation. Following the Madelung equation that belongs to this class, non- Newtonian properties such as randomness, entanglement, and probability interference typical for quantum systems have been described. Special attention was paid to the capability to violate the second law of thermodynamics, which makes these systems neither Newtonian, nor quantum. It has been shown that self-controlled dynamical systems can be linked to mathematical models of livings as well as to models of AI. The central point of this paper is the application of the self-controlled systems to NP-complete problems known as being unsolvable neither by classical nor by quantum algorithms. The approach is illustrated by solving a search in unsorted database in polynomial time by resonance between external force representing the address of a required item and the response representing location of this item.

•Jun 1, 2016•0 citations

Quantum-inspired maximizer

Michail A. Zak

The objective of this paper is to create a new kind of dynamical systems—a quantum-classical hybrid—that would preserve superposition and entanglement of random solutions while allowing one to measure their state variables by using classical methods. Such an optimal combination of characteristics is a perfect match for quantum-inspired computing. The model is represented by a modified Madelung equation in which the quantum potential is replaced by a different, specially chosen “computational” potential. As a result, the dynamics attains both quantum and classical properties. Similarities and differences of the proposed model with quantum systems are outlined. As an application, an algorithm for the global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithms is very simple: based on the quantum-inspired maximizer, introduce a positive function to be maximized as the probability density to which the solution is attracted. Then, the larger value of this function will have the higher probability to appear. Special attention is paid to the simulation of integer programming, NP-complete problems and information retrieval.

Journal of Mathematical Physics•Apr 1, 2008•16 citations

Quantum algorithms for general nonlinear dynamics based on the Carleman embedding

David Jennings, Kamil Korzekwa, Matteo Lostaglio +3 more

Important nonlinear dynamics, such as those found in plasma and fluid systems, are typically hard to simulate on classical computers. Thus, if fault-tolerant quantum computers could efficiently solve such nonlinear problems, it would be a transformative change for many industries. In a recent breakthrough [Liu et al., PNAS 2021], the first efficient quantum algorithm for solving nonlinear differential equations was constructed, based on a single condition $R<1$, where $R$ characterizes the ratio of nonlinearity to dissipation. This result, however, is limited to the class of purely dissipative systems with negative log-norm, which excludes application to many important problems. In this work, we correct technical issues with this and other prior analysis, and substantially extend the scope of nonlinear dynamical systems that can be efficiently simulated on a quantum computer in a number of ways. Firstly, we extend the existing results from purely dissipative systems to a much broader class of stable systems, and show that every quadratic Lyapunov function for the linearized system corresponds to an independent $R$-number criterion for the convergence of the Carleman scheme. Secondly, we extend our stable system results to physically relevant settings where conserved polynomial quantities exist. Finally, we provide extensive results for the class of non-resonant systems. With this, we are able to show that efficient quantum algorithms exist for a much wider class of nonlinear systems than previously known, and prove the BQP-completeness of nonlinear oscillator problems of exponential size. In our analysis, we also obtain several results related to the Poincaré-Dulac theorem and diagonalization of the Carleman matrix, which could be of independent interest.

quant-pharXiv:2509.07155•Quantum•Sep 10, 2025•28 citations

Entanglement in Quantum-Classical Hybrid

Michail A. Zak

It is noted that the phenomenon of entanglement is not a prerogative of quantum systems, but also occurs in other, non-classical systems such as quantum-classical hybrids, and covers the concept of entanglement as a special type of global constraint imposed upon a broad class of dynamical systems. Application of hybrid systems for physics of life, as well as for quantum-inspired computing, has been outlined. In representing the Schroedinger equation in the Madelung form, there is feedback from the Liouville equation to the Hamilton-Jacobi equation in the form of the quantum potential. Preserving the same topology, the innovators replaced the quantum potential with other types of feedback, and investigated the property of these hybrid systems. A function of probability density has been introduced. Non-locality associated with a global geometrical constraint that leads to an entanglement effect was demonstrated. Despite such a quantum like characteristic, the hybrid can be of classical scale and all the measurements can be performed classically. This new emergence of entanglement sheds light on the concept of non-locality in physics.

•Mar 1, 2011•0 citations

Non-Newtonian ai for Solving NP-Complete Problems.

Michail A. Zak

A new kind of dynamics for simulations based upon quantum-classical hybrid is discussed. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen potentials. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for quantum- inspired information processing. In this paper, the retrieval of stored items from an exponentially large unsorted database is performed by quantum-inspired resonance using polynomial resources due to quantum-like superposition effect.

•Feb 1, 2016•0 citations
The challenge of this paper is to relate quantum-inspired dynamics represented by a self-supervised system, to solutions of noncomputable problems. In the self-supervised systems, the role of actuators is played by the probability produced by the corresponding Liouville equation. Following the Madelung equation that belongs to this class, non-Newtonian properties such as randomness, entanglement, and probability interference typical for quantum systems have been described in [1]. It has been demonstrated there, that such systems exist in the mathematical world: they are presented by ODE coupled with their Liouville equation, but they belong neither to Newtonian nor to quantum physics. The central point of this paper is the application of the self-supervised systems to finding global maximum of functions that is no-where differential, but everywhere continuous (such as Weierstrass functions)
The challenge of this paper is to relate quantum-inspired dynamics represented by a self- supervised system, to solutions of noncomputable problems. In the self-supervised systems, the role of actuators is played by the probability produced by the corresponding Liouville equation. Following the Madelung equation that belongs to this class, non- Newtonian properties such as randomness, entanglement, and probability interference typical for quantum systems have been described in [1]. It has been demonstrated there, that such systems exist in the mathematical world: they are presented by ODE coupled with their Liouville equation, but they belong neither to Newtonian nor to quantum physics. The central point of this paper is the application of the self-supervised systems to solve traveling salesman problem.
A new class of dynamical system described by ODE coupled with their Liouville equation has been introduced and discussed. These systems called self-controlled, or self-supervised since the role of actuators is played by the probability produced by the Liouville equation. Following the Madelung equation that belongs to this class, non- Newtonian properties such as randomness, entanglement, and probability interference typical for quantum systems have been described. Special attention was paid to the capability to violate the second law of thermodynamics, which makes these systems neither Newtonian, nor quantum. It has been shown that self-controlled dynamical systems can be linked to mathematical models of livings as well as to models of AI. The central point of this paper is the application of the self-controlled systems to NP-complete problems known as being unsolvable neither by classical nor by quantum algorithms. The approach is illustrated by solving a search in unsorted database in polynomial time by resonance between external force representing the address of a required item and the response representing location of this item.
The objective of this paper is to create a new kind of dynamical systems—a quantum-classical hybrid—that would preserve superposition and entanglement of random solutions while allowing one to measure their state variables by using classical methods. Such an optimal combination of characteristics is a perfect match for quantum-inspired computing. The model is represented by a modified Madelung equation in which the quantum potential is replaced by a different, specially chosen “computational” potential. As a result, the dynamics attains both quantum and classical properties. Similarities and differences of the proposed model with quantum systems are outlined. As an application, an algorithm for the global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithms is very simple: based on the quantum-inspired maximizer, introduce a positive function to be maximized as the probability density to which the solution is attracted. Then, the larger value of this function will have the higher probability to appear. Special attention is paid to the simulation of integer programming, NP-complete problems and information retrieval.
Important nonlinear dynamics, such as those found in plasma and fluid systems, are typically hard to simulate on classical computers. Thus, if fault-tolerant quantum computers could efficiently solve such nonlinear problems, it would be a transformative change for many industries. In a recent breakthrough [Liu et al., PNAS 2021], the first efficient quantum algorithm for solving nonlinear differential equations was constructed, based on a single condition R<1R<1R<1, where RRR characterizes the ratio of nonlinearity to dissipation. This result, however, is limited to the class of purely dissipative systems with negative log-norm, which excludes application to many important problems. In this work, we correct technical issues with this and other prior analysis, and substantially extend the scope of nonlinear dynamical systems that can be efficiently simulated on a quantum computer in a number of ways. Firstly, we extend the existing results from purely dissipative systems to a much broader class of stable systems, and show that every quadratic Lyapunov function for the linearized system corresponds to an independent RRR-number criterion for the convergence of the Carleman scheme. Secondly, we extend our stable system results to physically relevant settings where conserved polynomial quantities exist. Finally, we provide extensive results for the class of non-resonant systems. With this, we are able to show that efficient quantum algorithms exist for a much wider class of nonlinear systems than previously known, and prove the BQP-completeness of nonlinear oscillator problems of exponential size. In our analysis, we also obtain several results related to the Poincaré-Dulac theorem and diagonalization of the Carleman matrix, which could be of independent interest.
It is noted that the phenomenon of entanglement is not a prerogative of quantum systems, but also occurs in other, non-classical systems such as quantum-classical hybrids, and covers the concept of entanglement as a special type of global constraint imposed upon a broad class of dynamical systems. Application of hybrid systems for physics of life, as well as for quantum-inspired computing, has been outlined. In representing the Schroedinger equation in the Madelung form, there is feedback from the Liouville equation to the Hamilton-Jacobi equation in the form of the quantum potential. Preserving the same topology, the innovators replaced the quantum potential with other types of feedback, and investigated the property of these hybrid systems. A function of probability density has been introduced. Non-locality associated with a global geometrical constraint that leads to an entanglement effect was demonstrated. Despite such a quantum like characteristic, the hybrid can be of classical scale and all the measurements can be performed classically. This new emergence of entanglement sheds light on the concept of non-locality in physics.
A new kind of dynamics for simulations based upon quantum-classical hybrid is discussed. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen potentials. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for quantum- inspired information processing. In this paper, the retrieval of stored items from an exponentially large unsorted database is performed by quantum-inspired resonance using polynomial resources due to quantum-like superposition effect.