Skip to content

Commit 95ab3d3

Browse files
mhjensenmhjensen
committed
week 14
1 parent aaead69 commit 95ab3d3

File tree

7 files changed

+40
-298
lines changed

7 files changed

+40
-298
lines changed

‎doc/pub/week14/html/week14-bs.html‎

Lines changed: 8 additions & 57 deletions
Original file line numberDiff line numberDiff line change
@@ -36,27 +36,10 @@
3636

3737
<!-- tocinfo
3838
{'highest level': 2,
39-
'sections': [('Plans for the week of April 22-26',
39+
'sections': [('Plans for the week of April 28-May 2',
4040
2,
4141
None,
42-
'plans-for-the-week-of-april-22-26'),
43-
('Brief reminder on Quantum Phase Estimation algorithm',
44-
2,
45-
None,
46-
'brief-reminder-on-quantum-phase-estimation-algorithm'),
47-
('Basics of encryption algorithm, classical background, '
48-
'factoring',
49-
2,
50-
None,
51-
'basics-of-encryption-algorithm-classical-background-factoring'),
52-
('Basics of encryption algorithm, classical background',
53-
2,
54-
None,
55-
'basics-of-encryption-algorithm-classical-background'),
56-
("QPE and Shor's algorithm",
57-
2,
58-
None,
59-
'qpe-and-shor-s-algorithm')]}
42+
'plans-for-the-week-of-april-28-may-2')]}
6043
end of tocinfo -->
6144

6245
<body>
@@ -75,11 +58,7 @@
7558
<li class="dropdown">
7659
<a href="#" class="dropdown-toggle" data-toggle="dropdown">Contents <b class="caret"></b></a>
7760
<ul class="dropdown-menu">
78-
<!-- navigation toc: --> <li><a href="#plans-for-the-week-of-april-22-26" style="font-size: 80%;">Plans for the week of April 22-26</a></li>
79-
<!-- navigation toc: --> <li><a href="#brief-reminder-on-quantum-phase-estimation-algorithm" style="font-size: 80%;">Brief reminder on Quantum Phase Estimation algorithm</a></li>
80-
<!-- navigation toc: --> <li><a href="#basics-of-encryption-algorithm-classical-background-factoring" style="font-size: 80%;">Basics of encryption algorithm, classical background, factoring</a></li>
81-
<!-- navigation toc: --> <li><a href="#basics-of-encryption-algorithm-classical-background" style="font-size: 80%;">Basics of encryption algorithm, classical background</a></li>
82-
<!-- navigation toc: --> <li><a href="#qpe-and-shor-s-algorithm" style="font-size: 80%;">QPE and Shor's algorithm</a></li>
61+
<!-- navigation toc: --> <li><a href="#plans-for-the-week-of-april-28-may-2" style="font-size: 80%;">Plans for the week of April 28-May 2</a></li>
8362

8463
</ul>
8564
</li>
@@ -105,55 +84,27 @@ <h1>Quantum Computing, Quantum Machine Learning and Quantum Information Theories
10584
</center>
10685
<br>
10786
<center>
108-
<h4>April 24</h4>
87+
<h4>April 30</h4>
10988
</center> <!-- date -->
11089
<br>
11190

11291
<!-- potential-jumbotron-button -->
11392
</div> <!-- end jumbotron -->
11493

11594
<!-- !split -->
116-
<h2 id="plans-for-the-week-of-april-22-26" class="anchor">Plans for the week of April 22-26 </h2>
95+
<h2 id="plans-for-the-week-of-april-28-may-2" class="anchor">Plans for the week of April 28-May 2 </h2>
11796

11897
<div class="panel panel-default">
11998
<div class="panel-body">
12099
<!-- subsequent paragraphs come in larger fonts, so start with a paragraph -->
100+
<p> O TBA</p>
121101
<ol>
122-
<li> Discussion of project 2</li>
123-
<li> Summary of quantum phase estimation algorithm</li>
124-
<li> Discussion of various quantum algorithms, see Hundt sections 6.4-6.6</li>
125-
<li> Reading suggestions: Hundt sections 6.4-6.6 and Nielsen and Chuang, sections 5.2-5.3</li>
126-
<li> <a href="https://youtu.be/OZdyky8UYdk" target="_self">Video of lecture at</a></li>
127-
<li> <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/HandWrittenNotes/2024/NotesApril24.pdf" target="_self">Whiteboard notes</a></li>
102+
<li> <a href="https://youtu.be/" target="_self">Video of lecture TBA</a>
103+
<!-- o <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/HandWrittenNotes/2024/NotesApril24.pdf" target="_self">Whiteboard notes</a> --></li>
128104
</ol>
129105
</div>
130106
</div>
131107

