Quantum computing simulation through reduction and decomposition optimizations with a case study of Shor's algorithm

2016 ◽  
Vol 29 (22) ◽  
pp. e3961 ◽  
Author(s):  
Anderson B. de Avila ◽  
Renata H. S. Reiser ◽  
Mauricio L. Pilla



2014 ◽  
Vol 14 (9&10) ◽  
pp. 763-776
Author(s):  
Omar Gamel ◽  
Daniel F.V. James

Periodic functions are of special importance in quantum computing, particularly in applications of Shor's algorithm. We explore methods of creating circuits for periodic functions to better understand their properties. We introduce a method for constructing the circuit for a simple monoperiodic function, that is one-to-one within a single period, of a given period $p$. We conjecture that to create a simple periodic function of period $p$, where $p$ is an $n$-bit number, one needs at most $n$ Toffoli gates.



2020 ◽  
Vol 61 ◽  
pp. 101961 ◽  
Author(s):  
Steve Harris ◽  
Anthony Trippe ◽  
David Challis ◽  
Nigel Swycher


Quantum machine learning is the combination of quantum computing and classical machine learning. It helps in solving the problems of one field to another field. Shor’s algorithm is used for factoring the integers in polynomial time. Since the bestknown classical algorithm requires super polynomial time to factor the product of two primes, the widely used cryptosystem, RSA, relies on factoring being impossible for large enough integers. In this paper we will focus on the quantum part of Shor’s algorithm, which actually solves the problem of period finding. In polynomial time factoring problem can be turned into a period finding problem so an efficient period finding algorithm can be used to factor integers efficiently.



Author(s):  
M. Suhail Zubairy

This chapter deals with some of the most prominent successes of quantum computing. The most well-known quantum computing algorithm, Shor’s algorithm for factoring a number in its prime factors, is discussed in details. The key to Shor’s algorithm is the quantum Fourier transform that is explained with the help of simple examples. The role of quantum entanglement is also discussed. The next important quantum computing algorithm is Grover’s algorithm that helps in searching an item in an unsorted database. This algorithm is motivated by first discussing a quantum shell game in which a pea hidden under one of the four shells is found in one measurement with certainty each time. This amazing result is then generalized to an arbitrary number of objects and Grover’s algorithm.





Sign in / Sign up

Export Citation Format

Share Document