相关论文: Quantum hypercomputation based on the dynamical al…

Quantum Lie algebras are generalizations of Lie algebras whose structure constants are power series in $h$. They are derived from the quantized enveloping algebras $\uqg$. The quantum Lie bracket satisfies a generalization of antisymmetry.…

We construct quantum algorithms to compute the solution and/or physical observables of nonlinear ordinary differential equations (ODEs) and nonlinear Hamilton-Jacobi equations (HJE) via linear representations or exact mappings between…

We define a new $q$-deformation of Brauer's centralizer algebra which contains Hecke algebras of type $A$ as unital subalgebras. We determine its generic structure as well as the structure of certain semisimple quotients. This is expected…

Quantum-classical hybrid algorithms offer a promising strategy for tackling computationally challenging problems, such as the maximum independent set (MIS) problem that plays a crucial role in areas like network design and data analysis.…

We introduce a new algebra B_l(z,q) depending on two nonzero complex parameters such that B_l(q^n,q) at q=1 coincides with the Brauer algebra B_l(n). We establish an analog of the Brauer-Schur-Weyl duality where the action of the new…

The problem of identifying the dynamical Lie algebras of finite-level quantum systems subject to external control is considered, with special emphasis on systems that are not completely controllable. In particular, it is shown that the…

Degenerating the quantum queer Schur superalgebra ${\mathcal{Q}_q(n,r; R)}$ to the case $q=1$, the queer Schur superalgebra ${\mathcal{Q}(n,r)}$ is obtained. In this article, we reconstruct the universal enveloping algebra…

Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for…

We introduce a quantum approximate optimization algorithm (QAOA) for continuous optimization. The algorithm is based on the dynamics of a quantum system moving in an energy potential which encodes the objective function. By approximating…

In this paper, we model and solve a fundamental power system problem, i.e., DC power flow, using a practical quantum computer. The Harrow-Hassidim-Lloyd (HHL) quantum algorithm is used to solve the DC power flow problem. The HHL algorithm…

We developed a quantum eigensolver (QE) which is based on an extension of optimized binary configurations measured by quantum annealing (QA) on a D-Wave Quantum Annealer (D-Wave QA). This approach performs iterative QA measurements to…

Quantum computing has gained a lot of attention recently, and scientists have seen potential applications in this field using quantum computing for Cryptography and Communication to Machine Learning and Healthcare. Protein folding has been…

This paper constitutes a review on N=2 fractional supersymmetric Quantum Mechanics of order k. The presentation is based on the introduction of a generalized Weyl-Heisenberg algebra W_k. It is shown how a general Hamiltonian can be…

In the present paper we construct all typical finite-dimensional representations of the quantum Lie superalgebra $U_{q}[gl(2/2)]$ at generic deformation parameter $q$. As in the non-deformed case the finite-dimensional…

Variational quantum algorithms, such as the Recursive Quantum Approximate Optimization Algorithm (RQAOA), have become increasingly popular, offering promising avenues for employing Noisy Intermediate-Scale Quantum devices to address…

We present a method to construct induced representations of quantum algebras having the structure of bicrossproduct. We apply this procedure to some quantum kinematical algebras in (1+1)--dimensions with this kind of structure: null-plane…

We present a comparison between the Quantum Approximate Optimization Algorithm (QAOA) and two widely studied competing methods, Quantum Annealing (QA) and Simulated Annealing (SA). To achieve this, we define a class of optimization problems…

Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization…

We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…

In this work we obtain the exact solution of quantum integrable system associated with the Lie superalgebra $\mathfrak{gl}(1|1)$, both for periodic and for generic open boundary conditions. By means of the fusion technique we derive a…