Related papers: Laws of Quantum Programming
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
Quantum mechanics is an extremely successful theory of nature and yet it lacks an intuitive axiomatization. In contrast, the special theory of relativity is well understood and is rooted into natural or experimentally justified postulates.…
A new formulation of quantum mechanics is proposed based on a new principle that can be considered a generalization of the Born rule. The principle is composed of a mathematical expression and an associated interpretation, and establishes a…
Quantum computing offers advantages over classical computation, yet the precise features that set the two apart remain unclear. In the standard quantum circuit model, adding a 1-qubit basis-changing gate -- commonly chosen to be the…
Quantum algorithms and circuits can, in principle, outperform the best non-quantum (classical) techniques for some hard computational problems. However, this does not necessarily lead to useful applications. To gauge the practical…
An examination of the concept of using classical degrees of freedom to drive the evolution of quantum computers is given. Specifically, when externally generated, coherent states of the electromagnetic field are used to drive transitions…
Quantum computing, leveraging quantum phenomena like superposition and entanglement, is emerging as a transformative force in computing technology, promising unparalleled computational speed and efficiency crucial for engineering…
Familiar formulations of classical and quantum mechanics are shown to follow from a general theory of mechanics based on pure states with an intrinsic probability structure. This theory is developed to the stage where theorems from quantum…
We present a general formalism for quantum error-correcting codes that encode both classical and quantum information (the EACQ formalism). This formalism unifies the entanglement-assisted formalism and classical error correction, and…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
Coherent control, aka quantum control, is a central concept in quantum computing that is attracting increasing attention from both the quantum foundations and quantum software communities. Defining coherent control in the presence of…
This paper reports three almost trivial theorems that nevertheless appear to have significant import for quantum foundations studies. 1) A Gleason-like derivation of the quantum probability law, but based on the positive operator-valued…
The quantum theory of decoherence plays an important role in a pragmatist interpretation of quantum theory. It governs the descriptive content of claims about values of physical magnitudes and offers advice on when to use quantum…
The nRules are empirical regularities that were discovered in macroscopic situations where the outcome is known. When they are projected theoretically into the microscopic domain they predict a novel ontology including the frequent collapse…
This thesis establishes a number of connections between foundational issues in quantum theory, and some quantum information applications. It starts with a review of quantum contextuality and non-locality, multipartite entanglement…
A remarkable difference between quantum and classical programs is that the control flow of the former can be either classical or quantum. One of the key issues in the theory of quantum programming languages is defining and understanding…
Due to the inevitable existence of quantum effects, a classical description generically breaks down after a finite quantum break-time $t_q$. We aim to find criteria for determining $t_q$. To this end, we construct a new prototype model that…
A fundamental problem in statistics and learning theory is to test properties of distributions. We show that quantum computers can solve such problems with significant speed-ups. In particular, we give fast quantum algorithms for testing…
The future development of quantum technologies relies on creating and manipulating quantum systems of increasing complexity, with key applications in computation, simulation and sensing. This poses severe challenges in the efficient…
The fundamental dynamics of quantum particles is neutral with respect to the arrow of time. And yet, our experiments are not: we observe quantum systems evolving from the past to the future, but not the other way round. A fundamental…