Related papers: Quantum hypercomputation based on the dynamical al…
The equivariant $K$-theory of the semi-infinite flag manifold, as developed recently by Kato, Naito, and Sagaki, carries commuting actions of the nil-double affine Hecke algebra (nil-DAHA) and a $q$-Heisenberg algebra. The action of the…
Recent advancements in quantum computing suggest the potential to revolutionize computational algorithms across various scientific domains including oceanography and atmospheric science. The field is still relatively young and quantum…
The quantum approximate optimization algorithm (QAOA) is one of the canonical algorithms designed to find approximate solutions to combinatorial optimization problems in current noisy intermediate-scale quantum (NISQ) devices. It is an…
In this paper, the Quantum Approximate Optimization Algorithm (QAOA) is analyzed by leveraging symmetries inherent in problem Hamiltonians. We focus on the generalized formulation of optimization problems defined on the sets of $n$-element…
Efficient classical simulation has matured to a critical component of the quantum computing stack, driving hardware validation, algorithm design, and the study of structured quantum dynamics. Lie-algebraic simulation ($\mathfrak{g}$-sim) is…
The quantum-to-classical transition is considered from the point of view of contractions of associative algebras. Various methods and ideas to deal with contractions of associative algebras are discussed that account for a large family of…
We reconsider differential geometry from the point of view of the quantum theory of non-relativistic spinning particles, which provides examples of supersymmetric quantum mechanics. This enables us to encode geometrical structure in…
Quantum mechanics of Hamiltonian (non-dissipative) systems uses Lie algebra and analytic group (Lie group). In order to describe non-Hamiltonian (dissipative) systems in quantum theory we need to use non-Lie algebra and analytic quasigroup…
Quantum computing enables the efficient resolution of complex problems, often outperforming classical methods across various applications. In 2009, Harrow, Hassidim and Lloyd proposed an algorithm for solving linear systems of equations,…
We define for real $q$ a unital $*$-algebra $U_q(\mathfrak{sl}(2,\mathbb{R}))$ quantizing the universal enveloping $*$-algebra of $\mathfrak{sl}(2,\mathbb{R})$. The $*$-algebra $U_q(\mathfrak{sl}(2,\mathbb{R}))$ is realized as a…
The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity, and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for…
The new method of solving quantum mechanical problems is proposed. The finite, i.e. cut off, Hilbert space is algebraically implemented in the computer code with states represented by lists of variable length. Complete numerical solution of…
Quantum computing, with its vast potential, is fundamentally shaped by the intricacies of quantum mechanics, which both empower and constrain its capabilities. The development of a universal, robust quantum programming language has emerged…
Quantum theory (QT), namely in terms of Schr\"odinger's 1926 wave functions in general requires complex numbers to be formulated. However, it soon turned out to even require some hypercomplex algebra. Incorporating Special Relativity leads…
As power systems expand, solving the Unit Commitment Problem (UCP) becomes increasingly challenging due to the dimensional catastrophe, and traditional methods often struggle to balance computational efficiency and solution quality. To…
By resorting to the Fock--Bargmann representation, we incorporate the quantum Weyl--Heisenberg algebra, $q$-WH, into the theory of entire analytic functions. The $q$--WH algebra operators are realized in terms of finite difference operators…
The Koopman--von Neumann (KvN) formulation of spectrally truncated fluid and plasma dynamics is considered as a potential approach for quantum computation. The KvN framework embeds the Liouville equation into a Hilbert space with…
Too often, quantum computer scientists seek to create new algorithms entirely fresh from new cloth when there are extensive and optimized classical algorithms that can be generalized wholesale. At the same time, one may seek to maintain…
The Schrieffer-Wolff transformation aims to solve degenerate perturbation problems and give an effective Hamiltonian that describes the low-energy dynamics of the exact Hamiltonian in the low-energy subspace of unperturbed Hamiltonian. This…
We develop a new and efficient method to systematically analyse four dimensional effective supergravities which descend from flux compactifications. The issue of finding vacua of such systems, both supersymmetric and non-supersymmetric, is…