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.

Certainty from uncertainty

The analogy between temporally periodic phases of noisy extended driven systems and smooth interfaces in growth models is used to derive results for both problems, viz., stable, temporally quasiperiodic phases with long-range spatial order can in fact occur for noisy, short-range, isotropic rules in dimensions d>2. For d=2, temporally quasiperiodic phases have algebraic, rather than long-range, order, and occur only in anisotropic systems. Anisotropic rules can also produce smooth, commensurately growing interfaces with d≥2 dimensions for generic parameter values

Temporally periodic phases and kinetic roughening.

A method and apparatus authenticates and provides non-repudiability for analog messages which renders it impossible for a person, including the recipient, who is not in possession of a (cryptographic) key belonging to the claimed sender, to forge the message. The recipient is able to verify that the sender possessed the correct key, and a third party (judge) can establish whether the message was forged or not. This is accomplished by interposing a digital signature generator/verifier/recorder (DS-GVR) module in the sending apparatus, such as a facsimile machine. The receiver, using another DS-GVR, can verify that a received document comes from the purported sender and has not been altered enroute. The receiver's DS-GVR module can be made to produce a machine-readable record of the signed transmission. Retention of such a machine-readable record by the receiver prevents the sender from repudiating legitimate messages, because it enables the receiver to prove to a third party such as a judge that the corresponding message was generated by the sender and not by the receiver.

Digital signature generator/verifier/recorder (DS-GVR) for analog transmissions

Quantum-state tomography--the practice of estimating a quantum state by performing measurements on it - is useful in a variety of contexts. We introduce 'gentle tomography' as a version of tomography that preserves the measured quantum data. As an application of gentle tomography, we describe a polynomial-time method for universal source coding.

https://arxiv.org/pdf/quant-ph/0403078.pdf

Universal quantum data compression via nondestructive tomography

We inquire under what conditions some of the information in a quantum signal source, namely a set of pure states ψa emitted with probabilities p a, can be extracted in classical form by a measurement leaving the quantum system with less entropy than it had before, but retaining the ability to regenerate the source state exactly from the classical measurement result and the after-measurement state of the quantum system. We show that this can be done if and only if the source states ψa fall into two or more mutually orthogonal subsets.

Charles H. Bennett

Papers

Certainty from uncertainty

Temporally periodic phases and kinetic roughening.

Digital signature generator/verifier/recorder (DS-GVR) for analog transmissions

Universal quantum data compression via nondestructive tomography

Reduction of Quantum Entropy by Reversible Extraction of Classical Information