3328 search results - page 27 / 666 » Topological Quantum Computation |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
ASAP
2006
IEEE
14 years 1 months ago
2006
IEEE
In the simulation of quantum circuits the matrices and vectors used to represent unitary operations and qubit states grow exponentially as the number of qubits increase. For insta...
ANSS
2005
IEEE
14 years 1 months ago
2005
IEEE
When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolat...