A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions

13 years 10 months ago

Download www.aueb.gr

This paper presents a quantum algorithm for ﬁnding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incompletely speciﬁed switching function. The proposed algorithm takes advantage of the inherent massive parallelism of quantum circuits in order to achieve better complexity than the conventional ones. The proposed Exclusive-Or (xor) expressions such as ESCT can be used to implement an arbitrary Boolean function into a reversible or even a quantum circuit.

Marinos Sampson, Dimitrios Voudouris, George K. Pa

Real-time Traffic

ISVLSI 2007 | Minimal Esct | Quantum Circuit | Sum Of Products |

claim paper

» Lower bounds for local search by quantum arguments

» Finding Minimal ESCT Expressions for Boolean Functions with Weight of up to 7

» New upper and lower bounds for randomized and quantum local search

» Quantum and classical query complexities of local search are polynomially related

» Exact ESCT minimization for functions of up to six input variables

» Finding TimeLagged 3D Clusters

» Minimum sum edge colorings of multicycles

» Finding minimizing and counting weighted subgraphs

Post Info
More Details (n/a)

Added	04 Jun 2010
Updated	04 Jun 2010
Type	Conference
Year	2007
Where	ISVLSI
Authors	Marinos Sampson, Dimitrios Voudouris, George K. Papakonstantinou

Comments (0)

Sciweavers

A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions

ISVLSI 2007 | Minimal Esct | Quantum Circuit | Sum Of Products |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers