Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/437372
Title: Study of cubelike graphs for parallel and quantum computation
Researcher: Rajdeepak, Rishikant
Guide(s): Sunitha, V. and Mulherkar, Jaideep
Keywords: Engineering and Technology
Computer Science
Computer Science Software Engineering
University: Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT)
Completed Date: 2022
Abstract: In this thesis, we study Cayley graphs over Znr for their utility in multiprocessorcomputing and quantum computing. For multiprocessor computing, we investigateproblems of graph embedding on cubelike interconnection networks suchas hypercubes and augmented cubes. These embeddings are required for efficientsimulation of divide-and-conquer based algorithms on multiprocessor systemsbuilt on such interconnection networks. In particular, we discuss Havel sconjecture which states that an equibipartite binary tree on 2n vertices spans then-dimensional hypercube. We develop an efficient embedding technique to provethe conjecture for a subfamily of equibipartite binary tree. We also worked ona related conjecture which states that a binary tree on 2n vertices spans the ndimensionalaugmented cube. For this, we propose a recursive technique to embedand a method to count the spanning binary trees of the augmented cube. Forexploring the utility of cubelike graphs for quantum computation, we study quantumwalks that can be used to develop quantum algorithms for searching andcommunication. We study both theoretical and experimental aspects of quantumwalks on cubelike graphs as well as Cayley graphs over Znr . For discrete-timequantum walk, our work gives a closed form for the quantum state of the systemassociated with cubelike graphs, after finitely many time steps; this work is thekey to studying hitting times on the graphs which is a measure of how quickly thewalker reaches a specific target node. We also decompose the quantum circuits ofthe corresponding evolution operators that were run on IBM s quantum computingplatform. We conjecture that there is a linear relation between the quantumhitting times and dimension of cubelike graphs. For continuous-time quantumwalk, we investigate weighted Cayley graphs over Znr in order to classify them into three categories of graphs - those that admit PST, those that do not admit PSTbut are periodic, and those that are not periodic. In continuation to this work, weconstructed quantum...
Pagination: xii, 128 p.
URI: http://hdl.handle.net/10603/437372
Appears in Departments:Department of Information and Communication Technology

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File81.36 kBAdobe PDFView/Open
02_prelim pages.pdf511.03 kBAdobe PDFView/Open
03_contents.pdf93.08 kBAdobe PDFView/Open
04_abstract.pdf85.44 kBAdobe PDFView/Open
05_chapter 1.pdf141.16 kBAdobe PDFView/Open
06_chapter 2.pdf165.38 kBAdobe PDFView/Open
07_chapter 3.pdf241.05 kBAdobe PDFView/Open
08_chapter 4.pdf540.75 kBAdobe PDFView/Open
09_chapter 5.pdf426.59 kBAdobe PDFView/Open
10_chapter 6.pdf126.46 kBAdobe PDFView/Open
11_annexures.pdf245.99 kBAdobe PDFView/Open
80_recommendation.pdf155.99 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: