Related papers: Programming of channels in generalized probabilist…
A programmable quantum processor uses the states of a program register to specify one element of a set of quantum channels which is applied to an input register. It is well-known that such a device is impossible with a finite-dimensional…
We propose a quantum programming paradigm where all data are familiar classical data, and the only non-classical element is a random number generator that can return results with negative probability. Currently, the vast majority of quantum…
Quantum theory can be regarded as a non-commutative generalization of classical probability. From this point of view, one expects quantum dynamics to be analogous to classical conditional probabilities. In this paper, a variant of the…
We study the limitations of deterministic programmability of quantum circuits, e.g., quantum computer. More precisely, we analyse the programming of quantum observables and channels via quantum multimeters. We show that the programming…
The framework of generalized probabilistic theories (GPTs) is a popular approach for studying the physical foundations of quantum theory. The standard framework assumes the no-restriction hypothesis, in which the state space of a physical…
We investigate general probabilistic theories in which every mixed state has a purification, unique up to reversible channels on the purifying system. We show that the purification principle is equivalent to the existence of a reversible…
The no-programming theorem prohibits the existence of a Universal Programmable Quantum Processor. This statement has several implications in relation to quantum computation, but also to other tasks of quantum information processing, making…
A general theory of dynamics is formulated with the aim of its application in emergent quantum mechanics. In such a framework it is argued that the fundamental dynamics of emergent quantum mechanics must be non-reversible.
A necessary condition for reversibility (sufficiency) of a quantum channel with respect to complete families of states with bounded rank is obtained. A full description (up to isometrical equivalence) of all quantum channels reversible with…
Controlling quantum systems is crucial for quantum computation and a variety of new quantum technologies. The control is typically achieved by breaking down the target dynamics into a sequence of elementary gates,whose description can be…
We introduce a general formalism, based on the stochastic formulation of quantum mechanics, to obtain localized quasi-classical wave packets as dynamically controlled systems, for arbitrary anharmonic potentials. The control is in general…
Gleason-type theorems for quantum theory allow one to recover the quantum state space by assuming that (i) states consistently assign probabilities to measurement outcomes and that (ii) there is a unique state for every such assignment. We…
The framework of generalized probabilistic theories is a powerful tool for studying the foundations of quantum physics. It provides the basis for a variety of recent findings that significantly improve our understanding of the rich physical…
The subject of this work is quantum predicative programming -- the study of developing of programs intended for execution on a quantum computer. We look at programming in the context of formal methods of program development, or programming…
The framework of generalized probabilistic theories (GPT) is a widely-used approach for studying the physical foundations of quantum theory. The standard GPT framework assumes the no-restriction hypothesis, in which the state space of a…
Modern classical computing devices, except of simplest calculators, have von Neumann architecture, i.e., a part of the memory is used for the program and a part for the data. It is likely, that analogues of such architecture are also…
Although the laws of classical physics are deterministic, thermodynamics gives rise to an arrow of time through irreversible processes. In quantum mechanics the unitary nature of the time evolution makes it intrinsically reversible, however…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
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…
Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…