#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2005

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ralf Stadelhofer
- AI EDAM
- 2006

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)

- Ferdinand Eisenkeil, Johannes Ernst, Ralf Stadelhofer, Uwe Kuhne, Oliver Deussen
- 2015 IEEE/AIAA 34th Digital Avionics Systems…
- 2015

This article consists of a collection of slides from the author's conference presentation.

- ‹
- 1
- ›