Related papers: Classical Computer, Quantum Computer, and the G\"o…
We give a computational complexity argument against the feasibility of quantum computers. We identify a very low complexity class of probability distributions described by noisy intermediate-scale quantum computers, and explain why it will…
We show that semiclassical formulas such as the Gutzwiller trace formula can be implemented on a quantum computer more efficiently than on a classical device. We give explicit quantum algorithms which yield quantum observables from…
This course of lectures has been taught for several years at the Lomonosov Moscow State University; its modified version in 2021 is read in the Zhejiang University (Hangzhou), in the framework of summer school on quantum computing. The…
Quantum entanglement describes superposition states in multi-dimensional systems, at least two partite, which cannot be factorized and are thus non-separable. Non-separable states exist also in classical theories involving vector spaces. In…
According to the Gottesman-Knill theorem, quantum algorithms which utilise only the operations belonging to a certain restricted set are efficiently simulable classically. Since some of the operations in this set generate entangled states,…
Quantum information theory is the study of the achievable limits of information processing within quantum mechanics. Many different types of information can be accommodated within quantum mechanics, including classical information, coherent…
This article deals with theoretical developments in the subject of quantum information and quantum computation, and includes an overview of classical information and some relevant quantum mechanics. The discussion covers topics in quantum…
Classical communication is the basis for many of our current and future technologies, such as mobile phones, video conferences, autonomous vehicles and particularly the internet. In contrast, quantum communication is governed by the laws of…
Quantum computing has garnered significant attention in recent years from both academia and industry due to its potential to achieve a "quantum advantage" over classical computers. The advent of quantum computing introduces new challenges…
We show that human consciousness can be modeled as a classical (not quantum) probabilistic computer. A quantum computer representation does not appear to be indicated because no known feature of consciousness depends on Planck's constant h,…
Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…
Artificial computing machinery transforms representations through an objective process, to be interpreted subjectively by humans, so the machine and the interpreter are different entities, but in the putative natural computing both…
We suggest that quantum computers can solve quantum many-body problems that are impracticable to solve on a classical computer.
On the basis of introspective analysis, we establish a crucial requirement for the physical computation basis of consciousness: it should allow processing a significant amount of information together at the same time. Classical computation…
Quantum computers are hypothetical devices, based on quantum physics, that would enable us to perform certain computations hundreds of orders of magnitude faster than digital computers. This feature is coined as "quantum supremacy" and one…
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…
Quantum mechanics---the theory describing the fundamental workings of nature---is famously counterintuitive: it predicts that a particle can be in two places at the same time, and that two remote particles can be inextricably and…
A longstanding goal in quantum information science is to demonstrate quantum computations that cannot be feasibly reproduced on a classical computer. Such demonstrations mark major milestones: they showcase fine control over quantum systems…
Two of the fundamental no-go theorems of quantum information are the no-cloning theorem (that it is impossible to make copies of general quantum states) and the no-teleportation theorem (the prohibition on telegraphing, or sending quantum…
A clock is, from an information-theoretic perspective, a system that emits information about time. One may therefore ask whether the theory of information imposes any constraints on the maximum precision of clocks. Here we show a…