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

CRC Press eBooks

On Measurement

Bernard d’Espagnat

Published May 4, 2018• 0 citations
Publisher

Abstract

Macroscopic systems being composed of atoms and fields, there is no reason why they should not obey the quantum laws. It therefore seems quite natural to consider them as quantum systems, albeit extremely complex ones. Measurement constitutes a riddle, and a great many theories were put forward as attempts to solve this riddle. The number is so considerable indeed that to try and review them all would be an almost impossible undertaking. A few essentially quantum notions, such as quantum tunneling, have been shown quite indispensable for explaining a number of experimental facts concerning some systems of macroscopic size and complexity. Small differences necessarily exist between a system as it really is and its description by means of simple statements Moreover, elaborate experimental setups can in general be conceived of that, if used as measurement devices, would enhance these small differences.

DOI
10.1201/9780429503283-10

Related papers

Interpretations of Quantum Mechanics and Measurement Problem

Marco Genovese

We present a panoramic view on various attempts to "solve" the problems of quantum measurement and macro-objectivation, i.e. of the transition from a probabilistic quantum mechanic microscopic world to a deterministic classical macroscopic world.

arXiv:1002.0990•Advanced Science Letters•Sep 1, 2010•42 citations

On the Nature of Quantum Geometry

Roger Penrose

As a way of honoring Professor Wheeler on his sixtieth birthday, I propose to take this opportunity to elaborate upon certain somewhat speculative ideas which I have tried to hint at on occasion, concerning the possible nature of a quantized space-time. The reader will not need to be too discerning to recognize some substantial differences between the ideas I am proposing here and those which Professor Wheeler has on many occasions so eloquently and forcefully put forward. Nonetheless, there is little doubt in my own mind as to the very great inspirational influence that Professor Wheeler’s own views have had in the development of several of the thoughts which I am expressing here. To begin with, let me make clear that I do not necessarily mean by “quantized space-time ” something which could be obtained by applying standard (or even non-standard) techniques of quantization to Einstein’s general theory of relativity. What I wish to say has its roots in something which is really more primitive than either quantum theory or relativity as such. This is the question of the fundamental role played by the mathematical concept of continuum in virtually the whole of accepted present-day physical theory. Not only does the continuum occupy a basic position in our mathematical models of space and time (with the concomitant implication of a continuous nature for many related physical concepts such as velocity, energy, momentum, temperature, etc.), but so also does present-day quantum theory rest crucially on a continuum concept, namely on the two-dimensional complex continuum of probability amplitudes, this being the continuum which also occurs in the superposition law. Let me say at the outset that I am not happy with this state of affairs in physical theory. The mathematical continuum has always seemed to me to contain many features which are really very foreign to physics. This point has been argued forcefully, particularly by Schrödinger [1] and also by a number of other physicists and philosophers [2]. If one is to accept the physical reality of the continuum, then one must accept that there are as 0 This paper originally appeared in Magic Without Magic, edited by J. Klauder, Freeman,

•Jan 1, 1972•46 citations

Nonseparability and Quantum Logic

Bernard d’Espagnat

This talk is about quantum logic, and before we engage in the subject proper let me say how much I appreciate the invitation to deliver it that was extended to me by the Japanese Society for the Philosophy of Science.In particular because I feel that such a meeting is really the place that is most adequate for the discussion of these matters.Let us introduce the subject by mentioning a few general points.First of all, logics deals with propositions.Hence we shall be concerned with propositions.But in fact our interest will be exclusively focused on what is-or what should be the simplest type of propositions: the propositions by means of which a physicist expresses what he knows about a physical system.A priori, our subject should then be very simple.Indeed the elementary books about logic tell us that the rules concerning these propositions can be formalized.That, for example, the propositions can be combined by means of two rules, corresponding to and and to or, and that the resulting structure is just that of a Boolean Algebra.We would expect this to hold for any system.However, as you know, a major difficulty already creeps in at this point when we want to deal with atomic systems.This is because a very simple word such as "and" may well have no obvious meaning in that case.And when we try to force a meaning to it was sometimes encounter quite unpleasant surprises, exemplified by the Heisenberg relations.Among the founders of quantum physics the reactions to such a fact were quite varied as is well known.Some of them sort of hoped that the difficulty just came from our using the wrong concepts.For example, it is quite obvious that if we try to describe as a particle something which is really a wave, we are heading for trouble and we are bound to formulate some meaningless propositions.However, this remark did not lead to a satisfactory solution in the end.Other physicists notably the Copenhagen group took a very different standpoint.Substantially, what they said boiled to this: since we cannot "see" the elementary particles, let us refrain from formulating directly propositions bearing on them.Ultimately, there fore, all their propositions bear on the instruments; or should be interpreted in terms of such propositions.This is -it turned out a very good recipe.Of course, propositions bearing on instruments are propositions of classical, macroscopic physcis.As such, they fall -57-

