Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9912020

A Quantum Logic Gate Representation of Quantum Measurement: Reversing and Unifying the Two Steps of von Neumann's Model

Giuseppe Castagnoli

Published Dec 6, 1999• 1 citation
arXivHTMLPDF

Abstract

In former work, quantum computation has been shown to be a problem solving process essentially affected by both the reversible dynamics leading to the state before measurement, and the logical-mathematical constraints introduced by quantum measurement (in particular, the constraint that there is only one measurement outcome). This dual influence, originated by independent initial and final conditions, justifies the quantum computation speed-up and is not representable inside dynamics, namely as a one-way propagation. In this work, we reformulate von Neumann's model of quantum measurement at the light of above findings. We embed it in a broader representation based on the quantum logic gate formalism and capable of describing the interplay between dynamical and non-dynamical constraints. The two steps of the original model, namely (1) dynamically reaching a complete entanglement between pointer and quantum object and (2) enforcing the one-outcome-constraint, are unified and reversed. By representing step (2) right from the start, the same dynamics of step (1) yields a probability distribution of mutually exclusive measurement outcomes. This appears to be a more accurate and complete representation of quantum measurement. PACS: 03.67.-a, 03.67.Lx, 03.65.Bz

DOI
10.48550/arxiv.quant-ph/9912020

Related papers

Quantum problem solving as simultaneous computation

Giuseppe Castagnoli

I provide an alternative way of seeing quantum computation. First, I describe an idealized classical problem solving machine that, thanks to a many body interaction, reversibly and nondeterministically produces the solution of the problem under the simultaneous influence of all the problem constraints. This requires a perfectly accurate, rigid, and reversible relation between the coordinates of the machine parts - the machine can be considered the many body generalization of another perfect machine, the bounching ball model of reversible computation. The mathematical description of the machine, as it is, is applicable to quantum problem solving, an extension of the quantum algorithms that comprises the physical representation of the problem-solution interdependence. The perfect relation between the coordinates of the machine parts is transferred to the populations of the reduced density operators of the parts of the computer register. The solution of the problem is reversibly and nondeterministically produced under the simultaneous influence of the state before measurement and the quantum principle. At the light of the present notion of simultaneous computation, the quantum speed up turns out to be "precognition" of the solution, namely the reduction of the initial ignorance of the solution due to backdating, to before running the algorithm, a time-symmetric part of the state vector reduction on the solution; as such, it is bounded by state vector reduction through an entropic inequality. PACS numbers: 03.67.Lx, 01.55.+b, 01.70.+w

arXiv:0710.1744•Oct 9, 2007•2 citations

Symmetry, Reversibility, and Efficiency of Quantum Computation

Giuseppe Castagnoli, Dalida Monti, Alexander V. Sergienko

The reason for the higher efficiency exhibited by some quantum algorithms over their classical counterparts is examined by considering the interplay between the reversible actions required to prepare the computer registers in an entangled state before measurement (the "initial actions"), and the final measurement action -- whereas measurement is interpreted in a new way, particularly suited to a problem solving context. This unification shows that the computation process, comprising the measurement outcome, is significantly influenced by both the initial actions and the need to satisfy the constraints set by the final measurement action. Reviewing the existing quantum algorithms in the light of this dual influence, yields new valuable insight in the nature of the quantum computation speed up.

arXiv:quant-ph/9908015•Aug 4, 1999•0 citations

An introduction to measurement based quantum computation

Richard Jozsa

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 basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the measurement outcomes. This is in contrast to the more familiar gate array model in which computational steps are unitary operations, developing a large entangled state prior to some final measurements for the output. Two principal schemes of measurement based computation are teleportation quantum computation (TQC) and the so-called cluster model or one-way quantum computer (1WQC). We will describe these schemes and show how they are able to perform universal quantum computation. We will outline various possible relationships between the models which serve to clarify their workings. We will also discuss possible novel computational benefits of the measurement based models compared to the gate array model, especially issues of parallelisability of algorithms.

arXiv:quant-ph/0508124•Aug 17, 2005•124 citations

MEASUREMENTS IN QUANTUM MECHANICS AND von NEUMANN’s MODEL

Pier A. Mello, Lars M. Johansen, Moises Martinez-Mares +1 more

Many textbooks on Quantum Mechanics are not very precise as to the meaning of making a measurement: as a consequence, they frequently make assertions which are not based on a dynamical description of the measurement process. A model proposed by von Neumann allows a dynamical description of measurement in Quantum Mechanics, including the measuring instrument in the formalism.In this article we apply von Neumann’s model to illustrate the measurement of an observable by means of a measuring instrument and show how various results, which are sometimens postulated without a dynamical basis, actually emerge.We also investigate the more complex, intriguing and fundamental problem of two successive measurements in Quantum Mechanics, extending von Neumann’s model to two measuring instruments. We present a description which allows obtaining, in a unified way, various results that have been given in the literature.

AIP conference proceedings•Jan 1, 2010•3 citations

A Logic of Quantum Measurement

Olivier Brunet

We present a formulation of quantum mechanics based on a logic representing some aspects of the behaviour of the measurement process. With such an approach, we make no direct mention of quantum states, and thus avoid the problems associated to this rather evasive notion. We then study some properties of the models of this logic, and deduce some characteristics that any model (and hence any formulation of quantum mechanics compatible with its prediction and relying on a notion of measurement) should verify. The main results we obtain are that in the case of a Hilbert space of dimension at least 3, no model can lead to the prediction with certainty of more than one atomic outcome. Moreover, if the Hilbert space is finite dimensional, then we are able to precisely describe the structure of the predictions of any model of our logic. As a consequence, we finally show that all the models of our logic make exactly the same predictions regarding whether a given sequence of outcomes is possible or not.

•Feb 17, 2015•0 citations

From Reversible Logic Gates to Universal Quantum Bases

Alex Bocharov, Krysta M. Svore

With the anticipated end of Moore’s law for integrated circuits [3, 4] fast approaching and continued advances in low-power electronics, interest in quantum computing has increased. This shifts the focus from deterministic logical circuits to potentially more powerful circuits based on controllable quantum systems. In this column, we present a mathematical tour of the quantum circuit model, beginning with reversible logic circuits and expanding to quantum circuits, gates, and measurement. We highlight quantum mechanical phenomena such as superposition, entanglement, and measurement, review the Gottesman-Knill theorem, which states that some subclasses of quantum operations can be simulated eciently on a classical computer, and describe sets of quantum gates that are universal for quantum computation.

