23,286 research outputs found
Information, information processing and gravity
I discuss fundamental limits placed on information and information processing
by gravity. Such limits arise because both information and its processing
require energy, while gravitational collapse (formation of a horizon or black
hole) restricts the amount of energy allowed in a finite region. Specifically,
I use a criterion for gravitational collapse called the hoop conjecture. Once
the hoop conjecture is assumed a number of results can be obtained directly:
the existence of a fundamental uncertainty in spatial distance of order the
Planck length, bounds on information (entropy) in a finite region, and a bound
on the rate of information processing in a finite region. In the final section
I discuss some cosmological issues related to the total amount of information
in the universe, and note that almost all detailed aspects of the late universe
are determined by the randomness of quantum outcomes. This paper is based on a
talk presented at a 2007 Bellairs Research Institute (McGill University)
workshop on black holes and quantum information.Comment: 7 pages, 5 figures, revte
Climate Ready Estuaries - COAST in Action: 2012 Projects from Maine and New Hampshire
In summer 2011 the US EPA’s Climate Ready Estuaries program awarded funds to the Casco Bay Estuary Partnership (CBEP) in Portland, Maine, and the Piscataqua Region Estuaries Partnership (PREP) in coastal New Hampshire, to further develop and use COAST (COastal Adaptation to Sea level rise Tool) in their sea level rise adaptation planning processes. The New England Environmental Finance Center worked with municipal staff, elected officials, and other stakeholders to select specific locations, vulnerable assets, and adaptation actions to model using COAST. The EFC then collected the appropriate base data layers, ran the COAST simulations, and provided visual, numeric, and presentation-based products in support of the planning processes underway in both locations. These products helped galvanize support for the adaptation planning efforts. Through facilitated meetings they also led to stakeholders identifying specific action steps and begin to determine how to implement them
A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
We describe a new polynomial time quantum algorithm that uses the quantum
fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian
operator, and that can be applied in cases (commonly found in ab initio physics
and chemistry problems) for which all known classical algorithms require
exponential time. Applications of the algorithm to specific problems are
considered, and we find that classically intractable and interesting problems
from atomic physics may be solved with between 50 and 100 quantum bits.Comment: 10 page
Statistical Properties of Interacting Bose Gases in Quasi-2D Harmonic Traps
The analytical probability distribution of the quasi-2D (and purely 2D) ideal
and interacting Bose gas are investigated by using a canonical ensemble
approach. Using the analytical probability distribution of the condensate, the
statistical properties such as the mean occupation number and particle number
fluctuations of the condensate are calculated. Researches show that there is a
continuous crossover of the statistical properties from a quasi-2D to a purely
2D ideal or interacting gases. Different from the case of a 3D Bose gas, the
interaction between atoms changes in a deep way the nature of the particle
number fluctuations.Comment: RevTex, 10pages, 4 figures, E-mail: [email protected]
Quantum Simulations on a Quantum Computer
We present a general scheme for performing a simulation of the dynamics of
one quantum system using another. This scheme is used to experimentally
simulate the dynamics of truncated quantum harmonic and anharmonic oscillators
using nuclear magnetic resonance. We believe this to be the first explicit
physical realization of such a simulation.Comment: 4 pages, 2 figures (\documentstyle[prl,aps,epsfig,amscd]{revtex}); to
appear in Phys. Rev. Let
Implementation of the Quantum Fourier Transform
The quantum Fourier transform (QFT) has been implemented on a three bit
nuclear magnetic resonance (NMR) quantum computer, providing a first step
towards the realization of Shor's factoring and other quantum algorithms.
Implementation of the QFT is presented with fidelity measures, and state
tomography. Experimentally realizing the QFT is a clear demonstration of NMR's
ability to control quantum systems.Comment: 6 pages, 2 figure
Quantum operations that cannot be implemented using a small mixed environment
To implement any quantum operation (a.k.a. ``superoperator'' or ``CP map'')
on a d-dimensional quantum system, it is enough to apply a suitable overall
unitary transformation to the system and a d^2-dimensional environment which is
initialized in a fixed pure state. It has been suggested that a d-dimensional
environment might be enough if we could initialize the environment in a mixed
state of our choosing. In this note we show with elementary means that certain
explicit quantum operations cannot be realized in this way. Our counterexamples
map some pure states to pure states, giving strong and easily manageable
conditions on the overall unitary transformation. Everything works in the more
general setting of quantum operations from d-dimensional to d'-dimensional
spaces, so we place our counterexamples within this more general framework.Comment: LATEX, 8 page
Quantum computation over continuous variables
This paper provides necessary and sufficient conditions for constructing a
universal quantum computer over continuous variables. As an example, it is
shown how a universal quantum computer for the amplitudes of the
electromagnetic field might be constructed using simple linear devices such as
beam-splitters and phase shifters, together with squeezers and nonlinear
devices such as Kerr-effect fibers and atoms in optical cavities. Such a device
could in principle perform `quantum floating point' computations. Problems of
noise, finite precision, and error correction are discussed.Comment: 9 pages, Te
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
We provide fast algorithms for simulating many body Fermi systems on a
universal quantum computer. Both first and second quantized descriptions are
considered, and the relative computational complexities are determined in each
case. In order to accommodate fermions using a first quantized Hamiltonian, an
efficient quantum algorithm for anti-symmetrization is given. Finally, a
simulation of the Hubbard model is discussed in detail.Comment: Submitted 11/7/96 to Phys. Rev. Lett. 10 pages, 0 figure
Universal quantum interfaces
To observe or control a quantum system, one must interact with it via an
interface. This letter exhibits simple universal quantum interfaces--quantum
input/output ports consisting of a single two-state system or quantum bit that
interacts with the system to be observed or controlled. It is shown that under
very general conditions the ability to observe and control the quantum bit on
its own implies the ability to observe and control the system itself. The
interface can also be used as a quantum communication channel, and multiple
quantum systems can be connected by interfaces to become an efficient universal
quantum computer. Experimental realizations are proposed, and implications for
controllability, observability, and quantum information processing are
explored.Comment: 4 pages, 3 figures, RevTe
- …