• Keine Ergebnisse gefunden

2 Factorization Algorithm . . . [6P]

N/A
N/A
Protected

Academic year: 2022

Aktie "2 Factorization Algorithm . . . [6P]"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

University of Regensburg WS 2019/20

Quantum Information Theory

Prof. John Schliemann Tue. H33 13pm c.t. &Thu. H34, 3pm c.t.

Dr. Paul Wenk Mon. 12pm c.t., H33

Sheet 8

1 Period Finding . . . [10P]

One important application of the QFT is in Shoer’s factorization algorithm. Assume a system consisting of two 3-qubit systems which are an input register (|Ini) and an output register (|Outi). The computational basis of each 3-qubit system is the orthogonal basis{|0i ≡ |000i,|1i ≡ |001i. . . ,|7i ≡ |111i}.

(a) Let the initial input register be

|Ini= 1

√8

7

X

x=0

|xi . (1)

Following the lecture, we apply now Uf on the total initial state,

|ψi=Uf

√1 8

7

X

x=0

|xi |0i= 1

√8

7

X

x=0

|x, f(x)i , (2)

with f(x) a periodic, non-constant function satisfying f(x+ 2) = f(x). Show that if we measure the first register after we applied the QFT to it, we are left with only two distinct results. This is a direct consequence of the periodicity.

(b) Now, we generalize the above result to a system with each register being an N-qubit system and f(x) having a period of P. Further, assume we apply the procedure corresponding to (a). Let the outcome of a measurement of the first register after this procedure beξ. Show that

ξ∈n

0, 1·2N

P , 2·2N

P , . . . ,(P−1)·2N P

o

with 2N/P ∈N. (3)

Hint: Say you have an arbitrary function g(x) and you want to calculate P

xg(x). How to rewrite this sum into two sumsP

l,kg(kP+l)? Apply this separation to use the periodicity to simplify the expression.

2 Factorization Algorithm . . . [6P]

In the lecture a prime factoring algorithm has been presented. Apply this algorithm toN = 35. To simplify it:

Choose in the first step a randommwhere the order is less than 10.

3 RSA Cryptosystem . . . [5P]

Show in thin mini-example how the RSA cryptosystem works by encrypting the message “13” withN =pq= 15 and the random numbere= 3 and decoding it again.

(2)

4 Josephson Junction . . . [12P]

One possible building block for the realization of quantum computers are Josephson junctions. Here, we would like to derive the Hamiltonian describing the Josephson junction starting with the Josephson equations

dQ

dt = −Iext+Icsin(φ), (4)

dt = −2e

~

V , (5)

whereQ=−2eN =CV,−ethe electron charge,φ=θ2−θ2the difference in the phases of the order parameters, N the number of Cooper pairs,Ic the critical current andIext the external current.

(a) Write down the Euler-Lagrange equation which follows from the Josephson equations and deduce the Lagrangian L. Hint: Recall that the electrostatic energy is given byCV2/2.

(b) Write down the classical Hamiltonian function. What is the meaning of the conjugate momentumπtoφ?

(c) By imposing the canonical commutation relation [π, φ] =~/ishow that we end up with the Hamiltonian H = −EC

2 d2

2 −EJcos(φ)−EJ

Iext

Ic φ . (6)

(d) What are the general solutions of Eq. (6) ifIext= 0?

Referenzen

ÄHNLICHE DOKUMENTE

Das diesem Dokument zugrundeliegende Vorhaben wurde mit Mitteln des Bundesministeriums für Bildung und Forschung.. unter dem Förderkennzeichen

• Register Allocation: Determine which variables are implemented by registers at which positions.. • Register Assignment: Determine which register implements which variable at

Register allocation by graph coloring is a procedure (with many variants) for allocation of registers beyond expressions and basic blocks. Register Allocation

Handels-Abgaben, Reglement für das Comptoir zur Erhebung derselben.. Handels-Abgaben, Revision im Jahre 1867 und spätere

[r]

© Copyright: Department for Northern European Studies Berlin and authors.. Die Geschichte eines

Kolksche Methode zur Bestimmung der Brechung 114..

These included compile-time and link-time schemes for allocating 52 registers, and register window schemes using 128 registers organized into fixed-size or variable-sized