Related papers: Limits to measurement in experiments governed by a…
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation…
Analog quantum simulation is emerging as a powerful tool for uncovering classically unreachable physics such as many-body real-time dynamics. A complete quantification of uncertainties is necessary in order to make precise predictions using…
How well can multiple incompatible observables be implemented by a single measurement? This is a fundamental problem in quantum mechanics with wide implications for the performance optimization of numerous tasks in quantum information…
Computational physics is an important tool for analysing, verifying, and -- at times -- replacing physical experiments. Nevertheless, simulating quantum systems and analysing quantum data has so far resisted an efficient classical treatment…
A certain generalization of the mathematical formalism of quantum mechanics beyond operator algebras is considered. The approach is based on the concept of conditional probability and the interpretation of the Lueders - von Neumann quantum…
We analyze a single-particle Mach-Zehnder interferometer experiment in which the path length of one arm may change (randomly or systematically) according to the value of an external two-valued variable $x$, for each passage of a particle…
We propose an exercise in which one attempts to deduce the formalism of quantum mechanics solely from phenomenological observations. The only assumed inputs are obtained through sequential probing of quantum systems; no presuppositions…
In the quantum regime, the third law of thermodynamics implies the unattainability of pure states. As shown recently, such unattainability implies that a unitary interaction between the measured system and a measuring apparatus can never…
Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…
The number of parameters describing a quantum state is well known to grow exponentially with the number of particles. This scaling clearly limits our ability to do tomography to systems with no more than a few qubits and has been used to…
We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed…
Projective (Von Neumann) Measurement of an operator (i.e. a dynamical variable) selected from a prescribed set of operators is termed unrecorded measurement (URM) when both the selected operator and the measurement outcome are unknown, i.e.…
Applications of quantum mechanics have led to many successful predictions and explanations of puzzling phenomena, and we now apply quantum mechanics to gain, process, and communicate information in novel ways. We can understand quantum…
With the relentless rise of computer power, there is a widespread expectation that computers can solve the most pressing problems of science, and even more besides. We explore the limits of computational modelling and conclude that, in the…
We question whether the measurement based quantum computing algorithm is in fact Grover's algorithm or simply a similar oracular search method. The two algorithms share several qualitative features especially in the case of the trivial 4…
The measurement process of observables in a quantum system comes out to be an unsovable problem which started in the early times of the development of the theory. In the present note we consider the measured system part of an open system…
In the computational social choice literature, there has been great interest in understanding how computational complexity can act as a barrier against manipulation of elections. Much of this literature, however, makes the assumption that…
The lower and upper bound of any given algorithm is one of the most crucial pieces of information needed when evaluating the computational effectiveness for said algorithm. Here a novel method of Boolean Algebraic Programming for symbolic…
Physics has long lived with a schizophrenia that desires determinism for measured systems while demanding that experimenters decide what to measure on a whim. Intriguingly, such a free will assumption for experimenters has thwarted many…
We show that, contrarily to the widespread belief, in quantum mechanics repeatable measurements are not necessarily described by orthogonal projectors--the customary paradigm of "observable". Nonorthogonal repeatability, however, occurs…