IQIS Lecture 6.8 — Simon's algorithm

preview_player
Показать описание

  1. Artur Ekert
Рекомендации по теме
Quantum computing for 0:15:49

Quantum computing for cryptographers III - Simon's algorithm

IQIS Lecture 7.6 0:10:51

IQIS Lecture 7.6 — Properties of Kraus representations

Simon's Algorithm 0:07:53

Simon's Algorithm

IQIS Lecture 7.11 0:08:53

IQIS Lecture 7.11 — Choi matrix

Quantum Computing: Example 0:26:21

Quantum Computing: Example of Simon's Algorithm (Part 3/3)

Quantum Cryptography - 1:19:47

Quantum Cryptography - Simon and Grover Algorithms / Shor's algorithm / ATAL FDP

Bernstein Vazirani Algorithm| 0:07:40

Bernstein Vazirani Algorithm| Explanation by Vasudha

Lecture 6: Bernstein 0:51:24

Lecture 6: Bernstein Vazirani algorithm | Practical Quantum Computing Programming

Towards a Complete 0:56:18

Towards a Complete Classification of Multipartite Entanglement

Lecture 8 0:12:00

Lecture 8 2 FOURIER SAMPLING

13- Implementation of 0:19:32

13- Implementation of Bernstein--Vazirani Algorithm in Qiskit

Parallel computing in 0:06:29

Parallel computing in quantum circuits

Lecture 8 0:15:53

Lecture 8 1 FOURIER SAMPLING

Ph CS 219A 1:01:42

Ph CS 219A Lecture 13 Black Box Model

Quantum computing for 0:10:43

Quantum computing for dummies - Ep:7 Bernstein- Vazirani Algorithm

Quantum computing for 0:16:30

Quantum computing for dummies - Ep:8 Bernstein- Vazirani How it works

Optimal control, tomography 0:44:32

Optimal control, tomography and visualization of quantum information processing | Steffen Glaser

bernstein Vazirani algorithm 0:10:03

bernstein Vazirani algorithm

Intro to Quantum 2:33:01

Intro to Quantum Computation: Lecture 7: The Deutsch-Josza and Bernstein-Vazirani algorithms

Algoritmo de Simon 0:12:27

Algoritmo de Simon

Let's learn Bernstein 0:02:00

Let's learn Bernstein Vazirani algorithm || Hadamard gate || Controlled NOT gate

Lecture 7 0:08:01

Lecture 7 2 UNIVERSAL FAMILY OF GATES

Quantum Lab episodio 1:11:09

Quantum Lab episodio 8: El algoritmo de Simon

Quantum Computing: Hadamard 0:08:09

Quantum Computing: Hadamard Gate on Multiple Qubits

Комментарии
Автор

Absolutely fantastic lecture series. Pure masterclass!

arkadijorlov
Автор

love this series! very helpful and clearly explained

akeelmedina
Автор

The step at 11:58 where (-1)^(a.y) is factored out seems confusing as ``(a XOR s). y" is not equal to ``(a.y XOR s.y)" also ``s.y = s1*y1 + s2*y2 + s3*y3 sn*yn", therefore its not guarenteed to be either 0 or 1 it can be 2 or 3 also, e.g., if s = (011) and y = (111) then, s.y = 2.

nilamonidaloi
Автор

very clear about the steps of Simon's algorithm, thanks!

zhengtongyan
Автор

why do we can't just put 0 in black box ? 0 + s = s

viktorkarpilov
Автор

What if "Wave Function Collapse" involves an annihilation + creation interaction with the Quantum Vacuum? The portion of the original "foreground" wave-function which collapses away is annihilated with "background" virtual (partial, off-mass-shell) anti-particles. The new portion of the "foreground" wave-function which regenerates into existence similarly arises from "background" virtual (partial, off-mass-shell) particles.

If so, and if you could affect the background population of virtual particles & anti-particles -- as with, say, some Casimir plates or something along those lines -- then you could affect wave-function collapse and (perhaps) skew probabilities in your favor.

Quantum Casinos can stack quantum decks in their favor?

eriknelson
Автор

afer hadamard, shouldnt it be sum over |+>|0>

nicolasjochem
join shbcf.ru