9,852 research outputs found
Fast optimization algorithms and the cosmological constant
Denef and Douglas have observed that in certain landscape models the problem
of finding small values of the cosmological constant is a large instance of an
NP-hard problem. The number of elementary operations (quantum gates) needed to
solve this problem by brute force search exceeds the estimated computational
capacity of the observable universe. Here we describe a way out of this
puzzling circumstance: despite being NP-hard, the problem of finding a small
cosmological constant can be attacked by more sophisticated algorithms whose
performance vastly exceeds brute force search. In fact, in some parameter
regimes the average-case complexity is polynomial. We demonstrate this by
explicitly finding a cosmological constant of order in a randomly
generated -dimensional ADK landscape.Comment: 19 pages, 5 figure
Spin-polarized Quantum Transport in Mesoscopic Conductors: Computational Concepts and Physical Phenomena
Mesoscopic conductors are electronic systems of sizes in between nano- and
micrometers, and often of reduced dimensionality. In the phase-coherent regime
at low temperatures, the conductance of these devices is governed by quantum
interference effects, such as the Aharonov-Bohm effect and conductance
fluctuations as prominent examples. While first measurements of quantum charge
transport date back to the 1980s, spin phenomena in mesoscopic transport have
moved only recently into the focus of attention, as one branch of the field of
spintronics. The interplay between quantum coherence with confinement-,
disorder- or interaction-effects gives rise to a variety of unexpected spin
phenomena in mesoscopic conductors and allows moreover to control and engineer
the spin of the charge carriers: spin interference is often the basis for
spin-valves, -filters, -switches or -pumps. Their underlying mechanisms may
gain relevance on the way to possible future semiconductor-based spin devices.
A quantitative theoretical understanding of spin-dependent mesoscopic
transport calls for developing efficient and flexible numerical algorithms,
including matrix-reordering techniques within Green function approaches, which
we will explain, review and employ.Comment: To appear in the Encyclopedia of Complexity and System Scienc
Extremal Optimization of Graph Partitioning at the Percolation Threshold
The benefits of a recently proposed method to approximate hard optimization
problems are demonstrated on the graph partitioning problem. The performance of
this new method, called Extremal Optimization, is compared to Simulated
Annealing in extensive numerical simulations. While generally a complex
(NP-hard) problem, the optimization of the graph partitions is particularly
difficult for sparse graphs with average connectivities near the percolation
threshold. At this threshold, the relative error of Simulated Annealing for
large graphs is found to diverge relative to Extremal Optimization at equalized
runtime. On the other hand, Extremal Optimization, based on the extremal
dynamics of self-organized critical systems, reproduces known results about
optimal partitions at this critical point quite well.Comment: 7 pages, RevTex, 9 ps-figures included, as to appear in Journal of
Physics
Quantum Cellular Automata
Quantum cellular automata (QCA) are reviewed, including early and more recent
proposals. QCA are a generalization of (classical) cellular automata (CA) and
in particular of reversible CA. The latter are reviewed shortly. An overview is
given over early attempts by various authors to define one-dimensional QCA.
These turned out to have serious shortcomings which are discussed as well.
Various proposals subsequently put forward by a number of authors for a general
definition of one- and higher-dimensional QCA are reviewed and their properties
such as universality and reversibility are discussed.Comment: 12 pages, 3 figures. To appear in the Springer Encyclopedia of
Complexity and Systems Scienc
Computational Complexity for Physicists
These lecture notes are an informal introduction to the theory of
computational complexity and its links to quantum computing and statistical
mechanics.Comment: references updated, reprint available from
http://itp.nat.uni-magdeburg.de/~mertens/papers/complexity.shtm
- …