id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
physics/0001048 | High-resolution path-integral development of financial options | physics.comp-ph cs.CE physics.data-an q-fin.PR | The Black-Scholes theory of option pricing has been considered for many years
as an important but very approximate zeroth-order description of actual market
behavior. We generalize the functional form of the diffusion of these systems
and also consider multi-factor models including stochastic volatility. Daily
Eurodo... |
physics/0002054 | Evolution of differentiated expression patterns in digital organisms | physics.bio-ph cs.NE q-bio.PE | We investigate the evolutionary processes behind the development and
optimization of multiple threads of execution in digital organisms using the
avida platform, a software package that implements Darwinian evolution on
populations of self-replicating computer programs. The system is seeded with a
linearly executed a... |
physics/0004057 | The information bottleneck method | physics.data-an cond-mat.dis-nn cs.LG nlin.AO | We define the relevant information in a signal $x\in X$ as being the
information that this signal provides about another signal $y\in \Y$. Examples
include the information that face images provide about the names of the people
portrayed, or the information that speech sounds provide about the words
spoken. Understand... |
physics/0005062 | Applying MDL to Learning Best Model Granularity | physics.data-an cs.AI cs.CV | The Minimum Description Length (MDL) principle is solidly based on a provably
ideal method of inference using Kolmogorov complexity. We test how the theory
behaves in practice on a general problem in model selection: that of learning
the best model granularity. The performance of a model depends critically on
the gra... |
physics/0007070 | Predictability, complexity and learning | physics.data-an cond-mat.dis-nn cond-mat.other cs.LG nlin.AO q-bio.OT | We define {\em predictive information} $I_{\rm pred} (T)$ as the mutual
information between the past and the future of a time series. Three
qualitatively different behaviors are found in the limit of large observation
times $T$: $I_{\rm pred} (T)$ can remain finite, grow logarithmically, or grow
as a fractional power... |
physics/0007075 | Optimization of Trading Physics Models of Markets | physics.comp-ph cond-mat.stat-mech cs.CE physics.data-an q-fin.ST | We describe an end-to-end real-time S&P futures trading system. Inner-shell
stochastic nonlinear dynamic models are developed, and Canonical Momenta
Indicators (CMI) are derived from a fitted Lagrangian used by outer-shell
trading models dependent on these indicators. Recursive and adaptive
optimization using Adaptiv... |
physics/0009032 | Information theory and learning: a physical approach | physics.data-an cond-mat.dis-nn cs.LG nlin.AO | We try to establish a unified information theoretic approach to learning and
to explore some of its applications. First, we define {\em predictive
information} as the mutual information between the past and the future of a
time series, discuss its behavior as a function of the length of the series,
and explain how ot... |
physics/0101021 | Adaptive evolution on neutral networks | physics.bio-ph cond-mat.stat-mech cs.NE nlin.AO q-bio.PE | We study the evolution of large but finite asexual populations evolving in
fitness landscapes in which all mutations are either neutral or strongly
deleterious. We demonstrate that despite the absence of higher fitness
genotypes, adaptation takes place as regions with more advantageous
distributions of neutral genoty... |
physics/0102009 | Self-adaptive exploration in evolutionary search | physics.bio-ph cs.NE nlin.AO q-bio | We address a primary question of computational as well as biological research
on evolution: How can an exploration strategy adapt in such a way as to exploit
the information gained about the problem at hand? We first introduce an
integrated formalism of evolutionary search which provides a unified view on
different s... |
physics/0209085 | The calculation of a normal force between multiparticle contacts using
fractional operators | physics.comp-ph cs.CE cs.NA math.NA physics.class-ph physics.geo-ph | This paper deals with the complex problem of how to simulate multiparticle
contacts. The collision process is responsible for the transfer and dissipation
of energy in granular media. A novel model of the interaction force between
particles has been proposed and tested. Such model allows us to simulate
multiparticle ... |
physics/0307117 | Symbolic stochastic dynamical systems viewed as binary N-step Markov
chains | physics.data-an cond-mat.stat-mech cs.CL math-ph math.MP nlin.AO physics.class-ph | A theory of systems with long-range correlations based on the consideration
of binary N-step Markov chains is developed. In the model, the conditional
probability that the i-th symbol in the chain equals zero (or unity) is a
linear function of the number of unities among the preceding N symbols. The
correlation and d... |
physics/0308041 | Ensembles of Protein Molecules as Statistical Analog Computers | physics.bio-ph cs.AI cs.NE physics.comp-ph physics.data-an q-bio.NC | A class of analog computers built from large numbers of microscopic
probabilistic machines is discussed. It is postulated that such computers are
implemented in biological systems as ensembles of protein molecules. The
formalism is based on an abstract computational model referred to as Protein
Molecule Machine (PMM)... |
physics/0405044 | Least Dependent Component Analysis Based on Mutual Information | physics.comp-ph cs.IT math.IT physics.data-an q-bio.QM | We propose to use precise estimators of mutual information (MI) to find least
dependent components in a linearly mixed signal. On the one hand this seems to
lead to better blind source separation than with any other presently available
algorithm. On the other hand it has the advantage, compared to other
implementatio... |
physics/0406023 | Maximum Entropy Multivariate Density Estimation: An exact
goodness-of-fit approach | physics.data-an cs.IT math.IT math.ST stat.TH | We consider the problem of estimating the population probability distribution
given a finite set of multivariate samples, using the maximum entropy approach.
In strict keeping with Jaynes' original definition, our precise formulation of
the problem considers contributions only from the smoothness of the estimated
dis... |
physics/0412029 | Spectral Mixture Decomposition by Least Dependent Component Analysis | physics.data-an cs.IT math.IT physics.chem-ph | A recently proposed mutual information based algorithm for decomposing data
into least dependent components (MILCA) is applied to spectral analysis, namely
to blind recovery of concentrations and pure spectra from their linear
mixtures. The algorithm is based on precise estimates of mutual information
between measure... |
physics/0504185 | Frequency of occurrence of numbers in the World Wide Web | physics.soc-ph cond-mat.stat-mech cs.DB math.ST stat.TH | The distribution of numbers in human documents is determined by a variety of
diverse natural and human factors, whose relative significance can be evaluated
by studying the numbers' frequency of occurrence. Although it has been studied
since the 1880's, this subject remains poorly understood. Here, we obtain the
deta... |
physics/0509039 | The Dynamics of Viral Marketing | physics.soc-ph cond-mat.stat-mech cs.DB cs.DS | We present an analysis of a person-to-person recommendation network,
consisting of 4 million people who made 16 million recommendations on half a
million products. We observe the propagation of recommendations and the cascade
sizes, which we explain by a simple stochastic model. We analyze how user
behavior varies wi... |
physics/0509075 | Sharp transition towards shared vocabularies in multi-agent systems | physics.soc-ph cond-mat.stat-mech cs.GT cs.MA | What processes can explain how very large populations are able to converge on
the use of a particular word or grammatical construction without global
coordination? Answering this question helps to understand why new language
constructs usually propagate along an S-shaped curve with a rather sudden
transition towards ... |
physics/0510117 | Modeling bursts and heavy tails in human dynamics | physics.soc-ph cs.MA | Current models of human dynamics, used from risk assessment to
communications, assume that human actions are randomly distributed in time and
thus well approximated by Poisson processes. We provide direct evidence that
for five human activity patterns the timing of individual human actions follow
non-Poisson statisti... |
physics/0511201 | Strategies for fast convergence in semiotic dynamics | physics.soc-ph cond-mat.stat-mech cs.GT cs.MA | Semiotic dynamics is a novel field that studies how semiotic conventions
spread and stabilize in a population of agents. This is a central issue both
for theoretical and technological reasons since large system made up of
communicating agents, like web communities or artificial embodied agents teams,
are getting wide... |
physics/0512045 | Topology Induced Coarsening in Language Games | physics.soc-ph cond-mat.stat-mech cs.GT cs.MA | We investigate how very large populations are able to reach a global
consensus, out of local "microscopic" interaction rules, in the framework of a
recently introduced class of models of semiotic dynamics, the so-called Naming
Game. We compare in particular the convergence mechanism for interacting agents
embedded in... |
physics/0601118 | Learning about knowledge: A complex network approach | physics.soc-ph cond-mat.dis-nn cs.NE physics.comp-ph | This article describes an approach to modeling knowledge acquisition in terms
of walks along complex networks. Each subset of knowledge is represented as a
node, and relations between such knowledge are expressed as edges. Two types of
edges are considered, corresponding to free and conditional transitions. The
latte... |
physics/0601161 | Monte Carlo Algorithm for Least Dependent Non-Negative Mixture
Decomposition | physics.chem-ph cond-mat.stat-mech cs.IT math.IT math.PR math.ST physics.comp-ph physics.data-an stat.TH | We propose a simulated annealing algorithm (called SNICA for "stochastic
non-negative independent component analysis") for blind decomposition of linear
mixtures of non-negative sources with non-negative coefficients. The de-mixing
is based on a Metropolis type Monte Carlo search for least dependent
components, with ... |
physics/0602033 | Community Structure in the United States House of Representatives | physics.soc-ph cond-mat.stat-mech cs.MA nlin.AO physics.data-an | We investigate the networks of committee and subcommittee assignments in the
United States House of Representatives from the 101st--108th Congresses, with
the committees connected by ``interlocks'' or common membership. We examine the
community structure in these networks using several methods, revealing strong
links... |
physics/0603002 | Functional dissipation microarrays for classification | physics.data-an cs.CV | In this article, we describe a new method of extracting information from
signals, called functional dissipation, that proves to be very effective for
enhancing classification of high resolution, texture-rich data. Our algorithm
bypasses to some extent the need to have very specialized feature extraction
techniques, a... |
physics/0606053 | Optimal estimation for Large-Eddy Simulation of turbulence and
application to the analysis of subgrid models | physics.class-ph cs.NE | The tools of optimal estimation are applied to the study of subgrid models
for Large-Eddy Simulation of turbulence. The concept of optimal estimator is
introduced and its properties are analyzed in the context of applications to a
priori tests of subgrid models. Attention is focused on the Cook and Riley
model in the... |
physics/0607116 | Utilisation de la substitution sensorielle par \'{e}lectro-stimulation
linguale pour la pr\'{e}vention des escarres chez les parapl\'{e}giques.
Etude pr\'{e}liminaire | physics.med-ph cs.RO q-bio.NC | Pressure ulcers are recognized as a major health issue in individuals with
spinal cord injuries and new approaches to prevent this pathology are
necessary. An innovative health strategy is being developed through the use of
computer and sensory substitution via the tongue in order to compensate for the
sensory loss i... |
physics/0608166 | Information filtering via Iterative Refinement | physics.data-an cs.IR physics.soc-ph | With the explosive growth of accessible information, expecially on the
Internet, evaluation-based filtering has become a crucial task. Various systems
have been devised aiming to sort through large volumes of information and
select what is likely to be more relevant. In this letter we analyse a new
ranking method, wh... |
physics/0608185 | Updating Probabilities | physics.data-an cond-mat.stat-mech cs.IT math.IT | We show that Skilling's method of induction leads to a unique general theory
of inductive inference, the method of Maximum relative Entropy (ME). The main
tool for updating probabilities is the logarithmic relative entropy; other
entropies such as those of Renyi or Tsallis are ruled out. We also show that
Bayes updat... |
physics/0608293 | Automatic Trading Agent. RMT based Portfolio Theory and Portfolio
Selection | physics.soc-ph cs.CE q-fin.PM stat.AP | Portfolio theory is a very powerful tool in the modern investment theory. It
is helpful in estimating risk of an investor's portfolio, which arises from our
lack of information, uncertainty and incomplete knowledge of reality, which
forbids a perfect prediction of future price changes. Despite of many
advantages this... |
physics/0609097 | F.A.S.T. - Floor field- and Agent-based Simulation Tool | physics.comp-ph cs.MA physics.soc-ph | In this paper a model of pedestrian motion is presented. As application its
parameters are fitted to one run in a primary school evacuation exercise.
Simulations with these parameters are compared to further runs during the same
exercise.
|
physics/0610051 | Structural Inference of Hierarchies in Networks | physics.soc-ph cs.LG physics.data-an | One property of networks that has received comparatively little attention is
hierarchy, i.e., the property of having vertices that cluster together in
groups, which then join to form groups of groups, and so forth, up through all
levels of organization in the network. Here, we give a precise definition of
hierarchica... |
physics/0701081 | Spatio-Temporal Electromagnetic Field Shapes and their Logical
Processing | physics.comp-ph cs.CV physics.gen-ph | This paper is on the spatio-temporal signals with the topologically modulated
electromagnetic fields. The carrier of the digital information is the
topological scheme composed of the separatrices-manifolds and equilibrium
positions of the field. The signals and developed hardware for their processing
in the space-tim... |
physics/0703126 | The Laplace-Jaynes approach to induction | physics.data-an cs.AI quant-ph | An approach to induction is presented, based on the idea of analysing the
context of a given problem into `circumstances'. This approach, fully Bayesian
in form and meaning, provides a complement or in some cases an alternative to
that based on de Finetti's representation theorem and on the notion of infinite
exchang... |
physics/0703164 | Cultural route to the emergence of linguistic categories | physics.soc-ph cond-mat.dis-nn cs.MA | Categories provide a coarse grained description of the world. A fundamental
question is whether categories simply mirror an underlying structure of nature,
or instead come from the complex interactions of human beings among themselves
and with the environment. Here we address this question by modelling a
population o... |
physics/9911006 | Genetic Algorithms in Time-Dependent Environments | physics.bio-ph adap-org cs.NE nlin.AO q-bio | The influence of time-dependent fitnesses on the infinite population dynamics
of simple genetic algorithms (without crossover) is analyzed. Based on general
arguments, a schematic phase diagram is constructed that allows one to
characterize the asymptotic states in dependence on the mutation rate and the
time scale o... |
q-bio/0310011 | Complex Independent Component Analysis of Frequency-Domain
Electroencephalographic Data | q-bio.QM cs.CE physics.data-an q-bio.NC | Independent component analysis (ICA) has proven useful for modeling brain and
electroencephalographic (EEG) data. Here, we present a new, generalized method
to better capture the dynamics of brain signals than previous ICA algorithms.
We regard EEG sources as eliciting spatio-temporal activity patterns,
corresponding... |
q-bio/0310025 | Pattern Excitation-Based Processing: The Music of The Brain | q-bio.NC cs.NE physics.bio-ph | An approach to information processing based on the excitation of patterns of
activity by non-linear active resonators in response to their input patterns is
proposed. Arguments are presented to show that any computation performed by a
conventional Turing machine-based computer, called T-machine in this paper,
could a... |
q-bio/0401033 | Parametric Inference for Biological Sequence Analysis | q-bio.GN cs.LG math.ST stat.TH | One of the major successes in computational biology has been the unification,
using the graphical model formalism, of a multitude of algorithms for
annotating and comparing biological sequences. Graphical models that have been
applied towards these problems include hidden Markov models for annotation,
tree models for... |
q-bio/0402029 | Fluctuation-dissipation theorem and models of learning | q-bio.NC cs.LG nlin.AO physics.data-an | Advances in statistical learning theory have resulted in a multitude of
different designs of learning machines. But which ones are implemented by
brains and other biological information processors? We analyze how various
abstract Bayesian learners perform on different data and argue that it is
difficult to determine ... |
q-bio/0403011 | Memorization in a neural network with adjustable transfer function and
conditional gating | q-bio.NC cs.NE | The main problem about replacing LTP as a memory mechanism has been to find
other highly abstract, easily understandable principles for induced plasticity.
In this paper we attempt to lay out such a basic mechanism, namely intrinsic
plasticity. Important empirical observations with theoretical significance are
time-l... |
q-bio/0403022 | Intelligent encoding and economical communication in the visual stream | q-bio.NC cs.AI cs.CC nlin.AO | The theory of computational complexity is used to underpin a recent model of
neocortical sensory processing. We argue that encoding into reconstruction
networks is appealing for communicating agents using Hebbian learning and
working on hard combinatorial problems, which are easy to verify. Computational
definition o... |
q-bio/0403036 | The Triplet Genetic Code had a Doublet Predecessor | q-bio.GN cs.CE q-bio.BM quant-ph | Information theoretic analysis of genetic languages indicates that the
naturally occurring 20 amino acids and the triplet genetic code arose by
duplication of 10 amino acids of class-II and a doublet genetic code having
codons NNY and anticodons $\overleftarrow{\rm GNN}$. Evidence for this scenario
is presented based... |
q-bio/0406015 | Information theory, multivariate dependence, and genetic network
inference | q-bio.QM cs.IT math.IT math.ST physics.data-an q-bio.GN stat.TH | We define the concept of dependence among multiple variables using maximum
entropy techniques and introduce a graphical notation to denote the
dependencies. Direct inference of information theoretic quantities from data
uncovers dependencies even in undersampled regimes when the joint probability
distribution cannot ... |
q-bio/0411030 | Statistical Mechanics Characterization of Neuronal Mosaics | q-bio.NC cond-mat.dis-nn cs.CV physics.bio-ph q-bio.QM | The spatial distribution of neuronal cells is an important requirement for
achieving proper neuronal function in several parts of the nervous system of
most animals. For instance, specific distribution of photoreceptors and related
neuronal cells, particularly the ganglion cells, in mammal's retina is required
in ord... |
q-bio/0501021 | Spike timing precision and neural error correction: local behavior | q-bio.NC cs.NE math.DS | The effects of spike timing precision and dynamical behavior on error
correction in spiking neurons were investigated. Stationary discharges -- phase
locked, quasiperiodic, or chaotic -- were induced in a simulated neuron by
presenting pacemaker presynaptic spike trains across a model of a prototypical
inhibitory syn... |
q-bio/0502023 | Learning intrinsic excitability in medium spiny neurons | q-bio.NC cs.NE | We present an unsupervised, local activation-dependent learning rule for
intrinsic plasticity (IP) which affects the composition of ion channel
conductances for single neurons in a use-dependent way. We use a
single-compartment conductance-based model for medium spiny striatal neurons in
order to show the effects of ... |
q-bio/0505021 | Characterizing Self-Developing Biological Neural Networks: A First Step
Towards their Application To Computing Systems | q-bio.NC cs.AR cs.NE nlin.AO | Carbon nanotubes are often seen as the only alternative technology to silicon
transistors. While they are the most likely short-term one, other longer-term
alternatives should be studied as well. While contemplating biological neurons
as an alternative component may seem preposterous at first sight, significant
recen... |
q-bio/0505050 | HLA and HIV Infection Progression: Application of the Minimum
Description Length Principle to Statistical Genetics | q-bio.QM cs.IT math.IT | The minimum description length (MDL) principle states that the best model to
account for some data minimizes the sum of the lengths, in bits, of the
descriptions of the model and the residual error. The description length is
thus a criterion for model selection. Description-length analysis of HLA
alleles from the Chi... |
q-bio/0507037 | Neuromodulation Influences Synchronization and Intrinsic Read-out | q-bio.NC cs.NE nlin.AO | Background: The roles of neuromodulation in a neural network, such as in a
cortical microcolumn, are still incompletely understood. Neuromodulation
influences neural processing by presynaptic and postsynaptic regulation of
synaptic efficacy. Neuromodulation also affects ion channels and intrinsic
excitability. Method... |
q-bio/0510007 | The fitness value of information | q-bio.PE cs.IT math.IT q-bio.NC | Biologists measure information in different ways. Neurobiologists and
researchers in bioinformatics often measure information using
information-theoretic measures such as Shannon's entropy or mutual information.
Behavioral biologists and evolutionary ecologists more commonly use
decision-theoretic measures, such the ... |
q-bio/0511045 | The use of the GARP genetic algorithm and internet grid computing in the
Lifemapper world atlas of species biodiversity | q-bio.QM cs.DC cs.NE q-bio.OT | Lifemapper (http://www.lifemapper.org) is a predictive electronic atlas of
the Earth's biological biodiversity. Using a screensaver version of the GARP
genetic algorithm for modeling species distributions, Lifemapper harnesses vast
computing resources through 'volunteers' PCs similar to SETI@home, to develop
models o... |
q-bio/0511046 | Improving ecological niche models by data mining large environmental
datasets for surrogate models | q-bio.QM cs.AI | WhyWhere is a new ecological niche modeling (ENM) algorithm for mapping and
explaining the distribution of species. The algorithm uses image processing
methods to efficiently sift through large amounts of data to find the few
variables that best predict species occurrence. The purpose of this paper is to
describe and... |
q-bio/0603007 | Compression ratios based on the Universal Similarity Metric still yield
protein distances far from CATH distances | q-bio.QM cs.CE physics.data-an q-bio.OT | Kolmogorov complexity has inspired several alignment-free distance measures,
based on the comparison of lengths of compressions, which have been applied
successfully in many areas. One of these measures, the so-called Universal
Similarity Metric (USM), has been used by Krasnogor and Pelta to compare simple
protein co... |
q-bio/0604024 | The transposition distance for phylogenetic trees | q-bio.PE cs.CE math.GR q-bio.OT | The search for similarity and dissimilarity measures on phylogenetic trees
has been motivated by the computation of consensus trees, the search by
similarity in phylogenetic databases, and the assessment of clustering results
in bioinformatics. The transposition distance for fully resolved phylogenetic
trees is a rec... |
q-bio/0605020 | Laws in Darwinian Evolutionary Theory | q-bio.PE cond-mat.stat-mech cs.NE math.OC nlin.AO physics.bio-ph q-bio.QM | In the present article the recent works to formulate laws in Darwinian
evolutionary dynamics are discussed. Although there is a strong consensus that
general laws in biology may exist, opinions opposing such suggestion are
abundant. Based on recent progress in both mathematics and biology, another
attempt to address ... |
q-bio/0607018 | A p-Adic Model of DNA Sequence and Genetic Code | q-bio.GN cs.IT math-ph math.IT math.MP physics.bio-ph | Using basic properties of p-adic numbers, we consider a simple new approach
to describe main aspects of DNA sequence and genetic code. Central role in our
investigation plays an ultrametric p-adic information space which basic
elements are nucleotides, codons and genes. We show that a 5-adic model is
appropriate for ... |
q-bio/0610040 | Metric learning pairwise kernel for graph inference | q-bio.QM cs.LG | Much recent work in bioinformatics has focused on the inference of various
types of biological networks, representing gene regulation, metabolic
processes, protein-protein interactions, etc. A common setting involves
inferring network edges in a supervised fashion from a set of high-confidence
edges, possibly charact... |
q-bio/0612013 | Clustering fetal heart rate tracings by compression | q-bio.TO cs.CV cs.IR q-bio.QM | Fetal heart rate (FHR) monitoring, before and during labor, is a very
important medical practice in the detection of fetuses in danger. We clustered
FHR tracings by compression in order to identify abnormal ones. We use a
recently introduced approach based on algorithmic information theory, a
theoretical, rigorous an... |
q-bio/0701009 | Attribute Exploration of Discrete Temporal Transitions | q-bio.QM cs.AI q-bio.MN | Discrete temporal transitions occur in a variety of domains, but this work is
mainly motivated by applications in molecular biology: explaining and analyzing
observed transcriptome and proteome time series by literature and database
knowledge. The starting point of a formal concept analysis model is presented.
The ob... |
q-bio/0703044 | On the existence of potential landscape in the evolution of complex
systems | q-bio.QM cond-mat.stat-mech cs.IT math.DS math.IT nlin.AO q-bio.MN | A recently developed treatment of stochastic processes leads to the
construction of a potential landscape for the dynamical evolution of complex
systems. Since the existence of a potential function in generic settings has
been frequently questioned in literature,herewe study several related
theoretical issues that li... |
quant-ph/0011122 | Algorithmic Theories of Everything | quant-ph cs.AI cs.CC cs.LG hep-th math-ph math.MP physics.comp-ph | The probability distribution P from which the history of our universe is
sampled represents a theory of everything or TOE. We assume P is formally
describable. Since most (uncountably many) distributions are not, this imposes
a strong inductive bias. We show that P(x) is small for any universe x lacking
a short descr... |
quant-ph/0012111 | Quantum error-correcting codes associated with graphs | quant-ph cs.IT math-ph math.IT math.MP | We present a construction scheme for quantum error correcting codes. The
basic ingredients are a graph and a finite abelian group, from which the code
can explicitly be obtained. We prove necessary and sufficient conditions for
the graph such that the resulting code corrects a certain number of errors.
This allows a ... |
quant-ph/0102108 | Quantum Kolmogorov Complexity Based on Classical Descriptions | quant-ph cs.CC cs.IT math.IT math.LO | We develop a theory of the algorithmic information in bits contained in an
individual pure quantum state. This extends classical Kolmogorov complexity to
the quantum domain retaining classical descriptions. Quantum Kolmogorov
complexity coincides with the classical Kolmogorov complexity on the classical
domain. Quant... |
quant-ph/0107129 | Algebraic geometric construction of a quantum stabilizer code | quant-ph cs.IT math.AG math.IT math.SG | The stabilizer code is the most general algebraic construction of quantum
error-correcting codes proposed so far. A stabilizer code can be constructed
from a self-orthogonal subspace of a symplectic space over a finite field. We
propose a construction method of such a self-orthogonal space using an
algebraic curve. B... |
quant-ph/0108073 | Quantum Information in Space and Time | quant-ph cond-mat.mes-hall cs.IT gr-qc hep-ph hep-th math-ph math.IT math.MP math.PR | Many important results in modern quantum information theory have been
obtained for an idealized situation when the spacetime dependence of quantum
phenomena is neglected. However the transmission and processing of (quantum)
information is a physical process in spacetime. Therefore such basic notions in
quantum inform... |
quant-ph/0108133 | On Classical and Quantum Cryptography | quant-ph cond-mat.mes-hall cs.IT hep-th math-ph math.IT math.MP | Lectures on classical and quantum cryptography. Contents: Private key
cryptosystems. Elements of number theory. Public key cryptography and RSA
cryptosystem. Shannon`s entropy and mutual information. Entropic uncertainty
relations. The no cloning theorem. The BB84 quantum cryptographic protocol.
Security proofs. Bell... |
quant-ph/0110103 | Quantum entanglement and geometry of determinantal varieties | quant-ph cs.IT math.AG math.IT | Quantum entanglement was first recognized as a feature of quantum mechanics
in the famous paper of Einstein, Podolsky and Rosen [18]. Recently it has been
realized that quantum entanglement is a key ingredient in quantum computation,
quantum communication and quantum cryptography ([16],[17],[6]). In this paper,
we in... |
quant-ph/0202015 | Semiclassical Neural Network | quant-ph cond-mat.dis-nn cs.AI q-bio | We have constructed a simple semiclassical model of neural network where
neurons have quantum links with one another in a chosen way and affect one
another in a fashion analogous to action potentials. We have examined the role
of stochasticity introduced by the quantum potential and compare the system
with the classi... |
quant-ph/0202016 | Neural Networks with c-NOT Gated Nodes | quant-ph cond-mat.dis-nn cs.AI q-bio | We try to design a quantum neural network with qubits instead of classical
neurons with deterministic states, and also with quantum operators replacing
teh classical action potentials. With our choice of gates interconnecting teh
neural lattice, it appears that the state of the system behaves in ways
reflecting both ... |
quant-ph/0203010 | Entangled Quantum Networks | quant-ph cond-mat.dis-nn cs.AI | We present some results from simulation of a network of nodes connected by
c-NOT gates with nearest neighbors. Though initially we begin with pure states
of varying boundary conditions, the updating with time quickly involves a
complicated entanglement involving all or most nodes. As a normal c-NOT gate,
though unita... |
quant-ph/0203105 | The capacity of hybrid quantum memory | quant-ph cs.IT math-ph math.IT math.MP math.OA | The general stable quantum memory unit is a hybrid consisting of a classical
digit with a quantum digit (qudit) assigned to each classical state. The shape
of the memory is the vector of sizes of these qudits, which may differ. We
determine when N copies of a quantum memory A embed in N(1+o(1)) copies of
another quan... |
quant-ph/0205161 | Contextualizing Concepts using a Mathematical Generalization of the
Quantum Formalism | quant-ph cs.AI q-bio.NC | We outline the rationale and preliminary results of using the State Context
Property (SCOP) formalism, originally developed as a generalization of quantum
mechanics, to describe the contextual manner in which concepts are evoked,
used, and combined to generate meaning. The quantum formalism was developed to
cope with... |
quant-ph/0207069 | Data compression limit for an information source of interacting qubits | quant-ph cs.IT math-ph math.IT math.MP | A system of interacting qubits can be viewed as a non-i.i.d quantum
information source. A possible model of such a source is provided by a quantum
spin system, in which spin-1/2 particles located at sites of a lattice interact
with each other. We establish the limit for the compression of information from
such a sour... |
quant-ph/0210176 | Quantum Pattern Recognition | quant-ph cond-mat.dis-nn cs.IR nlin.AO q-bio.NC | I review and expand the model of quantum associative memory that I have
recently proposed. In this model binary patterns of n bits are stored in the
quantum superposition of the appropriate subset of the computational basis of n
qbits. Information can be retrieved by performing an input-dependent rotation
of the memo... |
quant-ph/0301075 | Selective pressures on genomes in molecular evolution | quant-ph cs.NE nlin.AO physics.bio-ph q-bio.PE | We describe the evolution of macromolecules as an information transmission
process and apply tools from Shannon information theory to it. This allows us
to isolate three independent, competing selective pressures that we term
compression, transmission, and neutrality selection. The first two affect
genome length: the... |
quant-ph/0307170 | Quantum Stein's lemma revisited, inequalities for quantum entropies, and
a concavity theorem of Lieb | quant-ph cs.IT math-ph math.IT math.MP | We derive the monotonicity of the quantum relative entropy by an elementary
operational argument based on Stein's lemma in quantum hypothesis testing. For
the latter we present an elementary and short proof that requires the law of
large numbers only. Joint convexity of the quantum relative entropy is proven
too, res... |
quant-ph/0308158 | New Approachs to Quantum Computer Simulaton in a Classical Supercomputer | quant-ph cs.CE | Classical simulation is important because it sets a benchmark for quantum
computer performance. Classical simulation is currently the only way to
exercise larger numbers of qubits. To achieve larger simulations, sparse matrix
processing is emphasized below while trading memory for processing. It
performed well within... |
quant-ph/0309022 | Quantum Aspects of Semantic Analysis and Symbolic Artificial
Intelligence | quant-ph cs.CL | Modern approaches to semanic analysis if reformulated as Hilbert-space
problems reveal formal structures known from quantum mechanics. Similar
situation is found in distributed representations of cognitive structures
developed for the purposes of neural networks. We take a closer look at
similarites and differences b... |
quant-ph/0310075 | Symmetric Informationally Complete Quantum Measurements | quant-ph cs.IT math.FA math.IT | We consider the existence in arbitrary finite dimensions d of a POVM
comprised of d^2 rank-one operators all of whose operator inner products are
equal. Such a set is called a ``symmetric, informationally complete'' POVM
(SIC-POVM) and is equivalent to a set of d^2 equiangular lines in C^d.
SIC-POVMs are relevant for... |
quant-ph/0411140 | Improved Bounds on Quantum Learning Algorithms | quant-ph cs.LG | In this article we give several new results on the complexity of algorithms
that learn Boolean functions from quantum queries and quantum examples.
Hunziker et al. conjectured that for any class C of Boolean functions, the
number of quantum black-box queries which are required to exactly identify an
unknown functio... |
quant-ph/0501099 | Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting
Codes | quant-ph cs.IT math.IT | Simple rate-1/3 single-error-correcting unrestricted and CSS-type quantum
convolutional codes are constructed from classical self-orthogonal
$\F_4$-linear and $\F_2$-linear convolutional codes, respectively. These
quantum convolutional codes have higher rate than comparable quantum block
codes or previous quantum con... |
quant-ph/0501126 | Primitive Quantum BCH Codes over Finite Fields | quant-ph cs.IT math.IT | An attractive feature of BCH codes is that one can infer valuable information
from their design parameters (length, size of the finite field, and designed
distance), such as bounds on the minimum distance and dimension of the code. In
this paper, it is shown that one can also deduce from the design parameters
whether... |
quant-ph/0501152 | A generalized skew information and uncertainty relation | quant-ph cs.IT math.IT | A generalized skew information is defined and a generalized uncertainty
relation is established with the help of a trace inequality which was recently
proven by J.I.Fujii. In addition, we prove the trace inequality conjectured by
S.Luo and Z.Zhang. Finally we point out that Theorem 1 in {\it S.Luo and
Q.Zhang, IEEE T... |
quant-ph/0503236 | On Self-Dual Quantum Codes, Graphs, and Boolean Functions | quant-ph cs.IT math.IT | A short introduction to quantum error correction is given, and it is shown
that zero-dimensional quantum codes can be represented as self-dual additive
codes over GF(4) and also as graphs. We show that graphs representing several
such codes with high minimum distance can be described as nested regular graphs
having m... |
quant-ph/0506080 | Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem | quant-ph cs.IT math-ph math.DS math.IT math.MP | In classical information theory, entropy rate and Kolmogorov complexity per
symbol are related by a theorem of Brudno. In this paper, we prove a quantum
version of this theorem, connecting the von Neumann entropy rate and two
notions of quantum Kolmogorov complexity, both based on the shortest qubit
descriptions of q... |
quant-ph/0507231 | Algebras of Measurements: the logical structure of Quantum Mechanics | quant-ph cs.AI | In Quantum Physics, a measurement is represented by a projection on some
closed subspace of a Hilbert space. We study algebras of operators that
abstract from the algebra of projections on closed subspaces of a Hilbert
space. The properties of such operators are justified on epistemological
grounds. Commutation of me... |
quant-ph/0508070 | Nonbinary stabilizer codes over finite fields | quant-ph cs.IT math.IT | One formidable difficulty in quantum communication and computation is to
protect information-carrying quantum states against undesired interactions with
the environment. In past years, many good quantum error-correcting codes had
been derived as binary stabilizer codes. Fault-tolerant quantum computation
prompted the... |
quant-ph/0511016 | Convolutional and tail-biting quantum error-correcting codes | quant-ph cs.IT math.IT | Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to
4096 states and minimum distances up to 10 are constructed as stabilizer codes
from classical self-orthogonal rate-1/n F_4-linear and binary linear
convolutional codes, respectively. These codes generally have higher rate and
less decoding ... |
quant-ph/0511172 | On Classical Teleportation and Classical Nonlocality | quant-ph cs.IT math.IT | An interesting protocol for classical teleportation of an unknown classical
state was recently suggested by Cohen, and by Gour and Meyer. In that protocol,
Bob can sample from a probability distribution P that is given to Alice, even
if Alice has absolutely no knowledge about P. Pursuing a similar line of
thought, we... |
quant-ph/0511175 | A Proof of the Security of Quantum Key Distribution | quant-ph cs.CR cs.IT math.IT | We prove the security of theoretical quantum key distribution against the
most general attacks which can be performed on the channel, by an eavesdropper
who has unlimited computation abilities, and the full power allowed by the
rules of classical and quantum physics. A key created that way can then be used
to transmi... |
quant-ph/0601115 | Phase-Remapping Attack in Practical Quantum Key Distribution Systems | quant-ph cs.IT math.IT | Quantum key distribution (QKD) can be used to generate secret keys between
two distant parties. Even though QKD has been proven unconditionally secure
against eavesdroppers with unlimited computation power, practical
implementations of QKD may contain loopholes that may lead to the generated
secret keys being comprom... |
quant-ph/0602129 | Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional
Codes | quant-ph cs.IT math.IT | We present an algorithm to construct quantum circuits for encoding and
inverse encoding of quantum convolutional codes. We show that any quantum
convolutional code contains a subcode of finite index which has a
non-catastrophic encoding circuit. Our work generalizes the conditions for
non-catastrophic encoders derive... |
quant-ph/0603031 | Channel capacities of classical and quantum list decoding | quant-ph cs.IT math.IT | We focus on classical and quantum list decoding. The capacity of list
decoding was obtained by Nishimura in the case when the number of list does not
increase exponentially. However, the capacity of the exponential-list case is
open even in the classical case while its converse part was obtained by
Nishimura. We deri... |
quant-ph/0603098 | Quantum broadcast channels | quant-ph cs.IT math.IT | We consider quantum channels with one sender and two receivers, used in
several different ways for the simultaneous transmission of independent
messages. We begin by extending the technique of superposition coding to
quantum channels with a classical input to give a general achievable region. We
also give outer bound... |
quant-ph/0603135 | Interaction in Quantum Communication | quant-ph cs.CC cs.IT math.IT | In some scenarios there are ways of conveying information with many fewer,
even exponentially fewer, qubits than possible classically. Moreover, some of
these methods have a very simple structure--they involve only few message
exchanges between the communicating parties. It is therefore natural to ask
whether every c... |
quant-ph/0604013 | Beyond i.i.d. in Quantum Information Theory | quant-ph cs.IT math.IT | The information spectrum approach gives general formulae for optimal rates of
codes in many areas of information theory. In this paper the quantum spectral
divergence rates are defined and properties of the rates are derived. The
entropic rates, conditional entropic rates, and spectral mutual information
rates are th... |
quant-ph/0604161 | Clifford Code Constructions of Operator Quantum Error Correcting Codes | quant-ph cs.IT math.IT | Recently, operator quantum error-correcting codes have been proposed to unify
and generalize decoherence free subspaces, noiseless subsystems, and quantum
error-correcting codes. This note introduces a natural construction of such
codes in terms of Clifford codes, an elegant generalization of stabilizer codes
due to ... |
quant-ph/0605030 | Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov
Complexity | quant-ph cs.IT math-ph math.IT math.MP | We show that there exists a universal quantum Turing machine (UQTM) that can
simulate every other QTM until the other QTM has halted and then halt itself
with probability one. This extends work by Bernstein and Vazirani who have
shown that there is a UQTM that can simulate every other QTM for an arbitrary,
but preass... |
quant-ph/0605041 | Invertible Quantum Operations and Perfect Encryption of Quantum States | quant-ph cs.CR cs.IT math.IT | In this note, we characterize the form of an invertible quantum operation,
i.e., a completely positive trace preserving linear transformation (a CPTP map)
whose inverse is also a CPTP map. The precise form of such maps becomes
important in contexts such as self-testing and encryption. We show that these
maps correspo... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.