⚛️ quantum physics

Superstate Quantum Mechanics

This paper introduces Superstate Quantum Mechanics (SQM), a theoretical framework extending traditional quantum mechanics to states under multiple quadratic constraints, which reformulates stationary problems as quantum inverse problems and proposes dynamic evolution models to bridge direct and inverse quantum mechanics for applications in physics, machine learning, and classical computation.

Original authors: Mikhail Gennadievich Belov, Victor Victorovich Dubov, Vadim Konstantinovich Ivanov, Alexander Yurievich Maslov, Olga Vladimirovna Proshina, Vladislav Gennadievich Malyshkin

Published 2026-07-09

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Mikhail Gennadievich Belov, Victor Victorovich Dubov, Vadim Konstantinovich Ivanov, Alexander Yurievich Maslov, Olga Vladimirovna Proshina, Vladislav Gennadievich Malyshkin

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Idea: From "One Dot" to "The Whole Map"

Imagine traditional quantum mechanics (the physics of atoms and particles) as a game played with a single dot on a piece of paper.

The Dot: This dot represents the state of a particle (like an electron).
The Rules: The dot must stay on a specific circle (it has a fixed size).
The Goal: You want to find the "best" position for the dot on that circle to minimize energy. This is like finding the lowest point in a valley.

In this paper, the authors propose a new theory called Superstate Quantum Mechanics (SQM). Instead of playing with a single dot, imagine the game is now played with an entire map or a blueprint.

The Map: Instead of a dot, the "state" is now a complex grid of numbers (a matrix) that acts like a machine or a filter.
The Rules: This map has to follow many strict rules at once (like a puzzle where every row and column must add up to specific numbers).
The Goal: You want to find the "best" map that fits all these rules.

The "Reverse Engineering" Puzzle

The main reason the authors created this theory is to solve a specific type of puzzle called the Quantum Inverse Problem.

The Normal Way (Direct Problem): If you have a machine (a quantum system) and you push a button, you can predict what comes out.
The Inverse Way (The Puzzle): You see the output (what came out), but you don't know what the machine looks like inside. You have to reverse-engineer the machine just by looking at the results.

In the real world, this is like looking at a shadow on a wall and trying to figure out exactly what 3D object is casting it. The authors say that by treating the "machine" as a Superstate (the map/blueprint), they can turn this difficult guessing game into a neat algebraic math problem.

The "Energy" of the Map

In normal physics, we calculate "energy" to find the best state. In this new theory, the authors define a similar concept called Fidelity (which is like a "score" or "accuracy").

They want to find the map that gets the highest score.
They discovered that if you write the score as a specific type of math formula (a quadratic equation), you can solve for the best map using a new kind of math equation.
The Analogy: In normal physics, you solve for a single number (the energy level). In SQM, you solve for a whole matrix of numbers (a "super-energy" matrix) that tells you how good your map is.

Two Ways to Move: The "Flow" and the "Twist"

The paper also asks: "What happens if this map changes over time?" They suggest two ways this could happen:

The Linear Flow (The Conveyor Belt): Imagine the map sliding along a conveyor belt, changing smoothly. This is similar to how normal quantum systems evolve, but applied to the whole map instead of a single dot.
The Non-Linear Twist (The Gross-Pitaevskii Equation): Imagine the map twisting and turning on its own, where the way it moves depends on how "strong" it is right now. This is like a fluid that changes its own shape as it flows.

The authors suggest that these "moving maps" could describe how a quantum system evolves itself, not just how a particle moves inside it.

The "2D Circuit" vs. The "1D Circuit"

To visualize this, the authors compare it to computer circuits:

Normal Quantum Computing (1D): Imagine a line of dominoes falling one after another. You start with a state, push it through a line of gates, and get a result.
Superstate Computing (2D): Imagine a grid of dominoes. You can push them horizontally and vertically at the same time. This allows you to transform the entire "machine" (the quantum system) rather than just a single state.

