scispace - formally typeset
Search or ask a question
Author

Thomas Watson

Bio: Thomas Watson is an academic researcher from University of Memphis. The author has contributed to research in topics: Communication complexity & Upper and lower bounds. The author has an hindex of 21, co-authored 84 publications receiving 1203 citations. Previous affiliations of Thomas Watson include University of California, Berkeley & University of Toronto.


Papers
More filters
Journal Article
TL;DR: In this paper, it was shown that deterministic communication complexity can be superlogarithmic in the partition number of the associated communication matrix, and near-optimal deterministic lower bounds were obtained.
Abstract: We show that deterministic communication complexity can be superlogarithmic in the partition number of the associated communication matrix. We also obtain near-optimal deterministic lower bounds fo...

84 citations

Proceedings ArticleDOI
17 Oct 2015
TL;DR: It is shown that deterministic communication complexity can be super logarithmic in the partition number of the associated communication matrix and near-optimal deterministic lower bounds for the Clique vs. Independent Set problem are obtained.
Abstract: We show that deterministic communication complexity can be super logarithmic in the partition number of the associated communication matrix. We also obtain near-optimal deterministic lower bounds for the Clique vs. Independent Set problem, which in particular yields new lower bounds for the log-rank conjecture. All these results follow from a simple adaptation of a communication-to-query simulation theorem of Raz and McKenzie (Combinatorica 1999) together with lower bounds for the analogous query complexity questions.

81 citations