132-
133-
<!-- !split -->
134-
<h2 id="brief-reminder-on-quantum-phase-estimation-algorithm" class="anchor">Brief reminder on Quantum Phase Estimation algorithm </h2>
135-
136-
<!-- !split -->
137-
<h2 id="basics-of-encryption-algorithm-classical-background-factoring" class="anchor">Basics of encryption algorithm, classical background, factoring </h2>
138-
139-
<p>Probably the most important quantum algorithm so far is Shor&#8217;s factoring algorithm [228]. It can
140-
find a factor of a composite number N in roughly (log N)2
141-
steps, which is polynomial in the length
142-
log N of the input. On the other hand, there is no known classical (deterministic or randomized)
143-
algorithm that can factor N in polynomial time.
144-
</p>
145-
146-
<!-- !split -->
147-
<h2 id="basics-of-encryption-algorithm-classical-background" class="anchor">Basics of encryption algorithm, classical background </h2>
148-
149-
<!-- !split -->
150-
<h2 id="qpe-and-shor-s-algorithm" class="anchor">QPE and Shor's algorithm </h2>
151-
152-
<p>The crucial observation of Shor was that there is an efficient quantum algorithm for the problem
153-
of period-finding and that factoring can be reduced to this, in the sense that an efficient algorithm
154-
for period-finding implies an efficient algorithm for factoring
155-
</p>
156-
157108
<!-- ------------------- end of main content --------------- -->
158109
</div> <!-- end container -->
159110
<!-- include javascript, jQuery *first* -->

‎doc/pub/week14/html/week14-reveal.html‎

Lines changed: 5 additions & 36 deletions
Original file line numberDiff line numberDiff line change
@@ -165,7 +165,7 @@ <h1 style="text-align: center;">Quantum Computing, Quantum Machine Learning and
165165
</center>
166166
<br>
167167
<center>
168-
<h4>April 24</h4>
168+
<h4>April 30</h4>
169169
</center> <!-- date -->
170170
<br>
171171

@@ -176,50 +176,19 @@ <h4>April 24</h4>
176176
</section>
177177

178178
<section>
179-
<h2 id="plans-for-the-week-of-april-22-26">Plans for the week of April 22-26 </h2>
179+
<h2 id="plans-for-the-week-of-april-28-may-2">Plans for the week of April 28-May 2 </h2>
180180

181181
<div class="alert alert-block alert-block alert-text-normal">
182182
<b></b>
183183
<p>
184+
<p> O TBA</p>
184185
<ol>
185-
<p><li> Discussion of project 2</li>
186-
<p><li> Summary of quantum phase estimation algorithm</li>
187-
<p><li> Discussion of various quantum algorithms, see Hundt sections 6.4-6.6</li>
188-
<p><li> Reading suggestions: Hundt sections 6.4-6.6 and Nielsen and Chuang, sections 5.2-5.3</li>
189-
<p><li> <a href="https://youtu.be/OZdyky8UYdk" target="_blank">Video of lecture at</a></li>
190-
<p><li> <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/HandWrittenNotes/2024/NotesApril24.pdf" target="_blank">Whiteboard notes</a></li>
186+
<p><li> <a href="https://youtu.be/" target="_blank">Video of lecture TBA</a>
187+
<!-- o <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/HandWrittenNotes/2024/NotesApril24.pdf" target="_blank">Whiteboard notes</a> --></li>
191188
</ol>
192189
</div>
193190
</section>
194191

195-
<section>
196-
<h2 id="brief-reminder-on-quantum-phase-estimation-algorithm">Brief reminder on Quantum Phase Estimation algorithm </h2>
197-
</section>
198-
199-
<section>
200-
<h2 id="basics-of-encryption-algorithm-classical-background-factoring">Basics of encryption algorithm, classical background, factoring </h2>
201-
202-
<p>Probably the most important quantum algorithm so far is Shor&#8217;s factoring algorithm [228]. It can
203-
find a factor of a composite number N in roughly (log N)2
204-
steps, which is polynomial in the length
205-
log N of the input. On the other hand, there is no known classical (deterministic or randomized)
206-
algorithm that can factor N in polynomial time.
207-
</p>
208-
</section>
209-
210-
<section>
211-
<h2 id="basics-of-encryption-algorithm-classical-background">Basics of encryption algorithm, classical background </h2>
212-
</section>
213-
214-
<section>
215-
<h2 id="qpe-and-shor-s-algorithm">QPE and Shor's algorithm </h2>
216-
217-
<p>The crucial observation of Shor was that there is an efficient quantum algorithm for the problem
218-
of period-finding and that factoring can be reduced to this, in the sense that an efficient algorithm
219-
for period-finding implies an efficient algorithm for factoring
220-
</p>
221-
</section>
222-
223192

