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.

Quantum Computation and Quantum Information

Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

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.

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

This chapter describes the possibility of simulating physics in the classical approximation, a thing which is usually described by local differential equations. But the physical world is quantum mechanical, and therefore the proper problem is the simulation of quantum physics. A computer which will give the same probabilities as the quantum system does. The present theory of physics allows space to go down into infinitesimal distances, wavelengths to get infinitely great, terms to be summed in infinite order, and so forth; and therefore, if this proposition is right, physical law is wrong. Quantum theory and quantizing is a very specific type of theory. The chapter talks about the possibility that there is to be an exact simulation, that the computer will do exactly the same as nature. There are interesting philosophical questions about reasoning, and relationship, observation, and measurement and so on, which computers have stimulated people to think about anew, with new types of thinking.

/pdf/simulating-physics-with-computers-11bt3yutby.pdf

Simulating physics with computers

CHARMM (Chemistry at HARvard Molecular Mechanics) is a highly versatile and widely used molecu- lar simulation program. It has been developed over the last three decades with a primary focus on molecules of bio- logical interest, including proteins, peptides, lipids, nucleic acids, carbohydrates, and small molecule ligands, as they occur in solution, crystals, and membrane environments. For the study of such systems, the program provides a large suite of computational tools that include numerous conformational and path sampling methods, free energy estima- tors, molecular minimization, dynamics, and analysis techniques, and model-building capabilities. The CHARMM program is applicable to problems involving a much broader class of many-particle systems. Calculations with CHARMM can be performed using a number of different energy functions and models, from mixed quantum mechanical-molecular mechanical force fields, to all-atom classical potential energy functions with explicit solvent and various boundary conditions, to implicit solvent and membrane models. The program has been ported to numer- ous platforms in both serial and parallel architectures. This article provides an overview of the program as it exists today with an emphasis on developments since the publication of the original CHARMM article in 1983.

/pdf/charmm-the-biomolecular-simulation-program-4kexem0xkx.pdf

CHARMM: the biomolecular simulation program.

Information and computation theory have undergone a spurt of new growth, and a renewal of their historic connection to basic physics, as they have expanded to treat the intact transmission and processing of quantum states, and the interaction of such 'quantum information' with traditional forms of information. We may wonder why this did not happen earlier, as quantum principles have long been accepted as fundamental to all of physics. Perhaps the founders of information and computation theory, such as Shannon, Turing and von Neumann, were too accustomed to thinking of information processing in macroscopic terms, not yet having before them the powerful examples of the genetic code and ever-shrinking microelectronics. Be that as it may, information until recently has largely been thought of in classical terms, with quantum mechanics playing a supporting role in the design of the equipment to process it, and setting limits on the rate at which it could be sent through certain channels. Now we know that a fully quantum theory of information and information processing offers, among other benefits, a brand of cryptography whose security rests on fundamental physics, and a reasonable hope of constructing quan- tum computers that could dramatically speed up the solution of certain mathematical problems. These benefits depend on distinc- tively quantum properties such as uncertainty, interference and entanglement. At a more fundamental level, it has become clear that an information theory based on quantum principles extends and completes classical information theory, just as complex numbers extend and complete the reals. Besides quantum generalizations of classical notions such as sources, channels and codes, the new theory includes two complementary, quantifiable kinds of information— classical information and quantum entanglement. Classical infor- mation can be copied at will, but can only be transmitted forward in time, to a receiver in the sender's forward light cone. Entanglement in contrast, cannot be copied, but can connect any two points in space-time. Conventional data processing operations destroy entanglement, but quantum operations can create it and use it for various purposes, such as speeding up certain classical computa- tions and assisting in the transmission of classical information or intact quantum states. Part of the new quantum information theory is the qualitative and quantitative study of entanglement, and its interactions with classical information. Any means, such as an optical fibre, of delivering quantum systems more or less intact from one place to another, may be viewed as a quantum channel. Unlike classical channels, which are well characterized by a single capacity, quantum channels have several distinct capacities, depending on what one is trying to use them for, and what auxiliary resources are brought into play. New effects involving quantum information continue to be discovered, not only in the traditional areas of computation, channel capacity, and cryptography, but in areas such as commu- nication complexity and game theory.

In information processing, as in physics, our classical world view provides an incomplete approximation to an underlying quantum reality. Quantum effects like interference and entanglement play no direct role in conventional information processing, but they can—in principle now, but probably eventually in practice—be harnessed to break codes, create unbreakable codes, and speed up otherwise intractable computations.

In their article [arXiv:1705.03394], 'That is not dead which can eternal lie: the aestivation hypothesis for resolving Fermi's paradox', Sandberg et al. try to explain the Fermi paradox (we see no aliens) by claiming that Landauer's principle implies that a civilization can in principle perform far more (${\sim} 10^{30}$ times more) irreversible logical operations (e.g., error-correcting bit erasures) if it conserves its resources until the distant future when the cosmic background temperature is very low. So perhaps aliens are out there, but quietly waiting. Sandberg et al. implicitly assume, however, that computer-generated entropy can only be disposed of by transferring it to the cosmological background. In fact, while this assumption may apply in the distant future, our universe today contains vast reservoirs and other physical systems in non-maximal entropy states, and computer-generated entropy can be transferred to them at the adiabatic conversion rate of one bit of negentropy to erase one bit of error. This can be done at any time, and is not improved by waiting for a low cosmic background temperature. Thus aliens need not wait to be active. As Sandberg et al. do not provide a concrete model of the effect they assert, we construct one and show where their informal argument goes wrong.

Charles H. Bennett

Papers

Comment on 'The aestivation hypothesis for resolving Fermi's paradox'