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

Modern Physics Letters B

NONLINEAR SCHRÖDINGER EQUATION FOR QUANTUM COMPUTATION

M. Cemal Yalabık

Published Aug 10, 2006• 4 citations
Publisher

Abstract

Utilization of a quantum system whose time-development is described by the nonlinear Schrödinger equation in the transformation of qubits would make it possible to construct quantum algorithms which would be useful in a large class of problems. An example of such a system for implementing the logical NOR operation is demonstrated.
DOI
10.1142/s0217984906011268

Related papers

Nonlinear Schrodinger Equation for Quantum Computation

M. Cemal Yalabık

Utilization of a quantum system whose time-development is described by the nonlinear Schrodinger equation in the transformation of qubits would make it possible to construct quantum algorithms which would be useful in a large class of problems. An example of such a system for implementing the logical NOR operation is demonstrated.

arXiv:quant-ph/0307116•Jul 17, 2003•0 citations

A Qubit Algorithm for Simulating the Nonlinear Schroedinger Equation

Connor Simpson

Recent work in mathematical physics and nonlinear optics has shown that Hamiltonians that are non-Hermitian but still symmetric under parity and time reversal can describe eigenstates of a system with real eigenvalues. Other research has also showed that the nonlinear Schrodinger equation can be generalized to describe PT-symmetric systems, which generates novel solutions not described by its Hermitian equivalent. The Hermitian form of the nonlinear Schroedinger equation can also be extended to describe a particular case of the general PT-symmetric NLS, suggesting a connection between the two. I attempted to generate a unitary operator that will be useful for unitary quantum algorithms describing a coupled set of nonlinear Schroedinger equations and the PT-symmetric version of the NLS.

•Jan 1, 2019•0 citations

Quantum algorithms for the fractional Poisson equation via rational approximation

Yin Yang, Yue Yu, Long Zhang +1 more

This paper presents a quantum algorithm for solving the fractional Poisson equation \((-Δ)^s u = f\) with \(s \in (0,1)\) on bounded domains. The proposed approach combines rational approximation techniques with quantum linear system solvers to achieve exponential quantum advantage. The rational approximation represents the inverse fractional Laplacian as a weighted sum of standard resolvents, transforming the original nonlocal problem into a collection of shifted integer-order partial differential equations. These equations are consolidated into a single large linear system through a modified right-hand side construction that simplifies the quantum implementation. To enable practical implementation, we develop explicit quantum circuits via the Schrödingerization technique, which converts the non-unitary dynamics of the linear system into a higher-dimensional Schrödinger-type equation, allowing the use of standard Hamiltonian simulation. The circuit construction leverages the decomposition of shift operators to realize the discrete Laplacian and employs controlled operations to implement the select oracle. Under finite difference discretization, we provide detailed algorithmic procedures utilizing block-encoding techniques for the coefficient matrices. A comprehensive complexity analysis demonstrates that the quantum algorithm achieves a dependence on the inverse mesh size \(h^{-1}\) that is independent of the spatial dimension \(d\), in stark contrast to classical methods which suffer from exponential growth in high dimensions. This establishes an exponential quantum advantage for high-dimensional fractional problems, effectively overcoming the curse of dimensionality that limits classical approaches.

quant-pharXiv:2604.00603•Apr 2, 2026•0 citations

A CLASS OF EXACT SOLUTIONS OF THE TIME-DEPENDENT SCHRÖDINGER EQUATION WITH TIME-DEPENDENT MASS

Axel Schulze‐Halberg

We obtain a large class of solvable potentials and the corresponding exact solutions of the time-dependent Schrödinger equation with time-dependent mass by transforming it into an equation of telegraphy.

Modern Physics Letters A•Dec 28, 2001•1 citation

On nonlinear transformations in quantum computation

Zoë Holmes, Nolan J. Coble, Andrew T. Sornborger +1 more

While quantum computers are naturally well-suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear subroutines may prove key to a range of applications of quantum computing from solving nonlinear equations to data processing and quantum machine learning. Here we develop a series of basic subroutines for implementing nonlinear transformations of input quantum states. Our algorithms are framed around the concept of a weighted state, a mathematical entity describing the output of an operational procedure involving both quantum circuits and classical post-processing.

arXiv:2112.12307•Dec 23, 2021•1 citation

Nonlinear transformations in quantum computation

Zoë Holmes, Nolan J. Coble, Andrew T. Sornborger +1 more

While quantum computers are naturally well suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear subroutines may prove key to a range of applications of quantum computing from solving nonlinear equations to data processing and quantum machine learning. Here we develop a series of basic subroutines for implementing nonlinear transformations of input quantum states. Our algorithms are framed around the concept of a weighted state, a mathematical entity describing the output of an operational procedure involving both quantum circuits and classical postprocessing.

Physical Review Research•Feb 13, 2023•24 citations
Recent work in mathematical physics and nonlinear optics has shown that Hamiltonians that are non-Hermitian but still symmetric under parity and time reversal can describe eigenstates of a system with real eigenvalues. Other research has also showed that the nonlinear Schrodinger equation can be generalized to describe PT-symmetric systems, which generates novel solutions not described by its Hermitian equivalent. The Hermitian form of the nonlinear Schroedinger equation can also be extended to describe a particular case of the general PT-symmetric NLS, suggesting a connection between the two. I attempted to generate a unitary operator that will be useful for unitary quantum algorithms describing a coupled set of nonlinear Schroedinger equations and the PT-symmetric version of the NLS.
This paper presents a quantum algorithm for solving the fractional Poisson equation (−Δ)su=f(-Δ)^s u = f(−Δ)su=f with s∈(0,1)s \in (0,1)s∈(0,1) on bounded domains. The proposed approach combines rational approximation techniques with quantum linear system solvers to achieve exponential quantum advantage. The rational approximation represents the inverse fractional Laplacian as a weighted sum of standard resolvents, transforming the original nonlocal problem into a collection of shifted integer-order partial differential equations. These equations are consolidated into a single large linear system through a modified right-hand side construction that simplifies the quantum implementation. To enable practical implementation, we develop explicit quantum circuits via the Schrödingerization technique, which converts the non-unitary dynamics of the linear system into a higher-dimensional Schrödinger-type equation, allowing the use of standard Hamiltonian simulation. The circuit construction leverages the decomposition of shift operators to realize the discrete Laplacian and employs controlled operations to implement the select oracle. Under finite difference discretization, we provide detailed algorithmic procedures utilizing block-encoding techniques for the coefficient matrices. A comprehensive complexity analysis demonstrates that the quantum algorithm achieves a dependence on the inverse mesh size h−1h^{-1}h−1 that is independent of the spatial dimension ddd, in stark contrast to classical methods which suffer from exponential growth in high dimensions. This establishes an exponential quantum advantage for high-dimensional fractional problems, effectively overcoming the curse of dimensionality that limits classical approaches.
While quantum computers are naturally well-suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear subroutines may prove key to a range of applications of quantum computing from solving nonlinear equations to data processing and quantum machine learning. Here we develop a series of basic subroutines for implementing nonlinear transformations of input quantum states. Our algorithms are framed around the concept of a weighted state, a mathematical entity describing the output of an operational procedure involving both quantum circuits and classical post-processing.
While quantum computers are naturally well suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear subroutines may prove key to a range of applications of quantum computing from solving nonlinear equations to data processing and quantum machine learning. Here we develop a series of basic subroutines for implementing nonlinear transformations of input quantum states. Our algorithms are framed around the concept of a weighted state, a mathematical entity describing the output of an operational procedure involving both quantum circuits and classical postprocessing.