Related papers: Quantum randomness and value indefiniteness
Reversible computation requires that intermediate data be explicitly undone rather than discarded. In quantum programming, this principle appears as uncomputation, usually treated as a technical cleanup mechanism. We instead present…
In the past decade, the toolkit of quantum information has been expanded to include processes in which the basic operations do not have definite causal relations. Originally considered in the context of the unification of quantum mechanics…
An essential element of classical computation is the "if-then" construct, that accepts a control bit and an arbitrary gate, and provides conditional execution of the gate depending on the value of the controlling bit. On the other hand,…
Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration problem, for which a speed-up is shown by quantum computers…
Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by…
Quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister, a system of qubits, representing a…
Irreversibility is often considered to characterize measurements in quantum mechanics. Fundamental problems with this characterization are addressed. First, whether a measurement is made in quantum mechanics is an arbitrary decision on the…
We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to…
Vagueness is something everyone is familiar with. In fact, most people think that vagueness is closely related to language and exists only there. However, vagueness is a property of the physical world. Quantum computers harness…
The peculiar uncertainty or randomness of quantum measurements stems from coherence, whose information-theoretic characterization is currently under investigation. Under the resource theory of coherence, it is interesting to investigate…
Unlike classical information, quantum knowledge is restricted to the outcome of measurements of maximal observables corresponding to single contexts.
This paper explores the problem of quantum measurement complexity. In computability theory, the complexity of a problem is determined by how long it takes an effective algorithm to solve it. This complexity may be compared to the difficulty…
We study a quantum version of the sequential game illustrating problems connected with making rational decisions. We compare the results that the two models (quantum and classical) yield. In the quantum model intransitivity gains importance…
Quantum computing employs some quantum phenomena to process information. It has been hailed as the future of computing but it is plagued by serious hurdles when it comes to its practical realization. MemComputing is a new paradigm that…
We use the martingale-theoretic approach of game-theoretic probability to incorporate imprecision into the study of randomness. In particular, we define a notion of computable randomness associated with interval, rather than precise,…
The long lasting discussion on the completeness of quantum theory (QT) has not yet come to an end. The discussion is impeded by the lack of a clear understanding of what makes up the contents of a theory of physics in general and of QT…
Quantum computation is the suitable orthogonal encoding of possibly holistic functional properties into state vectors, followed by a projective measurement.
Pivotal within quantum physics, the concept of quantum incompatibility is generally related to algebraic aspects of the formalism, such as commutation relations and unbiasedness of bases. Recently, the concept was identified as a resource…
In quantum field theory radiative corrections can be finite but undetermined.
We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.