Logic in Computer Science•Aug 23, 2013•0 citations
In former work, quantum computation has been shown to be a problem solving process essentially affected by both the reversible dynamics leading to the state before measurement, and the logical-mathematical constraints introduced by quantum measurement (in particular, the constraint that there is only one measurement outcome). This dual influence, originated by independent initial and final conditions, justifies the quantum computation speed-up and is not representable inside dynamics, namely as a one-way propagation. In this work, we reformulate von Neumann's model of quantum measurement at the light of above findings. We embed it in a broader representation based on the quantum logic gate formalism and capable of describing the interplay between dynamical and non-dynamical constraints. The two steps of the original model, namely (1) dynamically reaching a complete entanglement between pointer and quantum object and (2) enforcing the one-outcome-constraint, are unified and reversed. By representing step (2) right from the start, the same dynamics of step (1) yields a probability distribution of mutually exclusive measurement outcomes. This appears to be a more accurate and complete representation of quantum measurement. PACS: 03.67.-a, 03.67.Lx, 03.65.Bz
I provide an alternative way of seeing quantum computation. First, I describe an idealized classical problem solving machine that, thanks to a many body interaction, reversibly and nondeterministically produces the solution of the problem under the simultaneous influence of all the problem constraints. This requires a perfectly accurate, rigid, and reversible relation between the coordinates of the machine parts - the machine can be considered the many body generalization of another perfect machine, the bounching ball model of reversible computation. The mathematical description of the machine, as it is, is applicable to quantum problem solving, an extension of the quantum algorithms that comprises the physical representation of the problem-solution interdependence. The perfect relation between the coordinates of the machine parts is transferred to the populations of the reduced density operators of the parts of the computer register. The solution of the problem is reversibly and nondeterministically produced under the simultaneous influence of the state before measurement and the quantum principle. At the light of the present notion of simultaneous computation, the quantum speed up turns out to be "precognition" of the solution, namely the reduction of the initial ignorance of the solution due to backdating, to before running the algorithm, a time-symmetric part of the state vector reduction on the solution; as such, it is bounded by state vector reduction through an entropic inequality. PACS numbers: 03.67.Lx, 01.55.+b, 01.70.+w
The reason for the higher efficiency exhibited by some quantum algorithms over their classical counterparts is examined by considering the interplay between the reversible actions required to prepare the computer registers in an entangled state before measurement (the "initial actions"), and the final measurement action -- whereas measurement is interpreted in a new way, particularly suited to a problem solving context. This unification shows that the computation process, comprising the measurement outcome, is significantly influenced by both the initial actions and the need to satisfy the constraints set by the final measurement action. Reviewing the existing quantum algorithms in the light of this dual influence, yields new valuable insight in the nature of the quantum computation speed up.
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 basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the measurement outcomes. This is in contrast to the more familiar gate array model in which computational steps are unitary operations, developing a large entangled state prior to some final measurements for the output. Two principal schemes of measurement based computation are teleportation quantum computation (TQC) and the so-called cluster model or one-way quantum computer (1WQC). We will describe these schemes and show how they are able to perform universal quantum computation. We will outline various possible relationships between the models which serve to clarify their workings. We will also discuss possible novel computational benefits of the measurement based models compared to the gate array model, especially issues of parallelisability of algorithms.
Many textbooks on Quantum Mechanics are not very precise as to the meaning of making a measurement: as a consequence, they frequently make assertions which are not based on a dynamical description of the measurement process. A model proposed by von Neumann allows a dynamical description of measurement in Quantum Mechanics, including the measuring instrument in the formalism.In this article we apply von Neumann’s model to illustrate the measurement of an observable by means of a measuring instrument and show how various results, which are sometimens postulated without a dynamical basis, actually emerge.We also investigate the more complex, intriguing and fundamental problem of two successive measurements in Quantum Mechanics, extending von Neumann’s model to two measuring instruments. We present a description which allows obtaining, in a unified way, various results that have been given in the literature.
We present a formulation of quantum mechanics based on a logic representing some aspects of the behaviour of the measurement process. With such an approach, we make no direct mention of quantum states, and thus avoid the problems associated to this rather evasive notion. We then study some properties of the models of this logic, and deduce some characteristics that any model (and hence any formulation of quantum mechanics compatible with its prediction and relying on a notion of measurement) should verify. The main results we obtain are that in the case of a Hilbert space of dimension at least 3, no model can lead to the prediction with certainty of more than one atomic outcome. Moreover, if the Hilbert space is finite dimensional, then we are able to precisely describe the structure of the predictions of any model of our logic. As a consequence, we finally show that all the models of our logic make exactly the same predictions regarding whether a given sequence of outcomes is possible or not.
With the anticipated end of Moore’s law for integrated circuits [3, 4] fast approaching and continued advances in low-power electronics, interest in quantum computing has increased. This shifts the focus from deterministic logical circuits to potentially more powerful circuits based on controllable quantum systems. In this column, we present a mathematical tour of the quantum circuit model, beginning with reversible logic circuits and expanding to quantum circuits, gates, and measurement. We highlight quantum mechanical phenomena such as superposition, entanglement, and measurement, review the Gottesman-Knill theorem, which states that some subclasses of quantum operations can be simulated eciently on a classical computer, and describe sets of quantum gates that are universal for quantum computation.