Annals of the Japan Association for Philosophy of Science•Jan 1, 1977•0 citations

A note on macroscopic measurement

A. C. Biswas

An attempt has been made to understand the process of measurement in terms of Statistical Mechanics.

Bulletin de la Classe des sciences•Jan 1, 1967•0 citations

A quantum view on convex optimization

Joran van Apeldoorn

Every day we need to make many decisions: what we should have for dinner, what to vote for, or whether to kiss that special person for the first time. There are also many decisions that need to be made at a larger scale, for example, groups, governments, and corporations have to make decisions in order to use their resources wisely. Every decision asks us to consider many possibilities and to try to get the optimal outcome (or more often than not, to simply avoid disaster). Making these decisions is further complicated by the constraints that are put on us. Even though people have become quite good at making decisions, the increasing complexity of the world around us means that `going with our guts' is often an ill-advised optimization strategy. The field of mathematics allows us to formulate an abstract version of some of the more complex problems we encounter, and allows us to quantify what the objectives and constraints are. For some problems mathematics even gives us a simple closed-form solution, e.g. many of us have learned in school how find the extreme points on a parabola. However, for many problems there is no such simple closed-form solution, the best we can do is to use a method, or algorithm, to construct a solution. This puts us in the realm of computer science. Computer science considers how to solve problems systematically, and more importantly how many steps the decision-making process has to take. Most optimization problems can be solved by simply listing all possible combinations of decisions and then searching for the best option, but as the number of decisions increases, so does the number of combinations. In fact, for many situations the number of possible combinations increases exponentially, making the process of writing down all the options impractical. Instead we often look for a smarter, more efficient algorithm, one that scales better with the problem size. It is not always easy (or even possible) to find an efficient algorithm. Consider the problem of finding the lowest place in the Swiss Alps. We may walk down into what seems the deepest valley, only to learn later that a farmer three valleys over has dug a really deep well. One of the problems in such a scenario is that we may find a local minimum, but due to a lack of structure in the problem we have no clear way of finding a global minimum. Some problems do have more structure, an important class of these is the class of convex optimization problems. Convex optimization problems have the useful property that local minima are also global minima. For our example about the Alps this means that, as long as we keep going down, we will always reach the lowest point. However, as anyone who ever went snowboarding can tell you, how you go down matters a lot for how fast you will get there. Apart from considering the structure of the problem we are trying to solve we should also consider what steps we can take to solve it. We may want to use pen and paper, use our laptop, or use a supercomputer, all of which function differently. However, these methods are not inherently different, with enough time we could perform the same computation as a supercomputer with nothing more than a pen and a piece of paper. Although this would be significantly slower, the scaling with the problem size would stay the same since the basic steps we can use are the same, only slower. What basic steps we may perform is ultimately dictated by the laws of physics: we can only change the state of our piece of paper, or our computer, in ways that are allowed by physics. Specifically, our piece of paper and our computers both follow the laws of classical physics, the physics that we see around us every day. During the 20th century our understanding of physics has changed and we now know that classical physics does not give a full description of the natural world. One of the places where classical physics breaks down is at the scale of atoms and elementary particles, at this small scale the universe is governed by the laws of quantum physics. Quantum physics predicts behavior that is not possible in classical physics. Particles might be in a superposition of many different classical states, only becoming a specific one of those states at random when interacting with our classical world via a measurement. Miraculously, and contrary to classical randomness, this quantum randomness does not stem from our inherent lack of knowledge about the particle, the different parts of the superposition are all present until we measure and can interfere with each other. A natural question to ask is whether these phenomena can be used to our benefit when performing computations. A computer that works according to the rules of quantum physics is called a Quantum computer, such devices have a wider range of basic operations that they can perform than classical computers do. This thesis asks the following central question can quantum computers solve convex optimization problems faster? In order to answer this question we consider a few different types of problem that we may encounter in convex optimization. If we have some black-box procedure to evaluate how good a proposed solution to a convex optimization problem is, for example a way of estimating the height of a point in the Alps or a method of estimating our profits given a business strategy, then a classical computer would have to try a lot of small changes in order to find the change that improves our objective the most. However, we show that a quantum computer can find the optimal direction for improvement exponentially faster. We then consider specific categories of convex optimization problems, mainly linear programming and semidefinite programming. These problem categories include many natural problems and have been widely used both for theoretical and practical purposes. For example, linear programming can be used for finding the optimal strategies of zero-sum games, coming up with a diet plan, or planning resources. Semidefinite programming is a generalization of linear programming and can additionally be useful for designing optimal experiments, approximately solving hard problems, or optimize processes involving quantum mechanics. Our quantum algorithms for these problems use a natural connection between quantum physics and semidefinite programming: the solutions to a semidefinite programming problem correspond to the states of a quantum system. We show that quantum computers can solve semidefinite programming problems and linear programming problems quadratically faster than a classical computer can. In fact, our algorithms take less time to solve the problem than that it would take to read through the whole input. We also take a more negative view and discuss the limitations of quantum computers. We show that, even though quantum computers can find the optimal direction of improvement exponentially faster, there is no general exponential speedup for finding the optimal value. We also show that in many ways our methods for solving linear and semidefinite programming problems are optimal: faster methods would not be able to read enough of the input to still get a good solution. To conclude, we showed that in a few different settings the answer to our central question is yes. The results in this dissertation show that quantum computers can solve some convex optimization problems faster, but there are also limits to this. There are still many open questions regarding convex optimization on quantum computers and we regard this topic as an important direction of future research.

•Feb 6, 2020•4 citations

Macroscopic quantum objects

Alastair I. M. Rae

For about ten years now there has been considerable interest in the general problem of the applicability of quantum mechanics to large-scale objects. This arises both because a breakdown of quantum principles in this regime could have profound implications for our understanding of fundamental questions like the quantum measurement problem and because of the possibility that devices operating on new principles might result.

Physics World•Jun 1, 1991•5 citations
Macroscopic systems being composed of atoms and fields, there is no reason why they should not obey the quantum laws. It therefore seems quite natural to consider them as quantum systems, albeit extremely complex ones. Measurement constitutes a riddle, and a great many theories were put forward as attempts to solve this riddle. The number is so considerable indeed that to try and review them all would be an almost impossible undertaking. A few essentially quantum notions, such as quantum tunneling, have been shown quite indispensable for explaining a number of experimental facts concerning some systems of macroscopic size and complexity. Small differences necessarily exist between a system as it really is and its description by means of simple statements Moreover, elaborate experimental setups can in general be conceived of that, if used as measurement devices, would enhance these small differences.
As a way of honoring Professor Wheeler on his sixtieth birthday, I propose to take this opportunity to elaborate upon certain somewhat speculative ideas which I have tried to hint at on occasion, concerning the possible nature of a quantized space-time. The reader will not need to be too discerning to recognize some substantial differences between the ideas I am proposing here and those which Professor Wheeler has on many occasions so eloquently and forcefully put forward. Nonetheless, there is little doubt in my own mind as to the very great inspirational influence that Professor Wheeler’s own views have had in the development of several of the thoughts which I am expressing here. To begin with, let me make clear that I do not necessarily mean by “quantized space-time ” something which could be obtained by applying standard (or even non-standard) techniques of quantization to Einstein’s general theory of relativity. What I wish to say has its roots in something which is really more primitive than either quantum theory or relativity as such. This is the question of the fundamental role played by the mathematical concept of continuum in virtually the whole of accepted present-day physical theory. Not only does the continuum occupy a basic position in our mathematical models of space and time (with the concomitant implication of a continuous nature for many related physical concepts such as velocity, energy, momentum, temperature, etc.), but so also does present-day quantum theory rest crucially on a continuum concept, namely on the two-dimensional complex continuum of probability amplitudes, this being the continuum which also occurs in the superposition law. Let me say at the outset that I am not happy with this state of affairs in physical theory. The mathematical continuum has always seemed to me to contain many features which are really very foreign to physics. This point has been argued forcefully, particularly by Schrödinger [1] and also by a number of other physicists and philosophers [2]. If one is to accept the physical reality of the continuum, then one must accept that there are as 0 This paper originally appeared in Magic Without Magic, edited by J. Klauder, Freeman,
This talk is about quantum logic, and before we engage in the subject proper let me say how much I appreciate the invitation to deliver it that was extended to me by the Japanese Society for the Philosophy of Science.In particular because I feel that such a meeting is really the place that is most adequate for the discussion of these matters.Let us introduce the subject by mentioning a few general points.First of all, logics deals with propositions.Hence we shall be concerned with propositions.But in fact our interest will be exclusively focused on what is-or what should be the simplest type of propositions: the propositions by means of which a physicist expresses what he knows about a physical system.A priori, our subject should then be very simple.Indeed the elementary books about logic tell us that the rules concerning these propositions can be formalized.That, for example, the propositions can be combined by means of two rules, corresponding to and and to or, and that the resulting structure is just that of a Boolean Algebra.We would expect this to hold for any system.However, as you know, a major difficulty already creeps in at this point when we want to deal with atomic systems.This is because a very simple word such as "and" may well have no obvious meaning in that case.And when we try to force a meaning to it was sometimes encounter quite unpleasant surprises, exemplified by the Heisenberg relations.Among the founders of quantum physics the reactions to such a fact were quite varied as is well known.Some of them sort of hoped that the difficulty just came from our using the wrong concepts.For example, it is quite obvious that if we try to describe as a particle something which is really a wave, we are heading for trouble and we are bound to formulate some meaningless propositions.However, this remark did not lead to a satisfactory solution in the end.Other physicists notably the Copenhagen group took a very different standpoint.Substantially, what they said boiled to this: since we cannot "see" the elementary particles, let us refrain from formulating directly propositions bearing on them.Ultimately, there fore, all their propositions bear on the instruments; or should be interpreted in terms of such propositions.This is -it turned out a very good recipe.Of course, propositions bearing on instruments are propositions of classical, macroscopic physcis.As such, they fall -57-
Every day we need to make many decisions: what we should have for dinner, what to vote for, or whether to kiss that special person for the first time. There are also many decisions that need to be made at a larger scale, for example, groups, governments, and corporations have to make decisions in order to use their resources wisely. Every decision asks us to consider many possibilities and to try to get the optimal outcome (or more often than not, to simply avoid disaster). Making these decisions is further complicated by the constraints that are put on us. Even though people have become quite good at making decisions, the increasing complexity of the world around us means that `going with our guts' is often an ill-advised optimization strategy. The field of mathematics allows us to formulate an abstract version of some of the more complex problems we encounter, and allows us to quantify what the objectives and constraints are. For some problems mathematics even gives us a simple closed-form solution, e.g. many of us have learned in school how find the extreme points on a parabola. However, for many problems there is no such simple closed-form solution, the best we can do is to use a method, or algorithm, to construct a solution. This puts us in the realm of computer science. Computer science considers how to solve problems systematically, and more importantly how many steps the decision-making process has to take. Most optimization problems can be solved by simply listing all possible combinations of decisions and then searching for the best option, but as the number of decisions increases, so does the number of combinations. In fact, for many situations the number of possible combinations increases exponentially, making the process of writing down all the options impractical. Instead we often look for a smarter, more efficient algorithm, one that scales better with the problem size. It is not always easy (or even possible) to find an efficient algorithm. Consider the problem of finding the lowest place in the Swiss Alps. We may walk down into what seems the deepest valley, only to learn later that a farmer three valleys over has dug a really deep well. One of the problems in such a scenario is that we may find a local minimum, but due to a lack of structure in the problem we have no clear way of finding a global minimum. Some problems do have more structure, an important class of these is the class of convex optimization problems. Convex optimization problems have the useful property that local minima are also global minima. For our example about the Alps this means that, as long as we keep going down, we will always reach the lowest point. However, as anyone who ever went snowboarding can tell you, how you go down matters a lot for how fast you will get there. Apart from considering the structure of the problem we are trying to solve we should also consider what steps we can take to solve it. We may want to use pen and paper, use our laptop, or use a supercomputer, all of which function differently. However, these methods are not inherently different, with enough time we could perform the same computation as a supercomputer with nothing more than a pen and a piece of paper. Although this would be significantly slower, the scaling with the problem size would stay the same since the basic steps we can use are the same, only slower. What basic steps we may perform is ultimately dictated by the laws of physics: we can only change the state of our piece of paper, or our computer, in ways that are allowed by physics. Specifically, our piece of paper and our computers both follow the laws of classical physics, the physics that we see around us every day. During the 20th century our understanding of physics has changed and we now know that classical physics does not give a full description of the natural world. One of the places where classical physics breaks down is at the scale of atoms and elementary particles, at this small scale the universe is governed by the laws of quantum physics. Quantum physics predicts behavior that is not possible in classical physics. Particles might be in a superposition of many different classical states, only becoming a specific one of those states at random when interacting with our classical world via a measurement. Miraculously, and contrary to classical randomness, this quantum randomness does not stem from our inherent lack of knowledge about the particle, the different parts of the superposition are all present until we measure and can interfere with each other. A natural question to ask is whether these phenomena can be used to our benefit when performing computations. A computer that works according to the rules of quantum physics is called a Quantum computer, such devices have a wider range of basic operations that they can perform than classical computers do. This thesis asks the following central question can quantum computers solve convex optimization problems faster? In order to answer this question we consider a few different types of problem that we may encounter in convex optimization. If we have some black-box procedure to evaluate how good a proposed solution to a convex optimization problem is, for example a way of estimating the height of a point in the Alps or a method of estimating our profits given a business strategy, then a classical computer would have to try a lot of small changes in order to find the change that improves our objective the most. However, we show that a quantum computer can find the optimal direction for improvement exponentially faster. We then consider specific categories of convex optimization problems, mainly linear programming and semidefinite programming. These problem categories include many natural problems and have been widely used both for theoretical and practical purposes. For example, linear programming can be used for finding the optimal strategies of zero-sum games, coming up with a diet plan, or planning resources. Semidefinite programming is a generalization of linear programming and can additionally be useful for designing optimal experiments, approximately solving hard problems, or optimize processes involving quantum mechanics. Our quantum algorithms for these problems use a natural connection between quantum physics and semidefinite programming: the solutions to a semidefinite programming problem correspond to the states of a quantum system. We show that quantum computers can solve semidefinite programming problems and linear programming problems quadratically faster than a classical computer can. In fact, our algorithms take less time to solve the problem than that it would take to read through the whole input. We also take a more negative view and discuss the limitations of quantum computers. We show that, even though quantum computers can find the optimal direction of improvement exponentially faster, there is no general exponential speedup for finding the optimal value. We also show that in many ways our methods for solving linear and semidefinite programming problems are optimal: faster methods would not be able to read enough of the input to still get a good solution. To conclude, we showed that in a few different settings the answer to our central question is yes. The results in this dissertation show that quantum computers can solve some convex optimization problems faster, but there are also limits to this. There are still many open questions regarding convex optimization on quantum computers and we regard this topic as an important direction of future research.