Related papers: Efficient Berry Phase Calculation via Adaptive Var…
Approximating the ground states of strongly interacting electron systems in quantum chemistry and condensed matter physics is expected to be one of the earliest applications of quantum computers. In this paper, we prepare highly accurate…
On-the-fly quantum nonadiabatic dynamics for large systems greatly benefits from the adiabatic representation readily available from the electronic structure programs. However, frequently occurring in this representation conical…
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes…
We explore a non-variational quantum state preparation approach combined with the ADAPT operator selection strategy in the application of preparing the ground state of a desired target Hamiltonian. In this algorithm, energy gradient…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
In the holonomic approach to quantum computation information is encoded in a degenerate eigenspace of a parametric family of Hamiltonians and manipulated by the associated holonomic gates. These are realized in terms of the non-abelian…
Phases arising from cyclic processes are fundamental in physics, bridging quantum and classical domains and providing deeper insights into the topology and dynamics of physical systems. This study investigates the accumulation of a…
The phase relation between quantum states represents an essential resource for the storage and processing of quantum information. While quantum phases are commonly controlled dynamically by tuning energetic interactions, utilizing geometric…
Geometric phases in quantum mechanics play an extraordinary role in broadening our understanding of fundamental significance of geometry in nature. One of the best known examples is the Berry phase (M.V. Berry (1984), Proc. Royal. Soc.…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
We propose a new variational quantum algorithm, which we refer to as TIMES-ADAPT, that prepares time-evolved states in a low-energy or symmetric subspace of a time-independent Hamiltonian on a quantum computer. Using a specially trained…
A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of…
We study quantum adiabatic dynamics, where the slowly moving field is influenced by system's state (feedback). The information for the feedback is gained from non-disturbating measurements done on an ensemble of identical non-interacting…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…
Effective low-energy theories represent powerful theoretical tools to reduce the complexity in modeling interacting quantum many-particle systems. However, common theoretical methods rely on perturbation theory, which limits their…
Geometric phases, generated by cyclic evolutions of quantum systems, offer an inspiring playground for advancing fundamental physics and technologies, alike. Intriguingly, the exotic statistics of anyons realised in physical systems can be…
Phase estimation is known to be a robust method for single-qubit gate calibration in quantum computers, while Bayesian estimation is widely used in devising optimal methods for learning in quantum systems. We present Bayesian phase…
Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $\epsilon$ in Heisenberg-limited time $T=\Theta(1/\epsilon)$. Standard gate-based implementations of QPE require…
Realisation of experiments even on small and medium-scale quantum computers requires an optimisation of several parameters to achieve high-fidelity operations. As the size of the quantum register increases, the characterisation of quantum…
The quantum adiabatic theorem incorporating the Berry phase phenomenon can be characterized as a factorization of the time evolution operator into a path-dependent geometric factor, a usual dynamical factor and a non-adiabatic factor that…