Multiple choice
A concatenated code suppresses errors doubly-exponentially: after L levels the logical rate is p_L = pth * (p/pth)^(2^L), with threshold pth = 1e-2 and physical rate p = 1e-3. What is the smallest number of concatenation levels L needed to reach p_L <= 1e-15?