English
Related papers

Related papers: Algorithmic measurement procedures

200 papers

The notion of weak measurement provides a formalism for extracting information from a quantum system in the limit of vanishing disturbance to its state. Here we extend this formalism to the measurement of sequences of observables. When…

Quantum Physics · Physics 2009-11-13 Graeme Mitchison , Richard Jozsa , Sandu Popescu

We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…

Quantum Physics · Physics 2019-12-03 Lucien Hardy , Adam G. M. Lewis

We introduce a framework for simulating quantum measurements based on classical processing of a set of accessible measurements. Well-known concepts such as joint measurability and projective simulability naturally emerge as particular cases…

Quantum Physics · Physics 2017-09-27 Leonardo Guerini , Jessica Bavaresco , Marcelo Terra Cunha , Antonio Acín

Recent works have independently suggested that Quantum Mechanics might permit for procedures that transcend the power of Turing Machines as well as of `standard' Quantum Computers. These approaches rely on and indicate that Quantum…

Quantum Physics · Physics 2010-05-10 Martin Ziegler

Informationally complete measurements on a quantum system allow to estimate the expectation value of any arbitrary operator by just averaging functions of the experimental outcomes. We show that such kind of measurements can be achieved…

Quantum Physics · Physics 2007-05-23 G. M. D'Ariano , P. Perinotti , M. F. Sacchi

Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and…

Logic · Mathematics 2007-05-23 Joel David Hamkins

This paper describes the formal verification of two Turing machines using the program verifier Dafny. Both machines are deciders, so we prove total correctness. They are typical first examples of Turing machines used in any course of…

Logic in Computer Science · Computer Science 2026-01-22 Edgar F. A. Lederer

This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…

Computational Complexity · Computer Science 2010-09-24 Koji Kobayashi

Measurement is an integral part of modern science, providing the fundamental means for evaluation, comparison, and prediction. In the context of visualization, several different types of measures have been proposed, ranging from approaches…

Graphics · Computer Science 2019-09-13 Fabian Bolte , Stefan Bruckner

Efficient methods for characterizing the performance of quantum measurements are important in the experimental quantum sciences. Ideally, one requires both a physically relevant distinguishability measure between measurement operations and…

Quantum Physics · Physics 2015-06-12 Easwar Magesan , Paola Cappellaro

Algorithmic entropy can be seen as a special case of entropy as studied in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics to the subject of algorithmic information theory. In…

Mathematical Physics · Physics 2013-02-27 John C. Baez , Mike Stay

Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical…

Quantum Physics · Physics 2017-04-19 Volkan Erol

In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of…

Quantum Physics · Physics 2007-05-23 Richard Jozsa

In this paper in which we address the evaluation of measurement process quality, we mainly focus on the evaluation procedure, as far as it is based on the numerical measurement outcomes. We challenge the approach where the "exact" value of…

Methodology · Statistics 2013-02-05 Edgard Nyssen , Wolfgang Jacquet

Metastability is a spurious mode of operation in digital signals, where an electrical signal fails to settle into a stable state within a specified time, leading to uncertainty and potentially failing downstream hardware. A system that…

Computational Complexity · Computer Science 2026-04-21 Johannes Bund , Amir Leshem , Moti Medina

We present a description of the measurement process based on the parametric representation with environmental coherent states. This representation is specifically tailored for studying quantum systems whose environment needs being…

Quantum Physics · Physics 2015-09-30 Pietro Liuzzo-Scorpo , Alessandro Cuccoli , Paola Verrucchi

Measurement involves the determination of quantitative estimates of physical quantities from experiment, along with estimates of their associated uncertainties. Herewith an experimental system model is the key to extracting information from…

Applications · Statistics 2008-09-01 Vladimir B. Bokov

The machinery of the human brain -- analog, probabilistic, embodied -- can be characterized computationally, but what machinery confers what computational powers? Any such system can be abstractly cast in terms of two computational…

Neurons and Cognition · Quantitative Biology 2020-08-14 Richard Granger

It is proposed a possible new approach of quantum measurements (QMS), disconnected of the traditional interpretation of uncertainty relations and independent of any appeal to the strange idea of collapse (reduction) of wave functions. The…

Quantum Physics · Physics 2007-05-23 S. Dumitru

A universal Turing machine is a powerful concept - a single device can compute any function that is computable. A universal spin model, similarly, is a class of physical systems whose low energy behavior simulates that of any spin system.…

Computational Complexity · Computer Science 2024-06-25 Tomáš Gonda , Gemma De les Coves