Related papers: Quantum Programming Without the Quantum Physics
The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is in itself nothing but a re-interpretation (fruitful indeed) of well-known concepts. The…
A generic approach for compiling any classical block compression algorithm into a quantum block compression algorithm is presented. Using this technique, compression asymptoticaly approaching the von Neumann entropy of a qubit source can be…
In recent work, Benjamin Schumacher and Michael~D. Westmoreland investigate a version of quantum mechanics which they call "modal quantum theory" but which we prefer to call "discrete quantum theory". This theory is obtained by…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum algorithms are demonstrated to outperform classical algorithms for certain problems and thus are promising candidates for efficient information processing. Herein we aim to provide a brief and popular introduction to quantum…
An understanding of quantum theory in terms of new, underlying descriptions capable of explaining the existence of non-classical correlations, non-commutativity of measurements and other unique and counter-intuitive phenomena remains still…
A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. The Ising spins can represent macroscopic two-level…
This paper serves as a bridge between quantum computing and analogical modeling (a general theory for predicting categories of behavior in varying contexts). Since its formulation in the early 1980s, analogical modeling has been…
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical ``black box'' function drawn from some set of such black box functions, we investigate a more general quantum query model…
Quantum computation is a topic of significant recent interest, with practical advances coming from both research and industry. A major challenge in quantum programming is dealing with errors (quantum noise) during execution. Because quantum…
This paper answers Bell's question: What does quantum information refer to? It is about quantum properties represented by subspaces of the quantum Hilbert space, or their projectors, to which standard (Kolmogorov) probabilities can be…
Quantum algorithms for computational linear algebra promise up to exponential speedups for applications such as simulation and regression, making them prime candidates for hardware realization. But these algorithms execute in a model that…
In this thesis, we investigate whether quantum algorithms can be used in the field of machine learning for both long and near term quantum computers. We will first recall the fundamentals of machine learning and quantum computing and then…
Quantum mechanics permits certain kinds of non-local effects. This paper demonstrates how these can be used for distributed computation with minimal communication between various processors. The problem considered is that of estimating the…
General relativity required the abandonment of Euclidean geometry. Here we show that quantum theory requires the abandonment of classical logic. We show that the Hilbert space representation of quantum theory is logically inevitable. There…
Modern programming relies on our ability to treat preprogrammed functions as black boxes - we can invoke them as subroutines without knowing their physical implementation. Here we show it is generally impossible to execute an unknown…
Quantum computers are a promising candidate to radically expand computational science through increased computing power and more effective algorithms. In particular quantum computing could have a tremendous impact in the field of quantum…
We present an information-theoretic interpretation of quantum formalism based on a Bayesian framework and devoid of any extra axiom or principle. Quantum information is construed as a technique for analyzing a logical system subject to…
We present a new quantum programming language called "Quala" that enables true full-stack programming of quantum hardware. Quala allows seamless integration of abstraction layers such as the digital circuit layer and the analog control…
A quantum probability model is introduced and used to explain human probability judgment errors including the conjunction, disjunction, inverse, and conditional fallacies, as well as unpacking effects and partitioning effects. Quantum…