Log-mod-finding: A New Idea for Implementation of Shor's Algorithm
|
|
- Sheena Burke
- 5 years ago
- Views:
Transcription
1 2012 International Conference on Networks and Information (ICNI 2012) IPCSIT vol. 57 (2012) (2012) IACSIT Press, Singapore DOI: /IPCSIT.2012.V57.11 Log-mod-finding: A New Idea for Implementation of Shor's Algorithm Mehdi Masoudi 1, Ahmad Pour Monjezy 2 1 IAU branch of Izeh, Izeh, Iran (masoudi737@gmail.com) 2 IAU science and research branch of Tehran Tehran, Iran (a.pourmonjezy@srbiau.ac.ir ) Abstract. One of the most important challenges in the Shor's algorithm is about minimizing the number of elements which is useful to construct an effective quantum computer. The best proposed architecture for implementation of Shor's algorithm is order-finding approach. In this approach for a quantum register such as x, it requires 2n qubits and 3 control qubit. However, using simple mathematical conversation which has been applied in this paper, in addition to easier implementation, we could decrease the required qubit for register x to n qubit. This makes a significant reduction in the number of implementation elements. Our experiments on 1000 RSA numbers shows that the proposed method could find prime factor all of the RSA numbers just with one decimal number. As a result, using this implementation, we can have a more precise method for cracking RSA numbers. Keywords. Shor's algorithm, quantum computing 1. Introduction Since Shor's discovered a polynomial time algorithm for factorization on a quantum computer, a lot of effort has been directed towards building a working quantum computer. Despite all these efforts, it is still extremely difficult to control even a few qubits. It is thus of great interest to study exactly how few qubits are needed to factor an n-bit number. Quantum factorization consists of classical pre-processing, a quantum algorithm for log-mod-finding and classical postprocessing. We will concentrate on the quantum part of factorization and consider classical parts as being free as long as they are computable in polynomial time. The only use of quantum computation in Shor s algorithm is to find the order of a x mod N, where N is an n-qubit integer that we want to factor. The order r of a x mod N is the least positive integer such that ar 1(mod N). For completeness, we now give the full algorithm for factoring N as given in [3]: 1. Pick a pseudo-random number a <N. 2. Compute gcd (a, N).this may be done using the Euclidean algorithm. 3. If the greatest common divisor (a, N) 1, then there is a nontrivial factor of N, so we are done. 4. Otherwise, use the log-mod-finding to find r, the period of the relation (1) function: f x a mod N 2 mod N f x r f x (1) 5. If r is odd go to back step If a r/2-1 (mod N) go back to step The factor of N is gcd (a r/2 ± 1, N). We are done. 60
2 2. The Circuit Fig. 1: Shor s algorithm flow chart In log-mod-finding approach instead of calculating the amount of a x mod N, 2 mod N is calculated. In order to understand easily, four stages have shown in Figure 2. In the first stage, quantum register x is multiplied by the integer, and then two power of the result be calculated, after this, mod N is calculated and then using the quantum furrier transform, The frequency of repetition was obtained and delivered to the classical process to do the rest algorithm. Fig. 2: quantum factorization stages 2.1. The multiplier gate Considering the expression (2) the multiplier, integer and decimal part of Log are considered as an integer and multiplied by the quantum register x and then the number of decimal qubits for the intended destination has to be removed low significant Results qubits. Whatever, the number of qubit which allocated to the decimal number be more, circuit has more precision in response. Also simulation for 1000 RSA number showed this circuit funded RSA factors successfully just with one decimal number. a 2 2 I.F 2 I.F (2) For implementing the multiplier circuit of reversible HGN and PG gate (Figure 3) is used. A multiplier circuit by these gates has been implemented by multiplying the minimum components gates for multiplying operation. Fig. 3: Reversible HNG and PG gate 61
3 Fig. 4: Partial products in a 4*4 multiplication Fig. 5: multiplier gate The Figure 3 is a four qubits multiplier. These components as MUL (Figure 5) and introduce it used to multiplied by the quantum register x and the IF (integer and decimal part of Log ), the number of qubits which has been consider in for decimal, it is necessary to remove the given low significant result of multiplying The decoder gate After multiplying x *IF, the two power the result must be calculated. We know that when the two power a number such as z, (z +1)th result qubit will be one. This behaviour is similar to the output of a decoder; using a quantum decoder these components can easily be implemented. Figure 6 shows an example of decoder 2 to 4 which has been implemented by CNOT and Toffoli gate The mod gate Fig. 6: partial products in a 2 to 4 quantum decoder Now, a circuit is needed to calculate mod N after result of decoder. In this circuit conditional phase shifter has been used, this gate if the control and target qubit equal 1 phase change equals to (k is equivalent to phase shift amount which has shown on conditional phase shifter) occurred on target qubit. If the controlled gate apply for quantum number a and Fourier b the result will be equal to Fourier a + b of the two numbers, and if this action reverse on number a and Fourier b the result will be Fourier a - b. so these component can be used for next operation according to the bars located at the left and right of these, any one can distinguish a component from other. 62
4 Fig.7: adder and subtracter gate To obtain the Mod components ФMOD (Figure 8) has been introduce, this component can subtract the first number from the second, due to controlling of valuable qubits if the result will be negative, the subtraction number will be added the first number again. Using this component to calculate the mod amount of first stage amount of 2 N will be subtracted from 2 and again if the result will be negative in sign the same amount would be added to it. This action will be done till the amount of 2 N is acquired, then at the last stage the output would be 2 mod N. { { Fig. 8: Implementation ФMOD gate Using this component, as is shown in Figure 9 together, will be placed besides the obtained result from the mod series will be taking the quantum Fourier transform, r come from it. 3. The log-mod-finding circuit Fig. 9: mod gate According to the previous components the quantum part can be implement as figure 10, this circuit has there input, the first of them is quantum register of x which intern is zero modes that has been transfer from Hadamard gates till a mode of superposition include all of numbers can be seen. The second input is equal to the amount of I, which intern is equal to integer part of Log. This input is obtained by classical process and 63
5 delivered to quantum part. The third input is F which in turn is equal to integer part of Log, if the circuit output subjected to quantum Fourier transform the result will be equalled to 2 mod N period or r, this result is a classical number. Then classical part of this number can be received and according to the algorithm gcd a 1,N will be calculated. If the obtained numbers is the factors N, the algorithm will be ended otherwise, classical part can continue using new amount of algorithm until the prime number will be found. 4. Conclusion Fig. 10: log- mod- finding circuit In this paper, we proposed utilizing 2 expression instead of a in the fourth step of Shor's algorithm. This simple change could reduce the number of qubits into n for a determined register x. Also it could outperform existing methods in terms of number of gates significantly. The simulations assert that the proposed circuit cracked 1000 of RSA numbers successfully just with one decimal number. 5. References [1] S. Beauregard, Circuit for Shor s algorithm using 2n+3 qubits, Quantum Information and Computation, quantph/ v3, 2003 pp [2] P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comp., 26, 1997 pp [3] P. Barrera, A. Calabro,L. Fortuna, D. Porto, A new method for implemention gate operation a quantum factoring algorithm, Circuits and Systems, ISCAS. 2003, pp [4] M. Haghparast, S. j. Jassbi, K. Navi, Design of a Nover reversible multiplier circuit using HNG gate in nanotechnology, World Appl. Sci. j, 3(6), 2008, pp [5] R. zhou, Y. Shi,J. Cao, H. Wang, Comment on Design of a Novel reversible multiplier circuit usin HNG Gate in nanotechnology, World Appl. Sci. j,10(2), 2010,pp [6] G. Draper, Addition on a quantum computer, quant-ph/ v1, [7] M. Nakhara, T. ohmi, quantum computing from linear algebra to physical realizations, Taylor & Francis book,isbn-13: ,2008. [8] X. Fu, W. Bao, C. Zhou, Design and Implementation of Quantum Factorization Algorithm, Proceding 3th of the IEEE conference Intelligent Information Technology and Security Informatics(IITSI), April 2010, pp [9] R. Cleve and J. Watrous (2000), Fast parallel circuits for the quantum Fourier transform, Proceedings 41st Annual Symposium on Foundations of Computer Science (FOCS 00), pp [10] M. Mosca and A. Ekert (1999), the hidden subgroup problem and eigenvalue estimation on a quantum computer, Lecture Notes in Computer Science, 1509, pp [11] S. Parker and M.B. Plenio (2000), efficient factorization with a single pure qubit and logn mixed qubits, Phys. Rev. Lett., 85, pp [12] A. Barenco, C. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J.A. Smolin, and H. Weifurter (1995), Elementary gates for quantum computation, Phys. Rev. A, 52, pp [13] D. Beckman, A.N. Chari, S. Devabhaktuni, and J. Preskill (1996), efficient networks for quantum factoring, Phys. Rev. A, 54, pp [14] L.M.K. Vandersypen, M. Steffen, G. Breyta, C.S. Yannoni, M.H. Sherwood, and I.L. Chuang (2001), Experimental realization of Shor s quantum factoring algorithm using magnetic resonance, Nature, 414, pp
arxiv:quant-ph/ v3 21 Feb 2003
Circuit for Shor s algorithm using 2n+3 qubits arxiv:quant-ph/2595v3 21 Feb 23 Stéphane Beauregard Abstract We try to minimize the number of qubits needed to factor an integer of n bits using Shor s algorithm
More informationarxiv: v2 [quant-ph] 1 Aug 2017
A quantum algorithm for greatest common divisor problem arxiv:1707.06430v2 [quant-ph] 1 Aug 2017 Wen Wang, 1 Xu Jiang, 1 Liang-Zhu Mu, 1, 2, 3, 4, and Heng Fan 1 School of Physics, Peking University, Beijing
More informationShor s Prime Factorization Algorithm
Shor s Prime Factorization Algorithm Bay Area Quantum Computing Meetup - 08/17/2017 Harley Patton Outline Why is factorization important? Shor s Algorithm Reduction to Order Finding Order Finding Algorithm
More informationQubit Recycling. Ran Chu. May 4, 2016
Qubit Recycling Ran Chu May 4, 06 Abstract Shor s quantum algorithm for fast number factoring is a key example of quantum computational algorithm and the prime motivator in the international effort to
More informationQuantum Cost efficient Reversible Multiplier
Quantum Cost efficient Reversible Multiplier Mandeep Kaur, Chakshu Goel Abstract Increasing demand for reducing power dissipation in digital multipliers has led to new mode of computation for multiplier
More informationGrover Algorithm Applied to Four Qubits System
www.ccsenet.org/cis Computer and Inormation Science Vol., No. ; May Grover Algorithm Applied to Four Qubits System Z. Sakhi (Corresponding author) Laboratory o Inormation Technology and Modelisation, and
More informationA FAST QUANTUM CIRCUIT FOR ADDITION WITH FEW QUBITS
Quantum Information and Computation, Vol. 8, No. 6&7 (2008) 0636 0649 c Rinton Press A FAST QUANTUM CIRCUIT FOR ADDITION WITH FEW QUBITS YASUHIRO TAKAHASHI 1,2 and NOBORU KUNIHIRO 2 1 NTT Communication
More informationInvestigating the Complexity of Various Quantum Incrementer Circuits. Presented by: Carlos Manuel Torres Jr. Mentor: Dr.
Investigating the Complexity of Various Quantum Incrementer Circuits Presented by: Carlos Manuel Torres Jr. Mentor: Dr. Selman Hershfield Department of Physics University of Florida Gainesville, FL Abstract:
More informationLecture note 8: Quantum Algorithms
Lecture note 8: Quantum Algorithms Jian-Wei Pan Physikalisches Institut der Universität Heidelberg Philosophenweg 12, 69120 Heidelberg, Germany Outline Quantum Parallelism Shor s quantum factoring algorithm
More informationFPGA-Based Circuit Model Emulation of Quantum Algorithms
FPGA-Based Circuit Model Emulation of Quantum Algorithms Mahdi Aminian, Mehdi Saeedi, Morteza Saheb Zamani, Mehdi Sedighi Quantum Design Automation Lab Computer Engineering Department, Amirkabir niversity
More informationExperimental Realization of Shor s Quantum Factoring Algorithm
Experimental Realization of Shor s Quantum Factoring Algorithm M. Steffen1,2,3, L.M.K. Vandersypen1,2, G. Breyta1, C.S. Yannoni1, M. Sherwood1, I.L.Chuang1,3 1 IBM Almaden Research Center, San Jose, CA
More informationQuantum Arithmetic on Galois Fields
Quantum rithmetic on Galois Fields arxiv:quant-ph/31163v1 9 Jan 3 Stéphane Beauregard, Gilles Brassard, José Manuel Fernande 11 pril bstract In this paper we discuss the problem of performing elementary
More informationarxiv:quant-ph/ v2 24 Nov 2004
Modularization of the multi-qubit controlled phase gate and its NMR implementation Jingfu Zhang 1,2, Wenzhang Liu 1,2, Zhiwei Deng 3, Zhiheng Lu, 4 and Gui Lu Long 1,2,5 1 Key Laboratory For Quantum Information
More informationExtended Superposed Quantum State Initialization Using Disjoint Prime Implicants
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants David Rosenbaum, Marek Perkowski Portland State University, Department of Computer Science Portland State University, Department
More informationarxiv:quant-ph/ v3 11 Mar 2004
ariv:quant-ph/040148v3 11 ar 004 Generalized G States and Distributed Quantum Computing Anocha Yimsiriwattana and Samuel J. Lomonaco Jr. Abstract. A key problem in quantum computing is finding a viable
More informationarxiv:quant-ph/ v1 15 Jan 2006
Shor s algorithm with fewer (pure) qubits arxiv:quant-ph/0601097v1 15 Jan 2006 Christof Zalka February 1, 2008 Abstract In this note we consider optimised circuits for implementing Shor s quantum factoring
More informationLogic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation
Quantum logic gates Logic gates Classical NOT gate Quantum NOT gate (X gate) A NOT A α 0 + β 1 X α 1 + β 0 A N O T A 0 1 1 0 Matrix form representation 0 1 X = 1 0 The only non-trivial single bit gate
More informationarxiv:quant-ph/ v1 16 Nov 1995
Quantum Networks for Elementary Arithmetic Operations Vlatko Vedral, Adriano Barenco and Artur Ekert Clarendon Laboratory, Department of Physics University of Oxford, Oxford, OX1 3PU, U.K. (Submitted to
More informationThe Deutsch-Josza Algorithm in NMR
December 20, 2010 Matteo Biondi, Thomas Hasler Introduction Algorithm presented in 1992 by Deutsch and Josza First implementation in 1998 on NMR system: - Jones, JA; Mosca M; et al. of a quantum algorithm
More informationShort Course in Quantum Information Lecture 5
Short Course in Quantum Information Lecture 5 Quantum Algorithms Prof. Andrew Landahl University of New Mexico Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html
More informationwith the ability to perform a restricted set of operations on quantum registers. These operations consist of state preparation, some unitary operation
Conventions for Quantum Pseudocode LANL report LAUR-96-2724 E. Knill knill@lanl.gov, Mail Stop B265 Los Alamos National Laboratory Los Alamos, NM 87545 June 1996 Abstract A few conventions for thinking
More informationQuantum algorithms for computing short discrete logarithms and factoring RSA integers
Quantum algorithms for computing short discrete logarithms and factoring RSA integers Martin Ekerå, Johan Håstad February, 07 Abstract In this paper we generalize the quantum algorithm for computing short
More informationPHYSICAL REVIEW A, 66,
PHYSICAL REVIEW A, 66, 022313 2002 Quantum-information processing by nuclear magnetic resonance: Experimental implementation of half-adder and subtractor operations using an oriented spin-7õ2 system K.
More informationarxiv:quant-ph/ v1 16 Jan 2003
Grover s Algorithm: Quantum Database Search arxiv:quant-ph/3179v1 16 Jan 3 C. Lavor Instituto de Matemática e Estatística Universidade do Estado do Rio de Janeiro - UERJ Rua São Francisco Xavier, 54, 6
More informationUniversity of Illinois at Chicago. Prelude: What is the fastest algorithm to sort an array?
Challenges in quantum algorithms for integer factorization 1 D. J. Bernstein University of Illinois at Chicago Prelude: What is the fastest algorithm to sort an array? def blindsort(x): while not issorted(x):
More informationQuantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles
Quantum Computation 650 Spring 2009 Lectures 1-21 The World of Quantum Information Marianna Safronova Department of Physics and Astronomy February 10, 2009 Outline Quantum Information: fundamental principles
More informationA Systematic Algorithm for Quantum Boolean Circuits Construction
A Systematic Algorithm for Quantum Boolean Circuits Construction I.M. Tsai and S.Y. Kuo arxiv:quant-ph/0104037v2 19 Apr 2001 Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan.
More informationAn Algorithm for Minimization of Quantum Cost
Appl. Math. Inf. Sci. 6, No. 1, 157-165 (2012) 157 Applied Mathematics & Information Sciences An International Journal An Algorithm for Minimization of Quantum Cost Anindita Banerjee and Anirban Pathak
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing The lecture notes were prepared according to Peter Shor s papers Quantum Computing and Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a
More informationDesign and Optimization of Reversible BCD Adder/Subtractor Circuit for Quantum and Nanotechnology Based Systems
World pplied Sciences Journal 4 (6): 787-792, 2008 ISSN 1818-4952 IDOSI Publications, 2008 Design and Optimization of Reversible CD dder/subtractor Circuit for Quantum and Nanotechnology ased Systems 1
More informationIntroduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm
Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut
More informationQuantum Computation and Communication
Tom Lake tswsl1989@sucs.org 16/02/2012 quan tum me chan ics: The branch of mechanics that deals with the mathematical description of the motion and interaction of subatomic particles - OED quan tum me
More informationShor s Algorithm for Factoring Large Integers
Shor s Algorithm for Factoring Large Integers C. Lavor, L.R.U. Manssur, and R. Portugal Instituto de Matemática e Estatística Universidade do Estado do Rio de Janeiro - UERJ Rua São Francisco Xavier, 54,
More informationShor s Algorithm. Polynomial-time Prime Factorization with Quantum Computing. Sourabh Kulkarni October 13th, 2017
Shor s Algorithm Polynomial-time Prime Factorization with Quantum Computing Sourabh Kulkarni October 13th, 2017 Content Church Thesis Prime Numbers and Cryptography Overview of Shor s Algorithm Implementation
More informationarxiv:quant-ph/ v5 6 Apr 2005
Nonunitary quantum circuit Hiroaki Terashima 1, and Masahito Ueda 1, arxiv:quant-ph/3461v5 6 Apr 5 1 Department of Physics, Tokyo Institute of Technology, Tokyo 15-8551, Japan CREST, Japan Science and
More informationarxiv: v4 [quant-ph] 8 Mar 2013
Decomposition of unitary matrices and quantum gates Chi-Kwong Li, Rebecca Roberts Department of Mathematics, College of William and Mary, Williamsburg, VA 2387, USA. (E-mail: ckli@math.wm.edu, rlroberts@email.wm.edu)
More informationQuantum Error Correction Codes-From Qubit to Qudit. Xiaoyi Tang, Paul McGuirk
Quantum Error Correction Codes-From Qubit to Qudit Xiaoyi Tang, Paul McGuirk Outline Introduction to quantum error correction codes (QECC) Qudits and Qudit Gates Generalizing QECC to Qudit computing Need
More informationQuantum Circuits: Fanout, Parity, and Counting
Quantum Circuits: Fanout, Parity, and Counting Cristopher oore Santa Fe Institute, 399 yde Park Road, Santa Fe, New exico 875 moore@santafe.edu ariv:quant-ph/99346v3 7 ar 999 Abstract. We propose definitions
More informationA Gentle Introduction to Quantum Computing
A Gentle Introduction to Quantum Computing Abdullah Khalid 01-10-0168 School of Science and Engineering Lahore University of Management Sciences Friday 3 rd June, 011 Contents 1 Introduction to Quantum
More informationOn The Complexity of Quantum Circuit Manipulation
On The Complexity of Quantum Circuit Manipulation Vincent Liew 1 Introduction The stabilizer class of circuits, introduced by Daniel Gottesman, consists of quantum circuits in which every gate is a controlled-not
More informationVolume 3, No. 1, January 2012 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at
Volume 3, No 1, January 2012 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at wwwjgrcsinfo A NOVEL HIGH DYNAMIC RANGE 5-MODULUS SET WHIT EFFICIENT REVERSE CONVERTER AND
More informationLiterature Review on Multiplier Accumulation Unit by Using Hybrid Adder
Literature Review on Multiplier Accumulation Unit by Using Hybrid Adder Amiya Prakash M.E. Scholar, Department of (ECE) NITTTR Chandigarh, Punjab Dr. Kanika Sharma Assistant Prof. Department of (ECE) NITTTR
More informationThe goal differs from prime factorization. Prime factorization would initialize all divisors to be prime numbers instead of integers*
Quantum Algorithm Processor For Finding Exact Divisors Professor J R Burger Summary Wiring diagrams are given for a quantum algorithm processor in CMOS to compute, in parallel, all divisors of an n-bit
More informationLos A 96.- Los Alamos National Laboratory Los Alamos New Mexico ASSUMPTIONS FOR FAULT TOLERANT QUANTUM COMPUTING. E.
1 LA-UR 96.- Los Alamos National Laboratory is operated by the Universityof California for the United States Department of Energy under contract W-7405-ENG-36. TITLE: AUTHOR(S): SUBMITTED TO: ASSUMPTIONS
More informationIntroduction to Quantum Information Processing
Introduction to Quantum Information Processing Lecture 6 Richard Cleve Overview of Lecture 6 Continuation of teleportation Computation and some basic complexity classes Simple quantum algorithms in the
More informationNumber Theory. CSS322: Security and Cryptography. Sirindhorn International Institute of Technology Thammasat University CSS322. Number Theory.
CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L06, Steve/Courses/2011/S2/CSS322/Lectures/number.tex,
More informationA new universal and fault-tolerant quantum basis
Information Processing Letters 75 000 101 107 A new universal and fault-tolerant quantum basis P. Oscar Boykin a,talmor a,b, Matthew Pulver a, Vwani Roychowdhury a, Farrokh Vatan a, a Electrical Engineering
More informationDatabase Manipulation Operations on Quantum Systems
Quant Inf Rev, No, 9-7 (203) 9 Quantum Information Review An International Journal http://dxdoiorg/02785/qir/0002 Database Manipulation Operations on Quantum Systems Ahmed Younes Department of Mathematics
More informationQUANTUM PHASE ESTIMATION WITH ARBITRARY CONSTANT-PRECISION PHASE SHIFT OPERATORS
Quantum Information and Computation, Vol., No. 9&0 (0) 0864 0875 c Rinton Press QUANTUM PHASE ESTIMATION WITH ARBITRARY CONSTANT-PRECISION PHASE SHIFT OPERATORS HAMED AHMADI Department of Mathematics,
More informationCircuits for Shor Factorization
qitd521 Circuits for Shor Factorization Robert B. Griffiths Version of 22 March 2012 Contents 1 Introduction 1 2 Quantum Fourier Transform 2 3 Modular Exponentiation 5 1 Introduction ow can Shor s algorithm
More informationQuantum Computing. 6. Quantum Computer Architecture 7. Quantum Computers and Complexity
Quantum Computing 1. Quantum States and Quantum Gates 2. Multiple Qubits and Entangled States 3. Quantum Gate Arrays 4. Quantum Parallelism 5. Examples of Quantum Algorithms 1. Grover s Unstructured Search
More informationIntroduction into Quantum Computations Alexei Ashikhmin Bell Labs
Introduction into Quantum Computations Alexei Ashikhmin Bell Labs Workshop on Quantum Computing and its Application March 16, 2017 Qubits Unitary transformations Quantum Circuits Quantum Measurements Quantum
More informationFigure 1: Circuit for Simon s Algorithm. The above circuit corresponds to the following sequence of transformations.
CS 94 //09 Fourier Transform, Period Finding and Factoring in BQP Spring 009 Lecture 4 Recap: Simon s Algorithm Recall that in the Simon s problem, we are given a function f : Z n Zn (i.e. from n-bit strings
More informationCHAPTER 2 AN ALGORITHM FOR OPTIMIZATION OF QUANTUM COST. 2.1 Introduction
CHAPTER 2 AN ALGORITHM FOR OPTIMIZATION OF QUANTUM COST Quantum cost is already introduced in Subsection 1.3.3. It is an important measure of quality of reversible and quantum circuits. This cost metric
More informationA scheme for protecting one-qubit information against erasure. error. Abstract
A scheme for protecting one-qubit information against erasure error Chui-Ping Yang 1, Shih-I Chu 1, and Siyuan Han 1 Department of Chemistry, University of Kansas, and Kansas Center for Advanced Scientific
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Toni Bluher Math Research Group, NSA 2018 Women and Mathematics Program Disclaimer: The opinions expressed are those of the writer and not necessarily those of NSA/CSS,
More informationOptimal Realizations of Controlled Unitary Gates
Optimal Realizations of Controlled nitary Gates Guang Song and Andreas Klappenecker Department of Computer Science Texas A&M niversity College Station, TX 77843-3112 {gsong,klappi}@cs.tamu.edu Abstract
More informationProjects about Quantum adder circuits Final examination June 2018 Quirk Simulator
Projects about Quantum adder circuits Final examination June 2018 Quirk Simulator http://algassert.com/2016/05/22/quirk.html PROBLEM TO SOLVE 1. The HNG gate is described in reference: Haghparast M. and
More informationQuantum Circuits and Algorithms
Quantum Circuits and Algorithms Modular Arithmetic, XOR Reversible Computation revisited Quantum Gates revisited A taste of quantum algorithms: Deutsch algorithm Other algorithms, general overviews Measurements
More informationGates for Adiabatic Quantum Computing
Gates for Adiabatic Quantum Computing Richard H. Warren Abstract. The goal of this paper is to introduce building blocks for adiabatic quantum algorithms. Adiabatic quantum computing uses the principle
More informationarxiv: v2 [quant-ph] 1 Jun 2017
arxiv:1611.07995v2 [quant-ph] 1 Jun 2017 FACTOING USING 2n + 2 QUBITS WITH TOFFOLI BASED MODULA MULTIPLICATION THOMAS HÄNEa Station Q Quantum Architectures and Computation Group, Microsoft esearch edmond,
More informationShor s Algorithm. Elisa Bäumer, Jan-Grimo Sobez, Stefan Tessarini May 15, 2015
Shor s Algorithm Elisa Bäumer, Jan-Grimo Sobez, Stefan Tessarini May 15, 2015 Integer factorization n = p q (where p, q are prime numbers) is a cryptographic one-way function Classical algorithm with best
More informationROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL
arxiv:quant-ph/0109016v2 2 Jul 2002 ROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL B. C. Travaglione, M. A. Nielsen Centre for Quantum Computer Technology, University of Queensland St Lucia, Queensland,
More informationIntroduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 71 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 8 (217) Jon Yard QNC 3126 jyard@uwaterloo.ca http://math.uwaterloo.ca/~jyard/qic71 1 Recap of: Eigenvalue
More informationProgress in Reversible Processor Design: A Novel Methodology for Reversible Carry Look-ahead Adder
Progress in Reversible Processor Design: A Novel Methodology for Reversible Carry Look-ahead Adder Himanshu Thapliyal #, Jayashree H.V *, Nagamani A. N *, Hamid R. Arabnia + # Department of Computer Science
More informationOptimized Reversible Programmable Logic Array (PLA)
Journal of Advances in Computer Research Quarterly ISSN: 28-6148 Sari Branch, Islamic Azad University, Sari, I.R.Iran (Vol. 4, No. 1, February 213), Pages: 81-88 www.jacr.iausari.ac.ir Optimized Reversible
More informationFast quantum modular exponentiation
PHYSICAL REVIEW A 71, 052320 2005 Fast quantum modular exponentiation Rodney Van Meter* and Kohei M. Itoh Graduate School of Science and Technology, Keio University and CREST-JST 3-14-1 Hiyoushi, Kohoku-ku,
More informationAn Architectural Framework For Quantum Algorithms Processing Unit (QAPU)
An Architectural Framework For Quantum s Processing Unit (QAPU) Mohammad Reza Soltan Aghaei, Zuriati Ahmad Zukarnain, Ali Mamat, and ishamuddin Zainuddin Abstract- The focus of this study is developing
More informationQuantum Computing Lecture Notes, Extra Chapter. Hidden Subgroup Problem
Quantum Computing Lecture Notes, Extra Chapter Hidden Subgroup Problem Ronald de Wolf 1 Hidden Subgroup Problem 1.1 Group theory reminder A group G consists of a set of elements (which is usually denoted
More informationMeasuring Spin-Lattice Relaxation Time
WJP, PHY381 (2009) Wabash Journal of Physics v4.0, p.1 Measuring Spin-Lattice Relaxation Time L.W. Lupinski, R. Paudel, and M.J. Madsen Department of Physics, Wabash College, Crawfordsville, IN 47933 (Dated:
More informationPrimality Test Via Quantum Factorization. Abstract
IASSNS-HEP-95/69; quant-ph:9508005 Primality Test Via Quantum Factorization H. F. Chau and H.-K. Lo School of Natural Sciences, Institute for Advanced Study, Olden Lane, Princeton, NJ 08540 (December 2,
More informationarxiv:quant-ph/ v1 14 Aug 2002
Tackling Systematic Errors in Quantum Logic Gates with Composite Rotations Holly K. Cummins, Gavin Llewellyn, and Jonathan A. Jones Λ Centre for Quantum Computation, Clarendon Laboratory, University of
More informationarxiv:quant-ph/ v2 23 Aug 2003
An Architecture of Deterministic Quantum Central Processing Unit arxiv:quant-ph/0207032v2 23 Aug 2003 Fei Xue a, Zeng-Bing Chen a Mingjun Shi a Xianyi Zhou a Jiangfeng Du a Rongdian Han a a Department
More informationIntroduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681
Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 48 / C&O 68 Lecture (2) Richard Cleve DC 27 cleve@cs.uwaterloo.ca Order-finding via eigenvalue estimation 2 Order-finding
More informationQuantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms Martin Roetteler, Michael Naehrig, Krysta M Svore, and Kristin Lauter Microsoft Research, USA Abstract We give precise quantum
More informationarxiv:quant-ph/ v1 8 Aug 1997
Quantum Algorithms Revisited arxiv:quant-ph/9708016v1 8 Aug 1997 By R. Cleve 1, A. Ekert, C. Macchiavello,3 and M. Mosca,4 Clarendon Laboratory, Department of Physics, University of Oxford, Parks Road,
More informationTHE RESEARCH OF QUANTUM PHASE ESTIMATION
THE RESEARCH OF QUANTUM PHASE ESTIMATION ALGORITHM Zhuang Jiayu 1,Zhao Junsuo,XuFanjiang, QiaoPeng& Hu Haiying 1 Science and Technology on Integrated Information System Laboratory, Institute of Software
More informationClassical RSA algorithm
Classical RSA algorithm We need to discuss some mathematics (number theory) first Modulo-NN arithmetic (modular arithmetic, clock arithmetic) 9 (mod 7) 4 3 5 (mod 7) congruent (I will also use = instead
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 8, August 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Efficient
More informationQuantum error correction in the presence of spontaneous emission
PHYSICAL REVIEW A VOLUME 55, NUMBER 1 JANUARY 1997 Quantum error correction in the presence of spontaneous emission M. B. Plenio, V. Vedral, and P. L. Knight Blackett Laboratory, Imperial College London,
More informationAn Analog Analogue of a Digital Quantum Computation
An Analog Analogue of a Digital Quantum Computation arxiv:quant-ph/9612026v1 6 Dec 1996 Edard Farhi Center for Theoretical Physics Massachusetts Institute of Technology Cambridge, MA 02139 Sam Gutmann
More informationarxiv: v2 [quant-ph] 14 May 2017
A Low-Overhead Hybrid Approach for Universal Fault-Tolerant Quantum Computation Eesa Nikahd, Morteza Saheb Zamani, and Mehdi Sedighi Quantum Design Automation Lab Amirkabir University of Technology, Tehran,
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
More informationTwo-Qubit Quantum Gates to Reduce the Quantum Cost of Reversible Circuit
11 41st IEEE International Symposium on Multiple-Valued Logic Two-Qubit Quantum Gates to Reduce the Quantum Cost of Reversible Circuit Md. Mazder Rahman, Anindita Banerjee, Gerhard W. Dueck, and Anirban
More informationDESIGN AND ANALYSIS OF A FULL ADDER USING VARIOUS REVERSIBLE GATES
DESIGN AND ANALYSIS OF A FULL ADDER USING VARIOUS REVERSIBLE GATES Sudhir Dakey Faculty,Department of E.C.E., MVSR Engineering College Abstract The goal of VLSI has remained unchanged since many years
More informationarxiv: v1 [quant-ph] 12 Aug 2013
On quantum circuits employing roots of the Pauli matrices Mathias Soeen, 1 D. Michael Miller, and Rolf Drechsler 1 1 Institute of Computer Science, niversity of Bremen, Germany Department of Computer Science,
More informationAPPLYING QUANTUM COMPUTER FOR THE REALIZATION OF SPSA ALGORITHM Oleg Granichin, Alexey Wladimirovich
APPLYING QUANTUM COMPUTER FOR THE REALIZATION OF SPSA ALGORITHM Oleg Granichin, Alexey Wladimirovich Department of Mathematics and Mechanics St. Petersburg State University Abstract The estimates of the
More informationAdvanced Cryptography Quantum Algorithms Christophe Petit
The threat of quantum computers Advanced Cryptography Quantum Algorithms Christophe Petit University of Oxford Christophe Petit -Advanced Cryptography 1 Christophe Petit -Advanced Cryptography 2 The threat
More informationMa/CS 6a Class 4: Primality Testing
Ma/CS 6a Class 4: Primality Testing By Adam Sheffer Reminder: Euler s Totient Function Euler s totient φ(n) is defined as follows: Given n N, then φ n = x 1 x < n and GCD x, n = 1. In more words: φ n is
More informationA brief survey on quantum computing
A brief survey on quantum computing Edward Poon University of Ottawa Edward Poon (Ottawa) A brief survey on quantum computing March 19, 2018 1 / 7 Outline Goal: Provide a high-level overview of what quantum
More informationFrom the Shortest Vector Problem to the Dihedral Hidden Subgroup Problem
From the Shortest Vector Problem to the Dihedral Hidden Subgroup Problem Curtis Bright December 9, 011 Abstract In Quantum Computation and Lattice Problems [11] Oded Regev presented the first known connection
More informationA Parallel Processing Algorithms for Solving Factorization and Knapsack Problems
www.ijcsi.org 246 A Parallel Processing Algorithms for Solving Factorization and Knapsack Problems G. Aloy Anuja Mary 1, J.Naresh 2 and C.Chellapan 3 1,2 Research Scholar,Department of Computer Science
More informationQuantum Computing: A Future Trends in Computing
Volume 3, No. 3, May-June 2012 International Journal of Advanced Research in Computer Science RESEARCH PAPER Available Online at www.ijarcs.info Quantum Computing: A Future Trends in Computing Amit V.Pandhare
More informationQuantum Algorithms Lecture #2. Stephen Jordan
Quantum Algorithms Lecture #2 Stephen Jordan Last Time Defined quantum circuit model. Argued it captures all of quantum computation. Developed some building blocks: Gate universality Controlled-unitaries
More informationPerfect quantum-error-correction coding in 24 laser pulses
PHYSICAL REVIEW A VOLUME 55, NUMBER 2 FEBRUARY 1997 Perfect quantum-error-correction coding in 24 laser pulses Samuel L. Braunstein Universität Ulm, Abteilung Quantenphysik, 89069 Ulm, Germany and SEECS,
More informationEfficient Circuit Design of Reversible Square
Efficient Circuit Design of Reversible Square H.V. Jayashree 1, Himanshu Thapliyal 2(B), and Vinod Kumar Agrawal 3 1 Department of Electronics and Communication Engineering, PES Institute of Technology,
More informationImitating quantum mechanics: Qubit-based model for simulation
Imitating quantum mechanics: Qubit-based model for simulation Steven Peil nited States Naval Observatory, Washington, DC 2392, SA Received 26 November 27; revised manuscript received 6 January 29; published
More informationCS257 Discrete Quantum Computation
CS57 Discrete Quantum Computation John E Savage April 30, 007 Lect 11 Quantum Computing c John E Savage Classical Computation State is a vector of reals; e.g. Booleans, positions, velocities, or momenta.
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part II Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 13, 2011 Overview Outline Grover s Algorithm Quantum search A worked example Simon s algorithm
More informationQuantum Switching Networks with Classical Routing
Quantum Switching Networks with Classical Routing Rahul Ratan, Manish Kumar Shukla, A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park, MD 0 Email: [rahulr,
More information