Related papers: Continuous-time quantum search and time-dependent …
Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy and Magniez et al. will be stated as quantum…
Beginning with the principle that a closed mechanical composite system is timeless, time can be defined by the regular changes in a suitable position coordinate (clock) in the observing part, when one part of the closed composite observes…
We introduce the concepts of Grover operators and Grover kernels to systematically analyse Grover's searching algorithms. Then, we investigate a one-parameter family of quantum searching algorithms of Grover's type and we show that the…
This work examines the time complexity of quantum search algorithms on combinatorial $t$-designs with multiple marked elements using the continuous-time quantum walk. Through a detailed exploration of $t$-designs and their incidence…
We solve the unstructured search problem in constant time by computing with a physically motivated nonlinearity of the Gross-Pitaevskii type. This speedup comes, however, at the novel expense of increasing the time-measurement precision.…
We find a relationship between unitary transformations of the dynamics of quantum systems with time-dependent Hamiltonians and gauge theories. In particular, we show that the nonrelativistic dynamics of spin-$\frac12$ particles in a…
Grover's algorithm is one of the pioneering demonstrations of the advantages of quantum computing over its classical counterpart, providing - at most - a quadratic speed-up over the classical solution for unstructured database search. The…
We present a systematic method for dealing with time dependent quantum dynamics, based on the quantum brachistochrone and matrix mechanics. We derive the explicit time dependence of the Hamiltonian operator for a number of constrained…
We formulate a set of conditions under which dynamics of a time-dependent quantum Hamiltonian are integrable. The main requirement is the existence of a nonabelian gauge field with zero curvature in the space of system parameters. Known…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
In this paper, we consider a continuous-time quantum walk based search algorithm. We introduce equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the finding…
Time-driven quantum systems are important in many different fields of physics like cold atoms, solid state, optics, etc. Many of their properties are encoded in the time evolution operator which is calculated by using a time-ordered product…
We develop a general framework for the construction of probabilities for the time of arrival in quantum systems. The time of arrival is identified with the time instant when a transition in the detector's degrees of freedom takes place.…
Perfect transfer of {\em unknown} states across distinct nodes is a basic function in bosonic quantum networks. Here we develop a general theory to construct an $N$-node bosonic network governed by the time-dependent Hamiltonian, as the…
Time symmetry in quantum mechanics, where the current quantum state is determined jointly by both the past and the future, offers a more comprehensive description of physical phenomena. This symmetry facilitates both forward and backward…
Our main goal in this paper is to extend to any system of coupled quadratic Hamiltonians some properties known for systems of quantum harmonic oscillators related with the Brownian Quantum Motion model. In a first part we get a rather…
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…
For a quantum field living on a non - static spacetime no instantaneous Hamiltonian is definable, for this generically necessitates a choice of inequivalent representation of the canonical commutation relations at each instant of time. This…
We report the implementation of Grover's quantum search algorithm in the scalable system of trapped atomic ion quantum bits. Any one of four possible states of a two-qubit memory is marked, and following a single query of the search space,…