Qubits Under Pressure: A Research-Level Quiz
From error-correction thresholds to quantum complexity, test how deep your understanding of quantum computing really goes.
- Mɔ̃ɖaŋuwo
- PhD
- Titina
- Nusɔsrɔ̃
- nyabiase 10
- abe aɖabaƒoƒo 5 ene
- Numeɖeɖe le nyabiabia ɖesiaɖe megbe
Tia “Nyemenye robot o” gbã.
Ɖe wo nɔewo ŋu
Na ɖeviwo kple fefelɔ̃lawo
Kpɔ nyabiabiawo
Ŋuɖoɖo nyuiawo mele eme o, ale be woagawɔ nuku na wò ne èle fefem.
Biabia 1
Which gate set is universal for quantum computation?
- Clifford gates plus the T gate
- Pauli gates plus the phase gate S
- Pauli gates plus Hadamard
- CNOT plus all Pauli gates
Biabia 2
Which complexity class is defined by bounded-error polynomial-time quantum computation?
- QMA
- BQP
- PostBQP
- QIP
Biabia 3
What are the parameters of the Steane code?
- [[15,1,3]]
- [[9,1,3]]
- [[7,1,3]]
- [[4,2,2]]
Biabia 4
What query complexity does Grover's algorithm achieve for unstructured search over N items?
- O(log N)
- O(N/2)
- O(N^(1/3))
- O(√N)
Biabia 5
In the surface code, what kind of error-correction threshold is often quoted under circuit-level depolarizing noise?
- About 1%
- About 0.001%
- About 10%
- About 25%
Biabia 6
The Gottesman–Knill theorem states that which circuits can be efficiently classically simulated?
- Circuits of matchgates only
- Stabilizer circuits
- Circuits with low T-count
- Circuits of depth one
Biabia 7
What subroutine gives Shor's algorithm its exponential speedup?
- Amplitude amplification
- Quantum walk on a graph
- Quantum Fourier transform for period finding
- Adiabatic evolution to a ground state
Biabia 8
Which result says no fault-tolerant code has a transversal universal gate set?
- Solovay–Kitaev theorem
- No-cloning theorem
- Threshold theorem
- Eastin–Knill theorem
Biabia 9
Why is the transmon less sensitive to charge noise than the Cooper-pair box?
- A large E_J/E_C ratio flattens its energy bands
- It uses no Josephson junction at all
- Its qubit states are spatially separated
- It operates far above the gap frequency
Biabia 10
What does the Solovay–Kitaev theorem guarantee for approximating a single-qubit unitary to precision ε?
- Exactly ε^(−1) gates from any set
- O(log^c(1/ε)) gates from a dense set
- Constant-depth circuits for every ε
- O(1/ε²) gates from Clifford gates
