Related papers: Limits to measurement in experiments governed by a…
Quantum tomography is the main method used to assess the quality of quantum information processing devices, but its complexity presents a major obstacle for the characterization of even moderately large systems. The number of experimental…
Incompatibility of certain measurements -- impossibility of obtaining deterministic outcomes simultaneously -- is a well known property of quantum mechanics. This feature can be utilized in many contexts, ranging from Bell inequalities to…
In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can…
The measurement postulate of quantum theory stands in conflict with the laws of thermodynamics and has evoked debate regarding what actually constitutes a measurement. With the help of modern quantum statistical mechanics, we take the first…
Many theoretical calculations of subtle coherent effects in quantum mechanics do not carefully consider the interface between their calculations and experiment. Calculations for gedanken experiments using initial states not satisfied in…
Quantum mechanics led to spectacular technological developments, discovery of new constituents of matter and new materials. However there is still no consensus on its interpretation and limitations. Some scientists and scientific writers…
Recently a study of the first superposed mechanical quantum object ("machine") visible to the naked eye was published. However, as we show, it turns out that if the object would actually be observed, i.e. would interact with an optical…
People solve different problems and know that some of them are simple, some are complex and some insoluble. The main goal of this work is to develop a mathematical theory of algorithmic complexity for problems. This theory is aimed at…
To demarcate the limits of experimental knowledge we probe the limits of what might be called an experiment. By appeal to examples of scientific practice from astrophysics and analogue gravity, we demonstrate that the reliability of…
Combining measurements which have "theoretical uncertainties" is a delicate matter, due to an unclear statistical basis. We present an algorithm based on the notion that a theoretical uncertainty represents an estimate of bias.
The computational abilities of theories within the generalised probabilistic theory framework has been the subject of much recent study. Such investigations aim to gain an understanding of the possible connections between physical…
Replicability and reproducibility of experimental results are primary concerns in all the areas of science and IR is not an exception. Besides the problem of moving the field towards more reproducible experimental practices and protocols,…
We propose a time-of-arrival operator in quantum mechanics by conditioning on a quantum clock. This allows us to bypass some of the problems of previous proposals, and to obtain a Hermitian time of arrival operator whose probability…
Quantum mechanics predicts the joint probability distribution of the outcomes of simultaneous measurements of commuting observables, but, in the state of the art, has lacked the operational definition of simultaneous measurements. The…
This paper is a comment on the paper "Quantum Mechanics and Algorithmic Randomness" was written by Ulvi Yurtsever \cite{Yurtsever} and the briefly explanation of the algorithmic randomness of quantum measurements results. There are…
Projective measurements with high quantum efficiency is often assumed to be required for efficient circuit based quantum computing. We argue that this is not the case and show that this fact has actually be known previously though not…
We describe in a qualitative way a possible picture of the Measurement Process in Quantum Mechanics, which takes into account: 1. the finite and non zero time duration T of the interaction between the observed system and the microscopic…
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…
We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such…