PL EN


Preferences help
enabled [disable] Abstract
Number of results
2019 | 123 | 102-113
Article title

Quantum Factorization of Integers 21 and 91 using Shor’s Algorithm

Content
Title variants
Languages of publication
EN
Abstracts
EN
In this paper we focused on the factorization of integer in detail using well known Shor’s algorithm and its quantum part realization. The algorithm finds prime factors any integer more efficiently than any known classical algorithm. It is based on prior knowledge of the answer to the factorization problem. Algorithm includes finding gcd using polynomial time Euclidean algorithm, determination of unknown period from quantum computer and continued fraction expansion approach. Factorization of two integers 21 and 91 are shown in this paper with all steps. Quantum part of the factorization described mathematically.
Discipline
Year
Volume
123
Pages
102-113
Physical description
Contributors
  • Department of Physics, RYM Engineering College, Ballari, India
  • Department of Physics, RYM Engineering College, Ballari, India
  • Department of Electronics, Proudhadevaraya Institute of Technology, Hosapete, India
References
  • [1] Nikesk S Dattani and Nathaniel Bryans, Quantum factorization of 56153 with only 4 qubits, Quantum Physics, 27th November 2014. arXiv:1411.6758
  • [2] Niklas Johansson and Jan Ake Larsson, Realization of Shor’s Algorithm at Room Temperature, Quantum Physics, 10th January 2017. arXiv:1706.03215
  • [3] T. Monz et al., Realization of a scalable Shor algorithm, Science 351, 1068–1070 (2016).
  • [4] E. Lucero et al., Computing prime factors with a Josephson phase qubit quantum processor. Nature Physics 8, 719-723 (2012).
  • [5] E. Martin-Lopez et al., Experimental realization of Shor’s quantum factoring algorithm using qubit recycling. Nature Photonics 6, 773–776 (2012).
  • [6] Politi, J. C. Matthews, and J. L. O’Brien, Shor’s quantum factoring algorithm on a photonic chip. Science 325, 1221–1221 (2009).
  • [7] C.-Y. Lu, D. E. Browne, T. Yang, and J.-W. Pan, Demonstration of a Compiled Version of Shor’s Quantum Factoring Algorithm Using Photonic Qubits. Physical Review Letters 99 (2007) 10.1103/PhysRevLett.99.250504
  • [8] B. P. Lanyon et al., Experimental Demonstration of a Compiled Version of Shor’s Algorithm with Quantum Entanglement. Physical Review Letters 99 (2007) 10.1103/PhysRevLett.99.250505
  • [9] L. M. Vandersypen et al., “Experimental realization of Shor’s quantum factoring algorithm using nuclear magnetic resonance. Nature 414, 883–887 (2001).
  • [10] N. Xu, J. Zhu, D. Lu, X. Zhou, X. Peng, and J. Du. Quantum Factorization of 143 on a Dipolar-Coupling Nuclear Magnetic Resonance System. Physical Review Letters, vol. 108, no. 13, p. 130501, Mar. 2012.
  • [11] L. M. Vandersypen, M. Steffen, G. Breyta, C. S. Yannoni, M. H. Sherwood, and I. L. Chuang, “Experimental realization of Shor’s quantum factoring algorithm using nuclear magnetic resonance. Nature, vol. 414, no. 6866, pp. 883–7, Jan. 2001.
  • [12] B. Lanyon, T. Weinhold, N. Langford, M. Barbieri, D. James, A. Gilchrist, and A. White, Experimental Demonstration of a Compiled Version of Shor’s Algorithm with Quantum Entanglement. Physical Review Letters, vol. 99, no. 25, p. 250505, Dec. 2007.
  • [13] C.-Y. Lu, D. Browne, T. Yang, and J.-W. Pan, Demonstration of a Compiled Version of Shor’s Quantum Factoring Algorithm Using Photonic Qubits. Physical Review Letters, vol. 99, no. 25, p. 250504, Dec. 2007.
  • [14] Politi, J. C. F. Matthews, and J. L. O’Brien, Shor’s quantum factoring algorithm on a photonic chip. Science, vol. 325, no. 5945, p.1221, Sep. 2009.
  • [15] E. Martín-López, A. Laing, T. Lawson, R. Alvarez, X.-Q. Zhou, and J. L. O’Brien, Experimental realization of Shor’s quantum factoring algorithm using qubit recycling. Nature Photonics, vol. 6, no. 11, pp. 773–776, Oct. 2012.
  • [16] E. Lucero, R. Barends, Y. Chen, J. Kelly, M. Mariantoni, A. Megrant, P. ’Malley, D. Sank, A. Vainsencher, J. Wenner, T. White, Y. Yin, A. N. Cleland, and J. M. Martinis, Computing prime factors with a Josephson phase qubit quantum processor. Nature Physics, vol. 8, no. 10, pp. 719–723, Aug. 2012.
  • [17] J. A. Smolin, G. Smith, and A. Vargo, Oversimplifying quantum factoring. Nature, vol. 499, no. 7457, pp. 163–5, Jul. 2013.
  • [18] C J C Burges, Factoring as Optimization. Microsoft Research, Vol. MSR-TR-200, 2002
  • [19] G. Schaller and R. Schutzhold, The role of symmetries in adiabatic quantum algorithm. Quantum Information and Computation, vol. 10, no. 1, pp. 109-140. 2010.
Document Type
article
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.psjd-160c7d48-5b72-448d-8959-39fdeb6cf551
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.