What Can We Do With This? (According to the Paper)

The paper is very specific about what this theory can do right now:

Classical Computers: You can run these "Superstate" calculations on a regular, old-fashioned computer. You don't need a real quantum computer to do the math.
Machine Learning & AI: The authors mention that this approach is very useful for Artificial Intelligence. Many AI problems involve finding the best "map" (model) that fits a lot of data. This new math helps solve those optimization problems more efficiently.
Reconstructing Systems: It helps scientists figure out what a quantum system looks like just by observing how it behaves.

What the Paper Does Not Claim

It is important to stick to what the paper actually says:

No New Physical Laws: The authors are not claiming they have discovered a new force of nature or that particles in the real world behave this way naturally. They are proposing a mathematical framework to describe and solve problems.
No "Magic" Measurements: They speculate that if a physical process existed that could solve these inverse problems in a single "measurement," the result would be a whole matrix, not just a number. However, they admit this is just a guess and that we currently only have the math to do this on computers.
No Medical or Clinical Uses: The paper does not mention any medical applications, cures, or biological uses.

Summary Analogy

Think of traditional quantum mechanics as trying to find the perfect note to play on a piano to make a song sound good.

Superstate Quantum Mechanics is like trying to design the entire piano itself. You are given a recording of a song (the data) and you have to figure out what the piano's strings, hammers, and wood should look like to produce that song. The authors have invented a new set of math tools (the "Superstate" equations) that make designing that piano much easier, especially for computers and AI.

Technical Summary: Superstate Quantum Mechanics (SQM)

Problem Statement
Traditional quantum mechanics (TQM) defines states as unit-length vectors in a Hilbert space subject to a single quadratic constraint (normalization). The stationary problem is an eigenvalue problem derived from minimizing a quadratic energy form, while the non-stationary problem describes the evolution of these vectors via a linear Schrödinger equation.

However, many practical problems in physics, machine learning, and artificial intelligence involve optimizing over objects with richer structures than simple vectors, such as unitary operators or quantum channels. These problems often require satisfying multiple quadratic constraints (e.g., unitarity conditions $U^\dagger U = I$ ) and optimizing a fidelity function that is quadratic in the mapping operator. These are "quantum inverse problems" where one seeks to reconstruct a system (e.g., a Hamiltonian) from observed state mappings. Standard optimization techniques for these problems, such as Semidefinite Programming (SDP) or gradient-based methods, often lack a unified algebraic structure or fail to provide a complete hierarchy of solutions. The paper addresses the need for a theoretical framework that generalizes TQM to handle states defined by multiple quadratic constraints, bridging the gap between direct quantum dynamics and inverse reconstruction problems.

Methodology
The authors introduce Superstate Quantum Mechanics (SQM), a framework where "states" are defined as elements of a Hilbert space subject to multiple quadratic constraints.

State Representation: Instead of vectors $|\psi\rangle$ , the fundamental states are represented as operators, specifically unitary (or partially unitary) matrices $U_{jk}$ .
Constraints: The system is subject to multiple quadratic constraints, such as the partial isometry condition $G_{ij} = \sum_k U_{ik}U^*_{jk} = \delta_{ij}$ .
Objective Function: The "energy" or fidelity $F$ $F$ is defined as a quadratic form (or a Rayleigh quotient of two quadratic forms) involving a superoperator tensor $S_{jk;j'k'}$ $S_{j k; j^{'} k^{'}}$ .
- For pure state mappings, $S$ is constructed from observation data.
- The optimization problem is formulated as a Quadratically Constrained Quadratic Program (QCQP).
Algebraic Formulation: By applying the Lagrange stationarity condition to the fidelity functional under the multiple quadratic constraints, the authors derive a new algebraic equation:
$S U = \lambda U$
Here, $S$ is a Hermitian superoperator tensor, $U$ is the operator-state, and $\lambda$ is a Hermitian matrix of Lagrange multipliers (an "eigenmatrix"), rather than a scalar eigenvalue.
Dynamics: The paper proposes two potential forms for the non-stationary (time-dependent) evolution of the unitary operator $U(t)$ $U (t)$ :
- A linear higher-order map: $i\hbar \frac{\partial U}{\partial t} = S U$ .
- A nonlinear Gross-Pitaevskii-type (GPE) map: $i\hbar \frac{\partial U}{\partial t} = \langle U | S | U \rangle U$ .
- A combination of both.

