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

Philosophy of Science

Is Measurement a Black Box? On the Importance of Understanding Measurement Even in Quantum Information and Computation

Michael Dickson

Published Dec 1, 2007• 16 citations
Publisher

Abstract

It has been argued, partly from the lack of any widely accepted solution to the measurement problem, and partly from recent results from quantum information theory, that measurement in quantum theory is best treated as a black box. However, there is a crucial difference between ‘having no account of measurement’ and ‘having no solution to the measurement problem’. We know a lot about measurements. Taking into account this knowledge sheds light on quantum theory as a theory of information and computation. In particular, the scheme of ‘one-way quantnum computation’ takes on a new character in light of the role that reference frames play in actually carrying out any one-way quantum comptuation.

DOI
10.1086/525641

Related papers

Measurement Problem & the True Nature of the Observer

James P. Kowall

The measurement problem of quantum theory remains unresolved in terms of how the quantum state of the physical world can be reduced to an observed state of the world. In the conventional formulation of quantum theory, the quantum state of the physical world is understood as an unobserved state of potentiality or a quantum wavefunction that must collapse into an observed state of actuality for the physical world to actually be observed. The unresolved issue of the quantum measurement problem is about the true nature of the observer. This question about the true nature of the observer explodes when we understand the quantum state of the physical world in terms of the holographic principle of quantum gravity, which tells us the fundamental nature of the physical world is quantized bits of information, called qubits, encoded on a holographic screen. The holographic screen in turn can be understood as an event horizon that arises in an observer's accelerated frame of reference. This way of understanding the holographic principle can be understood in terms of matrix models that utilize non-commutative geometry. The holographic principle understood in the context of an observer in an accelerated frame of reference has something important to tell us about the true nature of the observer, which is that every observer is at the center of its own holographic screen that defines its own observable holographic world.

Scientific GOD Journal•Apr 1, 2021•0 citations

Mechanism Of The Quantum Speed-up

Giuseppe Castagnoli, Daniel P. Sheehan

We explain the mechanism of the quantum speed-up -quantum algorithms requiring fewer computation steps than their classical equivalentfor a family of algorithms.Bob chooses a function and gives to Alice the black box that computes it.Alice, without knowing Bob's choice, should find a character of the function (e. g. its period) by computing its value for different arguments.There is naturally correlation between Bob's choice and the solution found by Alice.We show that, in quantum algorithms, this correlation becomes quantum.This highlights an overlooked measurement problem: sharing between two measurements the determination of correlated (thus redundant) measurement outcomes.All is like Alice, by reading the solution at the end of the algorithm, contributed to the initial choice of Bob, for half of it in quantum superposition for all the possible ways of taking this half.This contribution, back evolved to before running the algorithm, where Bob's choice is located, becomes Alice knowing in advance half of this choice.The quantum algorithm is the quantum superposition of all the possible ways of taking half of Bob's choice and, given the advanced knowledge of it, classically computing the missing half.This yields a speed-up with respect to the classical case where, initially, Bob's choice is completely unknown to Alice.

arXiv:1101.4359•AIP conference proceedings•Jan 1, 2011•3 citations

The measurement problem in quantum mechanics

Alessio Giuseppe Ferraioli, Canio Noce

In this paper, we discuss the importance of measurement in quantum mechanics and the so-called measurement problem. Any quantum system can be described as a linear combination of eigenstates of an operator representing a physical quantity; this means that the system can be in a superposition of states that corresponds to different eigenvalues, i.e., different physical outcomes, each one incompatible with the others. The measurement process converts a state of superposition (not macroscopically defined) in a well-defined state. We show that, if we describe the measurement by the standard laws of quantum mechanics, the system would preserve its state of superposition even on a macroscopic scale. Since this is not the case, we assume that a measurement does not obey to standard quantum mechanics, but to a new set of laws that form a “quantum measurement theory”.

Science & philosophy•Jun 1, 2019•4 citations

What does it take to solve the measurement problem?

Jonte R. Hance, S Hossenfelder

We summarise different aspects of the measurement problem in quantum mechanics. We argue that it is a real problem which requires a solution, and identify the properties a theory needs to solve the problem. We show that no current interpretation of quantum mechanics solves the problem, and that, being interpretations rather than extensions of quantum mechanics, they cannot solve it. Finally, we speculate what a solution of the measurement problem might be good for.

•Oct 11, 2022•0 citations

On the Relation Between Quantum Computational Speedup and Retrocausality

Giuseppe Castagnoli

