Related papers: Driving Hamiltonian in a Quantum Search Problem
This work concerns a study of the quantum mechanical extension of the work of Horwitz et al. [1] on the stability of classical Hamiltonian systems by geometrical methods. Simulations are carried out for several important examples, these…
A hybrid quantum-classical algorithm is a computational scheme in which quantum circuits are used to extract information that is then processed by a classical routine to guide subsequent quantum operations. These algorithms are especially…
A remarkably simple result is derived for the minimal time $T_{\rm min}$ required to drive a general initial state to a final target state by a Landau-Zener type Hamiltonian or, equivalently, by time-dependent laser driving. The associated…
Grover's quantum search algorithm is analyzed for the case in which the initial state is an arbitrary pure quantum state $|\phi>$ of $n$ qubits. It is shown that the optimal time to perform the measurement is independent of $| \phi>$,…
In some recent papers, the so called $(H,\rho)$-induced dynamics of a system $\mathcal{S}$ whose time evolution is deduced adopting an operatorial approach, has been introduced. According to the formal mathematical apparatus of quantum…
With many Hamiltonians one can naturally associate a |Psi|^2-distributed Markov process. For nonrelativistic quantum mechanics, this process is in fact deterministic, and is known as Bohmian mechanics. For the Hamiltonian of a quantum field…
We introduce a hybrid classical-quantum algorithm for simulating a Hamiltonian of the form $H= \sum_{i=1}^K H_i = \sum_{i=1}^K H_{i_1} \otimes H_{i_2} \otimes \cdots \otimes H_{i_M}$. Given that the entries of all $\{ H_{i_1}, H_{i_2} ,…
The Hamiltonian of a linearly driven two-level system, or qubit, in the standard rotating frame contains non-commuting terms that oscillate at twice the drive frequency, $\omega$, rendering the task of analytically finding the qubit's time…
We study quantum annealing for combinatorial optimization with Hamiltonian $H = z H_f + H_0$ where $H_f$ is diagonal, $H_0=-|\phi \rangle \langle \phi|$ is the equal superposition state projector and $z$ the annealing parameter. We…
Grover's search algorithm is the optimal quantum algorithm that can search an unstructured database quadratically faster than any known classical algorithm. The role of entanglement and correlations in the search algorithm have been studied…
We present a theoretical method to generate a highly accurate {\em time-independent} Hamiltonian governing the finite-time behavior of a time-periodic system. The method exploits infinitesimal unitary transformation steps, from which…
We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with non destructive single-shot readout of the two qubits. With this processor, we run the Grover…
Efficiently characterising quantum systems, verifying operations of quantum devices and validating underpinning physical models, are central challenges for the development of quantum technologies and for our continued understanding of…
This paper presents a useful compact formula for deriving an effective Hamiltonian describing the time-averaged dynamics of detuned quantum systems. The formalism also works for ensemble-averaged dynamics of stochastic systems. To…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The…
This study investigates pseudo-Hermitian quantum mechanics, where the Hamiltonian satisfies a modified Hermiticity condition. We extend the uncertainty relation for such systems, demonstrating its equivalence to the standard Hermitian case…
A many-body Hamiltonian can be block-diagonalized by expressing it in terms of symmetry-adapted basis states. Finding the group orbit representatives of these basis states and their corresponding symmetries is currently a…
The problem of simulating sparse Hamiltonians on quantum computers is well studied. The evolution of a sparse N x N Hamiltonian H for time t can be simulated using O(||Ht||poly(log N)) operations, which is essentially optimal due to a…
We prove that it is impossible to built a universal quantum machine that produces reflections about an unknown state. We then point out a connection between this result and the optimality of Grover's search algorithm: if such reflection…