Related papers: A Note on Parallel Distinguishability of two Quant…
We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes…
A unital $C^*$-algebra is called $N$-subhomogeneous if its irreducible representations are finite dimensional with dimension at most $N$. We extend this notion to operator systems, replacing irreducible representations by boundary…
We establish adiabatic theorems with and without spectral gap condition for general -- typically dissipative -- linear operators $A(t): D(A(t)) \subset X \to X$ with time-independent domains $D(A(t)) = D$ in some Banach space $X$. Compared…
We transform the problem of solving linear system of equations $A\mathbf{x}=\mathbf{b}$ to a problem of finding the right singular vector with singular value zero of an augmented matrix $C$, and present two quantum algorithms for solving…
We show that the flatness of a nonlinear discrete-time system can be checked by computing a unique sequence of involutive distributions. The well-known test for static feedback linearizability is included as a special case. Since the…
We present a polynomial-time algorithm that obtains a set of Asymptotic Linear Programs (ALPs) from a given linear system S, such that one of these ALPs admits a feasible solution if and only if S admits a feasible solution. We also show…
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…
Conditions for the validity of the quantum adiabatic approximation are analyzed. For the case of linear Hamiltonians, a simple and general sufficient condition is derived, which is valid for arbitrary spectra and any kind of time variation.…
In the field of computational logic, two classes of finite automata are considered fundamental: deterministic and nondeterministic automata (DFAs and NFAs). In a more fine-grained approach three natural intermediate classes were introduced,…
We present a criterion, based on three commutator relations, that allows to decide whether two self-adjoint matrices with non-overlapping support are simultaneously unitarily similar to quasidiagonal matrices, i.e., whether they can be…
Neutral-atom arrays are a leading platform for quantum technologies, offering a promising route toward large-scale, fault-tolerant quantum computing. We propose a novel quantum processing architecture based on dual-type, dual-element atom…
In this paper, a homogeneous system of n $\alpha$-order linear fractal differential equation is defined and the set of its fundamental solutions through the corresponding Wronskian matrix is described. Finally, the solutions of some…
The existing doubling algorithms have been proven efficient for several important nonlinear matrix equations arising from real-world engineering applications. In a nutshell, the algorithms iteratively compute a basis matrix, in one of the…
Solving linear systems of equations is a frequently encountered problem in machine learning and optimisation. Given a matrix $A$ and a vector $\mathbf b$ the task is to find the vector $\mathbf x$ such that $A \mathbf x = \mathbf b$. We…
A general quantum adiabatic theorem with and without the time-dependent orthogonalization is proven, which can be applied to understand the origin of activation energies in chemical reactions. Further proofs are also developed for the…
Khabibullin's conjecture for integral inequalities has two numeric parameters $n$ and $\alpha$ in its statement, $n$ being a positive integer and $\alpha$ being a positive real number. This conjecture is already proved in the case where…
It is shown that quantum mechanics on noncommutative spaces (NQM) can be obtained by the canonical quantization of some underlying second class constrained system formulated in extended configuration space. It leads, in particular, to an…
Infinitesimal symmetries of a classical mechanical system are usually described by a Lie algebra acting on the phase space, preserving the Poisson brackets. We propose that a quantum analogue is the action of a Lie bi-algebra on the…
This paper studies the problem of testing whether a system of linear equality and inequality constraints admits a solution when the coefficients of that system may have to be estimated. We show that a wide range of inferential questions in…
An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building block of quantum hidden subgroup algorithms over solvable…