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.
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.
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.
This paper presents a quantum algorithm for solving the fractional Poisson equation (−Δ)su=f with 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−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.