Achieving the Holevo bound via sequential measurements

A new detection scheme is presented which allows one to saturate asymptotically the Holevo bound.Differently from previous proposals, it is based on performing a sequence of (projective) YES/NO measurements which in N steps determines which codeword was sent by the sender (N being the number of the codewords).Our analysis shows that as long as N is below the limit posed by the Holevo bound the error probability can be sent to zero asymptotically in the length of the codewords.