Aims to reinforce the interface between physical sciences, theoretical computer science, and discrete mathematics. This book assembles theoretical physicists and specialists of theoretical informatics and discrete mathematics in order to learn about developments in cryptography, algorithmics, and more.
Quantum Circuit Simulation covers the fundamentals of linear algebra and introduces basic concepts of quantum physics needed to understand quantum circuits and algorithms. It requires only basic familiarity with algebra, graph algorithms and computer engineering. After introducing necessary background, the authors describe key simulation techniques that have so far been scattered throughout the research literature in physics, computer science, and computer engineering. Quantum Circuit Simulation also illustrates the development of software for quantum simulation by example of the QuIDDPro package, which is freely available and can be used by students of quantum information as a "quantum calculator."
This book provides a vivid account of the early history of molecular simulation, a new frontier for our understanding of matter that was opened when the demands of theoretical physicists were met by the availability of the modern computers. Since their inception, electronic computers have enormously increased their performance, thus making possible the unprecedented technological revolution that characterizes our present times. This obvious technological advancement has brought with it a silent scientific revolution in the practice of theoretical physics. In particular, in the physics of matter it has opened up a direct route from the microscopic physical laws to observable phenomena. One can now study the time evolution of systems composed of millions of molecules, and simulate the behaviour of macroscopic materials and actually predict their properties. Molecular simulation has provided a new theoretical and conceptual tool that physicists could only dream of when the foundations of statistical mechanics were laid. Molecular simulation has undergone impressive development, both in the size of the scientific community involved and in the range and scope of its applications. It has become the ubiquitous workhorse for investigating the nature of complex condensed matter systems in physics, chemistry, materials and the life sciences. Yet these developments remain largely unknown outside the inner circles of practitioners, and they have so far never been described for a wider public. The main objective of this book is therefore to offer a reasonably comprehensive reconstruction of the early history of molecular simulation addressed to an audience of both scientists and interested non-scientists, describing the scientific and personal trajectories of the main protagonists and discussing the deep conceptual innovations that their work produced.
This book presents the revised final versions of eight lectures given by leading researchers at the First Summer School on Theoretical Aspects of Computer Science in Tehran, Iran, in July 2000. The lectures presented are devoted to quantum computation, approximation algorithms, self-testing/correction, algebraic modeling of data, the regularity lemma, multiple access communication and combinatorial designs, graph-theoretical methods in computer vision, and low-density parity-check codes.
Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this Element, readers will meet some of the deepest ideas and theorems of modern computers and mathematics, such as Turing machines, unsolvable problems, the P=NP question, Kurt Gödel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises.
In the 1990's it was realized that quantum physics has some spectacular applications in computer science. This book is a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics. It begins with an introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the major applications: Shor's factoring algorithm, Grover's search algorithm, and quantum error correction. The book is intended primarily for computer scientists who know nothing about quantum theory, but will also be of interest to physicists who want to learn the theory of quantum computation, and philosophers of science interested in quantum foundational issues. It evolved during six years of teaching the subject to undergraduates and graduate students in computer science, mathematics, engineering, and physics, at Cornell University.
A very active field of research is emerging at the frontier of statistical physics, theoretical computer science/discrete mathematics, and coding/information theory. This book sets up a common language and pool of concepts, accessible to students and researchers from each of these fields.
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
Many physicists are not aware of the fact that they can solve their problems by applying optimization algorithms. Since the number of such algorithms is steadily increasing, many new algorithms have not been presented comprehensively until now. This presentation of recently developed algorithms applied in physics, including demonstrations of how they work and related results, aims to encourage their application, and as such the algorithms selected cover concepts and methods from statistical physics to optimization problems emerging in theoretical computer science.
Mathematical Physics in Theoretical Chemistry deals with important topics in theoretical and computational chemistry. Topics covered include density functional theory, computational methods in biological chemistry, and Hartree-Fock methods. As the second volume in the Developments in Physical & Theoretical Chemistry series, this volume further highlights the major advances and developments in research, also serving as a basis for advanced study. With a multidisciplinary and encompassing structure guided by a highly experienced editor, the series is designed to enable researchers in both academia and industry stay abreast of developments in physical and theoretical chemistry. - Brings together the most important aspects and recent advances in theoretical and computational chemistry - Covers computational methods for small molecules, density-functional methods, and computational chemistry on personal and quantum computers - Presents cutting-edge developments in theoretical and computational chemistry that are applicable to graduate students and research professionals in chemistry, physics, materials science and biochemistry