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 success probability), we consider a variety of special cases that emerge from the generalized Hamiltonian. In the context of optimal quantum search, we find it is possible to outperform, in terms of minimum search time, the well-known Farhi-Gutmann analog quantum search algorithm. In the context of nearly optimal quantum search, instead, we show it is possible to identify sub-optimal search algorithms capable of outperforming optimal search algorithms if only a sufficiently high success probability is sought. Finally, we briefly discuss the relevance of a tradeoff between speed and fidelity with emphasis on issues of both theoretical and practical importance to quantum information processing.
The evolution of the discrete Wigner function is formally similar to a probabilistic process, but the transition probabilities, like the discrete Wigner function itself, can be negative. We investigate these transition probabilities, as well as the transition rates for a continuous process, aiming particularly to give simple criteria for deciding when a set of such quantities corresponds to a legitimate quantum process. We also show how the transition rates for any Hamiltonian evolution can be worked out by expanding the Hamiltonian as a linear combination of displacement operators in the disc…
We investigate the transition probabilities for the "flavor" eigenstates in the two-level quantum system, which is described by a non-Hermitian Hamiltonian with the parity and time-reversal (PT) symmetry. Particularly, we concentrate on the so-called PT-broken phase, where two eigenvalues of the non-Hermitian Hamiltonian turn out to be a complex conjugate pair. In this case, we find that the transition probabilities will be unbounded in the limit of infinite time $t \to +\infty$. However, after performing a connection between a non-Hermitian system, which exhibits passive PT-symmetry and globa…
In this paper we derive analytical relations between probabilities of the excited state transfers and entanglements calculated by both the Wootters and positive partial transpose (PPT) criteria for the arbitrary spin system with single excited spin in the external magnetic field and Hamiltonian commuting with $I_z$. We apply these relations to study the arbitrary state transfers and entanglements in the simple systems of nuclear spins having two- and three-dimensional geometrical configurations with $XXZ$ Hamiltonian. It is shown that High-Probability State Transfers (HPSTs) are possible among…
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.
Transition probabilities for a class of two level systems described by explicitly time dependent Hamiltonians are considered. Provided only that the approach to the infinite time limit is non-trivial falling at least as fast as 1/t for large t, the transition probability takes a particularly simple form depending only on the value of Hamiltonian parameters in this limit.
The nonadiabatic transition probabilities in the two-level systems are calculated analytically by using the monodromy matrix determining the global feature of the underlying differential equation. We study the time-dependent 2x2 Hamiltonian with the tanh-type plus sech-type energy difference and with constant off-diagonal elements as an example to show the efficiency of the monodromy approach. The application of this method to multi-level systems is also discussed.
We investigate how to define in a consistent way the probabilities of the transitions between the "flavor" states of the two-level quantum system, which is described by a non-Hermitian but parity and time-reversal (PT) symmetric Hamiltonian. Explicit calculations are carried out to demonstrate the conservation of probability if a proper definition of the final state is adopted. Finally, this formalism is applied to two-flavor neutrino oscillations $ν^{}_μ\to ν^{}_μ$ and $ν^{}_μ\to ν^{}_τ$ in vacuum, where the exact PT symmetry requires the vacuum mixing angle to be maximal, which is compatible…
We obtain the exact expression for the matrix of nonadiabatic transition probabilities in the model of three interacting states with a time-dependent Hamiltonian. Unlike other known solvable Landau-Zener-like problems, our solution is generally expressed in terms of hypergeometric functions that have relatively complex behavior, e.g. the obtained transition probabilities may show multiple oscillations as functions of parameters of the model Hamiltonian.
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.
The universe, as a closed system, is for all time in a state with a determinate value of energy, i.e., in an eigenstate of the Hamiltonian. That is the principle of cosmic energy determinacy. The Hamiltonian depends on cosmic time through metric. Therefore there are confluence and branch points of energy levels. At branch points, quantum jumps must happen to prevent the violation of energy determinacy. Thus quantum jumps are a reaction against the propensity of the universe dynamics to that violation. On the basis of this idea, an internally consistent quantum jump dynamics is developed.
Transmission probabilities of the scattering problem with a position dependent mass are studied. After sketching the basis of the theory, within the context of the Schrödinger equation for spatially varying effective mass, the simplest problem, namely, tranmission through a square well potential with a position dependent mass barrier is studied and its novel properties are obtained. The solutions presented here may be adventageous in the design of semiconductor devices.
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.
This paper describes an algorithm for selecting a consistent set within the consistent histories approach to quantum mechanics and investigates its properties. The algorithm select from among the consistent sets formed by projections defined by the Schmidt decomposition by making projections at the earliest possible time. The algorithm unconditionally predicts the possible events in closed quantum systems and ascribes probabilities to these events. A simple random Hamiltonian model is described and the results of applying the algorithm to this model using computer programs are discussed and co…
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.
We use the fact that some linear Hamiltonian systems can be considered as ``finite level'' quantum systems, and the description of quantum mechanics in terms of probabilities, to associate probability distributions with this particular class of linear Hamiltonian systems.
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…
Despite the advent of Grover's algorithm for the unstructured search, its successful implementation on near-term quantum devices is still limited. We apply three strategies to reduce the errors associated with implementing quantum search algorithms. Our improved search algorithms have been implemented on the IBM quantum processors. Using them, we demonstrate three- and four-qubit search algorithm with higher average success probabilities compared to previous works. We present the successful execution of the five-qubit search on the IBM quantum processor for the first time. The results have bee…
We study the average probability that a discrete-time quantum walk finds a marked vertex on a graph. We first show that, for a regular graph, the spectrum of the transition matrix is determined by the weighted adjacency matrix of an augmented graph. We then consider the average search probability on a distance regular graph, and find a formula in terms of the adjacency matrix of its vertex-deleted subgraph. In particular, for any family of (1) complete graphs, or (2) strongly regular graphs, or (3) distance regular graphs of a fixed parameter $d$, varying valency $k$ and varying size $n$, such…
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 show that the computation of formation probabilities (FP) in the configuration basis and the full counting statistics (FCS) of observables in the quadratic fermionic Hamiltonians are equivalent to the calculation of emptiness formation probability (EFP) in the Hamiltonian with a defect. In particular, we first show that the FP of finding a particular configuration in the ground state is equivalent to the EFP of the ground state of the quadratic Hamiltonian with a defect. Then, we show that the probability of finding a particular value for any quadratic observable is equivalent to a FP probl…
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 Hamilton…
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.
Degree-Guided Adiabatic Quantum Algorithm for MIS with Neutral Atoms
Racah Institute of Physics, Hebrew University of Jerusalem（拉卡物理研究所，耶路撒冷希伯来大学）；School of Computer Science and Engineering, Hebrew University of Jerusalem（计算机科学与工程学院，耶路撒冷希伯来大学）；Institute of Applied Physics, Hebrew University of Jerusalem（应用物理研究所，耶路撒冷希伯来大学）
Quantum annealing aims at finding optimal solutions to complex optimization problems using a suitable quantum many body Hamiltonian encoding the solution in its ground state. To find the solution one typically evolves the ground state of a soluble initial Hamiltonian adiabatically to the ground state of the designated final Hamiltonian. Here we explore whether and when a full quantum representation of the dynamics leads to higher probability to end up in the desired ground when compared to a classical mean field approximation. As simple, nontrivial example we target the ground state of interac…
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…
We simulate the evolution of three-node spin chain on the quantum processor of IBM Quantum Experience using the diagonalization of $XX$-Hamiltonian and representing the evolution operator in terms of CNOT operations and one-qubit rotations. We study the single excitation transfer from the first to the third node and show the significant difference between calculated and theoretical values of state transfer probability. Then we propose a method reducing this difference by applying the two-parameter transformation including the shift and scale of the calculated probabilities. { We demonstrate th…
The properties of SU(1,1) SU(2),SU(2,1) and SU(3) have often been used in quantum optics. In this paper we demonstrate the use of these symmetries. The group properties of SU(1,1) SU(2), and SU(2,1) are used to find the transition probabilities of various time dependent quadratic Hamiltonians. We consider Hamiltonians representing the frequency converter,parametric amplifier and raman scattering.These Hamiltonians are used to describe optical coupling in nonlinear crystals.
Perturbative anticrossings have long been identified as a potential computational bottleneck for quantum annealing. This bottleneck can appear, for example, when a uniform transverse driver Hamiltonian is applied to each qubit. Previous theoretical research sought to alleviate such anticrossings by adjusting the transverse driver Hamiltonians on individual qubits according to a perturbative approximation. Here we apply this principle to a physical implementation of quantum annealing in a D-Wave 2000Q system. We use samples from the quantum annealing hardware and per-qubit anneal offsets to pro…
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…
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…
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 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 consider the space of probabilities {P(x)}, where the x are coordinates of a configuration space. Under the action of the translation group there is a natural metric over the space of parameters of the group given by the Fisher-Rao metric. This metric induces a metric over the space of probabilities. Our next step is to set the probabilities in motion. To do this, we introduce a canonically conjugate field S and a symplectic structure; this gives us Hamiltonian equations of motion. We show that it is possible to extend the metric structure to the full space of the {P,S} and this leads in a …
In the quest for signatures of coherent transport we consider exciton trapping in the continuous-time quantum walk framework. The survival probability displays different decay domains, related to distinct regions of the spectrum of the Hamiltonian. For linear systems and at intermediate times the decay obeys a power-law, in contrast to the corresponding exponential decay found in incoherent continuous-time random walk situations. To differentiate between the coherent and incoherent mechanisms, we present an experimental protocol based on a frozen Rydberg gas structured by optical dipole traps.
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…
A single trapped ion interacting with laser light in a radiofrequency trap is considered by diagonalization of full Hamiltonian of the system in a suitable basis. The energies, eigenvectors, probabilities of finding the atom in the ground state, density matrixes and its entanglement are computed. The study repeated for the Hamiltonian under the rotated wave approximation in the same basis. The results compared in general and in the Lamb-Dick regime for ultra-cold atoms to reveal essential changes in the results.
In most realistic models for quantum chaotic systems, the Hamiltonian matrices in unperturbed bases have a sparse structure. We study correlations in eigenfunctions of such systems and derive explicit expressions for some of the correlation functions with respect to energy. The analytical results are tested in several models by numerical simulations. An application is given for a relation between transition probabilities.
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…
The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which rigorous bounds on the circuit size depend on the number of terms $L$ in the system Hamiltonian and the size of the largest term in the Hamiltonian $Λ$. Consequently, Trotter-Suzuki is only practical for sparse Hamiltonians. Trotter-Suzuki is a deterministic compiler but it was recently shown that randomised compiling offers lower overheads. Here we present and ana…
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 compute Landau-Zener probabilities for 3-level systems with a linear sweep of the uncoupled energy levels of the 3$\times$3 Hamiltonian $H(t)$. Two symmetry classes of Hamiltonians are studied: For $H(t) \in$ su(2) (expressible as a linear combination of the three spin 1 matrices), an analytic solution to the problem is obtained in terms of the parabolic cylinder $D$ functions. For $H(t) \in$ su(3) (expressible as a linear combination of the eight Gell-Mann matrices), numerical solutions are obtained. In the adiabatic regime, full population transfer is obtained asymptotically at large time…
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…
We study the functioning of associative memory on three-level quantum elements, qutrites represented by spins with S = 1. The recording of patterns into the superposition of quantum states and their recall are carried out by adiabatic variation of the Hamiltonian with time. To equalize the probabilities of finding the system in different states of superposition, an auxiliary Hamiltonian is proposed, which is turned off at the end of evolution. Simulations were performed on two and three qutrits and an increase in the memory capacity after replacing qubits with qutrits is shown.
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…
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…
Motivated by what one observes dealing with PT-symmetric quantum mechanics, we discuss what happens if a physical system is driven by a diagonalizable Hamiltonian with not all real eigenvalues. In particular, we consider the functional structure related to systems living in finite-dimensional Hilbert spaces, and we show that certain intertwining relations can be deduced also in this case if we introduce suitable antilinear operators. We also analyze a simple model, computing the transition probabilities in the broken and in the unbroken regime.
