As each quantum algorithm requires a specific initial quantum state, quantum state
preparation is an important task in quantum computing. The preparation of quantum states is …

The search for information in a system has been a continuous problem for a computer. This
has resulted in the construction of a set of classical algorithms that can search for a set of …

In this paper, we present a novel formulation of traditional sampling-based motion planners
as database-oracle structures that can be solved via quantum search algorithms. We …

The synthesis strategy for quantum oracles is based on a reversible logic synthesis and a
quantum compilation step. In reversible logic synthesis it is important to obtain a compact …

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms
use randomization to allow efficient solutions to this complex problem. As mobile robots and …

The advancement of quantum computing significantly depends on the effective design and
synthesis of quantum reversible circuits. This thesis introduces innovative methods for …