Multiple choice
In QKD information reconciliation, Alice's key X and Bob's key Y are modeled as a binary symmetric channel with crossover probability Q (the QBER). By Shannon's source-coding bound, what is the minimum public side information Bob needs per key bit to reconstruct X with vanishing error?