Combinatorics, Quantum Computing and Cellular Phones
Dr. Robert Calderbank, AT&T Research Laboratories

This talk explores the connection between quantum error correction and wireless systems that employ multiple antennas at the base station and the mobile terminal. The two topics have a common mathematical foundation, involving orthogonal geometry -- the combinatorics of binary quadratic forms. We explain these connections, and describe how the wireless industry is making use of a mathematical framework developed by Radon and Hurwitz about a hundred years ago.

Viewgraphs: [powerpoint]

Quantum Error Correcting Codes and Quantum Cryptography
Dr. Peter Shor, AT&T Research Laboratories

When quantum computers were first proposed, it was widely believed that large-scale quantum computing would be infeasible, because it appeared impossible to correct errors on a quantum computer without disturbing the state of, and thus invalidating, the computation. Quantum error correcting codes were invented to circumvent this difficulty; these codes can be used to correct any likely error in an encoded quantum state without disturbing the state. Recently, a connection was discovered between quantum codes and the first application of the strange properties of quantum mechanics to computer science, namely the 1984 quantum key distribution protocol of Bennett and Brassard. It took over a decade to rigorously prove that this protocol was secure against an eavesdropper, and the first proofs were quite complicated. Recently, John Preskill and I found a simple proof by relating the security of the Bennett and Brassard protocol to the efficacy of CSS (Calderbank-Shor-Steane) codes, a class of quantum error correcting codes. In this talk, I introduce the fundamentals of quantum error correction and show its relationship to quantum key distribution.

Viewgraphs: [postscript] [pdf]

Frames Everywhere
Dr. Jelena Kovacevic, Bell Laboratories

Frames have become ubiquitous. They started as a mathematical theory by Duffin and Schaeffer, who provided an abstract framework for the idea of time-frequency atomic decomposition by Gabor. The theory then laid largely dormant until 1986 with the publication of work by Daubechies, Grossman and Meyer. Since then, frames have evolved into a state-of-the-art signal processing tool. Frames, or redundant representations, have been used in different areas under different guises. Perfect reconstruction oversampled filter banks are equivalent to frames in the space of square-summable sequences, described by Cvetkovic and Vetterli. Frames show resilience to additive noise as well as numerical stability of reconstruction. They have also demonstrated resilience to quantization. Several works exploit the resilience of frame expansions to coefficient losses as well as the greater freedom to capture significant signal characteristics. Frames have been used to design unitary space-time constellations for multiple-antenna wireless systems. Finally, although a well-known result by a Russian mathematician M.A. Naimark -- Naimark's Theorem -- has been widely used in frame theory in the past few years, only recently have researchers recast certain quantum measurement results in terms of frames. In this talk, I will examine frames and their various guises.

Viewgraphs: [
postscript] [pdf]




Last Updated: Oct. 26, 2001 (alw)