Key Contributions

Generalization of Quantum Mechanics: SQM extends TQM by treating states as operators subject to multiple quadratic constraints, reducing TQM to a limiting case where only a single normalization constraint exists.
New Algebraic Problem: The derivation of the equation $SU = \lambda U$ , where the eigenvalue is a matrix. This generalizes the standard eigenvalue problem and provides a stationary Schrödinger-like equation for quantum inverse problems.
Solution Hierarchy: The framework naturally generates a hierarchy of solutions (pairs of $U^{[s]}$ and $\lambda^{[s]}$ ). The "ground state" corresponds to the solution maximizing the fidelity (trace of $\lambda$ ).
Canonical Form and Orthogonality: The authors define a canonical basis where $\lambda$ is diagonal and $U$ is the identity matrix. They explore orthogonality conditions between solutions, noting that unlike TQM, the orthogonality depends on the eigenmatrices $\lambda$ .
2D Quantum Circuits: The paper introduces a conceptual model of "2D quantum circuits" where time evolution occurs along both horizontal and vertical axes, representing the evolution of the quantum system itself rather than just a state vector. This is linked to the "two-Hamiltonian approximation" of the superoperator $S$ .
Measurement Interpretation: The paper speculates that in SQM, the "measurement unit" could be a Hermitian matrix (the eigenmatrix $\lambda$ ) rather than a scalar, representing the realization of a specific quantum system configuration.

Results

Algebraic Solution: The stationary problem is reduced to solving the algebraic equation $SU = \lambda U$ . The fidelity of a solution is given by $F = \text{Tr}(\lambda)$ .
Numerical Implementation: The authors reference existing software (Ref. [48]) that implements an iterative algorithm to find the global maximum of the fidelity. This algorithm replaces the multiple quadratic constraints with a simplified constraint and linear constraints at each step, converging to the global maximum for the first solution in the hierarchy.
Connection to Higher-Order Maps: In the "two-Hamiltonian approximation" ( $S_{jk;j'k'} \approx \lambda_{jj'}\delta_{kk'} + \delta_{jj'}\nu_{kk'}$ ), the time evolution of $U(t)$ reproduces established higher-order quantum maps, where the system evolves via two independent unitary sequences.
Classical Computational Model: The theory allows for the simulation of quantum channels on classical computers by treating the channel as a classical computational model, provided the fidelity is quadratic.

Significance and Claims
The paper claims that SQM provides a unified algebraic framework for quantum inverse problems, variational quantum algorithms, and machine learning tasks involving unitary operators. By formulating these problems as a generalized eigenvalue problem, it offers a deeper structural understanding than standard numerical optimization.

The authors emphasize that while the stationary problem has clear applications in reconstructing Hamiltonians and quantum channels, the non-stationary dynamics (the evolution of the system itself) is speculative. They do not claim to have discovered a physical process that naturally implements this "dynamics of dynamics." Instead, they position SQM as a theoretical tool for developing new classes of algorithms, particularly in machine learning and artificial intelligence, where the constraints on the "state" (the model) are naturally quadratic. The work bridges direct and inverse quantum mechanics, suggesting that the same tensor $S$ governs both the reconstruction of a system from data and the potential evolution of that system.

The paper concludes by noting that the current implementation is limited to real-space matrices and that the study of the "density of states" for the solution hierarchy remains a subject for future research. The work is presented as an analytical study motivated by numerical observations of inverse problems, dedicated to the memory of Iya Pavlovna Ipatova.