CORR
2008
Springer
13 years 4 months ago
2008
Springer
Adiabatic quantum annealing is a paradigm of analog quantum computation, where a given computational job is converted to the task of finding the global minimum of some classical po...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Quantum computer programming is emerging as a new subject domain from multidisciplinary research in quantum computing, computer science, mathematics (especially quantum logic, lamb...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present the basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming langua...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
BIOSYSTEMS
2008
13 years 4 months ago
2008
The world's objective pattern is formed through consistent histories of quantum measurements originating as different branches of the same wave function. When we come close t...
ALGORITHMICA
2010
13 years 4 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
AIEDAM
2008
13 years 4 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
AIEDAM
2008
13 years 4 months ago
2008
We demonstrate the use of genetic programming in the automatic invention of quantum computing circuits that solve problems of potential theoretical and practical significance. We ...