Journal ArticleDOI
Universal Quantum Simulators
Reads0
Chats0
TLDR
Feynman's 1982 conjecture, that quantum computers can be programmed to simulate any local quantum system, is shown to be correct.Abstract:
Feynman's 1982 conjecture, that quantum computers can be programmed to simulate any local quantum system, is shown to be correct.read more
Citations
More filters
Quantum Computation and Quantum Information
TL;DR: This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
Journal ArticleDOI
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for these two problems, which takes a number of steps polynomial in the input size of the integer to be factored.
Journal ArticleDOI
Quantum Information with Continuous Variables
TL;DR: In this article, the authors present the Deutsch-Jozsa algorithm for continuous variables, and a deterministic version of it is used for quantum information processing with continuous variables.
Journal ArticleDOI
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.
Journal ArticleDOI
Quantum algorithm for linear systems of equations.
TL;DR: This work exhibits a quantum algorithm for estimating x(-->)(dagger) Mx(-->) whose runtime is a polynomial of log(N) and kappa, and proves that any classical algorithm for this problem generically requires exponentially more time than this quantum algorithm.
References
More filters
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
The Monte Carlo method.
N. Metropolis,Stanislaw M. Ulam +1 more
TL;DR: In this paper, the authors present a statistical approach to the study of integro-differential equations that occur in various branches of the natural sciences, such as biology and chemistry.
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.