DOCSLIB.ORG

Computational Complexity for Physicists

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Computational Complexity for Physicists L IMITS OF C OMPUTATION Copyright (c) 2002 Institute of Electrical and Electronics Engineers. Reprinted, with permission, from Computing in Science & Engineering. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the discussed products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by sending a blank email message to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. COMPUTATIONALCOMPLEXITY FOR PHYSICISTS The theory of computational complexity has some interesting links to physics, in particular to quantum computing and statistical mechanics. This article contains an informal introduction to this theory and its links to physics. ompared to the traditionally close rela- mentation as well as the computer on which the tionship between physics and mathe- program is running. matics, an exchange of ideas and meth- The theory of computational complexity pro- ods between physics and computer vides us with a notion of complexity that is Cscience barely exists. However, the few interac- largely independent of implementation details tions that have gone beyond Fortran program- and the computer at hand. Its precise definition ming and the quest for faster computers have been requires a considerable formalism, however. successful and have provided surprising insights in This is not surprising because it is related to a both fields. This is particularly true for the mutual highly nontrivial question that touches the foun- exchange between statistical mechanics and the dation of mathematics: What do we mean when we theory of computational complexity. Here, I discuss say a problem is solvable? Thinking about this this exchange in a manner directed at physicists question leads to Gödel’s incompleteness theo- with little or no knowledge of the theory. rem, Turing machines, and the Church-Turing thesis on computable functions. Here we adopt a more informal, pragmatic The measure of complexity viewpoint. A problem is solvable if a computer The branch of theoretical computer science program written in your favorite programming known as computational complexity is con- language can solve it. Your program’s running cerned with classifying problems according to time or time complexity must then be defined with the computational resources required to solve some care to serve as a meaningful measure of them (for additional information about this field, the problem’s complexity. see the “Related Works” sidebar). What can be measured (or computed) is the time that a par- Time complexity ticular algorithm uses to solve the problem. This In general, running time depends on a prob- time, in turn, depends on the algorithm’s imple- lem’s size and on the specific input data—the in- stance. Sorting 1,000 numbers takes longer than sorting 10 numbers. Some sorting algorithms 1521-9615/02/$17.00 © 2002 IEEE run faster if the input data is partially sorted al- ready. To minimize the dependency on the spe- STEPHAN MERTENS cific instance, we consider the worst-case time Otto-von-Guericke University, Magdeburg complexity T(n): MAY/JUNE 2002 31 strongly on the algorithm’s implementation de- Related Work tails—smart programmers and optimizing com- For introductions into the field of computational complexity, see pilers will try to reduce it. Therefore, rather than E.L. Lawler et al., eds., The Traveling Salesman Problem, Wiley-Interscience Series consider the precise number T(n) of elementary in Discrete Mathematics and Optimization, John Wiley & Sons, New York, 1985. operations, we only consider the asymptotic be- H.R. Lewis and C.H. Papadimitriou, “The Efficiency of Algorithms,” Scientific havior of T(n) for large values of n as the Lan- American, vol. 109, no. 1, Jan. 1978, pp. 96–109. dau symbols O and Θ denote: C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization, Prentice-Hall, Englewood Cliffs, N.J., 1982. • We say T(n) is of order at most g(n) and write O For a deep understanding of the field, read the following classic T(n) = (g(n)) if positive constants c and n0 ex- ≤ ≥ textbooks: ist such that T(n) cg(n) for all n n0. • We say T(n) is of order g(n) and write T(n) M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory Θ of NP-Completeness, W.H. Freeman, New York, 1997. = (g(n)) if positive constants c1, c2, and n0 exist ≤ ≤ ≥ C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, such that c1g(n) T(n) c2g(n) for all n n0. Mass., 1994. Multiplying two n × n matrixes requires n3 The complexity of Ising spin systems is discussed in: multiplications, according to the textbook for- B. Hayes, “Computing Science: The World in a Spin,” American Scientist, vol. 88, no. mula. However, this does not mean that the 5, Sept./Oct. 2000, pp. 2384–388; www.amsci.org/amsci/issues/comsci00/ problem of multiplying two n × n matrices has compsci2000-09.html. complexity Θ(n3). The textbook formula is a par- For an entertaining introduction (written by a physicist) to ticular algorithm, and an algorithm’s time com- Gödel’s incompleteness theorem, Turing machines, and the plexity is only an upper bound for a problem’s in- Church-Turing Thesis on computable functions, read herent complexity. In fact, researchers have found faster matrix multiplication algorithms with com- R. Penrose, The Emperor’s New Mind, Oxford Univ. Press, 1989. α plexity O (n ) and α < 3 during the last decades— α 1 To learn more about quantum parallelism, see www.qubit.org or the current record being = 2.376. Because the product matrix has n2 entries, α cannot be smaller D. Aharonov, “Quantum Computation,” Ann. Rev. Computational Physics VI, D. Stauffer, ed., World Scientific, 1998. than 2; it is an open question whether an algo- rithm can achieve this lower bound. Phase transitions in computational complexity are discussed in: A problem where the upper bound from algo- O. Dubois et al., eds., “Phase Transitions in Combinatorial Problems,” special rithmic complexity meets an inherent lower issue of Theor. Comp. Sci., vol. 265, nos. 1–2, 2001. bound is sorting n items. Under the general as- B. Hayes, “Computing Science: The Easiest Hard Problem,”American Scientist, sumption that comparisons between pairs of vol. 90, no. 2, Mar./Apr. 2002, pp. 113–117; www.amsci.org/amsci/issues/ items are the only source of information about comsci02/compsci2002-03.html. them, Θ(n log n) is a lower bound for the num- B. Hayes, “Computing Science: Can’t Get No Satisfaction,” American Scientist, vol. 85, no. 2, Mar./Apr. 1997, pp. 108–112; www.amsci.org/amsci/issues/ ber of comparisons to sort n items in the worst 2 Comsci97/compsci9703.html. case. This bound is met by algorithms such as “heapsort” or “mergesort.” Problem size Tn()= max(), tx (1) Our measure of time complexity still depends = xn on the somewhat ambiguous notion of problem where t(x) is the algorithm’s running time for in- size. In the matrix multiplication example, we put data x (in arbitrary units), and the maximum tacitly took the number n of rows of one input is taken over all problem instances of size n. The matrix as the “natural” measure of size. Using worst-case time is an upper bound for the ob- the number of elements m = n2 instead speeds up servable running time. the O (n3) algorithm to O (m3/2) without chang- A measure of time complexity should be based ing a single line of program code. An unam- on a unit of time that is independent of the spe- biguous definition of problem size is required to cific CPU’s clock rate. Such a unit is provided by compare algorithms. the time it takes to perform an elementary op- In computational complexity, all problems eration such as adding two integer numbers. solvable by a polynomial algorithm—that is, an Measuring the time in this unit means counting algorithm with time complexity Θ(nk) for some the number of elementary operations your algo- k—are lumped together and called tractable. rithm executes. This number in turn depends Problems that can only solvable by algorithms 32 COMPUTING IN SCIENCE & ENGINEERING n with nonpolynomial running time, such as Θ(2 ) 8 7 or Θ(n!), are also lumped together and called in- 4 9 tractable. There are practical as well as theoreti- 2 cal reasons for this rather coarse classification. 14 11 4 One of the theoretical advantages is that it does 7 6 not distinguish between the O (n3) and O (m3/2) 8 10 algorithm example from above; hence, we can 2 afford some sloppiness and stick with our am- 1 biguous natural measure of problem size. Figure 1. A weighted graph and its minimum spanning tree (shaded edges). Tractable and intractable problems The terms tractable and intractable for prob- lems with polynomial and exponential algo- a spanning subgraph) and whose edges have rithms refer to the fact that an exponential al- minimum total weight. Your subgraph should gorithm means a hard limit for the accessible not contain cycles because you can always re- problem sizes. Suppose that, with your current move an edge from a cycle, keeping all nodes equipment, you can solve a problem of size n connected and reducing the cost. A graph just within your schedule. If your algorithm has without cycles is a tree, so what you are look- complexity Θ(2n), a problem of size n + 1 needs ing for is a minimum spanning tree (MST) in a twice the time, pushing you off schedule.
Load more

