We extend the work of Hen for the Bernstein-Vazirani problem and Simon's problem on an adiabatic quantum computer. Our results are based on the Ising objective function for quantum annealing. For each problem we determine its objective function, describe its Hamiltonian matrix, and show the Hamiltonian matrix for a small problem. Following the pattern of Hen, we discuss factoring of integers, particularly Shor's factoring algorithm in an adiabatic quantum computing environment.
A method for high-fidelity coherent adiabatic transport in a zig-zag tight-binding chain, based on application of two external periodic driving fields, is theoretically proposed. The method turns out to be robust against imperfections and disorder of the static lattice Hamiltonian, is tolerant to next-nearest neighborhood interactions, and enables coherent transport in long chains without the need for a local control and timing of the trapping potential.
We present a general method to calculate the quasi-stationary state of a driven-dissipative system coupled to a transmission line (and more generally, to a reservoir) under periodic modulation of its parameters. Using Floquet's theorem, we formulate the differential equation for the system's density operator which has to be solved for a single period of modulation. On this basis we also provide systematic expansions in both the adiabatic and high-frequency regime. Applying our method to three different systems -- two- and three-level models as well as the driven nonlinear cavity -- we propose …
We outline an efficient quantum-adiabatic algorithm that solves Simon's problem, in which one has to determine the `period', or xor-mask, of a given black-box function. We show that the proposed algorithm is exponentially faster than its classical counterpart and has the same complexity as the corresponding circuit-based algorithm. Together with other related studies, this result supports a conjecture that the complexity of adiabatic quantum computation is equivalent to the circuit-based computational model in a stronger sense than the well-known, proven polynomial equivalence between the two …
We discuss applications of shortcuts to adiabaticity (STA) to adiabatic quantum computation. After reviewing the fundamental properties and the present status of STA from the author's personal point of view, we apply the method to the adiabatic algorithm of the Grover's problem. We discuss two possible implementations of STA for the adiabatic quantum computations: the method of quantum adiabatic brachistochrone and the Lewis-Riesenfeld invariant-based inverse engineering.
It is shown that efficient and robust universal quantum computation is possible using the stimulated Raman adiabatic passage with a qubit chain as a pointer register.
We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation.
For a T-periodic non-Hermitian Hamiltonian H(t), we construct a class of adiabatic cyclic states of period T which are not eigenstates of the initial Hamiltonian H(0). We show that the corresponding adiabatic geometric phase angles are real and discuss their relationship with the conventional complex adiabatic geometric phase angles. We present a detailed calculation of the new adiabatic cyclic states and their geometric phases for a non-Hermitian analog of the spin 1/2 particle in a precessing magnetic field.
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a resource is discussed.
We introduce high-order dynamical decoupling strategies for open system adiabatic quantum computation. Our numerical results demonstrate that a judicious choice of high-order dynamical decoupling method, in conjunction with an encoding which allows computation to proceed alongside decoupling, can dramatically enhance the fidelity of adiabatic quantum computation in spite of decoherence.
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm.
We prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The amount of time needed is evaluated by computing the gap. We show that the procedure is computationally efficient.
The parametric deformations of quasienergies and eigenvectors of unitary operators are applied to the design of quantum adiabatic algorithms. The conventional, standard adiabatic quantum computation proceeds along eigenenergies of parameter-dependent Hamiltonians. By contrast, discrete adiabatic computation utilizes adiabatic passage along the quasienergies of parameter-dependent unitary operators. For example, such computation can be realized by a concatenation of parameterized quantum circuits, with an adiabatic though inevitably discrete change of the parameter. A design principle of adiaba…
We propose a non-adiabatic scheme for geometric quantum computation with trapped ions. By making use of the Aharonov-Anandan phase, the proposed scheme not only preserves the globally geometric nature in quantum computation, but also provides the advantage of non-adiabaticity that overcomes the problem of slow evolution in the existing adiabatic schemes. Moreover, the present scheme requires only two atomic levels in each ion, making it an appealing candidate for quantum computation.
Adiabatic quantum computation, based on the adiabatic theorem, is a promising alternative to conventional quantum computation. The validity of an adiabatic algorithm depends on the existence of a nonzero energy gap between the ground and excited states. However, it is difficult to ascertain the exact value of the energy gap. In this paper, we put forward a theorem on the existence of nonzero energy gap for the Hamiltonians used in adiabatic quantum computation. It can help to effectively identify a large class of the Hamiltonians without energy-level crossing between the ground and excited sta…
For a finite XY chain and a finite two-dimensional Ising lattice, it is shown that the paramagnetic ground state is adiabatically transformed to the GHZ state in the ferromagnetic phase by slowly turning on the magnetic field. The fidelity between the GHZ state and an adiabatically evolved state shows a feature of the quantum phase transition.
We develop a non-adiabatic generalization of holonomic quantum computation in which high-speed universal quantum gates can be realized by using non-Abelian geometric phases. We show how a set of non-adiabatic holonomic one- and two-qubit gates can be implemented by utilizing optical transitions in a generic three-level $Λ$ configuration. Our scheme opens up for universal holonomic quantum computation on qubits characterized by short coherence times.
Adiabatic quantum computation for performing quantum computations such as Shor's algorithm is protected against thermal errors by an energy gap of size $O(1/n)$, where $n$ is the length of the computation to be performed.
I show how to protect adiabatic quantum computation (AQC) against decoherence and certain control errors, using a hybrid methodology involving dynamical decoupling, subsystem and stabilizer codes, and energy gaps. Corresponding error bounds are derived. As an example I show how to perform decoherence-protected AQC against local noise using at most two-body interactions.
Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum computation in decoherence-free subspaces have been proposed in the past few years. However, non-adiabatic holonomic quantum computation in decoherence-free subspaces, which avoids long run-time requirement but with all the robust advantages, remains an open problem. Here, we demonstrate how to realize non-adiabatic holonomic quantum computation in decoherence-free…
We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.
We show that it is possible to use a classical computer to efficiently simulate the adiabatic evolution of a quantum system in one dimension with a constant spectral gap, starting the adiabatic evolution from a known initial product state. The proof relies on a recently proven area law for such systems, implying the existence of a good matrix product representation of the ground state, combined with an appropriate algorithm to update the matrix product state as the Hamiltonian is changed. This implies that adiabatic evolution with such Hamiltonians is not useful for universal quantum computati…
The proposal of the optical scheme for holonomic quantum computation is evaluated based on dynamical resolution to the system beyond adiabatic limitation. The time-dependent Schrödinger equation is exactly solved by virtue of the cranking representation and gauge transformation approach. Besides providing rigorous confirmation to holonomies of the geometrical prediction that holds for the ideally adiabatic situation, the dynamical resolution enables one to evaluate elaborately the amplitude of the nonadiabatic deviation, so that the errors induced to the quantum computation can be explicitly e…
The parametric dependence of a quantum map under the influence of a rank-1 perturbation is investigated. While the Floquet operator of the map and its spectrum have a common period with respect to the perturbation strength $λ$, we show an example in which none of the quasienergies nor the eigenvectors obey the same period: After a periodic increment of $λ$, the quasienergy arrives at the nearest higher one, instead of the initial one, exhibiting an anholonomy, which governs another anholonomy of the eigenvectors. An application to quantum state manipulations is outlined.
Recent experiments show the existence of collective decoherence in quantum systems. We study the possibility of quantum computation in decoherence free subspace which is robust against such kind of decoherence processes. This passive protection protocol can be especially advantageous for continuous quantum computation such as quantum annealers. As an example we propose to use decoherence protected adiabatic quantum computation for the Grover search problem. Our proposal contains only two-body interactions, making it feasible in near-term quantum devices.
According to the quantum adiabatic theorem, we can in principle obtain a true vacuum of a quantum system starting from a trivial vacuum of a simple Hamiltonian. In actual adiabatic digital quantum simulation with finite time length and non-infinitesimal time steps, we can only obtain an approximate vacuum that is supposed to be a superposition of a true vacuum and excited states. We propose a procedure to improve the approximate vacuum.
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 examine the validity of the rotating wave approximation (RWA) in non-adiabatic holonomic single-qubit gates [New J. Phys. {\bf 14}, 103035 (2012)]. We demonstrate that the adoption of RWA may lead to a sharp decline in fidelity for rapid gate implementation and small energy separation between the excited and computational states. The validity of the RWA in the recent experimental realization [Nature (London) {\bf 496}, 482 (2013)] of non-adiabatic holonomic quantum computation for a superconducting qubit is examined.
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…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on the corresponding ground state. The minimum energy gap which governs the time required for a successful evolution is shown to be proportional to the overlap of the ground states of the initial and final Hamiltonians. We show that such evolutions exhibit a rapid crossover as the ground state changes abruptly near the transition point where the energy gap is m…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H(λ)$ that is based on ground state quantum computation [1]. We treat both a 1-dimensional configuration in which qubits on a line undergo nearest neighbor 2-qubit gates and an all-to-all configuration in which every qubit undergoes 2-qubit gates with every other qubit in the system.
We show enough evidence that a structured version of Adiabatic Quantum Computation (AQC) is efficient for most satisfiability problems. More precisely, when the success probability is fixed beforehand, the computational resources grow subexponentially in the number of qubits. Our study focuses on random satisfiability and exact cover problems, developing a multi-step algorithm that solves clauses one by one. Relating the computational cost to classical properties of the problem, we collect significant statistics with up to N=140 qubits, around the phase transitions, which is where the hardest …
Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian, $H_{\rm p}$, is normally chosen to be diagonal in the computational basis, that is a product basis for qubits. We point out that $H_{\rm p}$ can be chosen to be non-diagonal in the computational basis. To be more precise, we show how to construct $H_{\rm p}$ in such a way that all its excited states are entangled with respect to the qubit tensor product structure, while the ground state is still of the product form and …
An explicit algorithm for the travelling salesman problem is constructed in the framework of adiabatic quantum computation, AQC. The initial Hamiltonian for the AQC process admits canonical coherent states as the ground state, and the target Hamiltonian has the shortest tour as the desirable ground state. Some estimates/bounds are also given for the computational complexity of the algorithm with particular emphasis on the required energy resources, besides the space and time complexity, for the physical process of (quantum) computation in general.
We indicate that there are points to keep in mind in utilizing quantum states prepared by the adiabatic quantum computation. Even if an instantaneous expectation value of a physical quantity for the adiabatically prepared quantum state is close to an expectation value for the true vacuum, this does not assure us that the prepared vacuum is close to the true vacuum. In general time average of the expectation value tend to systematically differ from the true value. Using a simple model we discuss how to diminish this systematic difference.
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which implies that the adiabatic computation model and the conventional quantum computation model are polynomially equivalent. Our result can be extended to the physically realistic setting of particles arranged on a two-dimensional grid with nearest neighbor interactions. The equivalence between the models provides a new vantage point from which to tackle the centra…
A cluster state cannot be a unique ground state of a two-body interacting Hamiltonian. Here, we propose the creation of a cluster state of logical qubits encoded in spin-1/2 particles by adiabatically weakening two-body interactions. The proposal is valid for any spatial dimensional cluster states. Errors induced by thermal fluctuations and adiabatic evolution within finite time can be eliminated ensuring fault-tolerant quantum computing schemes.
We propose a simple feedback-control scheme for adiabatic quantum computation with superconducting flux qubits. The proposed method makes use of existing on-chip hardware to monitor the ground-state curvature, which is then used to control the computation speed to maximize the success probability. We show that this scheme can provide a polynomial speed-up in performance and that it is possible to choose a suitable set of feedback-control parameters for an arbitrary problem Hamiltonian.
Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large entangled state. In contrast in HQC the system starts in the ground subspace of a Hamiltonian which is slowly changed such that a transformation occurs within the subspace. Following the approach of Bacon and Flammia, we show that any measurement-based quantum computation on a graph state with \emph{gflow} can be converted into an adiabatically driven holonomic comp…
We examine the adiabatic dynamics of a quantum system coupled to a noisy classical control field. A stochastic phase shift is shown to arise in the off-diagonal elements of the system's density matrix which can cause decoherence. We derive the condition for onset of decoherence, and identify the noise properties that drive decoherence. We show how this decoherence mechansim causes: (1) a dephasing of the observable consequences of the adiabatic geometric phase; and (2) the loss of computational efficiency of the Shor algorithm when run on a sufficiently noisy geometric quantum computer.
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a function of the energy involved in the computation. Energy, and not just time and space, must thus be considered in the evaluation of algorithm complexity, in perfect accordance with the understanding that all computation is physical. We then propose, with oracular Hamiltonians, new quantum adiabatic algorithms of which not only the lower bound in time but also t…
In previous implementations of adiabatic quantum algorithms using spin systems, the average Hamiltonian method with Trotter's formula was conventionally adopted to generate an effective instantaneous Hamiltonian that simulates an adiabatic passage. However, this approach had issues with the precision of the effective Hamiltonian and with the adiabaticity of the evolution. In order to address these, we here propose and experimentally demonstrate a novel scheme for adiabatic quantum computation by using the intrinsic Hamiltonian of a realistic spin system to represent the problem Hamiltonian whi…
Recently, there has been growing interest in using adiabatic quantum computation as an architecture for experimentally realizable quantum computers. One of the reasons for this is the idea that the energy gap should provide some inherent resistance to noise. It is now known that universal quantum computation can be achieved adiabatically using 2-local Hamiltonians. The energy gap in these Hamiltonians scales as an inverse polynomial in the problem size. Here we present stabilizer codes which can be used to produce a constant energy gap against 1-local and 2-local noise. The corresponding fault…
In this work, we introduce a new family of [[6k, 2k, 2]] codes designed specifically to be compatible with adiabatic quantum computation. These codes support computationally universal sets of weight-two logical operators and are particularly well-suited for implementing dynamical decoupling error suppression. For Hamiltonians embeddable on a planar graph of fixed degree, our encoding maintains a planar connectivity graph and increase the graph degree by only two. These codes are the first known to possess these features.
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. By far, there is no experimental realization of adiabatic quantum computation on a single solid spin system under ambient conditions, which has been proved to be a compatible candidate for scalable quantum computation. In this letter, we report on the first experimental realization of an adiab…
The success of adiabatic quantum computation (AQC) depends crucially on the ability to maintain the quantum computer in the ground state of the evolution Hamiltonian. The computation process has to be sufficiently slow as restricted by the minimal energy gap. However, at finite temperatures, it might need to be fast enough to avoid thermal excitations. The question is, how fast does it need to be? The structure of evolution Hamiltonians for AQC is generally too complicated for answering this question. Here we model an adiabatic quantum computer as a (parametrically driven) harmonic oscillator.…
Since quantum computers are known to break the vast majority of currently-used cryptographic protocols, a variety of new protocols are being developed that are conjectured, but not proven to be safe against quantum attacks. Among the most promising is lattice-based cryptography, where security relies upon problems like the shortest vector problem. We analyse the potential of adiabatic quantum computation for attacks on lattice-based cryptography, and give numerical evidence that even outside the adiabatic regime such methods can facilitate the solution of the shortest vector and similar proble…
Non-adiabatic holonomic quantum computation in decoherence-free subspaces protects quantum information from control imprecisions and decoherence. For the non-collective decoherence that each qubit has its own bath, we show the implementations of two non-commutable holonomic single-qubit gates and one holonomic nontrivial two-qubit gate that compose a universal set of non-adiabatic holonomic quantum gates in decoherence-free-subspaces of the decoupling group, with an encoding rate of $\frac{N-2}{N}$. The proposed scheme is robust against control imprecisions and the non-collective decoherence, …
One of the difficulties in adiabatic quantum computation is the limit on the computation time. Here we propose two schemes to speed-up the adiabatic evolution. To apply this controlled adiabatic evolution to adiabatic quantum computation, we design one of the schemes without any prior knowledge of the instantaneous eigenstates of the final Hamiltonian. Whereas in another scheme, the control is constructed with the instantaneous eigenstate that is the target state of the control. As an illustration, we study a two-level system driven by a time-dependent magnetic field under the control. The phy…
Universal speeded-up adiabatic geometric quantum computation~(SAGQC) is studied in $Λ$-type three-level system with different coupling cases, i.e., time-dependent detuning, large detuning and one-photon resonance couplings, respectively. In these cases, the counterdiabatic driving method is used to speed up the universal quantum computation. These schemes in $Λ$-type three-level system are feasible in experiment because additional unaccessible ground-state-coupling is not needed. Only the shapes and phases of the initial adiabatic classical-field pulse are modified with the aid of effective tw…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single non-degenerate ground state protected from decohering noise by an energy gap that we argue is system-size-independent. Closely analogous to a traditional electric circuit, it substantially changes the requirements for quantum computer construction, easing measurement, timing, and heating problems. Using the standard adiabatic condition, we present evidence that this desi…
The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased s…
The high-speed implementation and robustness against of non-adiabatic holonomic quantum computation provide a new idea for overcoming the difficulty of quantum system interacting with the environment easily decoherence, which realizing large-scale quantum computer construction. Here, we show that a high-fidelity quantum gates to implement non-adiabatic holonomic quantum computation under solid-state spin in Nitrogen-Vacancy(NV) centers, providing an extensible experimental platform that has the potential for room-temperature quantum computing, which has increased attention recent years. Compar…
Geometric phases are an interesting resource for quantum computation, also in view of their robustness against decoherence effects. We study here the effects of the environment on a class of one-qubit holonomic gates that have been recently shown to be characterized by "optimal" working times. We numerically analyze the behavior of these optimal points and focus on their robustness against noise.
The problem of factorising positive integer $N$ into two integer factors $x$ and $y$ is first reformulated as an optimisation problem over the positive integer domain of either of the Diophantine polynomials $Q_N(x,y)=N^2(N-xy)^2 + x(x-y)^2$ or $R_N(x,y) = N^2(N-xy)^2 + (x-y)^2 + x$, of each of which the optimal solution is unique with $x\le \sqrt{N} \le y$, and $x=1$ if and only if $N$ is prime. An algorithm in the context of Adiabatic Quantum Computation is then proposed for the general factorisation problem.
In [Phys. Rev. Lett. 95, 080502 (2005)], Zheng proposed a scheme for implementing a conditional phase shift via adiabatic passages. The author claims that the gate is "neither of dynamical nor geometric origin" on the grounds that the Hamiltonian does not follow a cyclic change. He further argues that "in comparison with the adiabatic geometric gates, the nontrivial cyclic loop is unnecessary, and thus the errors in obtaining the required solid angle are avoided, which makes this new kind of phase gates superior to the geometric gates." In this Comment, we point out that geometric operations, …
Quantum computers with Kerr-nonlinear parametric oscillators (KPOs) have recently been proposed by the author and others. Quantum computation using KPOs is based on quantum adiabatic bifurcations of the KPOs, which lead to quantum superpositions of coherent states, such as Schrodinger cat states. Therefore, these quantum computers are referred to as "quantum bifurcation machines (QbMs)." QbMs can be used for qauntum adiabatic optimization and universal quantum computation. Superconducting circuits with Josephson junctions, Josephson parametric oscillators (JPOs) in particular, are promising fo…
Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance continuous-time quantum walk algorithms as well as adiabatic quantum algorithms. Unfortunately, very little is known today on the behavior of these Hamiltonian algorithms in the presence of noise. Here, we perform a fully analytical study of the resistance to noise of these algorithms using perturbation theory combined with a theoretical noise model based on random matrices drawn from the Gaussian O…
