相关论文: Quantum hypercomputation based on the dynamical al…
This paper explores the use of quantum computing, specifically the use of HHL and VQLS algorithms, to solve optimal power flow problem in electrical grids. We investigate the effectiveness of these quantum algorithms in comparison to…
The natural Hilbert Space of quantum particles can implement maximum-likelihood (ML) decoding of classical information. The 'Quantum Product Algorithm' (QPA) is computed on a Factor Graph, where function nodes are unitary matrix operations…
Learning the problem structure at multiple levels of coarseness to inform the decomposition-based hybrid quantum-classical combinatorial optimization solvers is a promising approach to scaling up variational approaches. We introduce a…
This report offers a comprehensive analysis of the evolving landscape of quantum algorithm software specifically tailored for condensed matter physics. It examines fundamental quantum algorithms such as Variational Quantum Eigensolver…
A new procedure for the construction of higher-dimensional Lie-Hamilton systems is proposed. This method is based on techniques belonging to the representation theory of Lie algebras and their realization by vector fields. The notion of…
Let $\mathbb{F}$ be a field, and let $q\in\mathbb{F}$. The $q$-deformed Heisenberg algebra is the unital associative $\mathbb{F}$-algebra $\mathcal{H}(q)$ with generators $A,B$ and relation $AB-qBA=I$, where $I$ is the multiplicative…
We construct three representations of the $su(1,1)$ current algebra: in extended Fock space, with Gamma random measures, and with negative binomial (Pascal) point processes. For the second and third representations, the lowering and neutral…
Quantum Approximate Optimization Algorithm (QAOA) is a promising hybrid quantum-classical algorithm for solving combinatorial optimization problems. However, it cannot overcome qubit limitation for large-scale problems. Furthermore, the…
A class of two-dimensional superintegrable systems on a constant curvature surface is considered as the natural generalization of some well known one-dimensional factorized systems. By using standard methods to find the shape-invariant…
Quantum algebras are a mathematical tool which provides us with a class of symmetries wider than that of Lie algebras, which are contained in the former as a special case. After a self-contained introduction to the necessary mathematical…
Using the subdynamical kinetic equation for an open quantum system, a formulation is presented for performing decoherence-free (DF) quantum computing in Rigged Liouville Space (RLS). Three types of interactions were considered, and in each…
We consider supersymmetric quantum mechanics on a K\"{a}hler cone, regulated via a suitable resolution of the conical singularity. The unresolved space has a $\mathfrak{u}(1,1|2)$ superconformal symmetry and we propose the existence of an…
The Quantum Approximate Optimization Algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ans\"atze for…
Some ideas about phenomenological applications of quantum algebras to physics are reviewed. We examine in particular some applications of the algebras $U_ q (su_2)$ and $U_{qp}({\rm u}_2)$ to various dynamical systems and to atomic and…
In this paper, we introduce stochastic simulated quantum annealing (SSQA) for large-scale combinatorial optimization problems. SSQA is designed based on stochastic computing and quantum Monte Carlo, which can simulate quantum annealing (QA)…
The Fokker-Planck equation models rare events across sciences, but its high-dimensional nature challenges classical computers. Quantum algorithms for such non-unitary dynamics often suffer from exponential {decay in} success probability. We…
Quantum annealing (QA) and Quantum Alternating Operator Ansatz (QAOA) are both heuristic quantum algorithms intended for sampling optimal solutions of combinatorial optimization problems. In this article we implement a rigorous direct…
Local Hamiltonian Problems (LHPs) are important problems that are computationally QMA-complete and physically relevant for many-body quantum systems. Quantum MaxCut (QMC), which equates to finding ground states of the quantum Heisenberg…
Deterministic dynamical models are discussed which can be described in quantum mechanical terms. In particular, a local quantum field theory is presented which is a supersymmetric classical model. -- The Hilbert space approach of Koopman…
We discuss topics related to finite-dimensional calculus in the context of finite-dimensional quantum mechanics. The truncated Heisenberg-Weyl algebra is called a TAA algebra after Tekin, Aydin, and Arik who formulated it in terms of…