Related papers: Quantum Adiabatic Evolution Algorithm and Quantum …
Transient chaos is an ubiquitous phenomenon characterizing the dynamics of phase space trajectories evolving towards a steady state attractor in physical systems as diverse as fluids, chemical reactions and condensed matter systems. Here we…
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average…
We study EC3, a variant of Exact Cover which is equivalent to Positive 1-in-3 SAT. Random instances of EC3 were recently used as benchmarks for simulations of an adiabatic quantum algorithm. Empirical results suggest that EC3 has a phase…
Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the…
In a time-orbiting-potential magnetic trap the neutral atoms are confined by means of an inhomogeneous magnetic field superimposed to an uniform rotating one. We perform an analytic study of the atomic motion by taking into account the…
Quantum computation has demonstrated advantages over classical computation for special hard problems, where a set of universal quantum gates is essential. Geometric phases, which have built-in resilience to local noise, have been used to…
We introduce an adiabatic long-range quantum communication proposal based on a quantum dot array. By adiabatically varying the external gate voltage applied on the system, the quantum information encoded in the electron can be transported…
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The…
We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is…
Here we investigate analogy between quantum signal processing (QSP) and the adiabatic-impulse model (AIM) in order to implement the QSP algorithm with fast quantum logic gates. QSP is an algorithm that uses single-qubit dynamics to perform…
By stating the adiabatic theorem of quantum mechanics in a clear and rigorous way, we establish a necessary condition and a sufficient condition for its validity, where the latter is obtained employing our recently developed adiabatic…
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.…
We numerically study quantum adiabatic algorithm for the propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows…
Adiabatic quantum gate implementation generally takes longer time, which is disadvantageous in view of decoherence. In this report we implement several essential one-qubit quantum gates nonadiabatically by making use of a dynamical…
It is well known that the dynamics of a quantum system is always non-adiabatic in passage through a quantum critical point and the defect density in the final state following a quench shows a power-law scaling with the rate of quenching.…
Phase transition is an important feature of SAT problem. For random k-SAT model, it is proved that as r (ratio of clauses to variables) increases, the structure of solutions will undergo a sudden change like satisfiability phase transition…
We propose a circuit-model quantum algorithm for eigenpath traversal that is based on a combination of concepts from Grover's search and adiabatic quantum computation. Our algorithm deploys a sequence of reflections determined from…
The adiabatic theorem of quantum mechanics states that the error between an instantaneous eigenstate of a time-dependent Hamiltonian and the state given by quantum evolution of duration $\tau$ is upper bounded by $C/\tau$ for some positive…
We analyze the optical selection rules of the microwave-assisted transitions in a flux qubit superconducting quantum circuit (SQC). We show that the parities of the states relevant to the superconducting phase in the SQC are well-defined…
Here we study the NP-complete $K$-SAT problem. Although the worst-case complexity of NP-complete problems is conjectured to be exponential, there exist parametrized random ensembles of problems where solutions can typically be found in…