We investigate the reason for the quantum speedup (quantum algorithms require fewer computation steps than their classical counterparts). We extend the representation of the quantum algorithm to the process of setting the problem, namely choosing the function computed by the black box. The initial measurement selects a setting at random, Bob (the problem setter) unitarily changes it into the desired one. With reference to the observer dependent quantum states of relational quantum mechanics, this representation is with respect to Bob and any external observer, it cannot be with respect to Alice (the problem solver). It would tell her the function computed by the black box, which to her should be hidden. To Alice, the projection of the quantum state due to the initial measurement is retarded at the end of her problem solving action, so that the algorithm input state remains one of complete ignorance of the setting. By black box computations, she unitarily sends it into the output state that, for each possible setting, encodes the corresponding solution, acquired by the final measurement. Mathematically, we can ascribe to the final measurement the selection of any fraction R of the random outcome of the initial measurement. This projects the input state to Alice on one of lower entropy where she knows the corresponding fraction of the problem setting. Given the appropriate value of R, the quantum algorithm is a sum over classical histories in each of which Alice, knowing in advance one of the R-th parts of the setting, performs the black box computations still required to identify the solution. Given a quantum algorithm, this retrocausality model provides the value of R that explains its speed up; in the major quantum algorithms, R is 1/2 or slightly above it. Conversely, given the problem, R=1/2 always yields the order of magnitude of the number of black box computations required to solve it in an optimal quantum way. Quanta 2016; 5: 34–52.

Quanta•Jan 10, 2016•8 citations

What the foundations of quantum computer science teach us about chemistry

Jarrod R. McClean, Nicholas C. Rubin, Joonho Lee +5 more

With the rapid development of quantum technology, one of the leading applications that has been identified is the simulation of chemistry. Interestingly, even before full scale quantum computers are available, quantum computer science has exhibited a remarkable string of results that directly impact what is possible in a chemical simulation with any computer. Some of these results even impact our understanding of chemistry in the real world. In this Perspective, we take the position that direct chemical simulation is best understood as a digital experiment. While on the one hand, this clarifies the power of quantum computers to extend our reach, it also shows us the limitations of taking such an approach too directly. Leveraging results that quantum computers cannot outpace the physical world, we build to the controversial stance that some chemical problems are best viewed as problems for which no algorithm can deliver their solution, in general, known in computer science as undecidable problems. This has implications for the predictive power of thermodynamic models and topics such as the ergodic hypothesis. However, we argue that this Perspective is not defeatist but rather helps shed light on the success of existing chemical models such as transition state theory, molecular orbital theory, and thermodynamics as models that benefit from data. We contextualize recent results, showing that data-augmented models are a more powerful rote simulation. These results help us appreciate the success of traditional chemical theory and anticipate new models learned from experimental data. Not only can quantum computers provide data for such models, but they can also extend the class and power of models that utilize data in fundamental ways. These discussions culminate in speculation on new ways for quantum computing and chemistry to interact and our perspective on the eventual roles of quantum computers in the future of chemistry.

