Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/231913
Title: Challenges in Quantum Computing
Researcher: Sahni, Prakash
Guide(s): Prakash, Shiroman and Hazur Saran
Keywords: Engineering and Technology,Engineering,Engineering Electrical and Electronic
University: Dayalbagh Educational Institute
Completed Date: 2016
Abstract: In this thesis, we define the problem of finding feed-through trees in a repeated and symmetric floorplan in a VLSI layout. We first use a classical computation method to solve the same. We then use a quantum computation method employing Grover s search algorithm on an entangled database to show that the searching for all solutions which would take runtime O(2n) on a classical computer takes O (sqrt (2n-m /k)) on a quantum computer in the best case, where n is the number of possible edges, n is the number of symmetries, and k the number of possible solutions. In general, the reduction will be quadratic and not exponential unless the entire floorplan is made of repeated symmetries. newline
Pagination: 
URI: http://hdl.handle.net/10603/231913
Appears in Departments:Department of Electrical Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File8.98 kBAdobe PDFView/Open
02_certificate.pdf38.39 kBAdobe PDFView/Open
03_declaration.pdf69.34 kBAdobe PDFView/Open
05_acknowledgement.pdf9.48 kBAdobe PDFView/Open
06_contents.pdf8.82 kBAdobe PDFView/Open
07_list_of_tables.pdf7.42 kBAdobe PDFView/Open
08_list_of_figures.pdf8.98 kBAdobe PDFView/Open
09_abbreviations.pdf8.1 kBAdobe PDFView/Open
10_chapter1.pdf125.04 kBAdobe PDFView/Open
11_chapter2.pdf250.53 kBAdobe PDFView/Open
12_chapter3.pdf214.98 kBAdobe PDFView/Open
13_conclusion.pdf68.75 kBAdobe PDFView/Open
14_reference.pdf121.07 kBAdobe PDFView/Open
15_summary.pdf68.77 kBAdobe PDFView/Open


Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.