相关论文: An Introduction to Quantum Complexity Theory
This survey, aimed at information processing researchers, highlights intriguing but lesser known results, corrects misconceptions, and suggests research areas. Themes include: certainty in quantum algorithms; the "fewer worlds" theory of…
In this paper we provide an intuitive-level discussion of the challenges and opportunities offered by quantum-based methods for supporting secure communications, e.g., over a network. The goal is to distill down to the most fundamental…
We present a conceptually clear introduction to quantum theory, deriving the theory from scratch from the point of view of quantum information. Different subsets of these lectures were taught to a wide variety of audiences, including…
Quantum information, a field in which great advances have been made in the past decades, now presents opportunities for chemistry. One roadblock to progress, especially for experimental chemical science, is that new concepts and technical…
In this review we give a brief overview of quantum simulation as applied to the study of complex systems. In particular, we cover the basic ideas of quantum simulation, neuromorphic computation, the Sachdev-Ye-Kitaev model, as well as…
In this paper we give an overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date. Such problems are believed to be difficult to solve, even with a quantum computer, but have the…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
This survey gives a comprehensive account of quantum correlations understood as a phenomenon stemming from the rules of quantization. Centered on quantum probability it describes the physical concepts related to correlations (both classical…
We present a logical calculus for reasoning about information flow in quantum programs. In particular we introduce a dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound…
This paper covers two topics: first an introduction to Algorithmic Complexity Theory: how it defines probability, some of its characteristic properties and past successful applications. Second, we apply it to problems in A.I. - where it…
Quantum computation is a rapidly progressing field today. What are its principles? In what sense is it distinct from conventional computation? What are its advantages and disadvantages? What type of problems can it address? How practical is…
In the paper is discussed complete probabilistic description of quantum systems with application to multiqubit quantum computations. In simplest case it is a set of probabilities of transitions to some fixed set of states. The probabilities…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by having it follow from…
We briefly discuss the current state, and future computational implications, of quantum type theory.
We argue that complex systems science and the rules of quantum physics are intricately related. We discuss a range of quantum phenomena, such as cryptography, computation and quantum phases, and the rules responsible for their complexity.…
Some contemporary views of the universe assume information and computation to be key in understanding and explaining the basic structure underpinning physical reality. We introduce the Computable Universe exploring some of the basic…
After a brief introduction to the principles and promise of quantum information processing, the requirements for the physical implementation of quantum computation are discussed. These five requirements, plus two relating to the…
The program of a physical concept of information is outlined in the framework of quantum theory. A proposal is made for how to avoid the introduction of axiomatic observables. The conventional (collapse) and the Everett interpretations of…
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…
We present a survey of quantum algorithms, primarily for an intended audience of pure mathematicians. We place an emphasis on algorithms involving group theory.