35 research outputs found
Quantum Annealing - Foundations and Frontiers
We briefly review various computational methods for the solution of
optimization problems. First, several classical methods such as Metropolis
algorithm and simulated annealing are discussed. We continue with a description
of quantum methods, namely adiabatic quantum computation and quantum annealing.
Next, the new D-Wave computer and the recent progress in the field claimed by
the D-Wave group are discussed. We present a set of criteria which could help
in testing the quantum features of these computers. We conclude with a list of
considerations with regard to future research.Comment: 22 pages, 6 figures. EPJ-ST Discussion and Debate Issue: Quantum
Annealing: The fastest route to large scale quantum computation?, Eds. A.
Das, S. Suzuki (2014
Communication Complexity Protocol for Q-trits
Consider a function where its entries are distributed among many parties.
Suppose each party is allowed to transmit only a limited amount of information
to a net. One can use a classical protocol to guess the value of the global
function. Is there a quantum protocol improving the results of all classical
protocols? Brukner et. al. showed the deep connection between such problems and
the theory of Bell's inequalities. Here we generalize the theory to trits.
There the best classical protocol fails whereas the quantum protocol yields the
correct answer.Comment: 8 page