Questions tagged [shors-algorithm]

Shor's algorithm, named after American mathematician Peter Shor, is a quantum algorithm for integer factorization, formulated in 1994. Informally, it solves the following problem: given an integer N, find its prime factors.

Filter by
Sorted by
Tagged with
1
vote
1answer
30 views

Does Toffoli AND conjugate affect superposition if used in Shor's algorithm?

I have come across several papers that use Toffoli AND conjugate to minimize the T-depth. But since it contains a measurement, does it affect Shor's algorithm (in terms of interference, entanglement, ...
3
votes
1answer
65 views

Logical bit-flip and Phase-flip operators of Shor’s 9-qubit code

The logical basis states of the Shor’s 9-qubit code are given by $|0_L\rangle = \frac{(|000\rangle+|111\rangle)(|000\rangle+|111\rangle)(|000\rangle+|111\rangle)}{2\sqrt{2}}, |1_L\rangle = \frac{(|000\...
1
vote
1answer
60 views

What is the largest number factored by the IBM Quantum simulators?

Though a lot of papers talk about the largest factored number by Shor's Algorithm, I want to know the largest one factored by the IBM Quantum, for example, the simulator_mps. I am able to use it to ...
5
votes
1answer
68 views

Continued fractions with Shor's algorithm: which convergent?

Suppose I am using Shor's order finding algorithm to calculate the order $r$ of $x\leq N$ with respect to $N$. After some run of the QPE subroutine, I obtain a good, $L$-bit approximation to $s/r$ for ...
0
votes
1answer
43 views

Quantum Fourier Transform in the Period Finding Problem

I am trying to prove that when applying the inverse QFT to the following state: we get the following result: However, I get a wrong prefactor. Can anyone tell me where I went wrong? Here my ...
3
votes
0answers
43 views

Shor vs Schnorr: A classical algorithm for breaking RSA? [duplicate]

I am not sure why I haven't heard much chatter about this paper by Dr. Claus Peter Schnorr where he claims to have come up with a classical algorithm to break the RSA protocol. The construction is ...
7
votes
1answer
242 views

Classical algorithm with complexity similar to Shor's discovered: Are there more efficient quantum algorithms than Shor's?

In the article Fast Factoring Integers by SVP Algorithms the author claims that he discovered classical algorithm for factoring integers in polynomial time. The Quantum Report mentioned here that it ...
-4
votes
1answer
50 views

Can I have access to break my Windows BitLocker key [closed]

Is it possible to have access to a quantum computer to break a BitLocker key (maybe with Shor's algorithm) and have access to my data? Here what happened to me: after I've changed my LENOVO X270 ...
6
votes
1answer
49 views

How does the subtraction gate work in Fourier space

I am currently reading Shor's algorithm on my own and I come across a paper via this link. It shows the circuit for implementing Shor's alogrithm. Here it depicts that taking a QFT circuit on the ...
4
votes
1answer
126 views

Shor's algorithm - modular exponentiation and Quantum Fourier transform and quantum phase estimation method

I have a question about Shor's algorithm with respect to the eigenvector representation of the second (lower) register. In the following I use the notation of Nielsen, M., Chuang, I., 2016, Quantum ...
4
votes
1answer
124 views

Why is the superposition of all states an eigenvector, with eigenvalue 1, of the QFT?

In many descriptions of order finding, but also in this answer here, it is shown that the superposition of all states is an eigenvector for eigenvalue 1.0. To cite: Having found the eigenvalues, we ...
2
votes
1answer
83 views

Can I access device specifications of IBMQ paying devices?

I need to perform some tests for my thesis in real quantum computers, however, I only have access to IBM's free quantum devices (the maximum number of qubits I can use is 15, in ...
2
votes
1answer
50 views

Unitary Operator impact on both - the Control Qubit and the Target Register in Shor's Algorithm

I read the details of Shor's algorithm implementation at the link https://qiskit.org/textbook/ch-algorithms/shor.html#2.-The-Solution and had a question. As a concept, when Unitary is applied with a ...
0
votes
1answer
72 views

Braket and Q# Simulators

I have implemented Shor's algorithm in Qiskit, and everything works as expected within the IBM Q experience for both the IBM qasm_simulator and real hardware. However, after I've implemented Shors in ...
7
votes
0answers
105 views

What is stopping FACTORING from being BQP-complete?

Classical complexity theory makes much of the study of so-called intermediate problems - that is, problems that are in $\mathsf{NP}$ but are nonetheless not known to be in $\mathsf{P}$ and further not ...
2
votes
1answer
70 views

How does this represent modular multiplication

How does this circuit map $|x\rangle$ to $|7x \space mod15\rangle$? Looking into Shor's and I thought that phase kickback causes the modular exponentiation part to be mapped onto the measurement ...
1
vote
2answers
63 views

Shor's implementation problem on qiskit

If q4-7 are all supposed to be eigenstates of the operation, why is it just that q7 is in $|1\rangle$? Shouldn't all qubits 4 to ...
2
votes
1answer
57 views

How to show that amount of qubits needed to crack the RSA-2048 protocol using Shor's algorithm?

I've read that under current technology we would need around 20 million qubits to crack the RSA-2048 protocol. How would one prove this?
1
vote
1answer
38 views

How to build an example of Shor's algorithm for the discrete log?

I have been trying to build myself an example of Shor's computations for the discrete log. I started out with this objective and I realized I should understand the factorization first, which I did ...
3
votes
1answer
134 views

Shor's algorithm: what to do after reading the QFT's result twice?

I asked about how to identify the period looking at a Fourier transform plot. The answer seems to be to run the fourier transform multiple times getting multiple values associated to high ...
3
votes
1answer
63 views

What are the interesting spikes in this after-QFT graph (page 241) of Programming Quantum Computers?

I'm reading Programming Quantum Computers trying to understand Shor's algorithm. I learned there that we prepare a state $|x^i \bmod N\rangle$, then apply the QFT to this state. The QFT changes the ...
2
votes
0answers
39 views

Is there an example of Shor's algorithm for the discrete log problem with concrete numbers anywhere?

I understand the problem well enough and I'm trying to understand the algorithm, Shor's version. It's not easy to read the abstract descriptions available everywhere --- Shor's paper, Nielsen's book ...
1
vote
1answer
200 views

Simplifying Qiskit circuit with c_if()

I'm trying to simplify the inner for loop of this implementation of the Mosca-Ekert semi-classical variant of Shor's algorithm. The inner for loop should have only linear length, but this ...
7
votes
3answers
283 views

Shor's algorithm: initialization of second register

I am trying to understand Shor's algorithm. I am not quite sure why the initialization, indicated as $|1\rangle$ in the below image at the bottom left is chosen as it is? I understand the modular ...
6
votes
1answer
87 views

What is a maximal number factored by Shor's algorithm so far?

With reference to a similar question here, I would like to know what is the maximal number which has been factored with Shor's algorithm so far on actual quantum hardware. The reason I am asking a ...
3
votes
0answers
57 views

Abelian Hidden Subgroup Problem for arbitrary cyclic p-Groups

I had asked a question similar to this one here regarding how to handle the HSP for groups whose cyclic decomposition contains factors whose order is not a power of two. I also had some prior ...
4
votes
1answer
108 views

How to write a classical version of Shor's algorithm

For learning purposes, I would like to write a classical version of Shor's algorithm. From what I have read, what makes this algorithm fast is the quantum FFT, which is used to find the period of the ...
3
votes
1answer
250 views

Problem with Shor's factoring algorithm [closed]

I'm trying to figure out the Shor's factoring algorithm. References i've been using wikipedia page, the book Quantum Computer Science by David Mermin and the orignal paper(1996) By Peter Shor. I ...
2
votes
2answers
62 views

In Shor's algorithm, how can we guarantee that each controlled-U will kickback to the same eigenvalue?

I'm studying the Shor algorithm as part of my thesis and have a question about the "measured" phases after the QPE. So, I take the controlled-U operations on the second register and in cause ...
2
votes
1answer
116 views

Constructing arbitrary functions for the Abelian HSP

My question might be similar to Hidden subgroup problem. However, I'm not exactly sure though. In addition, that question doesn't have an answer. I'm trying to create some simple instances of the ...
3
votes
1answer
68 views

Eigenvectors and eigenvalues of the gate $U_a:|s\rangle\mapsto|sa \bmod N\rangle$

I'm studying Shor algorithm. This is a demostration about the eigenvectors and eigenvalues of $U_a$ gate: Can somebody explain me from the third step to the last?
3
votes
1answer
74 views

Why can I use the Sum of Eigenvectors for Phase Estimation in Shor

In phase estimation, we start by using an eigenvector $\newcommand{\ket}[1]{\lvert#1\rangle}\ket u$ to find the corresponding eigenvalue lambda. So far so good. In the order finding algorithm, we also ...
5
votes
2answers
93 views

Is there a general order finding quantum algorithm for a given a and N?

I'm trying to construct a general circuit for Shor's algorithm in Qiskit. I understood the later parts of the circuit (inverse QFT and QPE), but can't really understand the order finding. For example, ...
2
votes
1answer
133 views

How to implement Cx mod N unitary

The following links provides circuts for $a\in\{2,7,8,11,13\}$ and $N=15$: https://qiskit.org/textbook/ch-algorithms/shor.html#3.-Qiskit-Implementation https://arxiv.org/abs/1202.6614v3. I am ...
4
votes
1answer
151 views

Energy cost of quantum computation

A quantum computer can be modeled as a single unitary transition of a (large) effective quantum state to another. In order to get errors under control, quantum error correction is assumed. A logical ...
2
votes
2answers
129 views

Shor's Discrete Logarithm Algorithm with a QFT with a small prime base

Suppose you replace both QFTs in Shor's discrete logarithm algorithm with simpler QFTs with small prime base w. Does this algorithm extract the discrete logarithm modulo w? It seems it does, provided ...
7
votes
1answer
86 views

What are the thermodynamic limits of Shor's algorithm

The asymptotic time complexity of Grover's algorithm is the square root of the time of a brute force algorithm. However, according to Perlner and Liu, the thermodynamic behavior (theoretical minimum ...
0
votes
0answers
23 views

Questions on May & Schlieper's “Quantum Period Finding is Compression Robust”

https://arxiv.org/abs/1905.10074 https://crypto.stanford.edu/~dabo/pubs/abstracts/quantum.html Below are a few questions about May and Schlieper's paper "Quantum Period Finding is Compression Robust"...
1
vote
1answer
113 views

Building the period-finding circuit for Shor's Algorithm & the classical complexity of finding the period

I've been trying to learn about Shor's algorithm by writing out implementations of the circuit for modular exponentiation, ${ a }^{ x }\; ({ mod }\; N)$, to find the period $r$ for small numbers such ...
5
votes
1answer
139 views

Question Regarding Quantum Period-Finding Fourier Transform Approximation

I am following the 5.4.1 Period-Finding Algorithm in Nielsen and Chuang as shown below: My confusion lies with the second expression of point 3 in the procedure. Why is the second expression an ...
1
vote
1answer
100 views

Quantum Phase Estimation Circuit and Modular Exponentiaton

In Nielsen and Chuang, it is stated that the effect of phase estimation circuit is mapping state $|j\rangle |u\rangle$ to $|j\rangle U^j |u\rangle$. Here is my solution: Consider the first $CU^{2^0}...
2
votes
2answers
146 views

Quantum computers don't try all the possible solutions, so how does the QFT really work?

Scott Aaronson is fond of saying "Quantum computers do not solve hard search problems instantaneously by simply trying all the possible solutions at once." That is, they are not non-deterministic ...
3
votes
5answers
208 views

Any other quantum algorithms than Jozsa-Deutsch decision algorithm, Grover search algorithm, Shor factorization algorithm?

I have been working on implementing Jozsa-Deutsch decision algorithm, Grover search algorithm, Shor factorization algorithm on my home-made 2 qubits device. I am wondering if there are any other ...
3
votes
2answers
160 views

What is Quantum Phase Estimation in Shor's Algorithm?

While I'm studying Algorithm, I couldn't understand what Quantum Phase Estimation is. And I heard there is relation between Phase-Kickback and Quantum Phase Estimation. I wonder what it is. Also, I'm ...
9
votes
3answers
608 views

Does the quantum Fourier transform have many applications beyond period finding?

(This is a somewhat soft question.) The quantum Fourier transform is formally quite similar to the fast Fourier transform, but exponentially faster. The QFT is famously at the core of Shor's ...
2
votes
1answer
121 views

Shor algorithm - how to obtain a period from diagram?

I'm studying shor's algorithm. I implemented in Qiskit and apriori I know that a period is 3 in my example. However, unless I know about period, how to obtain this period only according to seeing ...
1
vote
1answer
143 views

When increase the shot, why the result is different?

when I measure the shot = 1024 when I measure the shot = 8192 I want to derive result value 011(=3) However, I know if measure the more shots, increase the accuracy. why this result derive??? why ...
4
votes
1answer
123 views

What do empty white circles mean in a quantum circuit?

I'm studying Shor's algorithm. but I see from the beginning this empty circle. what this circle means??
3
votes
1answer
375 views

Implementing QFT for Shor's Algorithm?

I'm studying Shor's algorithm. This diagram shows a calculation of $4^x\mod21$. I don't understand how this expresses $4^x \mod21$. Could you explain this? For example, by showing another calculation ...
1
vote
1answer
112 views

How to implement modular exponentiation efficiently in Shor's algorithm?

I'm a noob in quantum computing and I'm trying to get Shor's algorithm working on Q# (the language is unrelated). However, I'm stuck on computing $f(x)$s in the quantum circuit. Let $N\sim \log_2(n)$ ...