Question
An algorithm for simulating these things can be sped up by using a tableau representation and storing additional “destabilizer” generators to avoid doing a Gaussian elimination. These things are simulated by a certain library’s Aer component, which joins the other elementally-named components Terra, Ignis, and Aqua. By the Gottesman-Knill theorem, these things can be simulated in polynomial time when restricted to operations in the Clifford group. An approach to simulating these things using the matrix product state representation is implemented by the (*) Qiskit (“KISS-kit”) SDK. These things can be naively simulated in exponential time by repeatedly multiplying a state vector of size 2-to-the-n with the unitary matrices that represent components of these things. For 10 points, name these things that are made up of logic gates like phase shift, CNOT (“C-not”), and Hadamard. ■END■
ANSWER: quantum circuits [accept qubits, because you could also say they’re simulating the qubits in a quantum circuit; similarly accept quantum gates before “gates”; accept stabilizer circuits; prompt on “quantum computers” with “what specific things in quantum computing are being simulated?”; reject “circuits” or “computers”]
<AW>
= Average correct buzz position
| Conv. % | Power % | Average Buzz |
|---|
| 100% | 25% | 82.25 |
Back to tossups