Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Improved Complexity of Quantum Oracles for Ternary Grover Algorithm for Graph Coloring

By: Perkowski, M.; Yushi Wang;

2011 / IEEE / 978-1-4577-0112-2

Description

This item was taken from the IEEE Conference ' Improved Complexity of Quantum Oracles for Ternary Grover Algorithm for Graph Coloring ' The paper presents a generalization of the well-known Grover Algorithm to operate on ternary quantum circuits. We compare complexity of oracles and some of their commonly used components for binary and ternary cases and various sizes and densities of colored graphs. We show that ternary encoding leads to quantum circuits that have significantly less qud its and lower quantum costs. In case of serial realization of quantum computers, our ternary algorithms and circuits are also faster.