English
Related papers

Related papers: Algorithmic measurement procedures

200 papers

The fact that not all measurements can be carried out simultaneously is a peculiar feature of quantum mechanics and responsible for many key phenomena in the theory, such as complementarity or uncertainty relations. For the special case of…

Quantum Physics · Physics 2014-10-22 Roope Uola , Tobias Moroder , Otfried Gühne

The quantum mechanical measurement problem does not arise in the quantum real number approach to quantum measurements of the first kind. The attributes of individual microscopic systems in the experimental ensemble always have qr-number…

General Physics · Physics 2019-02-07 John V Corbett

Generative AI techniques have opened the path for new generations of machines in diverse domains. These machines have various capabilities for example, they can produce images, generate answers or stories, and write codes based on the…

Artificial Intelligence · Computer Science 2023-07-18 Nitisha Aggarwal , Geetika Jain Saxena , Sanjeev Singh , Amit Pundir

A model of quantum measurement is proposed, which aims to describe statistical mechanical aspects of this phenomenon, starting from a purely Hamiltonian formulation. The macroscopic measurement apparatus is modeled as an ideal Bose gas, the…

Statistical Mechanics · Physics 2016-08-31 Armen E. Allahverdyan , Roger Balian , Theo M. Nieuwenhuizen

A quantum multimeter is a programmable device that can implement measurements of different observables depending on the programming quantum state inserted into it. The advantage of this arrangement over a single purpose device is in its…

Quantum Physics · Physics 2017-05-10 Teiko Heinosaari , Takayuki Miyadera , Mikko Tukiainen

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.…

Quantum Physics · Physics 2016-09-21 M. Revzen , A. Mann

This paper is an experimental exploration of the relationship between the runtimes of Turing machines and the length of proofs in formal axiomatic systems. We compare the number of halting Turing machines of a given size to the number of…

Computational Complexity · Computer Science 2012-01-05 Hector Zenil

In this paper, we present a thought experiment that demonstrates that the equivalence of quantum reduced states and statistical mixed states of ensembles is not merely a simple mathematical formulation in quantum mechanics, but rather…

Quantum Physics · Physics 2025-04-18 Zhihong Zuo

We analyze the notion that physical theories are quantitative and testable by observations in experiments. This leads us to propose a new, Bayesian, interpretation of probabilities in physics that unifies their current use in classical…

Quantum Physics · Physics 2007-05-23 Francis G. Perey

The paper explores known results related to the problem of identifying if a given program terminates on all inputs -- this is a simple generalization of the halting problem. We will see how this problem is related and the notion of proof…

Computational Complexity · Computer Science 2012-03-02 Rina Panigrahy

A fundamental problem in artificial intelligence is that nobody really knows what intelligence is. The problem is especially acute when we need to consider artificial systems which are significantly different to humans. In this paper we…

Artificial Intelligence · Computer Science 2007-05-23 Shane Legg , Marcus Hutter

A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…

Data Structures and Algorithms · Computer Science 2007-05-30 Eva Borbely

A quantum measurement is logically reversible if the premeasurement density operator of the measured system can be calculated from the postmeasurement density operator and from the outcome of the measurement. This paper analyzes why many…

Quantum Physics · Physics 2007-05-23 Masahito Ueda

The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of…

Data Structures and Algorithms · Computer Science 2015-05-19 Michael R. Fellows , Serge Gaspers , Frances A. Rosamond

We contribute results for a set of fundamental problems in the context of programmable matter by presenting algorithmic methods for evaluating and manipulating a collective of particles by a finite automaton that can neither store…

Data Structures and Algorithms · Computer Science 2018-10-16 Sándor P. Fekete , Robert Gmyr , Sabrina Hugo , Phillip Keldenich , Christian Scheffer , Arne Schmidt

No consensus seems to exist as to what constitutes a measurement which is still considered somewhat mysterious in many respects in quantum mechanics. At successive stages mathematical theory of measure, metrology and measurement theory…

Quantum Physics · Physics 2008-11-21 Paolo Rocchi , Orlando Panella

Many scientists seeking to understand the quantum mechanics of measurement situations (Copenhagen quantum theory) agree on its overwhelmingly successful algorithms to predict the outcomes of laboratory measurements but disagree on what…

Quantum Physics · Physics 2020-12-10 James B. Hartle

In this thesis, we consider the properties of measurements in quantum theory and other operational theories. After having introduced the framework of operational theories, we consider a communication scheme based on an experimental…

Quantum Physics · Physics 2021-06-08 Leevi Leppäjärvi

A phase space mathematical formulation of quantum mechanical processes accompanied by and ontological interpretation is presented in an axiomatic form. The problem of quantum measurement, including that of quantum state filtering, is…

Quantum Physics · Physics 2015-06-26 Daniela Dragoman

The Turing machine, as it was presented by Turing himself, models the calculations done by a person. This means that we can compute whatever any Turing machine can compute, and therefore we are Turing complete. The question addressed here…

Artificial Intelligence · Computer Science 2016-09-05 Ramón Casares
‹ Prev 1 4 5 6 7 8 10 Next ›