L19 - Quantum Computing Flashcards

1
Q

Define superposition

A

The ability for quantum bits to exist in multiple states simultaneously.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the purpose of Quantum Computing?

A

Use superposition to execute massively parallel computations.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Explain how the Schrodingers Cat thought experiment details the absurdity of superposition…

A

A cat is place in a box with a delayed radioactive poison. Until the box is opened to know for sure, the cat is considered both dead and alive.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

If superposition is not absurd, what is the likely hood that the cat is dead or alive?

A

Dead = 0.5
Alive = 0.5

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How can a QBit in a superposition state be represented?

A

∣ψ⟩=α|0⟩+β|1⟩

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What does each element of the superposition state equation represent?

A

α,β - probability of being in that state
|0⟩ and|1⟩ - basis states of the QBit

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What does the Superposition equation of QBits show?

A

The probability that each bases is found upon measurement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Given a register of size 3, create a superposition formula to represent both 3 and 7…

A

3 = 011
7 = 111

0.5(|0⟩+|1⟩) XOR |1⟩ XOR |1⟩
= 0.5(011 + 111)
= 0.5(|3⟩ + |7⟩)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What are the 2 most important quantum computing algorithms?

A
  • Grovers search
  • Shors factorisation
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What input does Grovers Search take?

A

Unstructured, unsorted data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the worst case complexity of Grovers Search?

A

O(sqrt(N))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the Church-Turing thesis?

A

All reasonable definitions of algorithms can be represented as equal, and any new algorithm is also equivalent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Does Quantum Computing algorithms conform to the Turing-Church thesis?

A

Yes. Quantum algorithms can be replicated on sequential machines, but have exponential slowdown.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly