Irreconcilable difference between quantum walks and adiabatic quantum computing
نویسندگان
چکیده
منابع مشابه
Adiabatic Quantum Computing: An Overview
Quantum computations can be implemented not only by the action of quantum circuits, but by the adiabatic evolution of a system’s Hamiltonian. This can be done by initializing the system into the ground state of a simple Hamiltonian, and then adiabatically evolving the Hamiltonian to one whose ground state encodes the solution to the problem. The time complexity of the problem, or more basically...
متن کاملGraph isomorphism and adiabatic quantum computing
In the Graph Isomorphism (GI) problem two N -vertex graphs G and G′ are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G → G′. If yes, then G and G′ are said to be isomorphic; otherwise they are non-isomorphic. The GI problem is an important problem in computer science and is thought to be of comparable difficul...
متن کاملRamsey numbers and adiabatic quantum computing.
The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers R(m,n) with m, n≥3, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers R(m,n). We show how the computation of R(m,n) can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evol...
متن کاملUniversal quantum walks and adiabatic algorithms by 1D Hamiltonians
We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation. Hamiltonians in this family can achieve universality either by driving a continuous-time quantum walk or by terminating an adiabatic algorithm. In either case, the universality property can be understood as arising from an efficient simula...
متن کاملApplication of quantum walks on graph structures to quantum computing
Quantum computation is a new computational paradigm which can provide fundamentally faster computation than in the classical regime. This is dependent on finding efficient quantum algorithms for problems of practical interest. One of the most successful tools in developing new quantum algorithms is the quantum walk. In this thesis, we explore two applications of the discrete time quantum walk. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2016
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.93.062313