Related papers: Exact Equivalence between Quantum Adiabatic Algori…
Quantum algorithms have the potential to provide exponential speedups over some of the best known classical algorithms. These speedups may enable quantum devices to solve currently intractable problems such as those in the fields of…
Fast and robust quantum gates is the cornerstone of fault-tolerance quantum computation. In this paper, we propose to achieve quantum gates based on non-cyclic geometric evolution. Dynamical phase during the evolution is cancelled by…
The challenge in building high-fidelity quantum gates lies in overcoming control errors and decoherence effects caused by the coupling between the quantum system and the external environment. Nonadiabatic holonomic quantum computation uses…
Recently, nonadiabatic geometric quantum computation has been received much attention, due to its fast manipulation and intrinsic error-resilience characteristics. However, to obtain universal geometric quantum control, only limited and…
We propose an alternative scheme of shortcuts to quantum phase gate in a much shorter time based on the approach of Lewis-Riesenfeld invariants in cavity quantum electronic dynamics (QED) systems. This scheme can be used to perform…
The process of translating a quantum algorithm into a form suitable for implementation on a quantum computing platform is crucial but yet challenging. This entails specifying quantum operations with precision, a typically intricate task. In…
We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the first approach, we combine the evolutionary algorithm with an…
In this paper we show that the performance of the quantum adiabatic algorithm is determined by phase transitions in underlying problem in the presence of transverse magnetic field $\Gamma$. We show that the quantum version of random…
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…
Implementation of quantum logical gates for multilevel system is demonstrated through decoherence control under the quantum adiabatic method using simple phase modulated laser pulses. We make use of selective population inversion and…
Adiabatic quantum computing~(AQC) is based on the adiabatic principle, where a quantum system remains in an instantaneous eigenstate of the driving Hamiltonian. The final state of the Hamiltonian encodes solution to the problem of interest.…
We demonstrate that with an optimally tuned scheduling function, adiabatic quantum computing (AQC) can readily solve a quantum linear system problem (QLSP) with $\mathcal{O}(\kappa~\text{poly}(\log(\kappa/\epsilon)))$ runtime, where…
Conditional geometric phase shift gate, which is fault tolerate to certain errors due to its geometric property, is made by NMR technique recently under adiabatic condition. By the adiabatic requirement, the result is inexact unless the…
We show that in a quantum adiabatic evolution, even though the adiabatic approximation is valid, the total phase of the final state indicated by the adiabatic theorem may evidently differ from the actual total phase. This invalidates the…
Adiabatic quantum algorithms represent a promising approach to universal quantum computation. Whilst in a closed system these algorithms are limited by avoided level crossings, where the gap becomes exponentially small in the system size,…
Quantum amplitude amplification and quantum phase estimation are two fundamental quantum algorithms. All known quantum algorithms are derived from these two algorithms. Even the adiabatic quantum algorithms can also be efficiently simulated…
Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…
We formulate a time-optimal approach to adiabatic quantum computation (AQC). A corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control…
Learning low dimensional representation is a crucial issue for many machine learning tasks such as pattern recognition and image retrieval. In this article, we present a quantum algorithm and a quantum circuit to efficiently perform…
Nonadiabatic geometric quantum computation is dedicated to the realization of high-fidelity and robust quantum gates, which are necessary for fault-tolerant quantum computation. However, it is limited by cyclic and mutative evolution path,…