224193

225194
</div> <!-- class="slides" -->

‎doc/pub/week14/html/week14-solarized.html‎

Lines changed: 7 additions & 52 deletions
Original file line numberDiff line numberDiff line change
@@ -63,27 +63,10 @@
6363

6464
<!-- tocinfo
6565
{'highest level': 2,
66-
'sections': [('Plans for the week of April 22-26',
66+
'sections': [('Plans for the week of April 28-May 2',
6767
2,
6868
None,
69-
'plans-for-the-week-of-april-22-26'),
70-
('Brief reminder on Quantum Phase Estimation algorithm',
71-
2,
72-
None,
73-
'brief-reminder-on-quantum-phase-estimation-algorithm'),
74-
('Basics of encryption algorithm, classical background, '
75-
'factoring',
76-
2,
77-
None,
78-
'basics-of-encryption-algorithm-classical-background-factoring'),
79-
('Basics of encryption algorithm, classical background',
80-
2,
81-
None,
82-
'basics-of-encryption-algorithm-classical-background'),
83-
("QPE and Shor's algorithm",
84-
2,
85-
None,
86-
'qpe-and-shor-s-algorithm')]}
69+
'plans-for-the-week-of-april-28-may-2')]}
8770
end of tocinfo -->
8871

8972
<body>
@@ -102,51 +85,23 @@ <h1>Quantum Computing, Quantum Machine Learning and Quantum Information Theories
10285
</center>
10386
<br>
10487
<center>
105-
<h4>April 24</h4>
88+
<h4>April 30</h4>
10689
</center> <!-- date -->
10790
<br>
10891

10992
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
110-
<h2 id="plans-for-the-week-of-april-22-26">Plans for the week of April 22-26 </h2>
93+
<h2 id="plans-for-the-week-of-april-28-may-2">Plans for the week of April 28-May 2 </h2>
11194

11295
<div class="alert alert-block alert-block alert-text-normal">
11396
<b></b>
11497
<p>
98+
<p> O TBA</p>
11599
<ol>
116-
<li> Discussion of project 2</li>
117-
<li> Summary of quantum phase estimation algorithm</li>
118-
<li> Discussion of various quantum algorithms, see Hundt sections 6.4-6.6</li>
119-
<li> Reading suggestions: Hundt sections 6.4-6.6 and Nielsen and Chuang, sections 5.2-5.3</li>
120-
<li> <a href="https://youtu.be/OZdyky8UYdk" target="_blank">Video of lecture at</a></li>
121-
<li> <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/HandWrittenNotes/2024/NotesApril24.pdf" target="_blank">Whiteboard notes</a></li>
100+
<li> <a href="https://youtu.be/" target="_blank">Video of lecture TBA</a>
101+
<!-- o <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/HandWrittenNotes/2024/NotesApril24.pdf" target="_blank">Whiteboard notes</a> --></li>
122102
</ol>
123103
</div>
124104

125-
126-
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
127-
<h2 id="brief-reminder-on-quantum-phase-estimation-algorithm">Brief reminder on Quantum Phase Estimation algorithm </h2>
128-
129-
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
130-
<h2 id="basics-of-encryption-algorithm-classical-background-factoring">Basics of encryption algorithm, classical background, factoring </h2>
131-
132-
<p>Probably the most important quantum algorithm so far is Shor&#8217;s factoring algorithm [228]. It can
133-
find a factor of a composite number N in roughly (log N)2
134-
steps, which is polynomial in the length
135-
log N of the input. On the other hand, there is no known classical (deterministic or randomized)
136-
algorithm that can factor N in polynomial time.
137-
</p>
138-
139-
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
140-
<h2 id="basics-of-encryption-algorithm-classical-background">Basics of encryption algorithm, classical background </h2>
141-
142-
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
143-
<h2 id="qpe-and-shor-s-algorithm">QPE and Shor's algorithm </h2>
144-
145-
<p>The crucial observation of Shor was that there is an efficient quantum algorithm for the problem
146-
of period-finding and that factoring can be reduced to this, in the sense that an efficient algorithm
147-
for period-finding implies an efficient algorithm for factoring
148-
</p>
149-
150105
<!-- ------------------- end of main content --------------- -->
151106
<center style="font-size:80%">
152107
<!-- copyright --> &copy; 1999-2024, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license