arXiv:2106.03997•The Journal of Chemical Physics•Oct 15, 2021•20 citations
It has been argued, partly from the lack of any widely accepted solution to the measurement problem, and partly from recent results from quantum information theory, that measurement in quantum theory is best treated as a black box. However, there is a crucial difference between ‘having no account of measurement’ and ‘having no solution to the measurement problem’. We know a lot about measurements. Taking into account this knowledge sheds light on quantum theory as a theory of information and computation. In particular, the scheme of ‘one-way quantnum computation’ takes on a new character in light of the role that reference frames play in actually carrying out any one-way quantum comptuation.
The measurement problem of quantum theory remains unresolved in terms of how the quantum state of the physical world can be reduced to an observed state of the world. In the conventional formulation of quantum theory, the quantum state of the physical world is understood as an unobserved state of potentiality or a quantum wavefunction that must collapse into an observed state of actuality for the physical world to actually be observed. The unresolved issue of the quantum measurement problem is about the true nature of the observer. This question about the true nature of the observer explodes when we understand the quantum state of the physical world in terms of the holographic principle of quantum gravity, which tells us the fundamental nature of the physical world is quantized bits of information, called qubits, encoded on a holographic screen. The holographic screen in turn can be understood as an event horizon that arises in an observer's accelerated frame of reference. This way of understanding the holographic principle can be understood in terms of matrix models that utilize non-commutative geometry. The holographic principle understood in the context of an observer in an accelerated frame of reference has something important to tell us about the true nature of the observer, which is that every observer is at the center of its own holographic screen that defines its own observable holographic world.
We explain the mechanism of the quantum speed-up -quantum algorithms requiring fewer computation steps than their classical equivalentfor a family of algorithms.Bob chooses a function and gives to Alice the black box that computes it.Alice, without knowing Bob's choice, should find a character of the function (e. g. its period) by computing its value for different arguments.There is naturally correlation between Bob's choice and the solution found by Alice.We show that, in quantum algorithms, this correlation becomes quantum.This highlights an overlooked measurement problem: sharing between two measurements the determination of correlated (thus redundant) measurement outcomes.All is like Alice, by reading the solution at the end of the algorithm, contributed to the initial choice of Bob, for half of it in quantum superposition for all the possible ways of taking this half.This contribution, back evolved to before running the algorithm, where Bob's choice is located, becomes Alice knowing in advance half of this choice.The quantum algorithm is the quantum superposition of all the possible ways of taking half of Bob's choice and, given the advanced knowledge of it, classically computing the missing half.This yields a speed-up with respect to the classical case where, initially, Bob's choice is completely unknown to Alice.
In this paper, we discuss the importance of measurement in quantum mechanics and the so-called measurement problem. Any quantum system can be described as a linear combination of eigenstates of an operator representing a physical quantity; this means that the system can be in a superposition of states that corresponds to different eigenvalues, i.e., different physical outcomes, each one incompatible with the others. The measurement process converts a state of superposition (not macroscopically defined) in a well-defined state. We show that, if we describe the measurement by the standard laws of quantum mechanics, the system would preserve its state of superposition even on a macroscopic scale. Since this is not the case, we assume that a measurement does not obey to standard quantum mechanics, but to a new set of laws that form a “quantum measurement theory”.
We investigate the reason for the quantum speedup (quantum algorithms require fewer computation steps than their classical counterparts). We extend the representation of the quantum algorithm to the process of setting the problem, namely choosing the function computed by the black box. The initial measurement selects a setting at random, Bob (the problem setter) unitarily changes it into the desired one. With reference to the observer dependent quantum states of relational quantum mechanics, this representation is with respect to Bob and any external observer, it cannot be with respect to Alice (the problem solver). It would tell her the function computed by the black box, which to her should be hidden. To Alice, the projection of the quantum state due to the initial measurement is retarded at the end of her problem solving action, so that the algorithm input state remains one of complete ignorance of the setting. By black box computations, she unitarily sends it into the output state that, for each possible setting, encodes the corresponding solution, acquired by the final measurement. Mathematically, we can ascribe to the final measurement the selection of any fraction R of the random outcome of the initial measurement. This projects the input state to Alice on one of lower entropy where she knows the corresponding fraction of the problem setting. Given the appropriate value of R, the quantum algorithm is a sum over classical histories in each of which Alice, knowing in advance one of the R-th parts of the setting, performs the black box computations still required to identify the solution. Given a quantum algorithm, this retrocausality model provides the value of R that explains its speed up; in the major quantum algorithms, R is 1/2 or slightly above it. Conversely, given the problem, R=1/2 always yields the order of magnitude of the number of black box computations required to solve it in an optimal quantum way. Quanta 2016; 5: 34–52.
With the rapid development of quantum technology, one of the leading applications that has been identified is the simulation of chemistry. Interestingly, even before full scale quantum computers are available, quantum computer science has exhibited a remarkable string of results that directly impact what is possible in a chemical simulation with any computer. Some of these results even impact our understanding of chemistry in the real world. In this Perspective, we take the position that direct chemical simulation is best understood as a digital experiment. While on the one hand, this clarifies the power of quantum computers to extend our reach, it also shows us the limitations of taking such an approach too directly. Leveraging results that quantum computers cannot outpace the physical world, we build to the controversial stance that some chemical problems are best viewed as problems for which no algorithm can deliver their solution, in general, known in computer science as undecidable problems. This has implications for the predictive power of thermodynamic models and topics such as the ergodic hypothesis. However, we argue that this Perspective is not defeatist but rather helps shed light on the success of existing chemical models such as transition state theory, molecular orbital theory, and thermodynamics as models that benefit from data. We contextualize recent results, showing that data-augmented models are a more powerful rote simulation. These results help us appreciate the success of traditional chemical theory and anticipate new models learned from experimental data. Not only can quantum computers provide data for such models, but they can also extend the class and power of models that utilize data in fundamental ways. These discussions culminate in speculation on new ways for quantum computing and chemistry to interact and our perspective on the eventual roles of quantum computers in the future of chemistry.