Related papers: Preparing angular momentum eigenstates using engin…
Describing a particle in an external electromagnetic field is a basic task of quantum mechanics. The standard scheme for this is known as "minimal coupling", and consists of replacing the momentum operators in the Hamiltonian by modified…
The efficient preparation of collective eigenstates of subwavelength-spaced optical dipoles is a prerequisite for observing their signature radiative properties and for their applications in quantum information processing. We theoretically…
Quantum phase transitions materialize as level crossings in the ground-state energy when the parameters of the Hamiltonian are varied. The resulting ground-state phase diagrams are straightforward to determine by exact diagonalization on…
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between…
Quantum computing has the potential to reduce the computational cost required for quantum dynamics simulations. However, existing quantum algorithms for coupled electron-nuclear dynamics simulation either require fault-tolerant devices, or…
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
Quantum Stochastic Walks (QSW) allow for a generalization of both quantum and classical random walks by describing the dynamic evolution of an open quantum system on a network, with nodes corresponding to quantum states of a fixed basis. We…
Quantum walks are powerful tools for building quantum search algorithms or quantum sampling algorithms named the construction of quantum stationary state. However, the success probability of those algorithms are all far away from 1.…
The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver (VQE) algorithm aims to prepare the ground state of a…
Quantum random walks are shown to have non-intuitive dynamics, which makes them an attractive area of study for devising quantum algorithms for well-known classical problems as well as those arising in the field of quantum computing. In…
Dynamic quantum circuits incorporate mid-circuit measurements and feed-forward operations originally intended to realize Quantum Error Correction. This paradigm has recently been utilized to prepare certain states and long-range entangling…
We propose a scheme for the realization of a quantum walker and a quantum simulator for the Dirac equation with ultracold spinor atoms in driven optical lattices. A precise control of the dynamics of the atomic matter wave can be realized…
We present a mechanism to efficiently pre-select the number of intrinsic many-body states that are used to define the many-body wave functions within the discrete Generator Coordinate Method (GCM). This procedure, based on the proper…
We study two different methods to prepare excited states on a quantum computer, a key initial step to study dynamics within linear response theory. The first method uses unitary evolution for a short time $T=\mathcal{O}(\sqrt{1-F})$ to…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…
Standard quantum computation is based on sequences of unitary quantum logic gates which process qubits. The one-way quantum computer proposed by Raussendorf and Briegel is entirely different. It has changed our understanding of the…
Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple…
The atom-optics kicked rotor can be used to prepare specific momentum distributions on a discrete basis set. We implement a continuous-time quantum walk and a quantum search protocol in this momentum basis. In particular we propose ways to…
Quantum walks are recognizably useful for the development of new quantum algorithms, as well as for the investigation of several physical phenomena in quantum systems. Actual implementations of quantum walks face technological difficulties…