Related papers: Transition Probabilities in Generalized Quantum Se…
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…
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these…
In this paper, we derive sharp lower bounds, also known as quantum speed limits, for the time it takes to transform a quantum system into a state such that an observable assumes its lowest average value. We assume that the system is…
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state which tends to the solution [Farhi et al.,…
The quantum speed limit sets the minimum time required to transfer a quantum system completely into a given target state. At shorter times the higher operation speed has to be paid with a loss of fidelity. Here we quantify the trade-off…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…
We generalize Grover's unstructured quantum search algorithm to enable it to use an arbitrary starting superposition and an arbitrary unitary matrix simultaneously. We derive an exact formula for the probability of the generalized Grover's…
Grover's quantum search algorithm drives a quantum computer from a prepared initial state to a desired final state by using selective transformations of these states. Here, we analyze a framework when one of the selective trasformations is…
The optimal control of unitary transformations is a fundamental problem in quantum control theory and quantum information processing. The feasibility of performing such optimizations is determined by the computational and control resources…
Quantum resource theories provide a mathematically rigorous way of understanding the nature of various quantum resources. An important problem in any quantum resource theory is to determine how quantum states can be converted into each…
Quantum simulation has wide applications in quantum chemistry and physics. Recently, scientists have begun exploring the use of randomized methods for accelerating quantum simulation. Among them, a simple and powerful technique, called…
The basic idea of spin chain engineering for perfect quantum state transfer (QST) is to find a set of coupling constants in the Hamiltonian, such that a particular state initially encoded on one site will evolve freely to the opposite site…
Uhlmann's theorem is a central result in quantum information theory, which associates the closeness of two quantum states with that of their purifications. The theorem also well characterizes a fundamental task: how close a pure quantum…
The quantum navigation problem of finding the time-optimal control Hamiltonian that transports a given initial state to a target state through quantum wind, that is, under the influence of external fields or potentials, is analysed. By…
Quantum signal processing provides an optimal procedure for simulating Hamiltonian evolution on a quantum computer using calls to a block encoding of the Hamiltonian. In many situations it is possible to control between forward and reverse…
Quantum simulation is a promising application of future quantum computers. Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. For an accurate product formula approximation,…
Consider a path of non-degenerate eigenstates of unitary operators or Hamiltonians with minimum eigenvalue gap G. The eigenpath traversal problem is to transform one or more copies of the initial to the final eigenstate. Solutions to this…
High fidelity quantum state transfer is an essential part of quantum information processing. In this regard, we address the problem of maximizing the fidelity in a quantum state transformation process satisfying the Liouville-von Neumann…
We present a general framework for finding the time-optimal evolution and the optimal Hamiltonian for a quantum system with a given set of initial and final states. Our formulation is based on the variational principle and is analogous to…
We present a simple derivation of the formula for the Hamiltonian operator(s) that achieve the fastest possible unitary evolution between given initial and final states. We discuss how this formula is modified in pseudo-Hermitian quantum…