- Full text PDF available (2)
- This year (0)
- Last 5 years (1)
- Last 10 years (1)
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 been developed so far. Designing such algorithms is complicated by the rather nonintuitive character of quantum physics. In this paper we present a genetic programming system that… (More)
The determination of the parity of a string of N binary digits is a well-known problem in classical as well as quantum information processing, which can be formulated as an oracle problem. It has been established that quantum algorithms require at least N / 2 oracle calls. We present an algorithm that reaches this lower bound and is also optimal in terms of… (More)
This article consists of a collection of slides from the author's conference presentation.