Related papers: Optimisation of Quantum Evolution Algorithms
Quantum inspired Evolutionary Algorithms were proposed more than a decade ago and have been employed for solving a wide range of difficult search and optimization problems. A number of changes have been proposed to improve performance of…
Using the fact that any linear representation of a group can be embedded into permutations, we propose a constructive description of quantum behavior that provides, in particular, a natural explanation of the appearance of complex numbers…
In this article, we compare the methods implementing the real-time evolution operator generated by a unitary diagonal matrix where its entries obey a known underlying real function. When the size of the unitary diagonal matrix is small, a…
Evolutionary algorithms have been frequently applied to constrained continuous optimisation problems. We carry out feature based comparisons of different types of evolutionary algorithms such as evolution strategies, differential evolution…
An important aspect in understanding the dynamics in the context of deparametrized models of LQG is to obtain a sufficient control on the quantum evolution generated by a given Hamiltonian operator. More specifically, we need to be able to…
Optimizing high-degree of freedom robotic manipulators requires searching complex, high-dimensional configuration spaces, a task that is computationally challenging for classical methods. This paper introduces a quantum native framework…
Quantum hardware continues to advance, yet finding new quantum algorithms - quantum software - remains a challenge, with classically trained computer programmers having little intuition of how computational tasks may be performed in the…
A novel expansion of the evolution operator associated with a -- in general, time-dependent -- perturbed quantum Hamiltonian is presented. It is shown that it has a wide range of possible realizations that can be fitted according to…
Identifying the real and imaginary parts of wave functions with coordinates and momenta, quantum evolution may be mapped onto a classical Hamiltonian system. In addition to the symplectic form, quantum mechanics also has a positive-definite…
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled by evolutionary algorithms that use a representation which…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
Quantum process tomography provides a means of measuring the evolution operator for a system at a fixed measurement time $t$. The problem of using that tomographic snapshot to predict the evolution operator at other times is generally…
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…
With rapid advancements in machine learning, first-order algorithms have emerged as the backbone of modern optimization techniques, owing to their computational efficiency and low memory requirements. Recently, the connection between…
Digital quantum simulation relies on Trotterization to discretize time evolution into elementary quantum gates. On current quantum processors with notable gate imperfections, there is a critical tradeoff between improved accuracy for finer…
For the description of quantum evolution, the use of a manifestly time-dependent quantum Hamiltonian $\mathfrak{h}(t) =\mathfrak{h}^\dagger(t)$ is shown equivalent to the work with its simplified, time-independent alternative $G\neq…
We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. Assuming access to a block-encoding of $H'=(H-E)/\lambda$ for some $E \in \mathbb R$, the goal is to implement an…
The efficient implementation of matrix arithmetic operations underpins the speedups of many quantum algorithms. We develop a suite of methods to perform matrix arithmetics -- with the result encoded in the off-diagonal blocks of a…
We investigate the evolution of a single qubit subject to a continuous unitary dynamics and an additional interrupting influence which occurs periodically. One may imagine a dynamically evolving closed quantum system which becomes open at…
For any Dirac theory of quantum gravity governed by a set of well-defined quantum constraints, we discover a universal formula for the exact form of the evolution Hamiltonian operator in a variable quantum reference frame of our…