We present new intuition behind Grover's quantum search algorithm by means of a Hamiltonian. Given a black-box Boolean function f mapping strings of length n into {0,1} such that f(w) = 1 for exactly one string w, L. K. Grover describes a quantum algorithm that finds w in O(2^{n/2}) time. Farhi & Gutmann show that w can also be found in the same amount time by letting the quantum system evolve according to a simple Hamiltonian depending only on f. Their system evolves along a path far from that taken by Grover's original algorithm, however. The current paper presents an equally simple Hamiltonian matching Grover's algorithm step for step. The new Hamiltonian is similar in appearance from that of Farhi & Gutmann, but has some important differences, and provides new intuition for Grover's algorithm itself. This intuition both contrasts with and supplements other explanations of Grover's algorithm as a rotation in two dimensions, and suggests that the Hamiltonian-based approach to quantum algorithms can provide a useful heuristic for discovering new quantum algorithms.
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}$. Then the known search hamiltonians become special cases of $H_{g}$. From the generalized search hamiltonian, we present remarkable results that searching with 100% is subject only to the phase factor in $H_{g}$ and independent to the number of states or initialization.
We examine the driving Hamiltonian in the analog analogue of Grover's algorithm by Farhi and Gutmann. For a quantum system with a given Hamiltonian $E|w> < w|$, we explicitly show that while the driving Hamiltonian $E|s> < s|$ optimally produces the state $|w>$ from an initial state $|s>$, the driving Hamiltonian $E^{\prime}|s> < s|(E^{\prime} \ne E)$ does not provide any speedup compared even with a classical computation.
Time is a valuable resource and it seems intuitive that longer time should lead to better precision in Hamiltonian parameter estimation. However recent studies have put this intuition into question, showing longer time may even lead to worse estimation in certain cases. Here we show that the intuition can be restored if coherent feedback controls are included. By deriving asymptotically optimal feedback controls we present a quantification of the maximal improvement feedback controls can provide in Hamiltonian parameter estimation and show a universal time scaling for the precision limit of Ha…
A relevant problem in quantum computing concerns how fast a source state can be driven into a target state according to Schrödinger's quantum mechanical evolution specified by a suitable driving Hamiltonian. In this paper, we study in detail the computational aspects necessary to calculate the transition probability from a source state to a target state in a continuous time quantum search problem defined by a multi-parameter generalized time-independent Hamiltonian. In particular, quantifying the performance of a quantum search in terms of speed (minimum search time) and fidelity (maximum succ…
We derive in this study a Hamiltonian to solve with certainty the analog quantum search problem analogue to the Grover algorithm. The general form of the initial state is considered. Since the evaluation of the measuring time for finding the marked state by probability of unity is crucially important in the problem, especially when the Bohr frequency is high, we then give the exact formula as a function of all given parameters for the measuring time.
The robustness of the local adiabatic quantum search to decoherence in the instantaneous eigenbasis of the search Hamiltonian is examined. We demonstrate that the asymptotic time-complexity of the ideal closed case is preserved, as long as the Hamiltonian dynamics is present. In the special case of pure decoherence where the environment monitors the search Hamiltonian, it is shown that the local adiabatic quantum search performs as the classical search.
Quantum search on the two-dimensional lattice with one marked vertex and cyclic boundary conditions is an important problem in the context of quantum algorithms with an interesting unfolding. It avails to test the ability of quantum walk models to provide efficient algorithms from the theoretical side and means to implement quantum walks in laboratories from the practical side. In this paper, we rigorously prove that the recent-proposed staggered quantum walk model provides an efficient quantum search on the two-dimensional lattice, if the reflection operators associated with the graph tessell…
We numerically simulate the effects of noise-induced sampling of alternative Hamiltonian paths on the ability of quantum adiabatic search (QuAdS) to solve randomly generated instances of the NP-Complete problem N-bit Exact Cover 3. The noise-averaged median runtime is determined as the noise-power and number of bits N are varied, and power-law and exponential fits are made to the data. Noise is seen to slowdown QuAdS, though a downward shift in the scaling exponent is found for N > 12 over a range of noise-power values. We discuss whether this shift might be connected to arguments in the liter…
We report on a detailed analysis of generalization of the local adiabatic search algorithm. Instead of evolving directly from an initial ground state Hamiltonian to a solution Hamiltonian a different evolution path is introduced and is shown that the time required to find an item in a database of size $N$ can be made to be independent of the size of the database by modifying the Hamiltonian used to evolve the system.
Recently the continuous time algorithm based on the generalized quantum search Hamiltonian was presented. In this letter, we consider the running time of the generalized quantum search Hamiltonian. We provide the surprising result that the maximum speedup of quantum search in the generalized Hamiltonian is the O(1) running time regardless of the number of total states. It seems to violate the proof of Zalka that the quadratic speedup is optimal in quantum search. However the argurment of Giovannetti et al. that a quantum speedup comes from the interaction between subsystems(or, equivalently en…
In Phys. Rev. A {\bf 71}, 060312(R) (2005) the robustness of the local adiabatic quantum search to decoherence in the instantaneous eigenbasis of the search Hamiltonian was examined. We expand this analysis to include the case of the global adiabatic quantum search. As in the case of the local search the asymptotic time complexity for the global search is the same as for the ideal closed case, as long as the Hamiltonian dynamics is present. In the case of pure decoherence, where the environment monitors the search Hamiltonian, we find that the time complexity of the global quantum adiabatic se…
Quantum computing can efficiently simulate Hamiltonian dynamics of many-body quantum physics, a task that is generally intractable with classical computers. The hardness lies at the ubiquitous anti-commutative relations of quantum operators, in corresponding with the notorious negative sign problem in classical simulation. Intuitively, Hamiltonians with more commutative terms are also easier to simulate on a quantum computer, and anti-commutative relations generally cause more errors, such as in the product formula method. Here, we theoretically explore the role of anti-commutative relation in…
We introduce a method for the search of parent Hamiltonians of input wave-functions based on the structure of their reduced density matrix. The two key elements of our recipe are an ansatz on the relation between reduced density matrix and parent Hamiltonian that is exact at the field theory level, and a minimization procedure on the space of relative entropies, which is particularly convenient due to its convexity. As examples, we show how our method correctly reconstructs the parent Hamiltonian correspondent to several non-trivial ground state wave functions, including conformal and symmetry…
We analyze three different quantum search algorithms, the traditional Grover's algorithm, its continuous-time analogue by Hamiltonian evolution, and finally the quantum search by local adiabatic evolution. We show that they are closely related algorithms in the sense that they all perform a rotation, at a constant angular velocity, from a uniform superposition of all states to the solution state. This make it possible to implement the last two algorithms by Hamiltonian evolution on a conventional quantum circuit, while keeping the quadratic speedup of Grover's original algorithm.
Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schrödinger's equation. In the former, the Hamiltonian is fixed, while in the latter, the Hamiltonian varies with time. As a result, their formulations of Grover's algorithm evolve differently through Hilbert space. We show that this difference is fundamental; they cannot be made to evolve along each other's path without introducing structure more powerful than the standard oracle for unstructured search. For…
Quantum computation by the adiabatic theorem requires a slowly varying Hamiltonian with respect to the spectral gap. We show that the Landau-Zener-Stückelberg oscillation phenomenon, that naturally occurs in quantum two level systems under non-adiabatic periodic drive, can be exploited to find the ground state of an N dimensional Grover Hamiltonian. The total runtime of this method is $O(\sqrt{2^n})$ which is equal to the computational time of the Grover algorithm in the quantum circuit model. An additional periodic drive can suppress a large subset of Hamiltonian control errors using coherent…
We study quantum dynamics of Grover's adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolutions are visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for short running time to inverse-square decay for long running time. The size dependence of the critical running time is expressed in terms of Lambert $W$ function. The transitionless driving Hamiltonian is obtained to make a quantum state follow the adiabatic path. We demonstrate that a constant Ha…
Ground-state preparation for a given Hamiltonian is a common quantum-computing task of great importance and has relevant applications in quantum chemistry, computational material modeling, and combinatorial optimization. We consider an approach to simulate dissipative non-Hermitian Hamiltonian quantum dynamics using Hamiltonian simulation techniques to efficiently recover the ground state of a target Hamiltonian. The proposed method facilitates the energy transfer by repeatedly projecting ancilla qubits to the desired state, rendering the effective non-Hermitian Hamiltonian evolution on the sy…
Non-Hermitian systems with parity-time symmetry have been developed rapidly and hold great promise for future applications. Unlike most existing works considering the symmetry of the free energy terms (e.g., gain-loss system), in this paper, we report that a realizable non-Hermitian interaction between two quantum resonances can also have a real spectrum after the exceptional point. That phenomenon is similar with that in the gain-loss system so that the non-Hermitian interaction can be an excellent substitute for quantum gain. Such a non-Hermitian interaction can be realized in designed optom…
We consider the problem of searching a d-dimensional lattice of N sites for a single marked location. We present a Hamiltonian that solves this problem in time of order sqrt(N) for d>2 and of order sqrt(N) log(N) in the critical dimension d=2. This improves upon the performance of our previous quantum walk search algorithm (which has a critical dimension of d=4), and matches the performance of a corresponding discrete-time quantum walk algorithm. The improvement uses a lattice version of the Dirac Hamiltonian, and thus requires the introduction of spin (or coin) degrees of freedom.
We develop a quantum-inspired numerical procedure for searching low-energy states of a classical Hamiltonian composed of two-body fully-connected random Ising interactions and a random local longitudinal magnetic field. In this method, we introduce infinitesimal quantum interactions that do not commute with the original Ising Hamiltonian, and repeatedly generate and truncate direct product states, inspired by the Krylov subspace method, to obtain the low-energy states of the original classical Ising Hamiltonian. The computational cost is controlled by the form of infinitesimal quantum interact…
We discuss what kind of quantum channels can enable thermalization processes. We show that in order to determine a system's temperature, a thermometer needs to dynamically gain information about the system's local Hamiltonian and not just its state. We illustrate this showing that any temperature measurement protocol that does not resolve the system's local Hamiltonian (such as, e.g., full state tomography) is susceptible to being fooled into measuring any value for the temperature. We will establish necessary conditions for thermal contact for quantum systems. Furthermore, we will show that t…
Quantum dot hybrid qubits formed from three electrons in double quantum dots represent a promising compromise between high speed and simple fabrication for solid state implementations of single qubit and two qubits quantum logic ports. We derive the Schrieffer-Wolff effective Hamiltonian that describes in a simple and intuitive way the qubit by combining a Hubbard-like model with a projector operator method. As a result, the Hubbard-like Hamiltonian is transformed in an equivalent expression in terms of the exchange coupling interactions between pairs of electrons. The effective Hamiltonian is…
In general, a quantum algorithm wants to avoid decoherence or perturbation, since such factors may cause errors in the algorithm. In this letter, we will supply the answer to the interesting question: can the factors seemingly harmful to a quantum algorithm(for example, perturbations) enhance the algorithm? We show that some perturbations to the generalized quantum search Hamiltonian can reduce the running time and enhance the success probability. We also provide the narrow bound to the perturbation which can be beneficial to quantum search. In addition, we show that the error induced by a per…
In this work we present a method for generating a fermionic encoding tailored to a set of target fermionic operators and to a target hardware connectivity. Our method uses brute force search, over the space of all encodings which map from Majorana monomials to Pauli operators, to find an encoding which optimizes a target cost function. In contrast to earlier works in this direction, our method searches over an extremely broad class of encodings which subsumes all known second quantized encodings that constitute algebra homomorphisms. In order to search over this class, we give a clear mathemat…
It was recently emphasized by Byrnes, Forster, and Tessler [Phys. Rev. Lett. 120, 060501 (2018)] that the continuous-time formulation of Grover's quantum search algorithm can be intuitively understood in terms of Rabi oscillations between the source and the target subspaces. In this work, motivated by this insightful remark and starting from the consideration of a time-independent generalized quantum search Hamiltonian as originally introduced by Bae and Kwon [Phys. Rev. A 66, 012314 (2002)], we present a detailed investigation concerning the physical connection between quantum search Hamilton…
We examine the use of adiabatic quantum algorithms to solve structured, or nested, search problems. We construct suitable time dependent Hamiltonians and derive the computation times for a general class of nested searches involving n qubits. As expected, we find that as additional structure is included, the Hamiltonians become more local and the computation times decrease.
Quantum annealing (QA) is one of the ways to search the ground state of the problem Hamiltonian. Here, we propose the QA scheme to search arbitrary excited states of the problem Hamiltonian. In our scheme, an $n$-th excited state of the trivial Hamiltonian is initially prepared and is adiabatically changed into an $n$-th excited state of the target Hamiltonian. Although our scheme is general such that we can search any excited states, we especially discuss the first excited state search in this paper. As a comparison, we consider a non-adiabatic scheme to find the first excited state with non-…
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 required, particularly for systems with large Hilbert spaces. Prior work on unitary transformation control indicates that (i) for controllable systems, local extrema in the search landscape for optimal control of quantum gates have null measure, facilitating the convergence of local search algorithms; but (ii) the required time for convergence to optimal con…
We propose a circuit-model quantum algorithm for eigenpath traversal that is based on a combination of concepts from Grover's search and adiabatic quantum computation. Our algorithm deploys a sequence of reflections determined from eigenspaces of instantaneous Hamiltonians defined along an adiabatic schedule in order to prepare a ground state of a target problem Hamiltonian. We provide numerical evidence suggesting that, for combinatorial search problems, our algorithm can find a solution faster, on average, than Grover's search. We demonstrate our findings by applying both algorithms to solvi…
In this letter, we show that the laser Hamiltonian can perform the quantum search. We also show that the process of quantum search is a resonance between the initial state and the target state, which implies that Nature already has a quantum search system to use a transition of energy. In addition, we provide the particular scheme to implement the quantum search algorithm based on a trapped ion.
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 analogues of classical search procedures. We present a rather detailed description of a somewhat simplified version of the MNRS algorithm. Finally, in the query complexity model, we show how quantum walks can be applied to the following search problems: Element Distinctness, Matrix Product Verification, Restricted Range Associativity, Triangle, and Group Comm…
We derive the Hamiltonian of a superconducting circuit that comprises a single-Josephson-junction flux qubit inductively coupled to an LC oscillator, and we compare the derived circuit Hamiltonian with the quantum Rabi Hamiltonian, which describes a two-level system coupled to a harmonic oscillator. We show that there is a simple, intuitive correspondence between the circuit Hamiltonian and the quantum Rabi Hamiltonian. While there is an overall shift of the entire spectrum, the energy level structure of the circuit Hamiltonian up to the seventh excited states can still be fitted well by the q…
We present two new continuous time quantum search algorithms similar to the adiabatic search algorithm, but now without an adiabatic evolution. We find that both algorithms work for a wide range of values of the parameters of the Hamiltonian, and one of them has, as an additional feature that, for values of time larger than a characteristic one, it will converge to a state which can be close to the searched state.
Perturbation theory in quantum mechanics studies how quantum systems interact with their environmental perturbations. Harmonic perturbation is a rare special case of time-dependent perturbations in which exact analysis exists. Some important technology advances, such as masers, lasers, nuclear magnetic resonance, etc., originated from it. Here we add quantum computation to this list with a theoretical demonstration. Based on harmonic perturbation, a quantum mechanical algorithm is devised to search the ground state of a given Hamiltonian. The intrinsic complexity of the algorithm is continuous…
We present an extension of Adiabatic Quantum Computing (AQC) algorithm for the unstructured search to the case when the number of marked items is unknown. The algorithm maintains the optimal Grover speedup and includes a small counting subroutine. Our other results include a lower bound on the amount of time needed to perform a general Hamiltonian-based quantum search, a lower bound on the evolution time needed to perform a search that is valid in the presence of control error and a generic upper bound on the minimum eigenvalue gap for evolutions. In particular, we demonstrate that quantum spe…
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., quant-ph/0001106]. We apply this time-dependent Hamiltonian approach to the Grover's problem, i. e., searching a marked item in an unstructured database. We find that, by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order $\sqrt{N}$, where $N$ is the number…
Recent advances in the field of adiabatic quantum computing and the closely related field of quantum annealers has centered around using more advanced and novel Hamiltonian representations to solve optimization problems. One of these advances has centered around the development of driver Hamiltonians that commute with the constraints of an optimization problem - allowing for another avenue to satisfying those constraints instead of imposing penalty terms for each of them. In particular, the approach is able to use sparser connectivity to embed several practical problems on quantum devices than…
We formulate an optimization problem of Hamiltonian design based on the variational principle. Given a variational ansatz for a Hamiltonian we construct a loss function to be minimised as a weighted sum of relevant Hamiltonian properties specifying thereby the search query. Using fractional quantum Hall effect as a test system we illustrate how the framework can be used to determine a generating Hamiltonian of a finite-size model wavefunction (Moore-Read Pfaffian and Read-Rezayi states), find optimal conditions for an experiment or "extrapolate" given wavefunctions in a certain universality cl…
Exceptional points (EPs) are degeneracies of classical and quantum open systems, which are studied in many areas of physics including optics, optoelectronics, plasmonics, and condensed matter physics. In the semiclassical regime, open systems can be described by phenomenological effective non-Hermitian Hamiltonians (NHHs) capturing the effects of gain and loss in terms of imaginary fields. The EPs that characterize the spectra of such Hamiltonians (HEPs) describe the time evolution of a system without quantum jumps. It is well known that a full quantum treatment describing more generic dynamic…
Quantum circuits constructed from Josephson junctions and superconducting electronics are key to many quantum computing and quantum optics applications. Designing these circuits involves calculating the Hamiltonian describing their quantum behavior. Here we present QuCAT, or "Quantum Circuit Analyzer Tool", an open-source framework to help in this task. This open-source Python library features an intuitive graphical or programmatical interface to create circuits, the ability to compute their Hamiltonian, and a set of complimentary functionalities such as calculating dissipation rates or visual…
Inspired by a recently constructed commuting-projector Hamiltonian for a two-dimensional (2D) time-reversal-invariant topological superconductor [Wang et al., Phys. Rev. B 98, 094502 (2018)], we introduce a commuting-projector model that describes an interacting yet exactly solvable 2D topological insulator. We explicitly show that both the gapped and gapless boundaries of our model are consistent with those of band-theoretic, weakly interacting topological insulators. Interestingly, on certain lattices our time-reversal-symmetric models also enjoy $\mathcal{CP}$ symmetry, leading to intuitive…
Quantum annealing (QA) is a promising method for solving combinatorial optimization problems whose solutions are embedded into a ground state of the Ising Hamiltonian. This method employs two types of Hamiltonians: a driver Hamiltonian and a problem Hamiltonian. After a sufficiently slow change from the driver Hamiltonian to the problem Hamiltonian, we can obtain the target ground state that corresponds to the solution. The inclusion of non-stoquastic terms in the driver Hamiltonian is believed to enhance the efficiency of the QA. Meanwhile, decoherence is regarded as of the main obstacles for…
For the XXZ chain, we discuss the relation between a lattice version of Unruh effect and the ground-state entanglement on the basis of the corner Hamiltonian. We find that the lattice Unruh temperature is interpreted as $β_λ= 2π/a$ with an effective acceleration $a=π/λ$, where $λ$ denotes the anisotropy parameter of the XXZ chain. Using quantum Monte Carlo simulation for the corner Hamiltonian at $β_λ$, we demonstrate that world lines of spins surrounding the entangle point provides an intuitive understanding the quantum entanglement. We also propose an XXZ-chain analogue of the detector for t…
The information of quantum pathways can be extracted in the framework of the Hamiltonian-encoding and Observable-decoding method. For closed quantum systems, only off-diagonal elements of the Hamiltonian in the Hilbert space is required to be encoded to obtain the desired transitions. For open quantum systems, environment-related terms will appear in the diagonal elements of the Hamiltonian in the Liouville space. Therefore, diagonal encodings have to be performed to differentiate different pathways, which will lead to self-to-self transitions and inconsistency of pathway amplitudes with Dyson…
Engineering desired Hamiltonian in quantum many-body systems is essential for applications such as quantum simulation, computation and sensing. Conventional quantum Hamiltonian engineering sequences are designed using human intuition based on perturbation theory, which may not describe the optimal solution and is unable to accommodate complex experimental imperfections. Here we numerically search for Hamiltonian engineering sequences using deep reinforcement learning (DRL) techniques and experimentally demonstrate that they outperform celebrated sequences on a solid-state nuclear magnetic reso…
Interacting spins in quantum magnet can cooperate and exhibit exotic states like the quantum spin liquid. To explore the materialization of such intriguing states, the determination of effective spin Hamiltonian of the quantum magnet is thus an important, while at the same time, very challenging inverse many-body problem. To efficiently learn the microscopic spin Hamiltonian from the macroscopic experimental measurements, here we propose an unbiased Hamiltonian searching approach that combines various optimization strategies, including the automatic differentiation and Bayesian optimization, e…
We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a data base of $N$ items. In particular we examine the effects on the computation time of adding energy to the system. We find that by increasing the lowest eigenvalue of the time dependent Hamiltonian {\it temporarily} to a maximum of $\propto \sqrt{N}$, it is possible to do the calculation in constant time. This leads us to derive the general theorem which provides the adiabatic analogue of the $\sqrt{N}$ bound of conventional quantum searches. The result suggests that the action associated w…
Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a quadratic advantage over classical random walks has been an outstanding problem. Thus far, this advantage is obtained only for specific graphs or when a single node of the underlying graph is marked. In this article, we provide a new continuous-time quantum walk search algorithm that completely resolves this: our algorithm can find a marked node in any grap…
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 time complexity, which is $O(\sqrt{N/M})$, of the local adiabatic search algorithm\cite{Roland2002}, to $O(\sqrt{N}/M)$.
