Author
Richard Phillips Feynman
Other affiliations: Massachusetts Institute of Technology, Cornell University, Los Alamos National Laboratory ...read more
Bio: Richard Phillips Feynman is an academic researcher from California Institute of Technology. The author has contributed to research in topics: Feynman diagram & Liquid helium. The author has an hindex of 77, co-authored 192 publications receiving 58881 citations. Previous affiliations of Richard Phillips Feynman include Massachusetts Institute of Technology & Cornell University.
Topics: Feynman diagram, Liquid helium, Electron, Meson, Quantum
Papers published on a yearly basis
Papers
More filters
01 Jan 2007
Cited by
More filters
TL;DR: A detailed description and comparison of algorithms for performing ab-initio quantum-mechanical calculations using pseudopotentials and a plane-wave basis set is presented in this article. But this is not a comparison of our algorithm with the one presented in this paper.
47,666 citations
University of Udine1, National Research Council2, International School for Advanced Studies3, Massachusetts Institute of Technology4, University of Paris5, Princeton University6, University of Minnesota7, ParisTech8, University of Milan9, International Centre for Theoretical Physics10, University of Paderborn11, ETH Zurich12, École Polytechnique Fédérale de Lausanne13
TL;DR: QUANTUM ESPRESSO as discussed by the authors is an integrated suite of computer codes for electronic-structure calculations and materials modeling, based on density functional theory, plane waves, and pseudopotentials (norm-conserving, ultrasoft, and projector-augmented wave).
Abstract: QUANTUM ESPRESSO is an integrated suite of computer codes for electronic-structure calculations and materials modeling, based on density-functional theory, plane waves, and pseudopotentials (norm-conserving, ultrasoft, and projector-augmented wave). The acronym ESPRESSO stands for opEn Source Package for Research in Electronic Structure, Simulation, and Optimization. It is freely available to researchers around the world under the terms of the GNU General Public License. QUANTUM ESPRESSO builds upon newly-restructured electronic-structure codes that have been developed and tested by some of the original authors of novel electronic-structure algorithms and applied in the last twenty years by some of the leading materials modeling groups worldwide. Innovation and efficiency are still its main focus, with special attention paid to massively parallel architectures, and a great effort being devoted to user friendliness. QUANTUM ESPRESSO is evolving towards a distribution of independent and interoperable codes in the spirit of an open-source project, where researchers active in the field of electronic-structure calculations are encouraged to participate in the project by contributing their own codes or by implementing their own ideas into existing codes.
19,985 citations
01 Dec 2010
TL;DR: This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
Abstract: Part I. Fundamental Concepts: 1. Introduction and overview 2. Introduction to quantum mechanics 3. Introduction to computer science Part II. Quantum Computation: 4. Quantum circuits 5. The quantum Fourier transform and its application 6. Quantum search algorithms 7. Quantum computers: physical realization Part III. Quantum Information: 8. Quantum noise and quantum operations 9. Distance measures for quantum information 10. Quantum error-correction 11. Entropy and information 12. Quantum information theory Appendices References Index.
14,825 citations
TL;DR: This paper presents a meta-modelling procedure called "Continuum Methods within MD and MC Simulations 3072", which automates the very labor-intensive and therefore time-heavy and expensive process of integrating discrete and continuous components into a discrete-time model.
Abstract: 6.2.2. Definition of Effective Properties 3064 6.3. Response Properties to Magnetic Fields 3066 6.3.1. Nuclear Shielding 3066 6.3.2. Indirect Spin−Spin Coupling 3067 6.3.3. EPR Parameters 3068 6.4. Properties of Chiral Systems 3069 6.4.1. Electronic Circular Dichroism (ECD) 3069 6.4.2. Optical Rotation (OR) 3069 6.4.3. VCD and VROA 3070 7. Continuum and Discrete Models 3071 7.1. Continuum Methods within MD and MC Simulations 3072
13,286 citations
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for these two problems, which takes a number of steps polynomial in the input size of the integer to be factored.
Abstract: A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and which have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.
7,427 citations