Reversible or information-lossless circuits have applications in digital signal processing,
communication, computer graphics and cryptography. They are also a fundamental …

We present a quantum algorithm for combinatorial optimization using the cost structure of
the search states. Its behavior is illustrated for overconstrained satisfiability (SAT) and …

Uniformly controlled one-qubit gates are quantum gates which can be represented as direct
sums of two-dimensional unitary operators acting on a single qubit. We present a quantum …

Until high-fidelity quantum computers with a large number of qubits become widely
available, classical simulation remains a vital tool for algorithm design, tuning, and …

For the first time in book form, this comprehensive and systematic monograph presents the
methods for the reversible synthesis of logic functions and circuits. This methodology offers …

A unitary operator U=∑ j, k uj, k| k〉〈 j| is called diagonal when uj, k= 0 unless j= k. The
definition extends to quantum computations, where j and k vary over the 2n binary …

In this paper we focus on a general approach of using genetic algorithm (GA) to evolve
Quantum circuits (QC). We propose a generic GA to evolve arbitrary quantum. circuit …

An alternative quantum algorithm for combinatorial search, adjusting amplitudes based on
number of conflicts in search states, performs well, on average, for hard random satisfiability …

Computer science and physics have been closely linked since the birth of modern
computing. In recent years, an interdisciplinary area has blossomed at the junction of these …

Quantum circuits currently constitute a dominant model for quantum computation [14]. Our
work addresses the problem of constructing quantum circuits to implement an arbitrary given …