Implementation of a quantum walk in a cycle of four nodes using an alternative method based on the Swap gate
DOI:
https://doi.org/10.13102/sscf.v19i.8872Keywords:
Quantum walk, IBM-Q, QiskitAbstract
This work has the objective of implementing quantum random walks in a graph with 4 nodes represented by a circle. It was observed that during the implementation of a discrete-time quantum walk, based on Hadamard's coin, the simulated results diverge from the theoretically expected results. In order to correct the discrepancies between the processed and theoretically expected results we use an alternative method based on the Swap port. To perform the simulation of the algorithms, the Qiskit framework and a real processor provided by IBM through remote access was used. The simulations performed in the real processor showed small fluctuations, however the quantum states were obtained with satisfactory probabilities.
Downloads
Metrics
References
M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information. Cambridge: Cambridge University Press (2000).
R.J. Hughes, D.M. Alde, P. Dyer, G.G. Luther, G.L. Morgan, M. Schauer, Quantum cryptography. Contemp. Phys. 36, (3) 149 (1995).
P.W. Shor. Algorithms for quantum computation: Discrete log and factoring. In: S. Goldwasser (Editor), Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, 124 (1994).
P. Kaye, R. Laflamme, M. Mosca, An Introduction to Quantum Computing. New York: Oxford University Press (2007).
J.M. Gambetta, M.J. Chow, M. Steffen. NPJ Quantum Information 3, 2 (2017).
The Quantiki, List of QC simulators. https://www.quantiki.org/wiki/list-qc-simulators. Accessed in: 02/07/2018.
The Liqui, The Quantum Architectures and Computation Group (QuArC) at Microsoft Research. https://www.microsoft.com/en-us/research/project/language-integrated-quantum-operations-liqui/. Accessed in: 02/07/2018.
R. Motwani, P. Raghavan, Randomized algorithms. ACM Comput. Surv. 28, (1) 33 (1996).
A. Ambainis, Quantum walk algorithm for element distinctness. SIAM J. Comput. 37, (1) 210 (2007).
R. Portugal, Quantum Walks and Search Algorithms. Cham: Springer (2018).
Y. Aharonov, L. Davidovich, N. Zagury. Quantum random walks. Phys. Rev. A 48, (2) 1687 (1993).
E. Farhi, S. Gutmann, Quantum computation and decision trees. Phys. Rev. A 58, 915 (1998).
M. Szegedy. Quantum speed-up of Markov chain based algorithms. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS '04), 32 (2004).
A. Patel, K.S. Raghunathan, P. Rungta. Quantum random walks do not need a coin toss. Phys. Rev. A 71, 032347 (2005).
R. Portugal, R.A.M. Santos, T.D. Fernandes, and D.N. Gonçalves. The staggered quantum walk model. Quantum Information Processing 15, (1) 85 (2016).
A. Abreu, L. Cunha, C. de Figueiredo, L. Kowada, F. Marquezino, D. Posner, R. Portugal. The graph tessellation cover number: Chromatic bounds, e-cient algorithms and hardness. Theoretical Computer Science 801, 175 (2020).
R. Portugal, T.D. Fernandes. Quantum search on the two-dimensional lattice using the staggered model with Hamiltonians. Phys. Rev. A 95, 042341 (2017).
J. Kempe. Contemporary Physics 44, (4) 307 (2003).
F. Acasiete, F.P. Agostini, J.K. Moqadam, et al. Implementation of quantum walks on IBM quantum computers. Quantum Information Process 19, 426 (2020). doi.:10.1007/s11128-020-02938-5.
P. Olivieri, M. Askarpour, E. di Nitto, Experimental Implementation of Discrete Time Quantum Walk with the IBM Qiskit Library. IEEE/ACM 2nd International Workshop on Quantum Software Engineering (Q-SE), 33 (2021). doi: 10.1109/Q-SE52541.2021.00014.
B. L. Douglas and J. B. Wang, PHYSICAL REVIEW A 79, 052335 (2009)
W.R. M. Rabelo, M.L.M. Costa. Revista Brasileira de Ensino de Física. 40, (4) e4306 (2018),
M.A. NIELSEN, I.L. CHUANG, Computação quântica e informação quântica. Porto Alegre: Bookman (2005).
V.P. GERDT, R. KRAGLER, A.N. PROKOPENYA, On Simulation of Quantum Circuits with Mathematica. Computer Algebra Systems in Teaching and Research/CASCR, 135 (2007).
J. C. GARCIA-ESCARTIN, P. CHAMORRO-POSADA, A SWAP gate for qudits. Quantum information processing 12, (12) 3625 (2013).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Dagoberto S Freitas, Aisis R Barbosa
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Sitientibus Physical Science Series is an open access journal, which means that all content is available for free and without cost to the user or his institution. Users are authorized to read, download, copy, distribute, print, search, or link to the full texts of articles in this journal, without asking the editor or author's prior permission. This is in line with BOAI's definition of open access.
Authors who publish with this journal agree to the following terms:
1. The authors retain copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of authorship of the work and initial publication in this journal.
2. Authors may enter into separate additional contractual agreements, but in accordance with the aforementioned license, for the non-exclusive distribution of the journal's published version of the work (eg, post it in an institutional repository or publish it in a book ), with an acknowledgment of its initial publication in this journal.
