Header menu link for other important links
X
Circuit synthesis of marked clique problem using quantum walk
BHADURI A SANYAL, A SAHA, B GAIN, S B MANDAL
Published in Springer Verlag
2017
Volume: 567
   
Pages: 37 - 51
Abstract
Many applications such as Element Distinctness, Triangle Finding, Boolean Satisfiability, Marked Subgraph problem can be solved by Quantum Walk, which is the quantum version of classical random walk without intermediate measurement. To design a quantum circuit for a given quantum algorithm, which involves Quantum Walk search, we need to define an oracle circuit specific to the given algorithm and the diffusion operator for amplification of the desired quantum state. In this paper, we propose a quantum circuit implementation for the oracle of the marked clique problem based on Quantum Walk approach. To the best of our knowledge, this is a first of its kind approach in regards to the quantum circuit synthesis of the marked clique oracle in binary quantum domain. We have performed the simulation of the proposed oracle circuit in Matlab. © Springer Nature Singapore Pte Ltd. 2017.
About the journal
JournalData powered by TypesetAdvances in Intelligent Systems and Computing
PublisherData powered by TypesetSpringer Verlag
ISSN2194-5357