Journal ArticleDOI
Information, physics, and computation
Reads0
Chats0
TLDR
In this paper, the connections between information, physics, and computation are examined and the computing power of quantum computers is examined, and it is argued that recently studied quantum computers, which are based on local interactions, cannot simulate quantum physics.Abstract:
This paper presents several observations on the connections between information, physics, and computation. In particular, the computing power of quantum computers is examined. Quantum theory is characterized by superimposed states and nonlocal interactions. It is argued that recently studied quantum computers, which are based on local interactions, cannot simulate quantum physics.read more
Citations
More filters
Journal ArticleDOI
Ising formulations of many NP problems
TL;DR: This work collects and extends mappings to the Ising model from partitioning, covering and satisfiability, and provides Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21NP-complete problems.
Journal ArticleDOI
Influence maximization in complex networks through optimal percolation
Flaviano Morone,Hernán A. Makse +1 more
TL;DR: This work maps the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network.
Journal ArticleDOI
TreeTime: Maximum-likelihood phylodynamic analysis
Pavel Sagulenko,Vadim Puller,Vadim Puller,Vadim Puller,Richard A. Neher,Richard A. Neher,Richard A. Neher +6 more
TL;DR: TreeTime is presented, a Python-based framework for phylodynamic analysis using an approximate Maximum Likelihood approach that can estimate ancestral states, infer evolution models, reroot trees to maximize temporal signals, estimate molecular clock phylogenies and population size histories and scales linearly with dataset size.
Journal ArticleDOI
Vital nodes identification in complex networks
Linyuan Lü,Linyuan Lü,Duanbing Chen,Xiao-Long Ren,Qian-Ming Zhang,Yi-Cheng Zhang,Yi-Cheng Zhang,Tao Zhou +7 more
TL;DR: This review clarifies the concepts and metrics, classify the problems and methods, as well as review the important progresses and describe the state of the art, and provides extensive empirical analyses to compare well-known methods on disparate real networks and highlight the future directions.
Proceedings Article
Iterative Learning for Reliable Crowdsourcing Systems
TL;DR: This paper gives a new algorithm for deciding which tasks to assign to which workers and for inferring correct answers from the workers' answers, and shows that the algorithm significantly outperforms majority voting and is asymptotically optimal through comparison to an oracle that knows the reliability of every worker.
References
More filters
Book
Quantum Mechanics and Path Integrals
TL;DR: Au sommaire as discussed by the authors developed the concepts of quantum mechanics with special examples and developed the perturbation method in quantum mechanics and the variational method for probability problems in quantum physics.
Journal ArticleDOI
Simulating physics with computers
TL;DR: In this paper, the authors describe the possibility of simulating physics in the classical approximation, a thing which is usually described by local differential equations, and the possibility that there is to be an exact simulation, that the computer will do exactly the same as nature.
Proceedings ArticleDOI
Algorithms for quantum computation: discrete logarithms and factoring
TL;DR: Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.
Journal ArticleDOI
Quantum theory, the Church-Turing principle and the universal quantum computer
TL;DR: In this paper, it is argued that underlying the Church-Turing hypothesis there is an implicit physical assertion: every finitely realizable physical system can be perfectly simulated by a universal model computing machine operating by finite means.
Journal ArticleDOI
Irreversibility and heat generation in the computing process
TL;DR: Two simple, but representative, models of bistable devices are subjected to a more detailed analysis of switching kinetics to yield the relationship between speed and energy dissipation, and to estimate the effects of errors induced by thermal fluctuations.