Recommended publications
  • Advances in Theoretical & Computational Physics
    ISSN: 2639-0108 Review Article Advances in Theoretical & Computational Physics Cosmology: Preprogrammed Evolution (The problem of Providence) Besud Chu Erdeni Unified Theory Lab, Bayangol disrict, Ulan-Bator, Mongolia *Corresponding author Besud Chu Erdeni, Unified Theory Lab, Bayangol disrict, Ulan-Bator, Mongolia. Submitted: 25 March 2021; Accepted: 08 Apr 2021; Published: 18 Apr 2021 Citation: Besud Chu Erdeni (2021) Cosmology: Preprogrammed Evolution (The problem of Providence). Adv Theo Comp Phy 4(2): 113-120. Abstract This is continued from the article Superunification: Pure Mathematics and Theoretical Physics published in this journal and intended to discuss the general logical and philosophical consequences of the universal mathematical machine described by the superunified field theory. At first was mathematical continuum, that is, uncountably infinite set of real numbers. The continuum is self-exited and self- organized into the universal system of mathematical harmony observed by the intelligent beings in the Cosmos as the physical Universe. Consequently, cosmology as a science of evolution in the Uni- verse can be thought as a preprogrammed natural phenomenon beginning with the Big Bang event, or else, the Creation act pro- (6) cess. The reader is supposed to be acquinted with the Pythagoras’ (Arithmetization) and Plato’s (Geometrization) concepts. Then, With this we can derive even the human gene-chromosome topol- the numeric, Pythagorean, form of 4-dim space-time shall be ogy. (1) The operator that images the organic growth process from nothing is where time is an agorithmic (both geometric and algebraic) bifur- cation of Newton’s absolute space denoted by the golden section exp exp e.
    [Show full text]
  • Journal of Computational Physics
    JOURNAL OF COMPUTATIONAL PHYSICS AUTHOR INFORMATION PACK TABLE OF CONTENTS XXX . • Description p.1 • Audience p.2 • Impact Factor p.2 • Abstracting and Indexing p.2 • Editorial Board p.2 • Guide for Authors p.6 ISSN: 0021-9991 DESCRIPTION . Journal of Computational Physics has an open access mirror journal Journal of Computational Physics: X which has the same aims and scope, editorial board and peer-review process. To submit to Journal of Computational Physics: X visit https://www.editorialmanager.com/JCPX/default.aspx. The Journal of Computational Physics focuses on the computational aspects of physical problems. JCP encourages original scientific contributions in advanced mathematical and numerical modeling reflecting a combination of concepts, methods and principles which are often interdisciplinary in nature and span several areas of physics, mechanics, applied mathematics, statistics, applied geometry, computer science, chemistry and other scientific disciplines as well: the Journal's editors seek to emphasize methods that cross disciplinary boundaries. The Journal of Computational Physics also publishes short notes of 4 pages or less (including figures, tables, and references but excluding title pages). Letters to the Editor commenting on articles already published in this Journal will also be considered. Neither notes nor letters should have an abstract. Review articles providing a survey of particular fields are particularly encouraged. Full text articles have a recommended length of 35 pages. In order to estimate the page limit, please use our template. Published conference papers are welcome provided the submitted manuscript is a significant enhancement of the conference paper with substantial additions. Reproducibility, that is the ability to reproduce results obtained by others, is a core principle of the scientific method.
    [Show full text]
  • Computational Science and Engineering
    Computational Science and Engineering, PhD College of Engineering Graduate Coordinator: TBA Email: Phone: Department Chair: Marwan Bikdash Email: [email protected] Phone: 336-334-7437 The PhD in Computational Science and Engineering (CSE) is an interdisciplinary graduate program designed for students who seek to use advanced computational methods to solve large problems in diverse fields ranging from the basic sciences (physics, chemistry, mathematics, etc.) to sociology, biology, engineering, and economics. The mission of Computational Science and Engineering is to graduate professionals who (a) have expertise in developing novel computational methodologies and products, and/or (b) have extended their expertise in specific disciplines (in science, technology, engineering, and socioeconomics) with computational tools. The Ph.D. program is designed for students with graduate and undergraduate degrees in a variety of fields including engineering, chemistry, physics, mathematics, computer science, and economics who will be trained to develop problem-solving methodologies and computational tools for solving challenging problems. Research in Computational Science and Engineering includes: computational system theory, big data and computational statistics, high-performance computing and scientific visualization, multi-scale and multi-physics modeling, computational solid, fluid and nonlinear dynamics, computational geometry, fast and scalable algorithms, computational civil engineering, bioinformatics and computational biology, and computational physics. Additional Admission Requirements Master of Science or Engineering degree in Computational Science and Engineering (CSE) or in science, engineering, business, economics, technology or in a field allied to computational science or computational engineering field. GRE scores Program Outcomes: Students will demonstrate critical thinking and ability in conducting research in engineering, science and mathematics through computational modeling and simulations.
    [Show full text]
  • COMPUTER PHYSICS COMMUNICATIONS an International Journal and Program Library for Computational Physics
    COMPUTER PHYSICS COMMUNICATIONS An International Journal and Program Library for Computational Physics AUTHOR INFORMATION PACK TABLE OF CONTENTS XXX . • Description p.1 • Audience p.2 • Impact Factor p.2 • Abstracting and Indexing p.2 • Editorial Board p.2 • Guide for Authors p.4 ISSN: 0010-4655 DESCRIPTION . Visit the CPC International Computer Program Library on Mendeley Data. Computer Physics Communications publishes research papers and application software in the broad field of computational physics; current areas of particular interest are reflected by the research interests and expertise of the CPC Editorial Board. The focus of CPC is on contemporary computational methods and techniques and their implementation, the effectiveness of which will normally be evidenced by the author(s) within the context of a substantive problem in physics. Within this setting CPC publishes two types of paper. Computer Programs in Physics (CPiP) These papers describe significant computer programs to be archived in the CPC Program Library which is held in the Mendeley Data repository. The submitted software must be covered by an approved open source licence. Papers and associated computer programs that address a problem of contemporary interest in physics that cannot be solved by current software are particularly encouraged. Computational Physics Papers (CP) These are research papers in, but are not limited to, the following themes across computational physics and related disciplines. mathematical and numerical methods and algorithms; computational models including those associated with the design, control and analysis of experiments; and algebraic computation. Each will normally include software implementation and performance details. The software implementation should, ideally, be available via GitHub, Zenodo or an institutional repository.In addition, research papers on the impact of advanced computer architecture and special purpose computers on computing in the physical sciences and software topics related to, and of importance in, the physical sciences may be considered.
    [Show full text]
  • Computational Complexity: a Modern Approach
    i Computational Complexity: A Modern Approach Sanjeev Arora and Boaz Barak Princeton University http://www.cs.princeton.edu/theory/complexity/ [email protected] Not to be reproduced or distributed without the authors’ permission ii Chapter 10 Quantum Computation “Turning to quantum mechanics.... secret, secret, close the doors! we always have had a great deal of difficulty in understanding the world view that quantum mechanics represents ... It has not yet become obvious to me that there’s no real problem. I cannot define the real problem, therefore I suspect there’s no real problem, but I’m not sure there’s no real problem. So that’s why I like to investigate things.” Richard Feynman, 1964 “The only difference between a probabilistic classical world and the equations of the quantum world is that somehow or other it appears as if the probabilities would have to go negative..” Richard Feynman, in “Simulating physics with computers,” 1982 Quantum computing is a new computational model that may be physically realizable and may provide an exponential advantage over “classical” computational models such as prob- abilistic and deterministic Turing machines. In this chapter we survey the basic principles of quantum computation and some of the important algorithms in this model. One important reason to study quantum computers is that they pose a serious challenge to the strong Church-Turing thesis (see Section 1.6.3), which stipulates that every physi- cally reasonable computation device can be simulated by a Turing machine with at most polynomial slowdown. As we will see in Section 10.6, there is a polynomial-time algorithm for quantum computers to factor integers, whereas despite much effort, no such algorithm is known for deterministic or probabilistic Turing machines.
    [Show full text]
  • COMPUTATIONAL SCIENCE 2017-2018 College of Engineering and Computer Science BACHELOR of SCIENCE Computer Science
    COMPUTATIONAL SCIENCE 2017-2018 College of Engineering and Computer Science BACHELOR OF SCIENCE Computer Science *The Computational Science program offers students the opportunity to acquire a knowledge in computing integrated with knowledge in one of the following areas of study: (a) bioinformatics, (b) computational physics, (c) computational chemistry, (d) computational mathematics, (e) environmental science informatics, (f) health informatics, (g) digital forensics and cyber security, (h) business informatics, (i) biomedical informatics, (j) computational engineering physics, and (k) computational engineering technology. Graduates of this program major in computational science with a concentration in one of the above areas of study. (Amended for clarification 12/5/2018). *Previous UTRGV language: Computational science graduates develop emphasis in two major fields, one in computer science and one in another field, in order to integrate an interdisciplinary computing degree applied to a number of emerging areas of study such as biomedical-informatics, digital forensics, computational chemistry, and computational physics, to mention a few examples. Graduates of this program are prepared to enter the workforce or to continue a graduate studies either in computer science or in the second major. A – GENERAL EDUCATION CORE – 42 HOURS Students must fulfill the General Education Core requirements. The courses listed below satisfy both degree requirements and General Education core requirements. Required 020 - Mathematics – 3 hours For all
    [Show full text]
  • Computational Problem Solving in University Physics Education Students’ Beliefs, Knowledge, and Motivation
    Computational problem solving in university physics education Students’ beliefs, knowledge, and motivation Madelen Bodin Department of Physics Umeå 2012 This work is protected by the Swedish Copyright Legislation (Act 1960:729) ISBN: 978-91-7459-398-3 ISSN: 1652-5051 Cover: Madelen Bodin Electronic version available at http://umu.diva-portal.org/ Printed by: Print & Media, Umeå University Umeå, Sweden, 2012 To my family Thanks It has been an exciting journey during these years as a PhD student in physics education research. I started this journey as a physicist and I am grateful that I've had the privilege to gain insight into the fascination field of how, why, and when people learn. There are many people that have been involved during this journey and contributed with support, encouragements, criticism, laughs, inspiration, and love. First I would like to thank Mikael Winberg who encouraged me to apply as a PhD student and who later became my supervisor. You have been invaluable as a research partner and constantly given me constructive comments on my work. Thanks also to Sune Pettersson and Sylvia Benkert who introduced me to this field of research. Many thanks to Jonas Larsson, Martin Servin, and Patrik Norqvist who let me borrow their students and also have contributed with valuable ideas and comments. Special thanks to the students who shared their learning experiences during my studies. It has been a privilege to be a member of the National Graduate School in Science and Technology Education (FontD). Thanks for providing courses and possibilities to networking with research colleagues from all over the world.
    [Show full text]
  • Teaching Computational Physics
    ODERN PHYSICS RESEARCH is concerned M increasing1y with comple~ systems com­ posed of many interacting components - the Teaching many atoms making up a solid, the many stars in a galaxy, or the many values of a field in space-time describing an elementary parti­ Computational cle. In most of these cases, although we might know the simple general laws govern­ ing the interactions between the components, Physics it is difficult to predict or understand qualita­ tively new phenomena that can arise solely from the complexity of the problem. General insights in this regard are difficult, and the analytical pencil-and-paper approach that has served physics so well in the past quickly reaches its limits. Numerical simulations are therefore essential to further understanding, and computcrs and computing playa central role in much of modern research. Using a computer to model physical sys­ tems is, at its best, more art than science. The successful computational physicist is not a blind number-cruncher, but rather exploits the numerical power of the computer through by Steven E. Koonin a mix of numerical analysis, analytical models, and programing to solve otherwise intractable problems. It is a skill that can be acquired and refined - knowing how to set up the simulation, what numerical methods to employ, how to implement them effi­ ciently, when to trust the accuracy of the results. Despite its importance, computational physics has largely been neglected in the stan­ dard university physics curriculum. In part, this is because it requires balanced integration of three commonly disjoint disciplines: phys­ Caltech in the winter of 1983.
    [Show full text]
  • Computational Complexity: a Modern Approach PDF Book
    COMPUTATIONAL COMPLEXITY: A MODERN APPROACH PDF, EPUB, EBOOK Sanjeev Arora,Boaz Barak | 594 pages | 16 Jun 2009 | CAMBRIDGE UNIVERSITY PRESS | 9780521424264 | English | Cambridge, United Kingdom Computational Complexity: A Modern Approach PDF Book Miller; J. The polynomial hierarchy and alternations; 6. This is a very comprehensive and detailed book on computational complexity. Circuit lower bounds; Examples and solved exercises accompany key definitions. Computational complexity: A conceptual perspective. Redirected from Computational complexities. Refresh and try again. Brand new Book. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying their computational complexity , i. In other words, one considers that the computation is done simultaneously on as many identical processors as needed, and the non-deterministic computation time is the time spent by the first processor that finishes the computation. Foundations of Cryptography by Oded Goldreich - Cambridge University Press The book gives the mathematical underpinnings for cryptography; this includes one-way functions, pseudorandom generators, and zero-knowledge proofs. If one knows an upper bound on the size of the binary representation of the numbers that occur during a computation, the time complexity is generally the product of the arithmetic complexity by a constant factor. Jason rated it it was amazing Aug 28, Seller Inventory bc0bebcaa63d3c. Lewis Cawthorne rated it really liked it Dec 23, Polynomial hierarchy Exponential hierarchy Grzegorczyk hierarchy Arithmetical hierarchy Boolean hierarchy. Convert currency. Convert currency. Familiarity with discrete mathematics and probability will be assumed. The formal language associated with this decision problem is then the set of all connected graphs — to obtain a precise definition of this language, one has to decide how graphs are encoded as binary strings.
    [Show full text]
  • Prospects for the Application of Data-Driven Methods for Computational Physics Modeling
    Prospects for the application of data-driven methods for computational physics modeling Karthik Duraisamy University of Michigan With the proliferation of high-resolution datasets and advances in computing and algorithms over the past decade, data science has risen as a discipline in its own right. Machine learning-driven models have attained spectacular success in commercial applications such as language translation, speech and face recognition, bioinformatics, and advertising. The natural question to ask then is: Can we bypass the traditional ways of intuition/hypothesis-driven model creation and instead use data to generate predictions of physical problems? The first part of this talk will review recent work in which inference and machine learning have been used to extract operator matrices, discover dynamical systems, and derive the solution of differential equations. The second part of the talk will discuss the challenges of extending these methods and data-driven modeling in general in the prediction of complex real-world problems. For instance, regardless of the quantity of interest, there may exist several latent variables that might not be identifiable without a knowledge of the physics; we may not have enough data in all regimes of interest; and the data may be noisy and of variable quality. A pragmatic solution, then, is to blend data with existing physical knowledge and enforcing known physical constraints. Thus, one can improve model robustness and consistency with physical laws and address gaps in data. This would constitute a data-augmented physics-based modeling paradigm. Examples of this hybrid paradigm will be highlighted in fluid flow and materials applications.
    [Show full text]
  • Path Optimization in Free Energy Calculations
    Path Optimization in Free Energy Calculations by Ryan Muraglia Graduate Program in Computational Biology & Bioinformatics Duke University Date: Approved: Scott Schmidler, Supervisor Patrick Charbonneau Paul Magwene Thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in the Graduate Program in Computational Biology & Bioinformatics in the Graduate School of Duke University 2016 Abstract Path Optimization in Free Energy Calculations by Ryan Muraglia Graduate Program in Computational Biology & Bioinformatics Duke University Date: Approved: Scott Schmidler, Supervisor Patrick Charbonneau Paul Magwene An abstract of a thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in the Graduate Program in Computational Biology & Bioinformatics in the Graduate School of Duke University 2016 Copyright c 2016 by Ryan Muraglia All rights reserved except the rights granted by the Creative Commons Attribution-Noncommercial License Abstract Free energy calculations are a computational method for determining thermodynamic quantities, such as free energies of binding, via simulation. Currently, due to compu- tational and algorithmic limitations, free energy calculations are limited in scope. In this work, we propose two methods for improving the efficiency of free energy calcu- lations. First, we expand the state space of alchemical intermediates, and show that this expansion enables us to calculate free energies along lower variance paths. We use Q-learning, a reinforcement learning technique, to discover and optimize paths at low computational cost. Second, we reduce the cost of sampling along a given path by using sequential Monte Carlo samplers. We develop a new free energy estima- tor, pCrooks (pairwise Crooks), a variant on the Crooks fluctuation theorem (CFT), which enables decomposition of the variance of the free energy estimate for discrete paths, while retaining beneficial characteristics of CFT.
    [Show full text]
  • Computational Science, Ph.D. 1
    Computational Science, Ph.D. 1 Computational Science, Ph.D. Lee Swindlehurst, UCI Director 949-824-2818 computationalscience.uci.edu (https://computationalscience.uci.edu/) Joint Doctoral Program with UC Irvine and San Diego State University A joint offering with San Diego State University (SDSU), the Ph.D. program in Computational Science trains professionals capable of developing novel computational approaches to solve complex problems in both fundamental sciences and applied sciences and engineering. A program of study combining applied mathematics, computing, and a solid training in basic science culminates in doctoral research focused on an unsolved scientific problem. The Ph.D. in Computational Science produces broadly educated, research-capable scientists that are well prepared for diverse careers in academia, industry, business, and government research laboratories. Students are admitted into the joint program via a Joint Admissions Committee. Applicants apply to UCI directly using the UCI graduate application. Applicants are expected to hold a Bachelor’s degree in one of the science, technology, engineering, and mathematics (STEM) fields. Applicants are evaluated on the basis of their prior academic record and their potential for creative research and teaching, as demonstrated in submitted materials. These materials include official university transcripts, three letters of recommendation, GRE scores, a Statement of Purpose, and a Personal History statement. Program Requirements The normative time to completion is five years. The maximum time to completion is seven years. A total minimum of 66 units of course work, independent study, and research must be completed. These units must be distributed as follows: • Minimum of 18 units of graduate-level coursework as SDSU.
    [Show full text]