The approximate version of the Eastin Knill theorem states: "If a code admits a universal set of transversal gates and corrects erasure with fixed accuracy, then for each logical qubit, a number of physical qubits per subsystem that is inversely proportional to the error parameter is needed".