In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator would be controllable, and built using existing technology. In some cases, moving away from gate-model-based implementations of quantum computing may offer a more feasible solution for particular experimental implementations. Here we consider an adiabatic quantum simulator which simulates the ground state properties of sparse Hamiltonians consisting of one- and two-local interaction terms, using sparse Hamiltonians with at most three-local interactions. Properties of such Hamiltonians can be well approximated with Hamiltonians containing only two-local terms. The register holding the simulated ground state is brought adiabatically into interaction with a probe qubit, followed by a single diabatic gate operation on the probe which then undergoes free evolution until measured. This allows one to recover e.g. the ground state energy of the Hamiltonian being simulated. Given a ground state, this scheme can be used to verify the QMA-complete problem LOCAL HAMILTONIAN, and is therefore likely more powerful than classical computing.
We use local adiabatic evolution to experimentally create and determine the ground state spin ordering of a fully-connected Ising model with up to 14 spins. Local adiabatic evolution -- in which the system evolution rate is a function of the instantaneous energy gap -- is found to maximize the ground state probability compared with other adiabatic methods while only requiring knowledge of the lowest $\sim N$ of the $2^N$ Hamiltonian eigenvalues. We also demonstrate that the ground state ordering can be experimentally identified as the most probable of all possible spin configurations, even whe…
We model the bang-bang optimization protocol as a shortcut to adiabaticity in the ground-state preparation of an ion-trap-based quantum simulator. Compared to a locally adiabatic evolution, the bang-bang protocol produces a somewhat lower ground-state probability, but its implementation is so much simpler than the locally adiabatic approach, that it remains an excellent choice to use for maximizing ground-state preparation in systems that cannot be solved with conventional computers. We describe how one can optimize the shortcut and provide specific details for how it can be implemented with c…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a Hamiltonian defining the problem to solve and a mixing Hamiltonian. The adiabatic theorem initially defined in quantum physic allows to compute a solution for the Schrödinger equation, but the foundation of this methods requires strong skill in physics and mathematics. Our main objectives in this paper are at first to provide an algorithm-based presentation (…
Controlled quantum mechanical devices provide a means of simulating more complex quantum systems exponentially faster than classical computers. Such "quantum simulators" rely heavily upon being able to prepare the ground state of Hamiltonians, whose properties can be used to calculate correlation functions or even the solution to certain classical computations. While adiabatic preparation remains the primary means of producing such ground states, here we provide a different avenue of preparation: cooling to the ground state via simulated dissipation. This is in direct analogy to contemporary e…
We propose an analog quantum simulator for the Holstein molecular-crystal model based on a superconducting circuit QED system in the dispersive regime. By varying the driving field on the superconducting resonators, one can readily access both the adiabatic and anti-adiabatic regimes of this model. Strong e-ph coupling required for small-polaron formation can also be reached. We show that small-polaron state of arbitrary quasimomentum can be generated by applying a microwave pulse to the resonators. We also show that significant squeezing in the resonator modes can be achieved in the polaron-c…
We propose a physical setup that can be used to simulate the quantum dynamics of the Ising model with present-day technology. Our scheme consists of electrons floating on superfluid helium which interact via Coulomb forces. In the limit of low temperatures, the system will stay near the ground state where its Hamiltonian is equivalent to the Ising model and thus shows phenomena such as quantum criticality. Furthermore, the proposed design could be generalized in order to study interacting field theories (e.g., $λϕ^4$) and adiabatic quantum computers.
We use a self-assembled two-dimensional Coulomb crystal of $\sim 70$ ions in the presence of an external transverse field to engineer a quantum simulator of the Dicke Hamiltonian. This Hamiltonian has spin and bosonic degrees of freedom which are encoded by two hyperfine states in each ion and the center of mass motional mode of the crystal, respectively. The Dicke model features a quantum critical point separating two distinct phases: the superradiant (ferromagnetic) and normal (paramagnetic) phases. We experimentally explore protocols that aim to adiabatically prepare the superradiant ground…
myqcs is a quantum circuit simulator using tensor. The simulator can be used with both wave functions or density matrices. The simulator also included noise that can be varied in form and that can be different for each gate.
We propose a quantum simulator based on driven superconducting qubits where the interactions are generated parametrically by a polychromatic magnetic flux modulation of a tunable bus element. Using a time-dependent Schrieffer-Wolff transformation, we analytically derive a multi-qubit Hamiltonian which features independently tunable $XX$ and $YY$-type interactions as well as local bias fields over a large parameter range. We demonstrate the adiabatic simulation of the ground state of a hydrogen molecule using two superconducting qubits and one tunable bus element. The time required to reach che…
Quantum simulation of many-body systems are one of the most interesting tasks of quantum technology. Among them is the preparation of a many-body system in its ground state when the vanishing energy gap makes the cooling mechanisms ineffective. Adiabatic theorem, as an alternative to cooling, can be exploited for driving the many-body system to its ground state. In this paper, we study two most common disorders in quantum dot arrays, namely exchange coupling fluctuations and hyperfine interaction, in adiabatically preparation of ground state in such systems. We show that the adiabatic ground s…
Classical simulation of quantum computation is vital for verifying quantum devices and assessing quantum algorithms. We present a new quantum circuit simulator developed on the Sunway TaihuLight supercomputer. Compared with other simulators, the present one is distinguished in two aspects. First, our simulator is more versatile. The simulator consists of three mutually independent parts to compute the full, partial and single amplitudes of a quantum state with different methods. It has the function of emulating the effect of noise and support more kinds of quantum operations. Second, our simul…
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.
We show that the quantum Fisher information attained in an adiabatic approach to critical quantum metrology cannot lead to the Heisenberg limit of precision and therefore regular quantum metrology under optimal settings is always superior. Furthermore, we argue that even though shortcuts to adiabaticity can arbitrarily decrease the time of preparing critical ground states, they cannot be used to achieve or overcome the Heisenberg limit for quantum parameter estimation in adiabatic critical quantum metrology. As case studies, we explore the application of counter-diabatic driving to the Landau-…
Especially sparse quantum states can be efficiently encoded with simple classical data structures. We show the admissibility of using a classical database to encode quantum states for a few practical examples and argue in favor of further optimizations for quantum simulation targeting simpler, only 'semi-quantum' circuits.
Quantum computing is a radical new paradigm for a technology that is capable to revolutionize information processing. Simulators of universal quantum computer are important for understanding the basic principles and operations of the current noisy intermediate-scale quantum (NISQ) processors, and for building in future fault-tolerant quantum computers. In this work, we present simulation of universal quantum computers by introducing Psitrum -- a universal gate-model quantum computer simulator implemented on classical hardware. The simulator allows to emulate and debug quantum algorithms in for…
We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of $L$ gates we can construct a quantum adiabatic algorithm with time complexity of $O(L)$. Additionally, our construction shows that one may exponentially speed up some quantum adiabatic algorithms by properly choosing an evolution path.
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 …
A major challenge facing adiabatic quantum computing is that algorithm design and error correction can be difficult for adiabatic quantum computing. Recent work has considered addressing his challenge by using coherently controlled adiabatic evolutions in the place of classically controlled evolution. An important question remains: what is the relative power of controlled adiabatic evolution to traditional adiabatic evolutions? We address this by showing that coherent control and measurement provides a way to average different adiabatic evolutions in ways that cause their diabatic errors to ca…
With quantum computers being out of reach for now, quantum simulators are the alternative devices for efficient and more exact simulation of problems that are challenging on conventional computers. Quantum simulators are classified into analog and digital, with the possibility of constructing "hybrid" simulators by combining both techniques. In this paper, we focus on analog quantum simulators of open quantum systems and address the limit that they can beat classical computers. In particular, as an example, we discuss simulation of the chlorosome light-harvesting antenna from green sulfur bact…
Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. A practicable necessary condition well-suited for many-body systems has been proven recently in [Phys. Rev. Lett. 119, 200401 (2017)]. Here we tailor this condition for estimating run times of quantum adiabatic algorithms. As an illustration, the condition is applied to the adiabatic algorithm for searching in an unstructured database (adiabatic Grover search algorithm). We find that thus obtained lower bound …
The unitary operator corresponding to the classical canonical transformation that connects a general closed system to an open system under adiabatic conditions is found. The quantum invariant operator of the adiabatic open system is derived from the unitary transformation of the quantum Hamiltonian of the closed system. On the basis of these results, we investigate the evolution of the general quantum adiabatic system and construct a revised adiabatic theorem. The adiabatic theorem developed here exactly reduces to the well-known Berry adiabatic theorem when the control parameter
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 …
One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physics to material science. Traditionally, in an analog sense, adiabatic evolution has been proposed to slowly evolve a simple Hamiltonian, initialized in its ground state, to the Hamiltonian of interest such that the final state becomes the desired ground state. Recently, variational methods have also been proposed and realized in quantum simulators for emulating the ground state of many-body systems. Here, we …
Shortcuts to adiabaticity are well-known methods for controlling the quantum dynamics beyond the adiabatic criteria, where counter-diabatic (CD) driving provides a promising means to speed up quantum many-body systems. In this work, we show the applicability of CD driving to enhance the digitized adiabatic quantum computing paradigm in terms of fidelity and total simulation time. We study the state evolution of an Ising spin chain using the digitized version of the standard CD driving and its variants derived from the variational approach. We apply this technique in the preparation of Bell and…
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…
Quantum adiabatic transfer is widely used in quantum computation and quantum simulation. However, the transfer speed is limited by the quantum adiabatic approximation condition, which hinders its application in quantum systems with a short decoherence time. Here we demonstrate quantum adiabatic state transfers that jump along geodesics in one-qubit and two-qubit superconducting transmons. This approach possesses the advantages of speed, robustness, and high fidelity compared with the usual adiabatic process. Our protocol provides feasible strategies for improving state manipulation and gate op…
Quantum simulator with the ability to harness the dynamics of complex quantum systems has emerged as a promising platform for probing exotic topological phases. Since the flexibility offered by various controllable quantum systems has enabled to gain insight into quantum simulation of such complicated problems, analog quantum simulator has recently shown its feasibility to tackle problems of exploring topological phases. However, digital quantum simulation and detection of topological phases still remain elusive. Here, we develop and experimentally realize the digital quantum simulation of top…
A simple proof of quantum adiabatic theorem is provided. Quantum adiabatic approximation is divided into two kinds. For Hamiltonian H(t/T), a relation between the size of the error caused by quantum adiabatic approximation and the parameter T is given.
Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Simulated annealing is a computational technique which explores the configuration space by mimicking thermal noise. By slow cooling, it freezes the system in a low-energy configuration, but the algorithm often gets stuck in local minima. In quantum annealing, the thermal noise is replaced by controllable quantum fluctuations, and the technique can be implemented in modern quantum simulators. However, quantum-adiabatic schemes become prohibitively slow i…
Adiabaticity of quantum evolution is important in many settings. One example is the adiabatic quantum computation. Nevertheless, up to now, there is no effective method to test the adiabaticity of the evolution when the eigenenergies of the driven Hamiltonian are not known. We propose a simple method to check adiabaticity of a quantum process for an arbitrary quantum system. We further propose a operational method for finding a uniformly adiabatic quench scheme based on Kibble-Zurek mechanism for the case when the initial and the final Hamiltonians are given. This method should help in impleme…
An alternative interpretation of the quantum adiabatic approximation is presented. This interpretation is based on the ideas originally advocated by David Bohm in his quest for establishing a hidden variable alternative to quantum mechanics. It indicates that the validity of the quantum adiabatic approximation is a sufficient condition for the separability of the quantum action function in the time variable. The implications of this interpretation for Berry's adiabatic phase and its semi-classical limit are also discussed.
Analog quantum simulation is expected to be a significant application of near-term quantum devices. Verification of these devices without comparison to known simulation results will be an important task as the system size grows beyond the regime that can be simulated classically. We introduce a set of experimentally-motivated verification protocols for analog quantum simulators, discussing their sensitivity to a variety of error sources and their scalability to larger system sizes. We demonstrate these protocols experimentally using a two-qubit trapped-ion analog quantum simulator and numerica…
Quantum simulators are devices that actively use quantum effects to answer questions about model systems and, through them, real systems. Here we expand on this definition by answering several fundamental questions about the nature and use of quantum simulators. Our answers address two important areas. First, the difference between an operation termed simulation and another termed computation. This distinction is related to the purpose of an operation, as well as our confidence in and expectation of its accuracy. Second, the threshold between quantum and classical simulations. Throughout, we p…
A non-adiabatic nuclear wavepacket dynamics simulation of the H$_2$O$^+$ de-excitation process is performed based on electronic structure calculations using the variational quantum eigensolver. The adiabatic potential energy surfaces and non-adiabatic coupling vectors are computed with algorithms for noisy intermediate-scale quantum devices, and time propagation is simulated with conventional methods for classical computers. The results of non-adiabatic transition dynamics from the $\tilde{B}$ state to $\tilde{A}$ state reproduce the trend reported in previous studies, which suggests that this…
Let L be a language decided by a constant-round quantum Arthur-Merlin (QAM) protocol with negligible soundness error and all but possibly the last message being classical. We prove that if this protocol is zero knowledge with a black-box, quantum simulator S, then L in BQP. Our result also applies to any language having a three-round quantum interactive proof (QIP), with all but possibly the last message being classical, with negligible soundness error and a black-box quantum simulator. These results in particular make it unlikely that certain protocols can be composed in parallel in order to …
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.
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.
A Quantum Computer is a new type of computer which can efficiently solve complex problems such as prime factorization. A quantum computer threatens the security of public key encryption systems because these systems rely on the fact that prime factorization is computationally difficult. Errors limit the effectiveness of quantum computers. Because of the exponential nature of quantum com puters, simulating the effect of errors on them requires a vast amount of processing and memory resources. In this paper we describe a parallel simulator which accesses the feasibility of quantum computers. We …
Due to the experimental time constraints of state of the art quantum simulations with trapped ions, the direct preparation of the ground state by adiabatically ramping the field of a transverse field Ising model becomes more and more difficult as the number of particles increase. We propose a spectroscopy protocol that intentionally creates excitations through diabatic ramping of the transverse field and measures a low-noise observable as a function of time for a constant field to reveal the structure of the coherent dynamics of the resulting many-body states. To simulate the experimental data…
As the first useful Quantum Computers will be quantum simulators, here the minimum number of qubits necessary for the solution of the Schroedinger equation in simple test problems is evaluated. From the present preliminary results it appears that it is possible to realize a useful quantum simulator with a register of only 10-15 qbits. The intrinsic sensitivity to some errors appears to be moderate without the need of error correcting methods. At present there is at least some indication that the amplitude errors are more dangerous than phase and decoherence errors. So corrections limited to am…
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.
In this paper, we will introduce the quantum circuit simulator we developed in C++ environment. We devise a novel method for efficient memory handling using linked list structures that enables us to simulate a quantum circuit of up to 20 qubits in a reasonable time. Our package can simulate the activity of any quantum circuit constructed by the user; it will also be used to understand the robustness of certain quantum algorithms such as Simons and Shors.
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.
We show theoretically how a driven harmonic oscillator can be used as a quantum simulator for non-Markovian damped harmonic oscillator. In the general framework, the results demonstrate the possibility to use a closed system as a simulator for open quantum systems. The quantum simulator is based on sets of controlled drives of the closed harmonic oscillator with appropriately tailored electric field pulses. The non-Markovian dynamics of the damped harmonic oscillator is obtained by using the information about the spectral density of the open system when averaging over the drives of the closed …
Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work proposes to execute some quantum learning protocols based entirely on adiabatic quantum evolution, hence dubbed as ``adiabatic quantum learning". In a conventional quantum machine learning protocol, the output is usually the expectation value of a pre-selected observable and the projective measurement of which forces a quantum circuit to run many times to obtain t…
Recently, some quantum algorithms have been implemented by quantum adiabatic evolutions. In this paper, we discuss the accurate relation between the running time and the distance of the initial state and the final state of a kind of quantum adiabatic evolutions. We show that this relation can be generalized to the case of mixed states.
We present a new adiabatic quantum algorithm for searching over structured databases. The new algorithm is optimized using a simplified complexity analysis.
Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [Phys. Rev. A 65, 062310 (2002)]. This adiabatic algorithm gives rise to a quadratic speed up over classical algorithms. We show that a modified version of the adiabatic evolution in that paper can improve the performance to constant time.
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…
