Question
These machines obey the Church-Turing thesis. For 10 points each:
[10e] Name these machines, exemplified by the IBM Q System One, which use the superposition of qubits to reduce time complexity when making computations.
ANSWER: quantum computers [do not accept or prompt on “computers”]
[10h] This quantum computing algorithm named for its Indian-American discoverer can search through unsorted data in big O of the square root of n.
ANSWER: Grover’s algorithm [prompt quantum search algorithm]
[10m] It’s not a Fourier transform, but Shor’s algorithm can perform this task in polynomial time. Quantum computers running Shor’s algorithm could theoretically break RSA encryption because of their efficiency in doing this task.
ANSWER: prime factorization [accept word forms]
<YM, Other Science>
Summary
| 2023 ILLIAC (Cornell) | 2023-10-21 | Y | 3 | 20.00 | 100% | 100% | 0% |
| 2023 ILLIAC (Mainsite) | 2023-10-21 | Y | 3 | 10.00 | 0% | 100% | 0% |
Data
| Chicago B | Missouri | 0 | 0 | 10 | 10 |
| Ohio State B | Chicago C | 0 | 0 | 10 | 10 |
| Ohio State C | Purdue B | 0 | 0 | 10 | 10 |