Related papers: Efficiency, Curvature, and Complexity of Quantum E…
Recently, nonadiabatic geometric quantum computation has been received much attention, due to its fast manipulation and intrinsic error-resilience characteristics. However, to obtain universal geometric quantum control, only limited and…
The development of quantum walks in the context of quantum computation, as generalisations of random walk techniques, led rapidly to several new quantum algorithms. These all follow unitary quantum evolution, apart from the final…
Quantum speed limits are relations yielding lower bounds on the evolution time of quantum systems. These results have been generalized in some ways, in particular by including evolutions to non-orthogonal states. However, there was a gap in…
In this work, we study quantum evolution of an open moving-qubit modulated by a classical driving field. We obtain the density operator of qubit at zero temperature and analyze its quantum evolution dynamics by using quantum speed limit…
We address the difference between integrable and chaotic motion in quantum theory as manifested by the complexity of the corresponding evolution operators. Complexity is understood here as the shortest geodesic distance between the…
The rate of the trace distance is used to evaluate quantum speed-up for arbitrary mixed states. Compared with some present methods, the approach based on trace distance can provide an optimal bound to the speed of the evolution. The…
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…
The construction of exactly-solvable models has recently been advanced by considering integrable $T\bar{T}$ deformations and related Hamiltonian deformations in quantum mechanics. We introduce a broader class of non-Hermitian Hamiltonian…
We introduce a new class of quantum models with time-dependent Hamiltonians of a special scaling form. By using a couple of time-dependent unitary transformations, the time evolution of these models is expressed in terms of related systems…
We investigate the quantum evolution speed of a qubit in two kinds of finite-temperature environments. The first environment is a bosonic bath with Ohmic-like spectrum. It is found that the high temperature not only leads to the speed-up…
We study a non-interacting quantum particle, moving on a one-dimensional lattice, which is subjected to repetitive measurements. We investigate the consequence when such motion is interrupted and restarted from the same initial…
Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential…
Digital quantum simulation has broad applications in approximating unitary evolution of Hamiltonians. In practice, many simulation tasks for quantum systems focus on quantum states in the low-energy subspace instead of the entire Hilbert…
Nonadiabatic geometric quantum computation is dedicated to the realization of high-fidelity and robust quantum gates, which are necessary for fault-tolerant quantum computation. However, it is limited by cyclic and mutative evolution path,…
Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. However, the known algorithms are either probabilistic (repeat until success) with impractically small success probabilities or coherent (quantum…
The performance of evolutionary algorithms can be heavily undermined when constraints limit the feasible areas of the search space. For instance, while Covariance Matrix Adaptation Evolution Strategy is one of the most efficient algorithms…
Quantum simulation using time evolution in phase estimation-based quantum algorithms can yield unbiased solutions of classically intractable models. However, long runtimes open such algorithms to decoherence. We show how measurement-based…
Quantum noise in real-world devices poses a significant challenge in achieving practical quantum advantage, since accurately compiled and executed circuits are typically deep and highly susceptible to decoherence. To facilitate the…
Hybrid quantum-classical optimization algorithms represent one of the most promising application for near-term quantum computers. In these algorithms the goal is to optimize an observable quantity with respect to some classical parameters,…
The dynamical aspects of a spin-1/2 particle in Hermitian coquaternionic quantum theory is investigated. It is shown that the time evolution exhibits three different characteristics, depending on the values of the parameters of the…