Sciweavers

113 search results - page 3 / 23
» Automatic Synthesis for Quantum Circuits Using Genetic Algor...
Sort
View
TCAD
2008
102views more  TCAD 2008»
13 years 7 months ago
Quantum Circuit Simplification and Level Compaction
Abstract--Quantum circuits are time-dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal sy...
Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller...
GECCO
2004
Springer
14 years 23 days ago
Evolving Quantum Circuits and Programs Through Genetic Programming
Abstract. Spector et al. have shown [1],[2],[3] that genetic programming can be used to evolve quantum circuits. In this paper, we present new results in this field, introducing p...
Paul Massey, John A. Clark, Susan Stepney
ENGL
2008
79views more  ENGL 2008»
13 years 7 months ago
Cost Reduction in Nearest Neighbour Based Synthesis of Quantum Boolean Circuits
Quantum computer algorithms require an `oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and ...
Mozammel H. A. Khan
IJIT
2004
13 years 8 months ago
Synthesis of Logic Circuits Using Fractional-Order Dynamic Fitness Functions
This paper analyses the performance of a genetic algorithm using a new concept, namely a fractional-order dynamic fitness function, for the synthesis of combinational logic circuit...
Cecília Reis, José António Te...
QCQC
1998
Springer
154views Communications» more  QCQC 1998»
13 years 11 months ago
Automated Design of Quantum Circuits
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...
Colin P. Williams, Alexander G. Gray