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 (-5[1])these things using the matrix product (15[1])state representation is implemented by the (*) Qiskit (“KISS-kit”) SDK. (10[1])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. (10[1])For 10 points, name these things that are made up of logic gates like phase shift, CNOT (“C-not”), and Hadamard. ■END■ (0[2])

Back to tossups

Buzzes

Summary