Related papers: Transition Probabilities in Generalized Quantum Se…
There are hamiltonians that solve a search problem of finding one of $N$ items in $O(\sqrt{N})$ steps. They are hamiltonians to describe an oscillation between two states. In this paper we propose a generalized search hamiltonian, $H_{g}$.…
Any protocol to process quantum information has to conclude with a measurement, aimed at producing a specific set of probabilities of measurement outcomes. In this work, we investigate the time, energy and importantly the genuine quantum…
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks…
We formalize and study the Hamiltonian certification problem. Given access to $e^{-\mathrm{i} Ht}$ for an unknown Hamiltonian $H$, the goal of the problem is to determine whether $H$ is $\varepsilon_1$-close to or $\varepsilon_2$-far from a…
The question of how fast a quantum state can evolve is considered. Using the definition of squared speed based on the Euclidean distance given in [Phys. Rev. Research, {\bf 2}, 033127 (2019)], we present a systematic framework to obtain the…
The minimum time a system needs to change from an initial state to a final orthogonal state is called quantum speed limit time. Quantum speed limit time can be used to quantify the speed of the quantum evolution. The speed of the quantum…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
A quantum search algorithm based on the partial adiabatic evolution\cite{Tulsi2009} is provided. We calculate its time complexity by studying the Hamiltonian in a two-dimensional Hilbert space. It is found that the algorithm improves the…
Characterizing quantum many-body systems is a fundamental problem across physics, chemistry, and materials science. While significant progress has been made, many existing Hamiltonian learning protocols demand digital quantum control over…
The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb-Robinson-type bounds that are crucial for understanding various…
Here, we are concerned with comparing estimation schemes for the quantum state under continuous measurement (quantum trajectories), namely quantum state filtering and, as introduced by us [Phys. Rev. Lett. 115, 180407 (2015)], quantum state…
We introduce a framework for computing time-dependent quantum transition rates (QTRs) that describe the pace of evolution of a quantum state from a given subspace to a target subspace. QTRs are expressed in terms of flux-flux correlators…
Search-base algorithms have widespread applications in different scenarios. Grover's quantum search algorithms and its generalization, amplitude amplification, provide a quadratic speedup over classical search algorithms for unstructured…
In this paper, we present efficient quantum algorithms that are exponentially faster than classical algorithms for solving the quantum optimal control problem. This problem involves finding the control variable that maximizes a physical…
The optimal quantum control theory is employed to determine electric pulses capable of producing quantum gates with high fidelity (higher than 0.9997). Particularly, these quantum gates were chosen to perform the permutation algorithm (Z.…
We present a continuous time quantum search algorithm analogous to Grover's. In particular, the optimal search time for this algorithm is proportional to $\sqrt{N}$, where $N$ is the database size. This search algorithm can be implemented…
I report a tight upper bound of the maximum speed of evolution from one quantum state $\rho$ to another $\rho'$ with fidelity $F(\rho,\rho')$ less than or equal to an arbitrary but fixed value under the action of a time-independent…
One often needs to estimate how fast an evolving state of a quantum system can depart from some target state or target subspace of a Hilbert space. Such estimates are known as quantum speed limits. We derive a quantum speed limit for a…
A general quantum search algorithm aims to evolve a quantum system from a known source state $|s\rangle$ to an unknown target state $|t\rangle$. It uses a diffusion operator $D_{s}$ having source state as one of its eigenstates and $I_{t}$,…
State conversion generalizes query complexity to the problem of converting between two input-dependent quantum states by making queries to the input. We characterize the complexity of this problem by introducing a natural…