Author:
Singh Shivani,Chawla Prateek,Sarkar Anupam,Chandrashekar C. M.
Abstract
AbstractQuantum walk has been regarded as a primitive to universal quantum computation. In this paper, we demonstrate the realization of the universal set of quantum gates on two- and three-qubit systems by using the operations required to describe the single particle discrete-time quantum walk on a position space. The idea is to utilize the effective Hilbert space of the single qubit and the position space on which it evolves in order to realize multi-qubit states and universal set of quantum gates on them. Realization of many non-trivial gates and engineering arbitrary states is simpler in the proposed quantum walk model when compared to the circuit based model of computation. We will also discuss the scalability of the model and some propositions for using lesser number of qubits in realizing larger qubit systems.
Funder
Department of Science and Technology, Government of India
Publisher
Springer Science and Business Media LLC
Reference41 articles.
1. Riazanov, G. V. The Feynman path integral for the Dirac equation. Sov. J. Exp. Theor. Phys. 6, 1107 (1958).
2. Feynman, R. P. Quantum mechanical computers. Found. Phys. 16, 507–531 (1986).
3. Aharonov, Y., Davidovich, L. & Zagury, N. Quantum random walks. Phys. Rev. A 48, 1687. https://doi.org/10.1103/PhysRevA.48.1687 (1993).
4. Meyer, D. A. From quantum cellular automata to quantum lattice gases. J. Stat. Phys. 85, 551–574. https://doi.org/10.1007/BF02199356 (1996).
5. Farhi, E. & Gutmann, S. Quantum computation and decision trees. Phys. Rev. A 58, 915. https://doi.org/10.1103/PhysRevA.58.915 (1998).
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献