corpus_id stringlengths 7 12 | paper_id stringlengths 9 16 | title stringlengths 1 261 | abstract stringlengths 70 4.02k | source stringclasses 1
value | bibtex stringlengths 208 20.9k | citation_key stringlengths 6 100 |
|---|---|---|---|---|---|---|
arxiv-677101 | physics/0703126 | The Laplace-Jaynes approach to induction | <|reference_start|>The Laplace-Jaynes approach to induction: 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 r... | arxiv | @article{mana2007the,
title={The Laplace-Jaynes approach to induction},
author={P. G. L. Porta Mana, A. M{aa}nsson, G. Bj"ork},
journal={arXiv preprint arXiv:physics/0703126},
year={2007},
archivePrefix={arXiv},
eprint={physics/0703126},
primaryClass={physics.data-an cs.AI quant-ph}
} | mana2007the |
arxiv-677102 | physics/0703164 | Cultural route to the emergence of linguistic categories | <|reference_start|>Cultural route to the emergence of linguistic categories: 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... | arxiv | @article{puglisi2007cultural,
title={Cultural route to the emergence of linguistic categories},
author={Andrea Puglisi, Andrea Baronchelli, and Vittorio Loreto},
journal={Proc. Natl. Acad. Sci. 105, 7936 (2008)},
year={2007},
doi={10.1073/pnas.0802485105},
archivePrefix={arXiv},
eprint={phys... | puglisi2007cultural |
arxiv-677103 | physics/0703218 | Analysis of the structure of complex networks at different resolution levels | <|reference_start|>Analysis of the structure of complex networks at different resolution levels: Modular structure is ubiquitous in real-world complex networks, and its detection is important because it gives insights in the structure-functionality Modular structure is ubiquitous in real-world complex networks, and its... | arxiv | @article{arenas2007analysis,
title={Analysis of the structure of complex networks at different resolution
levels},
author={Alex Arenas, Alberto Fernandez and Sergio Gomez},
journal={New J. Phys. 10 (2008) 053039},
year={2007},
doi={10.1088/1367-2630/10/5/053039},
archivePrefix={arXiv},
epr... | arenas2007analysis |
arxiv-677104 | physics/9911006 | Genetic Algorithms in Time-Dependent Environments | <|reference_start|>Genetic Algorithms in Time-Dependent Environments: 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 asymp... | arxiv | @article{ronnewinkel1999genetic,
title={Genetic Algorithms in Time-Dependent Environments},
author={Christopher Ronnewinkel, Claus O. Wilke and Thomas Martinetz},
journal={arXiv preprint arXiv:physics/9911006},
year={1999},
archivePrefix={arXiv},
eprint={physics/9911006},
primaryClass={physi... | ronnewinkel1999genetic |
arxiv-677105 | q-bio/0310011 | Complex Independent Component Analysis of Frequency-Domain Electroencephalographic Data | <|reference_start|>Complex Independent Component Analysis of Frequency-Domain Electroencephalographic Data: 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 pr... | arxiv | @article{anemuller2003complex,
title={Complex Independent Component Analysis of Frequency-Domain
Electroencephalographic Data},
author={Jorn Anemuller, Terrence J. Sejnowski, Scott Makeig},
journal={Neural Networks, 16:1311-1323, 2003},
year={2003},
doi={10.1016/j.neunet.2003.08.003},
archiveP... | anemuller2003complex |
arxiv-677106 | q-bio/0310025 | Pattern Excitation-Based Processing: The Music of The Brain | <|reference_start|>Pattern Excitation-Based Processing: The Music of The Brain: 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 conve... | arxiv | @article{koyrakh2003pattern,
title={Pattern Excitation-Based Processing: The Music of The Brain},
author={Lev Koyrakh},
journal={arXiv preprint arXiv:q-bio/0310025},
year={2003},
archivePrefix={arXiv},
eprint={q-bio/0310025},
primaryClass={q-bio.NC cs.NE physics.bio-ph}
} | koyrakh2003pattern |
arxiv-677107 | q-bio/0311037 | Hierarchical Clustering Using Mutual Information | <|reference_start|>Hierarchical Clustering Using Mutual Information: We present a method for hierarchical clustering of data called {\it mutual information clustering} (MIC) algorithm. It uses mutual information (MI) as a similarity measure and exploits its grouping property: The MI between three objects $X, Y,$ and $Z... | arxiv | @article{kraskov2003hierarchical,
title={Hierarchical Clustering Using Mutual Information},
author={Alexander Kraskov, Harald Stoegbauer, Ralph G. Andrzejak, Peter
Grassberger},
journal={arXiv preprint arXiv:q-bio/0311037},
year={2003},
archivePrefix={arXiv},
eprint={q-bio/0311037},
primar... | kraskov2003hierarchical |
arxiv-677108 | q-bio/0311039 | Hierarchical Clustering Based on Mutual Information | <|reference_start|>Hierarchical Clustering Based on Mutual Information: Motivation: Clustering is a frequently used concept in variety of bioinformatical applications. We present a new method for hierarchical clustering of data called mutual information clustering (MIC) algorithm. It uses mutual information (MI) as a s... | arxiv | @article{kraskov2003hierarchical,
title={Hierarchical Clustering Based on Mutual Information},
author={Alexander Kraskov, Harald St"ogbauer, Ralph G. Andrzejak, and Peter
Grassberger},
journal={arXiv preprint arXiv:q-bio/0311039},
year={2003},
archivePrefix={arXiv},
eprint={q-bio/0311039},
... | kraskov2003hierarchical |
arxiv-677109 | q-bio/0401033 | Parametric Inference for Biological Sequence Analysis | <|reference_start|>Parametric Inference for Biological Sequence Analysis: 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 the... | arxiv | @article{pachter2004parametric,
title={Parametric Inference for Biological Sequence Analysis},
author={Lior Pachter, Bernd Sturmfels},
journal={arXiv preprint arXiv:q-bio/0401033},
year={2004},
doi={10.1073/pnas.0406011101},
archivePrefix={arXiv},
eprint={q-bio/0401033},
primaryClass={q-... | pachter2004parametric |
arxiv-677110 | q-bio/0402029 | Fluctuation-dissipation theorem and models of learning | <|reference_start|>Fluctuation-dissipation theorem and models of learning: 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 learne... | arxiv | @article{nemenman2004fluctuation-dissipation,
title={Fluctuation-dissipation theorem and models of learning},
author={Ilya Nemenman},
journal={Neural Comp. 17 (9): 2006-2033 SEP 2005},
year={2004},
number={NSF-KITP-04-20},
archivePrefix={arXiv},
eprint={q-bio/0402029},
primaryClass={q-bi... | nemenman2004fluctuation-dissipation |
arxiv-677111 | q-bio/0403011 | Memorization in a neural network with adjustable transfer function and conditional gating | <|reference_start|>Memorization in a neural network with adjustable transfer function and conditional gating: 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 mecha... | arxiv | @article{scheler2004memorization,
title={Memorization in a neural network with adjustable transfer function and
conditional gating},
author={Gabriele Scheler},
journal={arXiv preprint arXiv:q-bio/0403011},
year={2004},
archivePrefix={arXiv},
eprint={q-bio/0403011},
primaryClass={q-bio.NC c... | scheler2004memorization |
arxiv-677112 | q-bio/0403022 | Intelligent encoding and economical communication in the visual stream | <|reference_start|>Intelligent encoding and economical communication in the visual stream: 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 wor... | arxiv | @article{lorincz2004intelligent,
title={Intelligent encoding and economical communication in the visual stream},
author={Andras Lorincz},
journal={arXiv preprint arXiv:q-bio/0403022},
year={2004},
archivePrefix={arXiv},
eprint={q-bio/0403022},
primaryClass={q-bio.NC cs.AI cs.CC nlin.AO}
} | lorincz2004intelligent |
arxiv-677113 | q-bio/0403036 | The Triplet Genetic Code had a Doublet Predecessor | <|reference_start|>The Triplet Genetic Code had a Doublet Predecessor: 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 $\o... | arxiv | @article{patel2004the,
title={The Triplet Genetic Code had a Doublet Predecessor},
author={Apoorva Patel},
journal={Journal of Theoretical Biology 233 (2005) 527-532},
year={2004},
archivePrefix={arXiv},
eprint={q-bio/0403036},
primaryClass={q-bio.GN cs.CE q-bio.BM quant-ph}
} | patel2004the |
arxiv-677114 | q-bio/0406015 | Information theory, multivariate dependence, and genetic network inference | <|reference_start|>Information theory, multivariate dependence, and genetic network inference: 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 uncov... | arxiv | @article{nemenman2004information,
title={Information theory, multivariate dependence, and genetic network
inference},
author={Ilya Nemenman},
journal={arXiv preprint arXiv:q-bio/0406015},
year={2004},
number={NSF-KITP-04-54},
archivePrefix={arXiv},
eprint={q-bio/0406015},
primaryClass=... | nemenman2004information |
arxiv-677115 | q-bio/0409022 | Topology of biological networks and reliability of information processing | <|reference_start|>Topology of biological networks and reliability of information processing: Biological systems rely on robust internal information processing: Survival depends on highly reproducible dynamics of regulatory processes. Biological information processing elements, however, are intrinsically noisy (genetic... | arxiv | @article{klemm2004topology,
title={Topology of biological networks and reliability of information
processing},
author={Konstantin Klemm and Stefan Bornholdt},
journal={Proc. Natl. Acad. Sci. USA 102 (2005) 18414},
year={2004},
doi={10.1073/pnas.0509132102},
archivePrefix={arXiv},
eprint={q... | klemm2004topology |
arxiv-677116 | q-bio/0411030 | Statistical Mechanics Characterization of Neuronal Mosaics | <|reference_start|>Statistical Mechanics Characterization of Neuronal Mosaics: 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 ... | arxiv | @article{costa2004statistical,
title={Statistical Mechanics Characterization of Neuronal Mosaics},
author={Luciano da Fontoura Costa, Fernando Rocha and Silene Maria Araujo de
Lima},
journal={Appl. Phys. Lett. 86, 093901 (2005)},
year={2004},
doi={10.1063/1.1874306},
archivePrefix={arXiv},
... | costa2004statistical |
arxiv-677117 | q-bio/0501021 | Spike timing precision and neural error correction: local behavior | <|reference_start|>Spike timing precision and neural error correction: local behavior: 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 presenti... | arxiv | @article{stiber2005spike,
title={Spike timing precision and neural error correction: local behavior},
author={Michael Stiber},
journal={Neural Computation, v. 17, n. 7, 1577-1601, 2005},
year={2005},
archivePrefix={arXiv},
eprint={q-bio/0501021},
primaryClass={q-bio.NC cs.NE math.DS}
} | stiber2005spike |
arxiv-677118 | q-bio/0502023 | Learning intrinsic excitability in medium spiny neurons | <|reference_start|>Learning intrinsic excitability in medium spiny neurons: 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-base... | arxiv | @article{scheler2005learning,
title={Learning intrinsic excitability in medium spiny neurons},
author={Gabriele Scheler},
journal={F1000Research 2014, 2:88},
year={2005},
doi={10.12688/f1000research.2-88.v2},
archivePrefix={arXiv},
eprint={q-bio/0502023},
primaryClass={q-bio.NC cs.NE}
} | scheler2005learning |
arxiv-677119 | q-bio/0505021 | Characterizing Self-Developing Biological Neural Networks: A First Step Towards their Application To Computing Systems | <|reference_start|>Characterizing Self-Developing Biological Neural Networks: A First Step Towards their Application To Computing Systems: 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 st... | arxiv | @article{berry2005characterizing,
title={Characterizing Self-Developing Biological Neural Networks: A First Step
Towards their Application To Computing Systems},
author={Hugues Berry (INRIA Futurs), Olivier Temam (INRIA Futurs)},
journal={arXiv preprint arXiv:q-bio/0505021},
year={2005},
archivePr... | berry2005characterizing |
arxiv-677120 | q-bio/0505050 | HLA and HIV Infection Progression: Application of the Minimum Description Length Principle to Statistical Genetics | <|reference_start|>HLA and HIV Infection Progression: Application of the Minimum Description Length Principle to Statistical Genetics: 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 re... | arxiv | @article{hraber2005hla,
title={HLA and HIV Infection Progression: Application of the Minimum
Description Length Principle to Statistical Genetics},
author={Peter T. Hraber, Bette T. Korber, Steven Wolinsky, Henry A. Erlich,
Elizabeth A. Trachtenberg, Thomas B. Kepler},
journal={Lecture Notes in Computer... | hraber2005hla |
arxiv-677121 | q-bio/0506034 | The Shapley Value of Phylogenetic Trees | <|reference_start|>The Shapley Value of Phylogenetic Trees: Every weighted tree corresponds naturally to a cooperative game that we call a "tree game"; it assigns to each subset of leaves the sum of the weights of the minimal subtree spanned by those leaves. In the context of phylogenetic trees, the leaves are species ... | arxiv | @article{haake2005the,
title={The Shapley Value of Phylogenetic Trees},
author={Claus-Jochen Haake, Akemi Kashiwada, Francis Edward Su},
journal={J. Mathematical Biology 56 (2008), 479--497},
year={2005},
doi={10.1007/s00285-007-0126-2},
archivePrefix={arXiv},
eprint={q-bio/0506034},
pri... | haake2005the |
arxiv-677122 | q-bio/0507037 | Neuromodulation Influences Synchronization and Intrinsic Read-out | <|reference_start|>Neuromodulation Influences Synchronization and Intrinsic Read-out: 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 ef... | arxiv | @article{scheler2005neuromodulation,
title={Neuromodulation Influences Synchronization and Intrinsic Read-out},
author={Gabriele Scheler},
journal={F1000Research 2018, 7:1277},
year={2005},
doi={10.12688/f1000research.15804.2},
archivePrefix={arXiv},
eprint={q-bio/0507037},
primaryClass=... | scheler2005neuromodulation |
arxiv-677123 | q-bio/0510007 | The fitness value of information | <|reference_start|>The fitness value of information: 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 ... | arxiv | @article{bergstrom2005the,
title={The fitness value of information},
author={Carl T. Bergstrom and Michael Lachmann},
journal={arXiv preprint arXiv:q-bio/0510007},
year={2005},
archivePrefix={arXiv},
eprint={q-bio/0510007},
primaryClass={q-bio.PE cs.IT math.IT q-bio.NC}
} | bergstrom2005the |
arxiv-677124 | q-bio/0511045 | The use of the GARP genetic algorithm and internet grid computing in the Lifemapper world atlas of species biodiversity | <|reference_start|>The use of the GARP genetic algorithm and internet grid computing in the Lifemapper world atlas of species biodiversity: 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 modeli... | arxiv | @article{stockwell2005the,
title={The use of the GARP genetic algorithm and internet grid computing in the
Lifemapper world atlas of species biodiversity},
author={David R.B. Stockwell, James H. Beach, Aimee Stewart, Gregory
Vorontsov, David Vieglais, Ricardo Scachetti Pereira},
journal={arXiv preprint ... | stockwell2005the |
arxiv-677125 | q-bio/0511046 | Improving ecological niche models by data mining large environmental datasets for surrogate models | <|reference_start|>Improving ecological niche models by data mining large environmental datasets for surrogate models: 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... | arxiv | @article{stockwell2005improving,
title={Improving ecological niche models by data mining large environmental
datasets for surrogate models},
author={David R.B. Stockwell},
journal={arXiv preprint arXiv:q-bio/0511046},
year={2005},
archivePrefix={arXiv},
eprint={q-bio/0511046},
primaryClass... | stockwell2005improving |
arxiv-677126 | q-bio/0603007 | Compression ratios based on the Universal Similarity Metric still yield protein distances far from CATH distances | <|reference_start|>Compression ratios based on the Universal Similarity Metric still yield protein distances far from CATH distances: 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 o... | arxiv | @article{rocha2006compression,
title={Compression ratios based on the Universal Similarity Metric still yield
protein distances far from CATH distances},
author={Jairo Rocha, Francesc Rossell'o, Joan Segura},
journal={arXiv preprint arXiv:q-bio/0603007},
year={2006},
archivePrefix={arXiv},
epr... | rocha2006compression |
arxiv-677127 | q-bio/0604024 | The transposition distance for phylogenetic trees | <|reference_start|>The transposition distance for phylogenetic trees: 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 t... | arxiv | @article{rossello2006the,
title={The transposition distance for phylogenetic trees},
author={Francesc Rossello, Gabriel Valiente},
journal={arXiv preprint arXiv:q-bio/0604024},
year={2006},
archivePrefix={arXiv},
eprint={q-bio/0604024},
primaryClass={q-bio.PE cs.CE math.GR q-bio.OT}
} | rossello2006the |
arxiv-677128 | q-bio/0605020 | Laws in Darwinian Evolutionary Theory | <|reference_start|>Laws in Darwinian Evolutionary Theory: 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 b... | arxiv | @article{ao2006laws,
title={Laws in Darwinian Evolutionary Theory},
author={P Ao},
journal={Physics of Life Reviews, 2 (2005) 117-156},
year={2006},
doi={10.1016/j.plrev.2005.03.002},
archivePrefix={arXiv},
eprint={q-bio/0605020},
primaryClass={q-bio.PE cond-mat.stat-mech cs.NE math.OC n... | ao2006laws |
arxiv-677129 | q-bio/0607018 | A p-Adic Model of DNA Sequence and Genetic Code | <|reference_start|>A p-Adic Model of DNA Sequence and Genetic Code: 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,... | arxiv | @article{dragovich2006a,
title={A p-Adic Model of DNA Sequence and Genetic Code},
author={Branko Dragovich and Alexandra Dragovich},
journal={p-Adic Numbers, Ultrametric Analysis and Applications 1 (2009)
34-41},
year={2006},
doi={10.1134/S2070046609010038},
archivePrefix={arXiv},
eprint={... | dragovich2006a |
arxiv-677130 | q-bio/0610017 | Number sequence representation of protein structures based on the second derivative of a folded tetrahedron sequence | <|reference_start|>Number sequence representation of protein structures based on the second derivative of a folded tetrahedron sequence: This paper proposes a new mathematical approach to characterize native protein structures based on the discrete differential geometry of tetrahedron tiles. In the approach, local stru... | arxiv | @article{morikawa2006number,
title={Number sequence representation of protein structures based on the second
derivative of a folded tetrahedron sequence},
author={Naoto Morikawa},
journal={arXiv preprint arXiv:q-bio/0610017},
year={2006},
archivePrefix={arXiv},
eprint={q-bio/0610017},
prim... | morikawa2006number |
arxiv-677131 | q-bio/0610040 | Metric learning pairwise kernel for graph inference | <|reference_start|>Metric learning pairwise kernel for graph inference: 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 su... | arxiv | @article{vert2006metric,
title={Metric learning pairwise kernel for graph inference},
author={Jean-Philippe Vert (CB), Jian Qiu (GS-UW), William Stafford Noble
(GS-UW)},
journal={arXiv preprint arXiv:q-bio/0610040},
year={2006},
archivePrefix={arXiv},
eprint={q-bio/0610040},
primaryClass={... | vert2006metric |
arxiv-677132 | q-bio/0611052 | Grid Added Value to Address Malaria | <|reference_start|>Grid Added Value to Address Malaria: Through this paper, we call for a distributed, internet-based collaboration to address one of the worst plagues of our present world, malaria. The spirit is a non-proprietary peer-production of information-embedding goods. And we propose to use the grid technology... | arxiv | @article{breton2006grid,
title={Grid Added Value to Address Malaria},
author={V. Breton (LPC-Clermont), N. Jacq (LPC-Clermont, CS-Si), M. Hofmann
(SCAI)},
journal={Dans IEEE Transactions on Information Technology in Biomedicine
(12) - 6th IEEE International Symposium on Cluster Computing and the Grid,
... | breton2006grid |
arxiv-677133 | q-bio/0611053 | Integration and mining of malaria molecular, functional and pharmacological data: how far are we from a chemogenomic knowledge space? | <|reference_start|>Integration and mining of malaria molecular, functional and pharmacological data: how far are we from a chemogenomic knowledge space?: The organization and mining of malaria genomic and post-genomic data is highly motivated by the necessity to predict and characterize new biological targets and new d... | arxiv | @article{birkholtz2006integration,
title={Integration and mining of malaria molecular, functional and
pharmacological data: how far are we from a chemogenomic knowledge space?},
author={L.-M. Birkholtz, O. Bastien (DRDC), G. Wells, D. Grando (DRDC), F.
Joubert, V. Kasam (LPC-Clermont), M. Zimmermann, P. Ort... | birkholtz2006integration |
arxiv-677134 | q-bio/0611054 | Grid enabled virtual screening against malaria | <|reference_start|>Grid enabled virtual screening against malaria: WISDOM is an international initiative to enable a virtual screening pipeline on a grid infrastructure. Its first attempt was to deploy large scale in silico docking on a public grid infrastructure. Protein-ligand docking is about computing the binding e... | arxiv | @article{jacq2006grid,
title={Grid enabled virtual screening against malaria},
author={N. Jacq (LPC-Clermont, CS-Si), J. Salzemann (LPC-Clermont), F. Jacq
(LPC-Clermont), Y. Legr'e (LPC-Clermont), E. Medernach (LPC-Clermont), J.
Montagnat (Informatique Signaux Et Syst`emes), A. Maass (SCAI), M.
Reichstadt... | jacq2006grid |
arxiv-677135 | q-bio/0612013 | Clustering fetal heart rate tracings by compression | <|reference_start|>Clustering fetal heart rate tracings by compression: 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 approa... | arxiv | @article{santos2006clustering,
title={Clustering fetal heart rate tracings by compression},
author={C. Costa Santos (Univ. Porto), J. Bernardes (Univ. Porto), P. Vitanyi
(CWI/Univ. Amsterdam), L. Antunes (Univ. Porto)},
journal={arXiv preprint arXiv:q-bio/0612013},
year={2006},
archivePrefix={arXi... | santos2006clustering |
arxiv-677136 | q-bio/0701009 | Attribute Exploration of Discrete Temporal Transitions | <|reference_start|>Attribute Exploration of Discrete Temporal Transitions: 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. T... | arxiv | @article{wollbold2007attribute,
title={Attribute Exploration of Discrete Temporal Transitions},
author={Johannes Wollbold},
journal={In: Gely, A. et al.. Contributions to ICFCA 2007 - 5th
International Conference on Formal Concept Analysis. Clermont-Ferrand 2007,
121-130},
year={2007},
archivePr... | wollbold2007attribute |
arxiv-677137 | q-bio/0703044 | On the existence of potential landscape in the evolution of complex systems | <|reference_start|>On the existence of potential landscape in the evolution of complex systems: 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 be... | arxiv | @article{ao2007on,
title={On the existence of potential landscape in the evolution of complex
systems},
author={P. Ao, C. Kwon, H. Qian},
journal={Complexity 12 (2007) 19-27},
year={2007},
archivePrefix={arXiv},
eprint={q-bio/0703044},
primaryClass={q-bio.QM cond-mat.stat-mech cs.IT math.D... | ao2007on |
arxiv-677138 | quant-ph/0001077 | Poly-locality in quantum computing | <|reference_start|>Poly-locality in quantum computing: A polynomial depth quantum circuit effects, by definition a poly-local unitary transformation of tensor product state space. It is a physically reasonable belief [Fy][L][FKW] that these are precisely the transformations which will be available from physics to help ... | arxiv | @article{freedman2000poly-locality,
title={Poly-locality in quantum computing},
author={Michael H. Freedman},
journal={arXiv preprint arXiv:quant-ph/0001077},
year={2000},
archivePrefix={arXiv},
eprint={quant-ph/0001077},
primaryClass={quant-ph cs.NA}
} | freedman2000poly-locality |
arxiv-677139 | quant-ph/0002066 | Quantum lower bounds by quantum arguments | <|reference_start|>Quantum lower bounds by quantum arguments: We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum adversary that runs the algorithm with a superposition of inpu... | arxiv | @article{ambainis2000quantum,
title={Quantum lower bounds by quantum arguments},
author={Andris Ambainis},
journal={arXiv preprint arXiv:quant-ph/0002066},
year={2000},
archivePrefix={arXiv},
eprint={quant-ph/0002066},
primaryClass={quant-ph cs.CC}
} | ambainis2000quantum |
arxiv-677140 | quant-ph/0003035 | One Complexity Theorist's View of Quantum Computing | <|reference_start|>One Complexity Theorist's View of Quantum Computing: The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools of comput... | arxiv | @article{fortnow2000one,
title={One Complexity Theorist's View of Quantum Computing},
author={Lance Fortnow},
journal={arXiv preprint arXiv:quant-ph/0003035},
year={2000},
archivePrefix={arXiv},
eprint={quant-ph/0003035},
primaryClass={quant-ph cs.CC}
} | fortnow2000one |
arxiv-677141 | quant-ph/0005106 | Interaction in Quantum Communication Complexity | <|reference_start|>Interaction in Quantum Communication Complexity: One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet there are ways of conveying information with exponentially fewer qubits th... | arxiv | @article{nayak2000interaction,
title={Interaction in Quantum Communication Complexity},
author={Ashwin Nayak, Amnon Ta-Shma and David Zuckerman},
journal={arXiv preprint arXiv:quant-ph/0005106},
year={2000},
archivePrefix={arXiv},
eprint={quant-ph/0005106},
primaryClass={quant-ph cs.CC}
} | nayak2000interaction |
arxiv-677142 | quant-ph/0007021 | The Quantum Complexity of Set Membership | <|reference_start|>The Quantum Complexity of Set Membership: We study the quantum complexity of the static set membership problem: given a subset S (|S| \leq n) of a universe of size m (m \gg n), store it as a table of bits so that queries of the form `Is x \in S?' can be answered. The goal is to use a small table and ... | arxiv | @article{radhakrishnan2000the,
title={The Quantum Complexity of Set Membership},
author={Jaikumar Radhakrishnan, Pranab Sen, S. Venkatesh},
journal={arXiv preprint arXiv:quant-ph/0007021},
year={2000},
archivePrefix={arXiv},
eprint={quant-ph/0007021},
primaryClass={quant-ph cs.CC}
} | radhakrishnan2000the |
arxiv-677143 | quant-ph/0007071 | A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability | <|reference_start|>A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability: Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy)... | arxiv | @article{farhi2000a,
title={A Numerical Study of the Performance of a Quantum Adiabatic Evolution
Algorithm for Satisfiability},
author={Edward Farhi, Jeffrey Goldstone, Sam Gutmann},
journal={arXiv preprint arXiv:quant-ph/0007071},
year={2000},
number={MIT-CTP # 3006},
archivePrefix={arXiv},
... | farhi2000a |
arxiv-677144 | quant-ph/0008059 | Quantum Algorithms for Weighing Matrices and Quadratic Residues | <|reference_start|>Quantum Algorithms for Weighing Matrices and Quadratic Residues: In this article we investigate how we can employ the structure of combinatorial objects like Hadamard matrices and weighing matrices to device new quantum algorithms. We show how the properties of a weighing matrix can be used to constr... | arxiv | @article{van dam2000quantum,
title={Quantum Algorithms for Weighing Matrices and Quadratic Residues},
author={Wim van Dam (UC Berkeley)},
journal={Algorithmica, Volume 34, No. 4, pages 413-428 (2002)},
year={2000},
doi={10.1007/s00453-002-0975-4},
archivePrefix={arXiv},
eprint={quant-ph/0008... | van dam2000quantum |
arxiv-677145 | quant-ph/0009009 | The definition of a random sequence of qubits: from Noncommutative Algorithmic Probability Theory to Quantum Algorithmic Information Theory and back | <|reference_start|>The definition of a random sequence of qubits: from Noncommutative Algorithmic Probability Theory to Quantum Algorithmic Information Theory and back: The issue of defining a random sequence of qubits is studied in the framework of Algorithmic Free Probability Theory.Its connection with Quantum Algori... | arxiv | @article{segre2000the,
title={The definition of a random sequence of qubits: from Noncommutative
Algorithmic Probability Theory to Quantum Algorithmic Information Theory and
back},
author={Gavriel Segre},
journal={arXiv preprint arXiv:quant-ph/0009009},
year={2000},
archivePrefix={arXiv},
ep... | segre2000the |
arxiv-677146 | quant-ph/0010076 | Beyond Stabilizer Codes II: Clifford Codes | <|reference_start|>Beyond Stabilizer Codes II: Clifford Codes: Knill introduced a generalization of stabilizer codes, in this note called Clifford codes. It remained unclear whether or not Clifford codes can be superior to stabilizer codes. We show that Clifford codes are stabilizer codes provided that the abstract err... | arxiv | @article{klappenecker2000beyond,
title={Beyond Stabilizer Codes II: Clifford Codes},
author={Andreas Klappenecker (Texas A&M University), Martin Roetteler
(Universitaet Karlsruhe)},
journal={IEEE Transactions on Information Theory, vol. 48, no. 8, pp.
2396-2399, 2002},
year={2000},
archivePrefix... | klappenecker2000beyond |
arxiv-677147 | quant-ph/0010082 | Beyond Stabilizer Codes I: Nice Error Bases | <|reference_start|>Beyond Stabilizer Codes I: Nice Error Bases: Nice error bases have been introduced by Knill as a generalization of the Pauli basis. These bases are shown to be projective representations of finite groups. We classify all nice error bases of small degree, and all nice error bases with abelian index gr... | arxiv | @article{klappenecker2000beyond,
title={Beyond Stabilizer Codes I: Nice Error Bases},
author={Andreas Klappenecker (Texas A&M University), Martin Roetteler
(Universitaet Karlsruhe)},
journal={IEEE Transactions on Information Theory, vol. 48, no. 8, pp.
2392-2395, 2002},
year={2000},
archivePrefi... | klappenecker2000beyond |
arxiv-677148 | quant-ph/0011067 | Efficient Quantum Algorithms for Shifted Quadratic Character Problems | <|reference_start|>Efficient Quantum Algorithms for Shifted Quadratic Character Problems: We introduce the Shifted Legendre Symbol Problem and some variants along with efficient quantum algorithms to solve them. The problems and their algorithms are different from previous work on quantum computation in that they do no... | arxiv | @article{van dam2000efficient,
title={Efficient Quantum Algorithms for Shifted Quadratic Character Problems},
author={Wim van Dam (Berkeley, CWI), Sean Hallgren (MSRI)},
journal={arXiv preprint arXiv:quant-ph/0011067},
year={2000},
archivePrefix={arXiv},
eprint={quant-ph/0011067},
primaryCla... | van dam2000efficient |
arxiv-677149 | quant-ph/0011122 | Algorithmic Theories of Everything | <|reference_start|>Algorithmic Theories of Everything: 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... | arxiv | @article{schmidhuber2000algorithmic,
title={Algorithmic Theories of Everything},
author={Juergen Schmidhuber},
journal={Sections 1-5 in: Hierarchies of generalized Kolmogorov
complexities and nonenumerable universal measures computable in the limit.
International Journal of Foundations of Computer Scien... | schmidhuber2000algorithmic |
arxiv-677150 | quant-ph/0012111 | Quantum error-correcting codes associated with graphs | <|reference_start|>Quantum error-correcting codes associated with graphs: 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 tha... | arxiv | @article{schlingemann2000quantum,
title={Quantum error-correcting codes associated with graphs},
author={D. Schlingemann and R.F. Werner},
journal={arXiv preprint arXiv:quant-ph/0012111},
year={2000},
doi={10.1103/PhysRevA.65.012308},
archivePrefix={arXiv},
eprint={quant-ph/0012111},
pri... | schlingemann2000quantum |
arxiv-677151 | quant-ph/0101133 | Time and Space Bounds for Reversible Simulation | <|reference_start|>Time and Space Bounds for Reversible Simulation: We prove a general upper bound on the tradeoff between time and space that suffices for the reversible simulation of irreversible computation. Previously, only simulations using exponential time or quadratic space were known. The tradeoff shows for t... | arxiv | @article{buhrman2001time,
title={Time and Space Bounds for Reversible Simulation},
author={Harry Buhrman (CWI and Univ. Amsterdam), J. Tromp (CWI and
BioInformatics Solutions), Paul Vitanyi (CWI and Univ. Amsterdam)},
journal={Journal of Physics A: Mathematical and General, 34(2001),
6821--6830.},
y... | buhrman2001time |
arxiv-677152 | quant-ph/0102054 | Quantum Pushdown Automata | <|reference_start|>Quantum Pushdown Automata: Quantum finite automata, as well as quantum pushdown automata (QPA) were first introduced by C. Moore and J. P. Crutchfield. In this paper we introduce the notion of QPA in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automat... | arxiv | @article{golovkins2001quantum,
title={Quantum Pushdown Automata},
author={Marats Golovkins},
journal={LNCS, 2000, vol. 1963, pp. 336-346},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0102054},
primaryClass={quant-ph cs.CC cs.FL}
} | golovkins2001quantum |
arxiv-677153 | quant-ph/0102108 | Quantum Kolmogorov Complexity Based on Classical Descriptions | <|reference_start|>Quantum Kolmogorov Complexity Based on Classical Descriptions: 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 c... | arxiv | @article{vitanyi2001quantum,
title={Quantum Kolmogorov Complexity Based on Classical Descriptions},
author={Paul M.B. Vitanyi},
journal={IEEE Transactions on Information Theory, Vol. 47, No. 6, September
2001, 2464-2479},
year={2001},
doi={10.1109/18.945258},
archivePrefix={arXiv},
eprint=... | vitanyi2001quantum |
arxiv-677154 | quant-ph/0104053 | Quantum Formulas: a Lower Bound and Simulation | <|reference_start|>Quantum Formulas: a Lower Bound and Simulation: We show that Nechiporuk's method for proving lower bounds for Boolean formulas can be extended to the quantum case. This leads to an $\Omega(n^2 / \log^2 n)$ lower bound for quantum formulas computing an explicit function. The only known previous explic... | arxiv | @article{roychowdhury2001quantum,
title={Quantum Formulas: a Lower Bound and Simulation},
author={Vwani P. Roychowdhury and Farrokh Vatan},
journal={arXiv preprint arXiv:quant-ph/0104053},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0104053},
primaryClass={quant-ph cs.CC}
} | roychowdhury2001quantum |
arxiv-677155 | quant-ph/0104100 | Lower bounds in the quantum cell probe model | <|reference_start|>Lower bounds in the quantum cell probe model: We introduce a new model for studying quantum data structure problems -- the "quantum cell probe model". We prove a lower bound for the static predecessor problem in the address-only version of this model where we allow quantum parallelism only over the `... | arxiv | @article{sen2001lower,
title={Lower bounds in the quantum cell probe model},
author={Pranab Sen and S. Venkatesh},
journal={arXiv preprint arXiv:quant-ph/0104100},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0104100},
primaryClass={quant-ph cs.CC}
} | sen2001lower |
arxiv-677156 | quant-ph/0107129 | Algebraic geometric construction of a quantum stabilizer code | <|reference_start|>Algebraic geometric construction of a quantum stabilizer code: 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... | arxiv | @article{matsumoto2001algebraic,
title={Algebraic geometric construction of a quantum stabilizer code},
author={Ryutaroh Matsumoto},
journal={arXiv preprint arXiv:quant-ph/0107129},
year={2001},
doi={10.1109/TIT.2002.1013156},
archivePrefix={arXiv},
eprint={quant-ph/0107129},
primaryClas... | matsumoto2001algebraic |
arxiv-677157 | quant-ph/0108010 | Classical simulation of noninteracting-fermion quantum circuits | <|reference_start|>Classical simulation of noninteracting-fermion quantum circuits: We show that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant corresponds to a physical model of noninteracting fermions in one dimension. We give an alternative pr... | arxiv | @article{terhal2001classical,
title={Classical simulation of noninteracting-fermion quantum circuits},
author={Barbara M. Terhal and David P. DiVincenzo},
journal={Phys. Rev. A 65, 032325/1-10 (2002)},
year={2001},
doi={10.1103/PhysRevA.65.032325},
archivePrefix={arXiv},
eprint={quant-ph/010... | terhal2001classical |
arxiv-677158 | quant-ph/0108033 | Fermionic Linear Optics and Matchgates | <|reference_start|>Fermionic Linear Optics and Matchgates: Fermionic linear optics is efficiently classically simulatable. Here it is shown that the set of states achievable with fermionic linear optics and particle measurements is the closure of a low dimensional Lie group. The weakness of fermionic linear optics and ... | arxiv | @article{knill2001fermionic,
title={Fermionic Linear Optics and Matchgates},
author={E. Knill},
journal={arXiv preprint arXiv:quant-ph/0108033},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0108033},
primaryClass={quant-ph cs.CC}
} | knill2001fermionic |
arxiv-677159 | quant-ph/0108073 | Quantum Information in Space and Time | <|reference_start|>Quantum Information in Space and Time: 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 s... | arxiv | @article{volovich2001quantum,
title={Quantum Information in Space and Time},
author={Igor V. Volovich},
journal={arXiv preprint arXiv:quant-ph/0108073},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0108073},
primaryClass={quant-ph cond-mat.mes-hall cs.IT gr-qc hep-ph hep-th math-ph m... | volovich2001quantum |
arxiv-677160 | quant-ph/0108133 | On Classical and Quantum Cryptography | <|reference_start|>On Classical and Quantum Cryptography: 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 BB... | arxiv | @article{volovich2001on,
title={On Classical and Quantum Cryptography},
author={I.V. Volovich and Ya.I. Volovich},
journal={arXiv preprint arXiv:quant-ph/0108133},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0108133},
primaryClass={quant-ph cond-mat.mes-hall cs.IT hep-th math-ph mat... | volovich2001on |
arxiv-677161 | quant-ph/0109063 | Universal Simulation of Hamiltonians Using a Finite Set of Control Operations | <|reference_start|>Universal Simulation of Hamiltonians Using a Finite Set of Control Operations: Any quantum system with a non-trivial Hamiltonian is able to simulate any other Hamiltonian evolution provided that a sufficiently large group of unitary control operations is available. We show that there exist finite gro... | arxiv | @article{wocjan2001universal,
title={Universal Simulation of Hamiltonians Using a Finite Set of Control
Operations},
author={Pawel Wocjan, Martin Roetteler, Dominik Janzing, Thomas Beth
(Universitaet Karlsruhe)},
journal={Quantum Information & Computation 2(2): 133-150, 2002},
year={2001},
archi... | wocjan2001universal |
arxiv-677162 | quant-ph/0109068 | Improved Quantum Communication Complexity Bounds for Disjointness and Equality | <|reference_start|>Improved Quantum Communication Complexity Bounds for Disjointness and Equality: We prove new bounds on the quantum communication complexity of the disjointness and equality problems. For the case of exact and non-deterministic protocols we show that these complexities are all equal to n+1, the previo... | arxiv | @article{hoyer2001improved,
title={Improved Quantum Communication Complexity Bounds for Disjointness and
Equality},
author={Peter Hoyer (U Calgary) and Ronald de Wolf (CWI, Amsterdam)},
journal={19th Annual Symposium on Theoretical Aspects of Computer Science,
STACS 2002, LNCS 2285, pp. 299-310, 2002},
... | hoyer2001improved |
arxiv-677163 | quant-ph/0109070 | On Quantum Versions of the Yao Principle | <|reference_start|>On Quantum Versions of the Yao Principle: The classical Yao principle states that the complexity R_epsilon(f) of an optimal randomized algorithm for a function f with success probability 1-epsilon equals the complexity max_mu D_epsilon^mu(f) of an optimal deterministic algorithm for f that is correct... | arxiv | @article{de graaf2001on,
title={On Quantum Versions of the Yao Principle},
author={Mart de Graaf and Ronald de Wolf (CWI Amsterdam)},
journal={arXiv preprint arXiv:quant-ph/0109070},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0109070},
primaryClass={quant-ph cs.CC}
} | de graaf2001on |
arxiv-677164 | quant-ph/0109088 | Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds | <|reference_start|>Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds: We address the problem of simulating pair-interaction Hamiltonians in n node quantum networks where the subsystems have arbitrary, possibly different, dimensions. We show that any pair-interaction can be used to sim... | arxiv | @article{wocjan2001simulating,
title={Simulating Hamiltonians in Quantum Networks: Efficient Schemes and
Complexity Bounds},
author={Pawel Wocjan, Martin Roetteler, Dominik Janzing, Thomas Beth
(Universitaet Karlsruhe)},
journal={Phys. Rev. A 65, 042309 (2002)},
year={2001},
doi={10.1103/PhysRev... | wocjan2001simulating |
arxiv-677165 | quant-ph/0110006 | Quantum Certificate Verification: Single versus Multiple Quantum Certificates | <|reference_start|>Quantum Certificate Verification: Single versus Multiple Quantum Certificates: The class MA consists of languages that can be efficiently verified by classical probabilistic verifiers using a single classical certificate, and the class QMA consists of languages that can be efficiently verified by qua... | arxiv | @article{kobayashi2001quantum,
title={Quantum Certificate Verification: Single versus Multiple Quantum
Certificates},
author={Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami},
journal={arXiv preprint arXiv:quant-ph/0110006},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0110006},... | kobayashi2001quantum |
arxiv-677166 | quant-ph/0110018 | Algorithmic Information Theoretic Issues in Quantum Mechanics | <|reference_start|>Algorithmic Information Theoretic Issues in Quantum Mechanics: taking aside the review part, a finite-cardinality's set of new ideas concerning algorithmic information issues in Quantum Mechanics is introduced and analyzed<|reference_end|> | arxiv | @article{segre2001algorithmic,
title={Algorithmic Information Theoretic Issues in Quantum Mechanics},
author={Gavriel Segre},
journal={arXiv preprint arXiv:quant-ph/0110018},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0110018},
primaryClass={quant-ph cs.CC math-ph math.MP}
} | segre2001algorithmic |
arxiv-677167 | quant-ph/0110067 | Frontier between separability and quantum entanglement in a many spin system | <|reference_start|>Frontier between separability and quantum entanglement in a many spin system: We discuss the critical point $x_c$ separating the quantum entangled and separable states in two series of N spins S in the simple mixed state characterized by the matrix operator $\rho=x|\tilde{\phi}><\tilde{\phi}| + \frac... | arxiv | @article{alcaraz2001frontier,
title={Frontier between separability and quantum entanglement in a many spin
system},
author={F.C. Alcaraz (Departamento de Fisica - Universidade Federal de Sao
Carlos, Brazil) and C. Tsallis (Centro Brasileiro de Pesquisas Fisicas - Rio
de Janeiro and Erwin Schroedinger Inte... | alcaraz2001frontier |
arxiv-677168 | quant-ph/0110103 | Quantum entanglement and geometry of determinantal varieties | <|reference_start|>Quantum entanglement and geometry of determinantal varieties: 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, quant... | arxiv | @article{chen2001quantum,
title={Quantum entanglement and geometry of determinantal varieties},
author={Hao Chen},
journal={arXiv preprint arXiv:quant-ph/0110103},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0110103},
primaryClass={quant-ph cs.IT math.AG math.IT}
} | chen2001quantum |
arxiv-677169 | quant-ph/0110136 | Quantum Algorithm for Hilbert's Tenth Problem | <|reference_start|>Quantum Algorithm for Hilbert's Tenth Problem: We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to the Turing halti... | arxiv | @article{kieu2001quantum,
title={Quantum Algorithm for Hilbert's Tenth Problem},
author={Tien D Kieu},
journal={Int.J.Theor.Phys. 42 (2003) 1461-1478},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0110136},
primaryClass={quant-ph cs.LO hep-th math.LO math.NT}
} | kieu2001quantum |
arxiv-677170 | quant-ph/0111038 | Discrete Cosine Transforms on Quantum Computers | <|reference_start|>Discrete Cosine Transforms on Quantum Computers: A classical computer does not allow to calculate a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition, entanglement, and in... | arxiv | @article{klappenecker2001discrete,
title={Discrete Cosine Transforms on Quantum Computers},
author={Andreas Klappenecker (Texas A&M University), Martin Roetteler
(Universitaet Karlsruhe)},
journal={IEEE R8-EURASIP Symposium on Image and Signal Processing and
Analysis, pp. 464-468, Pula, Croatia, 2001},
... | klappenecker2001discrete |
arxiv-677171 | quant-ph/0111039 | On the Irresistible Efficiency of Signal Processing Methods in Quantum Computing | <|reference_start|>On the Irresistible Efficiency of Signal Processing Methods in Quantum Computing: We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We deri... | arxiv | @article{klappenecker2001on,
title={On the Irresistible Efficiency of Signal Processing Methods in Quantum
Computing},
author={Andreas Klappenecker (Texas A&M University), Martin Roetteler
(Universitaet Karlsruhe)},
journal={Proceedings of the First International Workshop on Spectral
Techniques and Lo... | klappenecker2001on |
arxiv-677172 | quant-ph/0111097 | A proposal for founding mistrustful quantum cryptography on coin tossing | <|reference_start|>A proposal for founding mistrustful quantum cryptography on coin tossing: A significant branch of classical cryptography deals with the problems which arise when mistrustful parties need to generate, process or exchange information. As Kilian showed a while ago, mistrustful classical cryptography can... | arxiv | @article{kent2001a,
title={A proposal for founding mistrustful quantum cryptography on coin tossing},
author={Adrian Kent},
journal={Phys. Rev. A 68, 012312 (2003).},
year={2001},
doi={10.1103/PhysRevA.68.012312},
archivePrefix={arXiv},
eprint={quant-ph/0111097},
primaryClass={quant-ph c... | kent2001a |
arxiv-677173 | quant-ph/0111099 | Quantum Bit String Commitment | <|reference_start|>Quantum Bit String Commitment: A bit string commitment protocol securely commits $N$ classical bits in such a way that the recipient can extract only $M<N$ bits of information about the string. Classical reasoning might suggest that bit string commitment implies bit commitment and hence, given the Ma... | arxiv | @article{kent2001quantum,
title={Quantum Bit String Commitment},
author={Adrian Kent (Centre for Quantum Computation, University of Cambridge)},
journal={Phys. Rev. Lett. 90 237901 (2003)},
year={2001},
doi={10.1103/PhysRevLett.90.237901},
archivePrefix={arXiv},
eprint={quant-ph/0111099},
... | kent2001quantum |
arxiv-677174 | quant-ph/0111102 | Quantum Lower Bound for the Collision Problem | <|reference_start|>Quantum Lower Bound for the Collision Problem: The collision problem is to decide whether a function X:{1,..,n}->{1,..,n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of Theta(n^{1/5}) on the number of queries needed by a quantum computer to solve this probl... | arxiv | @article{aaronson2001quantum,
title={Quantum Lower Bound for the Collision Problem},
author={Scott Aaronson},
journal={arXiv preprint arXiv:quant-ph/0111102},
year={2001},
archivePrefix={arXiv},
eprint={quant-ph/0111102},
primaryClass={quant-ph cs.CC}
} | aaronson2001quantum |
arxiv-677175 | quant-ph/0201007 | A lower bound on the quantum query complexity of read-once functions | <|reference_start|>A lower bound on the quantum query complexity of read-once functions: We establish a lower bound of $\Omega{(\sqrt{n})}$ on the bounded-error quantum query complexity of read-once Boolean functions, providing evidence for the conjecture that $\Omega(\sqrt{D(f)})$ is a lower bound for all Boolean func... | arxiv | @article{barnum2002a,
title={A lower bound on the quantum query complexity of read-once functions},
author={Howard Barnum, Michael Saks},
journal={arXiv preprint arXiv:quant-ph/0201007},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0201007},
primaryClass={quant-ph cs.CC}
} | barnum2002a |
arxiv-677176 | quant-ph/0201082 | Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C Language | <|reference_start|>Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C Language: We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to h... | arxiv | @article{blaha2002quantum,
title={Quantum Computers and Quantum Computer Languages: Quantum Assembly
Language and Quantum C Language},
author={Stephen Blaha},
journal={arXiv preprint arXiv:quant-ph/0201082},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0201082},
primaryClass={quant... | blaha2002quantum |
arxiv-677177 | quant-ph/0202015 | Semiclassical Neural Network | <|reference_start|>Semiclassical Neural Network: 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 p... | arxiv | @article{shafee2002semiclassical,
title={Semiclassical Neural Network},
author={Fariel Shafee},
journal={stochastics and dynamics, Vol. 7, No. 3 (2007) 403-416},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0202015},
primaryClass={quant-ph cond-mat.dis-nn cs.AI q-bio}
} | shafee2002semiclassical |
arxiv-677178 | quant-ph/0202016 | Neural Networks with c-NOT Gated Nodes | <|reference_start|>Neural Networks with c-NOT Gated Nodes: 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... | arxiv | @article{shafee2002neural,
title={Neural Networks with c-NOT Gated Nodes},
author={Fariel Shafee},
journal={arXiv preprint arXiv:quant-ph/0202016},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0202016},
primaryClass={quant-ph cond-mat.dis-nn cs.AI q-bio}
} | shafee2002neural |
arxiv-677179 | quant-ph/0203010 | Entangled Quantum Networks | <|reference_start|>Entangled Quantum Networks: 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 mos... | arxiv | @article{shafee2002entangled,
title={Entangled Quantum Networks},
author={Fariel Shafee},
journal={microelectronics journal, 2006},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0203010},
primaryClass={quant-ph cond-mat.dis-nn cs.AI}
} | shafee2002entangled |
arxiv-677180 | quant-ph/0203019 | Unpredictability of wave function's evolution in nonintegrable quantum systems | <|reference_start|>Unpredictability of wave function's evolution in nonintegrable quantum systems: It is shown that evolution of wave functions in nonintegrable quantum systems is unpredictable for a long time T because of rapid growth of number of elementary computational operations $\mathcal O(T)\sim T^\alpha$. On th... | arxiv | @article{ivanov2002unpredictability,
title={Unpredictability of wave function's evolution in nonintegrable quantum
systems},
author={I. B. Ivanov},
journal={arXiv preprint arXiv:quant-ph/0203019},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0203019},
primaryClass={quant-ph cs.CC n... | ivanov2002unpredictability |
arxiv-677181 | quant-ph/0203034 | Computing the Noncomputable | <|reference_start|>Computing the Noncomputable: We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic processes is considered for the Hilbert's tenth problem,... | arxiv | @article{kieu2002computing,
title={Computing the Noncomputable},
author={Tien D. Kieu},
journal={Contemporary Physics 44 (2003) 51- 71},
year={2002},
doi={10.1080/00107510302712},
archivePrefix={arXiv},
eprint={quant-ph/0203034},
primaryClass={quant-ph cs.LO math.LO}
} | kieu2002computing |
arxiv-677182 | quant-ph/0203105 | The capacity of hybrid quantum memory | <|reference_start|>The capacity of hybrid quantum memory: 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 qu... | arxiv | @article{kuperberg2002the,
title={The capacity of hybrid quantum memory},
author={Greg Kuperberg (UC Davis)},
journal={IEEE Trans. Inform. Theory 49 (2003), 1465-1473},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0203105},
primaryClass={quant-ph cs.IT math-ph math.IT math.MP math.OA... | kuperberg2002the |
arxiv-677183 | quant-ph/0204010 | Quantum Optimization Problems | <|reference_start|>Quantum Optimization Problems: Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a quantum optimization problem u... | arxiv | @article{yamakami2002quantum,
title={Quantum Optimization Problems},
author={Tomoyuki Yamakami},
journal={arXiv preprint arXiv:quant-ph/0204010},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0204010},
primaryClass={quant-ph cs.CC}
} | yamakami2002quantum |
arxiv-677184 | quant-ph/0204022 | A New Protocol and Lower Bounds for Quantum Coin Flipping | <|reference_start|>A New Protocol and Lower Bounds for Quantum Coin Flipping: We present a new protocol and two lower bounds for quantum coin flipping. In our protocol, no dishonest party can achieve one outcome with probability more than 0.75. Then, we show that our protocol is optimal for a certain type of quantum pr... | arxiv | @article{ambainis2002a,
title={A New Protocol and Lower Bounds for Quantum Coin Flipping},
author={Andris Ambainis},
journal={Journal of Computer and System Sciences, 68(2): 398-416, 2004.},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0204022},
primaryClass={quant-ph cs.CR}
} | ambainis2002a |
arxiv-677185 | quant-ph/0204063 | Lower bound for a class of weak quantum coin flipping protocols | <|reference_start|>Lower bound for a class of weak quantum coin flipping protocols: We study the class of protocols for weak quantum coin flipping introduced by Spekkens and Rudolph (quant-ph/0202118). We show that, for any protocol in this class, one party can win the coin flip with probability at least $1/\sqrt{2}$.<... | arxiv | @article{ambainis2002lower,
title={Lower bound for a class of weak quantum coin flipping protocols},
author={Andris Ambainis},
journal={arXiv preprint arXiv:quant-ph/0204063},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0204063},
primaryClass={quant-ph cs.CR}
} | ambainis2002lower |
arxiv-677186 | quant-ph/0205083 | Quantum Random Walks Hit Exponentially Faster | <|reference_start|>Quantum Random Walks Hit Exponentially Faster: We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum random walks.... | arxiv | @article{kempe2002quantum,
title={Quantum Random Walks Hit Exponentially Faster},
author={Julia Kempe},
journal={Probability Theory and Related Fields, Vol. 133(2), p. 215-235
(2005), conference version in Proc. 7th RANDOM, p. 354-69, 2003},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph... | kempe2002quantum |
arxiv-677187 | quant-ph/0205128 | Authentication of Quantum Messages | <|reference_start|>Authentication of Quantum Messages: Authentication is a well-studied area of classical cryptography: a sender S and a receiver R sharing a classical private key want to exchange a classical message with the guarantee that the message has not been modified by any third party with control of the commun... | arxiv | @article{barnum2002authentication,
title={Authentication of Quantum Messages},
author={Howard Barnum, Claude Crepeau, Daniel Gottesman, Adam Smith and Alain
Tapp},
journal={Proc. 43rd Annual IEEE Symposium on the Foundations of Computer
Science (FOCS '02), pp. 449-458. IEEE Press, 2002.},
year={2002... | barnum2002authentication |
arxiv-677188 | quant-ph/0205133 | Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games | <|reference_start|>Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games: We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate t... | arxiv | @article{terhal2002adaptive,
title={Adaptive Quantum Computation, Constant Depth Quantum Circuits and
Arthur-Merlin Games},
author={Barbara M. Terhal and David P. DiVincenzo},
journal={Quant. Inf. Comp. Vol. 4 (No. 2), pages 134--145 (2004)},
year={2002},
archivePrefix={arXiv},
eprint={quant-p... | terhal2002adaptive |
arxiv-677189 | quant-ph/0205161 | Contextualizing Concepts using a Mathematical Generalization of the Quantum Formalism | <|reference_start|>Contextualizing Concepts using a Mathematical Generalization of the Quantum Formalism: 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 conce... | arxiv | @article{gabora2002contextualizing,
title={Contextualizing Concepts using a Mathematical Generalization of the
Quantum Formalism},
author={Liane Gabora and Diederik Aerts},
journal={Journal of Experimental and Theoretical Artificial Intelligence,
14, pp. 327-358 (2002)},
year={2002},
archivePref... | gabora2002contextualizing |
arxiv-677190 | quant-ph/0206122 | On communication over an entanglement-assisted quantum channel | <|reference_start|>On communication over an entanglement-assisted quantum channel: Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or s... | arxiv | @article{nayak2002on,
title={On communication over an entanglement-assisted quantum channel},
author={Ashwin Nayak (Caltech) and Julia Salzman (Princeton)},
journal={arXiv preprint arXiv:quant-ph/0206122},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0206122},
primaryClass={quant-ph ... | nayak2002on |
arxiv-677191 | quant-ph/0206123 | On bit-commitment based quantum coin flipping | <|reference_start|>On bit-commitment based quantum coin flipping: In this paper, we focus on a special framework for quantum coin flipping protocols,_bit-commitment based protocols_, within which almost all known protocols fit. We show a lower bound of 1/16 for the bias in any such protocol. We also analyse a sequence ... | arxiv | @article{nayak2002on,
title={On bit-commitment based quantum coin flipping},
author={Ashwin Nayak (Caltech) and Peter Shor (AT&T Labs-Research)},
journal={arXiv preprint arXiv:quant-ph/0206123},
year={2002},
doi={10.1103/PhysRevA.67.012304},
number={Caltech CS TR 2002.004},
archivePrefix={ar... | nayak2002on |
arxiv-677192 | quant-ph/0207069 | Data compression limit for an information source of interacting qubits | <|reference_start|>Data compression limit for an information source of interacting qubits: 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 wi... | arxiv | @article{datta2002data,
title={Data compression limit for an information source of interacting qubits},
author={Nilanjana Datta and Yuri Suhov},
journal={arXiv preprint arXiv:quant-ph/0207069},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0207069},
primaryClass={quant-ph cs.IT math-p... | datta2002data |
arxiv-677193 | quant-ph/0207131 | Efficient Quantum Algorithms for Estimating Gauss Sums | <|reference_start|>Efficient Quantum Algorithms for Estimating Gauss Sums: We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction from the... | arxiv | @article{van dam2002efficient,
title={Efficient Quantum Algorithms for Estimating Gauss Sums},
author={Wim van Dam (HP, MSRI, UC Berkeley) and Gadiel Seroussi (HP)},
journal={arXiv preprint arXiv:quant-ph/0207131},
year={2002},
number={HPL-2002-208},
archivePrefix={arXiv},
eprint={quant-ph/0... | van dam2002efficient |
arxiv-677194 | quant-ph/0207158 | Non-Interactive Quantum Statistical and Perfect Zero-Knowledge | <|reference_start|>Non-Interactive Quantum Statistical and Perfect Zero-Knowledge: This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness or entanglement is necessary for non-trivial protocols o... | arxiv | @article{kobayashi2002non-interactive,
title={Non-Interactive Quantum Statistical and Perfect Zero-Knowledge},
author={Hirotada Kobayashi},
journal={arXiv preprint arXiv:quant-ph/0207158},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0207158},
primaryClass={quant-ph cs.CC}
} | kobayashi2002non-interactive |
arxiv-677195 | quant-ph/0208043 | Quantum Circuits with Unbounded Fan-out | <|reference_start|>Quantum Circuits with Unbounded Fan-out: We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denoted by QNCf^0) can approximate with polynomially small error the following gates:... | arxiv | @article{hoyer2002quantum,
title={Quantum Circuits with Unbounded Fan-out},
author={Peter Hoyer (U Calgary) and Robert Spalek (CWI)},
journal={Theory of Computing, 1(5):81-103, 2005},
year={2002},
doi={10.4086/toc.2005.v001a005},
archivePrefix={arXiv},
eprint={quant-ph/0208043},
primaryC... | hoyer2002quantum |
arxiv-677196 | quant-ph/0208062 | Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument | <|reference_start|>Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument: A locally decodable code encodes n-bit strings x in m-bit codewords C(x), in such a way that one can recover any bit x_i from a corrupted codeword by querying only a few bits of that word. We use a quantum argument to... | arxiv | @article{kerenidis2002exponential,
title={Exponential Lower Bound for 2-Query Locally Decodable Codes via a
Quantum Argument},
author={Iordanis Kerenidis (UC Berkeley) and Ronald de Wolf (CWI, Amsterdam)},
journal={arXiv preprint arXiv:quant-ph/0208062},
year={2002},
archivePrefix={arXiv},
epr... | kerenidis2002exponential |
arxiv-677197 | quant-ph/0208130 | Engineering Functional Quantum Algorithms | <|reference_start|>Engineering Functional Quantum Algorithms: Suppose that a quantum circuit with K elementary gates is known for a unitary matrix U, and assume that U^m is a scalar matrix for some positive integer m. We show that a function of U can be realized on a quantum computer with at most O(mK+m^2log m) element... | arxiv | @article{klappenecker2002engineering,
title={Engineering Functional Quantum Algorithms},
author={Andreas Klappenecker (Texas A&M University) and Martin Roetteler
(Universitaet Karlsruhe)},
journal={Physical Review A, 67, 010302, 2003},
year={2002},
doi={10.1103/PhysRevA.67.010302},
archivePref... | klappenecker2002engineering |
arxiv-677198 | quant-ph/0209060 | Quantum Lower Bound for Recursive Fourier Sampling | <|reference_start|>Quantum Lower Bound for Recursive Fourier Sampling: One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algorithm is not far from optimal. The moral is that the need to "uncomput... | arxiv | @article{aaronson2002quantum,
title={Quantum Lower Bound for Recursive Fourier Sampling},
author={Scott Aaronson},
journal={Quantum Information and Computation 3(2):165-174, 2003},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0209060},
primaryClass={quant-ph cs.CC}
} | aaronson2002quantum |
arxiv-677199 | quant-ph/0210020 | Quantum Certificate Complexity | <|reference_start|>Quantum Certificate Complexity: Given a Boolean function f, we study two natural generalizations of the certificate complexity C(f): the randomized certificate complexity RC(f) and the quantum certificate complexity QC(f). Using Ambainis' adversary method, we exactly characterize QC(f) as the square ... | arxiv | @article{aaronson2002quantum,
title={Quantum Certificate Complexity},
author={Scott Aaronson},
journal={arXiv preprint arXiv:quant-ph/0210020},
year={2002},
archivePrefix={arXiv},
eprint={quant-ph/0210020},
primaryClass={quant-ph cs.CC}
} | aaronson2002quantum |
arxiv-677200 | quant-ph/0210064 | A Quantum Random Walk Search Algorithm | <|reference_start|>A Quantum Random Walk Search Algorithm: Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorith... | arxiv | @article{shenvi2002a,
title={A Quantum Random Walk Search Algorithm},
author={Neil Shenvi, Julia Kempe, and K. Birgitta Whaley},
journal={Phys. Rev. A, Vol. 67 (5), 052307 (2003)},
year={2002},
doi={10.1103/PhysRevA.67.052307},
archivePrefix={arXiv},
eprint={quant-ph/0210064},
primaryCla... | shenvi2002a |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.