‎doc/pub/week14/html/week14.html‎

Lines changed: 7 additions & 52 deletions
Original file line numberDiff line numberDiff line change
@@ -140,27 +140,10 @@
140140

141141
<!-- tocinfo
142142
{'highest level': 2,
143-
'sections': [('Plans for the week of April 22-26',
143+
'sections': [('Plans for the week of April 28-May 2',
144144
2,
145145
None,
146-
'plans-for-the-week-of-april-22-26'),
147-
('Brief reminder on Quantum Phase Estimation algorithm',
148-
2,
149-
None,
150-
'brief-reminder-on-quantum-phase-estimation-algorithm'),
151-
('Basics of encryption algorithm, classical background, '
152-
'factoring',
153-
2,
154-
None,
155-
'basics-of-encryption-algorithm-classical-background-factoring'),
156-
('Basics of encryption algorithm, classical background',
157-
2,
158-
None,
159-
'basics-of-encryption-algorithm-classical-background'),
160-
("QPE and Shor's algorithm",
161-
2,
162-
None,
163-
'qpe-and-shor-s-algorithm')]}
146+
'plans-for-the-week-of-april-28-may-2')]}
164147
end of tocinfo -->
165148

166149
<body>
@@ -179,51 +162,23 @@ <h1>Quantum Computing, Quantum Machine Learning and Quantum Information Theories
179162
</center>
180163
<br>
181164
<center>
182-
<h4>April 24</h4>
165+
<h4>April 30</h4>
183166
</center> <!-- date -->
184167
<br>
185168

186169
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
187-
<h2 id="plans-for-the-week-of-april-22-26">Plans for the week of April 22-26 </h2>
170+
<h2 id="plans-for-the-week-of-april-28-may-2">Plans for the week of April 28-May 2 </h2>
188171

189172
<div class="alert alert-block alert-block alert-text-normal">
190173
<b></b>
191174
<p>
175+
<p> O TBA</p>
192176
<ol>
193-
<li> Discussion of project 2</li>
194-
<li> Summary of quantum phase estimation algorithm</li>
195-
<li> Discussion of various quantum algorithms, see Hundt sections 6.4-6.6</li>
196-
<li> Reading suggestions: Hundt sections 6.4-6.6 and Nielsen and Chuang, sections 5.2-5.3</li>
197-
<li> <a href="https://youtu.be/OZdyky8UYdk" target="_blank">Video of lecture at</a></li>
198-
<li> <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/HandWrittenNotes/2024/NotesApril24.pdf" target="_blank">Whiteboard notes</a></li>
177+
<li> <a href="https://youtu.be/" target="_blank">Video of lecture TBA</a>
178+
<!-- o <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/HandWrittenNotes/2024/NotesApril24.pdf" target="_blank">Whiteboard notes</a> --></li>
199179
</ol>
200180
</div>
201181

202-
203-
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
204-
<h2 id="brief-reminder-on-quantum-phase-estimation-algorithm">Brief reminder on Quantum Phase Estimation algorithm </h2>
205-
206-
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
207-
<h2 id="basics-of-encryption-algorithm-classical-background-factoring">Basics of encryption algorithm, classical background, factoring </h2>
208-
209-
<p>Probably the most important quantum algorithm so far is Shor&#8217;s factoring algorithm [228]. It can
210-
find a factor of a composite number N in roughly (log N)2
211-
steps, which is polynomial in the length
212-
log N of the input. On the other hand, there is no known classical (deterministic or randomized)
213-
algorithm that can factor N in polynomial time.
214-
</p>
215-
216-
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
217-
<h2 id="basics-of-encryption-algorithm-classical-background">Basics of encryption algorithm, classical background </h2>
218-
219-
<!-- !split --><br><br><br><br><br><br><br><br><br><br>
220-
<h2 id="qpe-and-shor-s-algorithm">QPE and Shor's algorithm </h2>
221-
222-
<p>The crucial observation of Shor was that there is an efficient quantum algorithm for the problem
223-
of period-finding and that factoring can be reduced to this, in the sense that an efficient algorithm
224-
for period-finding implies an efficient algorithm for factoring
225-
</p>
226-
227182
<!-- ------------------- end of main content --------------- -->
228183
<center style="font-size:80%">
229184
<!-- copyright --> &copy; 1999-2024, Morten Hjorth-Jensen. Released under CC Attribution-NonCommercial 4.0 license

‎doc/pub/week14/ipynb/ipynb-week14-src.tar.gz‎

0 Bytes
Binary file not shown.

0 commit comments

Comments
 (0)