Journal Article
TL;DR: In this paper, the communication lower bound for composed functions of the form $f\circ g^n, where f is any boolean function on n inputs and g is a sufficiently hard two-party gadget, was established.
Abstract: We develop a new method to prove communication lower bounds for composed functions of the form $f\circ g^n$, where $f$ is any boolean function on $n$ inputs and $g$ is a sufficiently “hard” two-party gadget. Our main structure theorem states that each rectangle in the communication matrix of $f \circ g^n$ can be simulated by a nonnegative combination of juntas. This is a new formalization for the intuition that each low-communication randomized protocol can only “query” a few inputs of $f$ as encoded by the gadget $g$. Consequently, we characterize the communication complexity of $f\circ g^n$ in all known one-sided (i.e., not closed under complement) zero-communication models by a corresponding query complexity measure of $f$. These models in turn capture important lower bound techniques such as corruption, smooth rectangle bound, relaxed partition bound, and extended discrepancy. As applications, we resolve several open problems from prior work. We show that $\mathsf{SBP}^{\sf cc}$ (a class characterized...

79 citations

Journal ArticleDOI
TL;DR: This work develops a new method to prove communication lower bounds for composed functions of the form $f\circ g^n, and characterize the communication complexity of f in all known one-sided zero-communication models by a corresponding query complexity measure of f.
Abstract: We develop a new method to prove communication lower bounds for composed functions of the form $f\circ g^n$, where $f$ is any boolean function on $n$ inputs and $g$ is a sufficiently “hard” two-party gadget. Our main structure theorem states that each rectangle in the communication matrix of $f \circ g^n$ can be simulated by a nonnegative combination of juntas. This is a new formalization for the intuition that each low-communication randomized protocol can only “query” a few inputs of $f$ as encoded by the gadget $g$. Consequently, we characterize the communication complexity of $f\circ g^n$ in all known one-sided (i.e., not closed under complement) zero-communication models by a corresponding query complexity measure of $f$. These models in turn capture important lower bound techniques such as corruption, smooth rectangle bound, relaxed partition bound, and extended discrepancy. As applications, we resolve several open problems from prior work. We show that $\mathsf{SBP}^{\sf cc}$ (a class characterized...

61 citations

Posted Content
TL;DR: It is shown that the randomized communication complexity of the composed function f o g^n, where g is an index gadget, is characterized by the randomized decision tree complexity of f, meaning that many query complexity separations involving randomized models automatically imply analogous separations in communication complexity.
Abstract: For any $n$-bit boolean function $f$, we show that the randomized communication complexity of the composed function $f\circ g^n$, where $g$ is an index gadget, is characterized by the randomized decision tree complexity of $f$. In particular, this means that many query complexity separations involving randomized models (e.g., classical vs. quantum) automatically imply analogous separations in communication complexity.

56 citations


Cited by
More filters
Journal ArticleDOI

784 citations

Journal Article
TL;DR: Alho and Spencer as discussed by the authors published a book on statistical and mathematical demography, focusing on mature population models, the particular focus of the new author (see, e.g., Caswell 2000).
Abstract: Here are two books on a topic new to Technometrics: statistical and mathematical demography. The first author of Applied Mathematical Demography wrote the first two editions of this book alone. The second edition was published in 1985. Professor Keyfritz noted in the Preface (p. vii) that at age 90 he had no interest in doing another edition; however, the publisher encouraged him to find a coauthor. The result is an additional focus for the book in the world of biology that makes it much more relevant for the sciences. The book is now part of the publisher’s series on Statistics for Biology and Health. Much of it, of course, focuses on the many aspects of human populations. The new material focuses on mature population models, the particular focus of the new author (see, e.g., Caswell 2000). As one might expect from a book that was originally written in the 1970s, it does not include a lot of information on statistical computing. The new book by Alho and Spencer is focused on putting a better emphasis on statistics in the discipline of demography (Preface, p. vii). It is part of the publisher’s Series in Statistics. The authors are both statisticians, so the focus is on statistics as used for demographic problems. The authors are targeting human applications, so their perspective on science does not extend any further than epidemiology. The book actually strikes a good balance between statistical tools and demographic applications. The authors use the first two chapters to teach statisticians about the concepts of demography. The next four chapters are very similar to the statistics content found in introductory books on survival analysis, such as the recent book by Kleinbaum and Klein (2005), reported by Ziegel (2006). The next three chapters are focused on various aspects of forecasting demographic rates. The book concludes with chapters focusing on three areas of applications: errors in census numbers, financial applications, and small-area estimates.

710 citations

Journal ArticleDOI
TL;DR: In this article, the authors present a comprehensive and accessible treatment of the theoretical tools that are needed to cope with entanglement in quantum systems and provide the reader with the necessary background information about the experimental developments.
Abstract: In the last two decades there has been an enormous progress in the experimental investigation of single quantum systems. This progress covers fields such as quantum optics, quantum computation, quantum cryptography, and quantum metrology, which are sometimes summarized as `quantum technologies'. A key issue there is entanglement, which can be considered as the characteristic feature of quantum theory. As disparate as these various fields maybe, they all have to deal with a quantum mechanical treatment of the measurement process and, in particular, the control process. Quantum control is, according to the authors, `control for which the design requires knowledge of quantum mechanics'. Quantum control situations in which measurements occur at important steps are called feedback (or feedforward) control of quantum systems and play a central role here. This book presents a comprehensive and accessible treatment of the theoretical tools that are needed to cope with these situations. It also provides the reader with the necessary background information about the experimental developments. The authors are both experts in this field to which they have made significant contributions. After an introduction to quantum measurement theory and a chapter on quantum parameter estimation, the central topic of open quantum systems is treated at some length. This chapter includes a derivation of master equations, the discussion of the Lindblad form, and decoherence – the irreversible emergence of classical properties through interaction with the environment. A separate chapter is devoted to the description of open systems by the method of quantum trajectories. Two chapters then deal with the central topic of quantum feedback control, while the last chapter gives a concise introduction to one of the central applications – quantum information. All sections contain a bunch of exercises which serve as a useful tool in learning the material. Especially helpful are also various separate boxes presenting important background material on topics such as the block representation or the feedback gain-bandwidth relation. The two appendices on quantum mechanics and phase-space and on stochastic differential equations serve the same purpose. As the authors emphasize, the book is aimed at physicists as well as control engineers who are already familiar with quantum mechanics. It takes an operational approach and presents all the material that is needed to follow research on quantum technologies. On the other hand, conceptual issues such as the relevance of the measurement process for the interpretation of quantum theory are neglected. Readers interested in them may wish to consult instead a textbook such as Decoherence and the Quantum-to-Classical Transition by Maximilian Schlosshauer. Although the present book does not contain applications to gravity, part of its content might become relevant for the physics of gravitational-wave detection and quantum gravity phenomenology. In this respect it should be of interest also for the readers of this journal.

612 citations

Journal ArticleDOI
TL;DR: This review discusses the current status of devices that generate quantum random numbers, and discusses the most fundamental processes based on elementary quantum mechanical processes.
Abstract: In mathematics and computer science, random numbers have the role of a resource for assisting proofs, making cryptography secure, and enabling computational protocols. This role motivates efforts to produce random numbers as a physical process. Potential physical sources abound, but arguably the most fundamental are those based on elementary quantum mechanical processes. This review discusses the current status of devices that generate quantum random numbers.

446 citations

Book ChapterDOI
01 Jan 1996

378 citations