Related papers: Quantum randomness and value indefiniteness
The quantum world is fascinating. It presents a description of nature that defies our most rooted concepts about what reality is. For example, quantum objects possess \lq\lq spooky\rq\rq\ properties that allow them to be in multiple places…
We introduce probability estimation, a broadly applicable framework to certify randomness in a finite sequence of measurement results without assuming that these results are independent and identically distributed. Probability estimation…
Consequences of quantum recurrences on the stability of a broad class of dynamical systems is presented.
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
We show that in finite dimension a quantum measurement with continuous set of outcomes is always equivalent to a continuous random choice of measurements with only finite outcomes.
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…
There has been no lack of coverage in the past few years in scientific journals of the topic of quantum computation. Rightly so, as this is a novel idea with--so far--at least one very important practical application (prime factorisation)…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
We discuss the physical nature of quantum information, in particular focussing on tasks that are achievable by some physical realizations of qubits but not by others.
The higher than classical efficiency exhibited by some quantum algorithms is here ascribed to their non-mechanistic character, which becomes evident by joining the notions of entanglement and quantum measurement. Measurement analogically…
It is shown that probabilistic treatment of quantum mechanics can be coordinated with causality of all physical processes. The physical interpretation of quantum-mechanical phenomena such as process of measurement and collapse of quantum…
We discuss quantum information processing machines. We start with single purpose machines that either redistribute quantum information or identify quantum states. We then move on to machines that can perform a number of functions, with the…
Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also considered intractable. This raises the question of how one can…
This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of…
A typical oracle problem is finding which software program is installed on a computer, by running the computer and testing its input-output behaviour. The program is randomly chosen from a set of programs known to the problem solver. As…
We show that the local and deterministic mode of description is not only in conflict with the quantum theory, but also with relativity. We argue that elementary relativistic properties of spacetime lead to the emergence of a…
A software product line models the variability of highly configurable systems. Complete exploration of all valid configurations (the configuration space) is infeasible as it grows exponentially with the number of features in the worst case.…
We study weakest precondition reasoning about the (co)variance of outcomes and the variance of run-times of probabilistic programs with conditioning. For outcomes, we show that approximating (co)variances is computationally more difficult…
This paper considers the relevance of the concepts of observability and computability in physical theory. Observability is related to verifiability which is essential for effective computing and as physical systems are computational systems…
Quantum theory encounters a difficulty when attempting to describe recording devices. If the recording is of events in which quantum uncertainty plays a role, such as an experiment on a quantum system, quantum theory is unable to correctly…