Multi-qubit quantum computing using discrete-time quantum walks on closed graphs
Prateek Chawla, Shivani Singh, Aman Agarwal, Sarvesh Srinivasan, C. M. Chandrashekar
Homi Bhabha National Institute Institute of Mathematical Sciences Czech Technical University in Prague Birla Institute of Technology and Science, Pilani - Goa Campus
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of the scheme is demonstrated by using a set of walk operations on a closed lattice form to implement the universal set of quantum gates on multi-qubit system. We also present a set of experimentally realizable walk operations that can implement Grover's algorithm, quantum Fourier transformation and quantum phase estimation algorithms. An elementary implementation of error detection and correction is also presented. Analysis of space and time complexity of the scheme highlights the advantages of quantum walk based model for quantum computation on systems where implementation of quantum walk evolution operations is an inherent feature of the system.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIQuantum Computing Algorithms and Architecture
Quantum Information and Cryptography · Quantum Mechanics and Applications
参考文献 52
此处列出前 3 条
引用本文 13
按被引量排序,此处列出前 3 条