1973 Alexander Holevo publishes a paper showing that n qubits cannot carry more than n classical bits of information (a result known as "Holevo's theorem" or "Holevo's bound"). Charles H. Bennett shows that computation can be done reversibly.