4 pages, 2 figures; To prevent from misunderstanding, we clarified the discussion of an apparent speedup in the Grover algorithm; figures improved + minor changes
The parametrization of adiabatic paths is optimal when tunneling is minimized. Hamiltonian evolutions do not have unique optimizers. However, dephasing Lindblad evolutions do. The optimizers are simply characterized by an Euler-Lagrange equation and have a constant tunneling rate along the path irrespective of the gap. Application to quantum search algorithms recovers the Grover result for appropriate scaling of the dephasing. Dephasing rates that beat Grover imply hidden resources in Lindblad operators.
We aim to give more insights on adiabatic evolution concerning the occurrence of anti-crossings and their link to the spectral minimum gap $Δ_{min}$. We study in detail adiabatic quantum computation applied to a specific combinatorial problem called weighted max $k$-clique. A clear intuition of the parametrization introduced by V. Choi is given which explains why the characterization isn't general enough. We show that the instantaneous vectors involved in the anti-crossing vary brutally through it making the instantaneous ground-state hard to follow during the evolution. This result leads to a…
An adiabatic time evolution of a closed quantum system connects eigenspaces of initial and final Hermitian Hamiltonians for slowly driven systems, or, unitary Floquet operators for slowly modulated driven systems. We show that the connection of eigenspaces depends on a topological property of the adiabatic paths for given initial and final points. An example in slowly modulated periodically driven systems is shown. These analysis are based on the topological analysis of the exotic quantum holonomy in adiabatic closed paths.
The adiabatic perturbation is shown to be singular from the exact solution of a spin-1/2 particle in a uniformly rotating magnetic field. Due to a non-adiabatic effect, its quantum trajectory on a Bloch sphere is a cycloid traced by a circle rolling along an adiabatic path. As the magnetic field rotates more and more slowly, the time-energy uncertainty, proportional to the distance of the quantum trajectory, calculated by the exact solution is entirely different from the one obtained by the adiabatic path traced by the instantaneous state. However, the non-adiabatic Aharonov-Anandan geometric …
The recent "honeycomb code" is a fault-tolerant quantum memory defined by a sequence of checks which implements a nontrivial automorphism of the toric code. We argue that a general framework to understand this code is to consider continuous adiabatic paths of gapped Hamiltonians and we give a conjectured description of the fundamental group and second and third homotopy groups of this space in two spatial dimensions. A single cycle of such a path can implement some automorphism of the topological order of that Hamiltonian. We construct such paths for arbitrary automorphisms of two-dimensional …
We apply a flexible numerical integrator to the simulation of adiabatic quantum computation with nonlinear paths. We find that a nonlinear path may significantly improve the performance of adiabatic algorithms versus the conventional straight-line interpolations. The employed integrator is suitable for solving the time-dependent Schrödinger equation for any qubit Hamiltonian. Its flexible storage format significantly reduces cost for storage and matrix-vector multiplication in comparison to common sparse matrix schemes.
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.
We find an exact expression for the current that is induced in a 3 site ring during a multiple-path adiabatic crossing. The understanding of the dynamics requires to go beyond the two-level phenomenology. In particular we highlight a prototype process, "adiabatic metamorphosis", during which current is flowing through a non-accessible site. This helps to understand the crossover from coherent non-classical splitting to stochastic noisy-alike partitioning of the current.
Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization. We introduce a transformation that maps every non-stoquastic adiabatic path ending in a classical Hamiltonian to a corresponding stoquastic adiabatic path by appropriately adjusting the phase of each matrix entry in the computational basis. We compare the spectral gaps of these adiabatic paths and find both theoretically and numerically that the paths based on non-stoquastic Hamiltonians have …
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes the solution of the computational problem. These algorithms have generally been studied in the case where the "straight line" path from initial to final Hamiltonian is taken. But there is no reason not to try paths involving terms that are not linear combinations of the initial and final Hamiltonians. We give several proposals for randomly generating new paths…
We obtain the adiabatic Berry phase by defining a generalised gauge potential whose line integral gives the phase holonomy for arbitrary evolutions of parameters. Keeping in mind that for classical integrable systems it is hardly clear how to obtain open-path Hannay angle, we establish a connection between the open-path Berry phase and Hannay angle by using the parametrised coherent state approach. Using the semiclassical wavefunction we analyse the open-path Berry phase and obtain the open-path Hannay angle. Further, by expressing the adiabatic Berry phase in terms of the commutator of instan…
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…
Quantum systems are typically subject to various environmental noise sources. Treating these environmental disturbances with a system-bath approach beyond weak coupling one must refer to numerical methods as, for example, the numerically exact quasi-adiabatic path integral approach. This approach, however, cannot treat baths which couple to the system via operators, which do not commute. We extend the quasi-adiabatic path integral approach by determining the time discrete influence functional for such non-commuting fluctuations and by modifying the propagation scheme accordingly. We test the e…
We discuss adiabatic quantum phenomena at a level crossing. Given a path in the parameter space which passes through a degeneracy point, we find a criterion which determines whether the adiabaticity condition can be satisfied. For paths that can be traversed adiabatically we also derive a differential equation which specifies the time dependence of the system parameters, for which transitions between distinct energy levels can be neglected. We also generalize the well-known geometric connections to the case of adiabatic paths containing arbitrarily many level-crossing points and degenerate lev…
Shortcuts to adiabaticity (STA) are fast methods to realize the same final state evolution of quantum adiabatic process. We develop a general theory to construct a new kind of STA by solely sampling the points of the adiabatic path of the original adiabatic Hamiltonian. In contrast to previous methods, our approach does not require any additional control resources, has inherent robustness, and does not use any complicated unitary transformation. Based on path sampling, the resulting STA protocols are simple and can avoid points of adiabatic path that are challenging to implement. As applicatio…
The non-adiabatic geometric quantum computation (NGQC) has attracted a lot of attention for noise-resilient quantum control. However, previous implementations of NGQC require long evolution paths that make them more vulnerable to incoherent errors than their dynamical counterparts.In this work, we experimentally realize a universal short-path non-adiabatic geometric gate set (SPNGQC) with a 2-times shorter evolution path on a superconducting quantum processor. Characterizing with both quantum process tomography and randomized benchmarking methods, we report an average single-qubit gate fidelit…
Whether one is interested in quantum state preparation or in the design of efficient heat engines, adiabatic (reversible) transformations play a pivotal role in minimizing computational complexity and energy losses. Understanding the structure of these transformations and identifying the systems for which such transformations can be performed efficiently and quickly is therefore of primary importance. In this paper we focus on finding optimal paths in the space of couplings controlling the system's Hamiltonian. More specifically, starting from a local Hamiltonian we analyze directions in the s…
In this paper, we study two different nonlinear interpolating paths in adiabatic evolution algorithms for solving a particular class of quantum search problems where both the initial and final Hamiltonian are one-dimensional projector Hamiltonians on the corresponding ground state. If the overlap between the initial state and final state of the quantum system is not equal to zero, both of these models can provide a constant time speedup over the usual adiabatic algorithms by increasing some another corresponding "complexity". But when the initial state has a zero overlap with the solution stat…
We implemented arbitrary single qubit gates of geometric quantum computing for a three-level system in a single-shot manner. The evolution time of the gate has been minimized by considering the shortest trajectory of the state on the Bloch sphere. The duration of gates grows from zero with the rotation angle $γ$, and the tested T gate time can be reduced to $\sim$40\% of those in the traditional orange-sliced-shaped path non-adiabatic holonomic quantum computing (NHQC) scheme by the parametrization of Rabi frequency. We also demonstrated that certain pulses are robust against static detuning e…
We propose a realistic scheme to create motional entangled states of a few bosonic atoms. It can experimentally be realized with a gas of ultra cold bosonic atoms trapped in a deep optical lattice potential. By simultaneously deforming and rotating the trapping potential on each lattice site it is feasible to adiabatically create a variety of entangled states on each lattice well. We fully address the case of N=2 and N=4 atoms per well and identify a sequence of fractional quantum Hall states: the Pfaffian state, the 1/2-Laughlin quasiparticle and the 1/2-Laughlin state. Exact knowledge of the…
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic evolution with a interpolation path is too simple, the minimal gap between the ground state and the first excited state of this quantum adiabatic evolution is an inverse exponential distance. Thus quantum adiabatic evolutions of this kind can't be used to design efficient quantum algorithms. Similarly, we show that a quantum adiabatic evolution with a simple final …
It has been recently argued that adiabatic quantum optimization would fail in solving NP-complete problems because of the occurrence of exponentially small gaps due to crossing of local minima of the final Hamiltonian with its global minimum near the end of the adiabatic evolution. Using perturbation expansion, we analytically show that for the NP-hard problem of maximum independent set there always exist adiabatic paths along which no such crossings occur. Therefore, in order to prove that adiabatic quantum optimization fails for any NP-complete problem, one must prove that it is impossible t…
The path dependence of adiabatic evolution in classical harmonic chains with clamps is examined. It is shown that cutting and joining a chain may braid adiabatic normal mode frequencies. Accordingly, different adiabatic paths with the same endpoints may transport a normal mode to a different one, and an adiabatic cycle pumps action variables, i.e., the adiabatic invariants of integrable classical systems. Another adiabatic pump for artificial edge modes induced by clamps is shown as an application. Extensions to completely integrable systems and quantum systems are outlined.
A gapped quantum system that is adiabatically perturbed remains approximately in its eigenstate after the evolution. We prove that, for constant gap, general quantum processes that approximately prepare the final eigenstate require a minimum time proportional to the ratio of the length of the eigenstate path to the gap. Thus, no rigorous adiabatic condition can yield a smaller cost. We also give a necessary condition for the adiabatic approximation that depends on local properties of the path, which is appropriate when the gap varies.
All the geometric phases, adiabatic and non-adiabatic, are formulated in a unified manner in the second quantized path integral formulation. The exact hidden local symmetry inherent in the Schrödinger equation defines the holonomy. All the geometric phases are shown to be topologically trivial. The geometric phases are briefly compared to the chiral anomaly which is naturally formulated in the path integral.
In quantum adiabatic algorithm, as the adiabatic parameter $s(t)$ changes slowly from zero to one with finite rate, a transition to excited states inevitably occurs and this induces an intrinsic computational error. We show that this computational error depends not only on the total computation time $T$ but also on the time derivatives of the adiabatic parameter $s(t)$ at the beginning and the end of evolution. Previous work (Phys. Rev. A \textbf{82}, 052305) also suggested this result. With six typical paths, we systematically demonstrate how to optimally design an adiabatic path to reduce th…
We construct a set of instances of 3SAT which are not solved efficiently using the simplest quantum adiabatic algorithm. These instances are obtained by picking random clauses all consistent with two disparate planted solutions and then penalizing one of them with a single additional clause. We argue that by randomly modifying the beginning Hamiltonian, one obtains (with substantial probability) an adiabatic path that removes this difficulty. This suggests that the quantum adiabatic algorithm should in general be run on each instance with many different random paths leading to the problem Hami…
Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are probabilistic in nature and the minimum gap between the ground state and first excited state of the system during evolution is a major factor in determining the success probability. In this work we investigate a strategy for increasing the minimum gap and success probability by introducing intermediate Hamiltonians that modify the evolution path between initia…
The geometric phase acquired by the vector states under an adiabatic evolution along a noncyclic path can be calculated correctly in any instantaneous basis of a Hamiltonian that varies in time due to a time-dependent classical field.
We explore to what extent path-integral quantum Monte Carlo methods can efficiently simulate the tunneling behavior of quantum adiabatic optimization algorithms. Specifically we look at symmetric cost functions defined over n bits with a single potential barrier that a successful optimization algorithm will have to tunnel through. The height and width of this barrier depend on n, and by tuning these dependencies, we can make the optimization algorithm succeed or fail in polynomial time. In this article we compare the strength of quantum adiabatic tunneling with that of path-integral quantum Mo…
We study adiabatic quantum quenches across a quantum multicritical point (MCP) using a quenching scheme that enables the system to hit the MCP along different paths. We show that the power-law scaling of the defect density with the rate of driving depends non-trivially on the path, i.e., the exponent varies continuously with the parameter $α$ that defines the path, up to a critical value $α= α_c$; on the other hand for $α\geq α_c$, the scaling exponent saturates to a constant value. We show that dynamically generated and {\it path($α$)-dependent} effective critical exponents associated with th…
It was recently shown that, for solving NP-complete problems, adiabatic paths always exist without finite-order perturbative crossings between local and global minima, which could lead to anticrossings with exponentially small energy gaps if present. However, it was not shown whether such a path could be found easily. Here, we give a simple construction that deterministically eliminates all such anticrossings in polynomial time, space, and energy, for any Ising models with polynomial final gap. Thus, in order for adiabatic quantum optimization to require exponential time to solve any NP-comple…
The present paper reports on results of quantum dynamics calculations for Stark-chirp rapid-adiabatic passage (SCRAP) in two-level systems with electric fields computed with the optimal control theory. The Pontryagin maximum principle is used to determine the robust optimal control fields in the presence of time-varying and spatially-inhomogeneous perturbing electric fields. The concept of a non-adiabatic correction to the Bloch vector dynamics is introduced and discussed. The existence of a non-zero geometric phase is proved for certain adiabatic paths, which correspond to the complete popula…
We propose a compact atom interferometer to measure homogeneous constant forces guiding the arms via shortcuts to adiabatic paths. For a given sensitivity, which only depends on the space-time area of the guiding paths, the cycle time can be made fast without loosing visibility. The atom is driven by spin-dependent trapping potentials moving in opposite directions, complemented by linear and time-dependent potentials that compensate the trap acceleration. Thus the arm states are adiabatic in the moving frames, and non-adiabatic in the laboratory frame. The trapping potentials may be anharmonic…
We propose a method to obtain optimal protocols for adiabatic ground-state preparation near the adiabatic limit, extending earlier ideas from [D. A. Sivak and G. E. Crooks, Phys. Rev. Lett. 108, 190602 (2012)] to quantum non-dissipative systems. The space of controllable parameters of isolated quantum many-body systems is endowed with a Riemannian quantum metric structure, which can be exploited when such systems are driven adiabatically. Here, we use this metric structure to construct optimal protocols in order to accomplish the task of adiabatic ground-state preparation in a fixed amount of …
We elucidate the geometry of quantum adiabatic evolution. By minimizing the deviation from adiabaticity we find a Riemannian metric tensor underlying adiabatic evolution. Equipped with this tensor, we identify a unified geometric description of quantum adiabatic evolution and quantum phase transitions, which generalizes previous treatments to allow for degeneracy. The same structure is relevant for applications in quantum information processing, including adiabatic and holonomic quantum computing, where geodesics over the manifold of control parameters correspond to paths which minimize errors…
We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in [E. Farhi, et al., arXiv:quant-ph/0208135]. The algorithm is applied to a random binary optimization problem (a version of the 3-Satisfiability problem) where the n-bit cost function is symmetric with respect to the permutation of individual bits. The evolution paths are produced, using the generic control Hamiltonians H(τ) that preserve the bit symmetry of the underlying optimization problem. In the case where the ground state of H(0) coincides with the totally-symmetric stat…
We argue that the non-adiabatic evolution of spin states in Stern-Gerlach apparatus can blur the manifestation of path spin entanglement. This fact introduces a contradiction to the usual perception of spin measurement even in a formally ideal situation. Through quantitative calculation, we have pointed out the specific reason behind the breakdown of adiabatic evolution to be the spatial inhomogeneity of applied magnetic field. The angle $θ$ between the $z$ component of magnetic moment of the particle and applied magnetic field is also a determining factor for the category of evolution of spin…
We demonstrate the possibility of (sub)exponential quantum speedup via a quantum algorithm that follows an adiabatic path of a gapped Hamiltonian with no sign problem. This strengthens the superpolynomial separation recently proved by Hastings. The Hamiltonian that exhibits this speed-up comes from the adjacency matrix of an undirected graph, and we can view the adiabatic evolution as an efficient $\mathcal{O}(\mathrm{poly}(n))$-time quantum algorithm for finding a specific "EXIT" vertex in the graph given the "ENTRANCE" vertex. On the other hand we show that if the graph is given via an adjac…
We find an exact expression for the current ($I$) that flows via a tagged bond from a site ("dot") whose potential ($u$) is varied in time. We show that the analysis reduces to that of calculating time dependent probabilities, as in the stochastic formulation, but with splitting (branching) ratios that are not bounded within $[0,1]$. Accordingly our result can be regarded as a multiple-path version of the continuity equation. It generalizes results that have been obtained from adiabatic transport theory in the context of quantum "pumping" and "stirring". Our approach allows to address the adia…
We decompose the quantum adiabatic evolution as the products of gauge invariant unitary operators and obtain the exact nonadiabatic correction in the adiabatic approximation. A necessary and sufficient condition that leads to adiabatic evolution with geometric phases is provided and we determine that in the adiabatic evolution, while the eigenstates are slowly varying, the eigenenergies and degeneracy of the Hamiltonian can change rapidly. We exemplify this result by the example of the adiabatic evolution driven by parametrized pulse sequences. For driving fields that are rotating slowly with …
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…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather than discrete gates. We explore an alternative approach in which slowly varying measurements are used to mimic adiabatic evolution. We show that for certain Hamiltonians, which remain frustration-free all along the adiabatic path, the necessary measurements can be implemented through the measurement of random terms from the Hamiltonian. This offers a new, a…
Quantum adiabatic evolutions find a broad range of applications in quantum physics and quantum technologies. The traditional form of the quantum adiabatic theorem limits the speed of adiabatic evolution by the minimum energy gaps of the system Hamiltonian. Here, we experimentally show using a nitrogen-vacancy center in diamond that, even in the presence of vanishing energy gaps, quantum adiabatic evolution is possible. This verifies a recently derived necessary and sufficient quantum adiabatic theorem and offers paths to overcome the conventionally assumed constraints on adiabatic methods. By …
For a spin subjected to an adiabatically changing magnetic field, the solid angle result as embodied by a rotation operator is the only path-dependent factor in the quantum evolution operator. For a charged particle, the infinite degeneracy calls for a rigorous investigation. We find that in this case, it is the product of the rotation operator and a path-ordered magnetic translation operator that enters into the evolution operator and determines the geometric phase. This result agrees with the fact that the instantaneous hamiltonian is invariant under magnetic translation as well as rotation.…
Currently, there is a growing interest in the development of a new hierarchy of methods based on the concept of seniority, which has been introduced quite recently in quantum chemistry. Despite the enormous potential of these methods, the accurate description of both dynamical and static correlation effects within a single and in-principle-exact approach remains a challenge. In this work, we propose an alternative formulation of reduced density-matrix functional theory (RDMFT) where the (one-electron reduced) density matrix is mapped onto an ab initio seniority-zero wave function. In this theo…
We propose to use a quantum adiabatic and simulated-annealing framework to compute theground state of small molecules. The initial Hamiltonian of our algorithms is taken to be themaximum commuting Hamiltonian that consists of a maximal set of commuting terms in the fullHamiltonian of molecules in the Pauli basis. We consider two variants. In the first method, weperform the adiabatic evolution on the obtained time- or path-dependent Hamiltonian with theinitial state as the ground state of the maximum commuting Hamiltonian. However, this methoddoes suffer from the usual problems of adiabatic qua…
We make use of a superconducting qubit to study the effects of noise on adiabatic geometric phases. The state of the system, an effective spin one-half particle, is adiabatically guided along a closed path in parameter space and thereby acquires a geometric phase. By introducing artificial fluctuations in the control parameters, we measure the geometric contribution to dephasing for a variety of noise powers and evolution times. Our results clearly show that only fluctuations which distort the path lead to geometric dephasing. In a direct comparison with the dynamic phase, which is path-indepe…
