 Solution

Alice sends the $m$ conjugate-coded qubits through the noiseless quantum channel. Bob independently chooses a uniformly random basis bit $y_i^{\prime }$ for each qubit and performs a projective measurement in the computational basis when $y_i^{\prime }=0$ or the Hadamard basis when $y_i^{\prime }=1$.

After all measurements, Alice and Bob publicly reveal $Y$ and $Y^{\prime }$ but keep the data bits secret. They discard every position with $y_i\ne y_i^{\prime }$ and retain the measured bits at positions where the bases agree. In the ideal channel those retained bits equal Alice's $x_i$ with certainty. Each pair of bases agrees with probability $1/2$, so the shared secret key has expected length $m/2$.