L20 - Quantum Algorithms and Quantum Computers Flashcards
1
Q
What is the aim of Shors Factorisation algorithm?
A
Find factors of integers effectively
2
Q
What is brute force complexity of factorisation algorithms?
A
Exponential
3
Q
What time can Shors perform factorisation in?
A
P
4
Q
In principle, what algorithm is Shors capable of breaking?
A
RSA, since private key could be deduced from public one.
5
Q
What are the 5 conditions for building quantum computers?
A
- Scalability with well defined Qbits
- Initialisation of Qbits to a pure state
- Universal set of quantum gates
- Long coherence time
- Qbit measurement capability
