Related papers: Quantum Timing and Synchronization Problems
Creating precise timing devices at ultra-short time scales is not just an important technological challenge, but confronts us with foundational questions about timekeeping's ultimate precision limits. Research on clocks has either focused…
We propose and simulate a protocol to evolve a quantum particle forward in time such that its trajectory closely matches that of the particle's Newtonian counterpart. Using short bursts of Schr\"odinger time-evolution interleaved with…
Quantum walks represent an excellent testbed for investigating the interplay between unitary coherent and incoherent dissipative processes. Thanks to photonic quantum interferometers of considerable size, experimental studies could be…
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…
A quantum system subjected to a strong continuous monitoring undergoes quantum jumps. This very well known fact hides a neglected subtlety: sharp scale-invariant fluctuations invariably decorate the jump process even in the limit where the…
A long-standing quantum-mechanical puzzle is whether the collapse of the wave function is a real physical process or simply an epiphenomenon. This puzzle lies at the heart of the measurement problem. One way to choose between the…
One of the most important goals in quantum thermodynamics is to demonstrate advantages of thermodynamic protocols over their classical counterparts. For that, it is necessary to (i) develop theoretical tools and experimental set-ups to deal…
Through a straightforward Bayesian approach we show that under some general conditions a maximum running time, namely the number of discrete steps performed by a computer program during its execution, can be defined such that the…
In this paper we extend the concept of persistence, well defined for classical stochastic dynamics, to the context of quantum dynamics. We demonstrate the idea via quantum random walk and a successive measurement scheme, where persistence…
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches the complete bipartite graph of $N$ vertices for one of $k$…
Many-particles quantum walks of particles obeying Bose statistics moving on graphs of various topologies are introduced. A single coin tossing commands the conditional shift operation over the whole graph. Vertices particle densities, the…
We develop a general theory of the time distribution of quantum events, applicable to a large class of problems such as arrival time, dwell time and tunneling time. A stopwatch ticks until an awaited event is detected, at which time the…
Quantum walks on graphs are fundamental to quantum computing and have led to many interesting open problems in algebraic graph theory. This review article highlights three key classes of open problems in this domain; perfect state transfer,…
We introduce quantum walks with a time-dependent coin, and show how they include, as a particular case, the generalized quantum walk recently studied by Wojcik et al. {[}Phys. Rev. Lett. \textbf{93}, 180601(2004){]} which exhibits…
We explore a continuous-time quantum walk starting at a single vertex on the discrete path and cycle with a cubic nonlinearity. Such nonlinearities arise in Bose-Einstein condensates described by the Gross-Pitaevskii equation or by…
We study numerically the behavior of continuous-time quantum walks over networks which are topologically equivalent to square lattices. On short time scales, when placing the initial excitation at a corner of the network, we observe a fast,…
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…
We address the question of how a quantum computer can be used to simulate experiments on quantum systems in thermal equilibrium. We present two approaches for the preparation of the equilibrium state on a quantum computer. For both…
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…