I gathered a few of the comments made by participants of my lecture “Why quantum computers cannot work and how”, and a few of my answers. Here they are along with some of the lecture’s slides. Here is the link for the full presentation.
Category Archives: Physics
Meeting with Aram Harrow, and my Lecture on Why Quantum Computers Cannot Work.
Last Friday, I gave a lecture at the quantum information seminar at MIT entitled “Why quantum computers cannot work and how.” It was a nice event with lovely participation during the talk, and a continued discussion after it. Many very interesting and useful remarks were made. Here are the slides. (The abstract can be found on this page.)
After having an almost a year–long debate with Aram Harrow, I finally met Aram in person, and we had nice time together during my visit.
Aram is so nice that had it been up to me I would certainly make quantum computers possible :) (But this is not up to us and all we can do is to try to explore if QC are possible or not.)
We talked about quite a few topics starting with various exotic models of noise that treat differently classic and quantum information, the relevance of locally correctable codes and their quantum counterparts, the sum of Squares/Lasserre hierarchy, unique games and hypercontractivity, my smoothed Lindblad evolutions , NMR and spinecho, quantum annealing and stoquasicity, and works by Mossbüer, Rekha Thomas, and Monique Laurent were mentioned.
More
I just returned yesterday night from Yale after a very fruitful visit. Here is a picture of a snowcar decorated with car mirrors from the great blizzard.
Symplectic Geometry, Quantization, and Quantum Noise
Over the last two meetings of our HU quantum computation seminar we heard two talks about symplectic geometry and its relations to quantum mechanics and quantum noise.
Yael Karshon: Manifolds, symplectic manifolds, Newtonian mechanics, quantization, and the non squeezing theorem.
The first informal lecture by Yael Karshon gave an introduction to the notions of manifolds and symplectic manifolds. Yael described the connection with Newtonian physics, gave the example of symplectic structure on phase spaces coming from physics, and talked about dynamics and physical laws. She also gave other examples of symplectic manifolds. The 2dimensional sphere is an important example, and also complex projective manifolds are symplectic.
Quantization
Now, if symplectic geometry describes Newtonian mechanics how should we move to describe quantum mechanics? Yael talked a little about quantization, described an impossibility theorem by Groenweld and Van Hove for certain general types of quantization, and mentioned a few ways around it. (More details at the end of this post.)
Non squeezing, symplectic camels and uncertainty.
Yael concluded with Gromov’s nonsqueezing theorem. This theorem asserts that a ball of radius R cannot be “squeezed” by a symplectic map to a cylinder whose base is a circle of radius r, for R > r. Yael mentioned that Gromov’s non squeezing theorem can be regarded as a classical manifestation of the uncertainty principle from quantum mechanics. (The Wikipedia article gives a nice description of the theorem, mention the metaphor of passing a symplectic camel through the eye of a needle, and notes the connection with the uncertainty principle.)
Leonid Polterovich: Geometry of Poisson Brackets and Quantum Unsharpness
A week later Leonid Polterovich gave a lecture entitled “Geometry of Poisson brackets and quantum unsharpness.” (Here are the slides Update: here is a video of a related lecture in QStart). Leonid reviewed the notion of symplectic manifolds, and gave a vivid explanation, based on areas of parallelograms, of how to think about a symplectic form. Then he defined a displaceable set (a notion introduced by Helmut Hofer) in a symplectic manifold. This is a set X such that you can find a Hamiltonian diffeomorphism so that the image of X is disjoint from X. On small discs are displaceable but the equator is not!
Poisson brackets and the fiber theorem
Another crucial ingredient in the lecture was the notion of Poisson brackets which measure noncommutativity of Hamiltonian flow. Leonid continued to describe the PolterovichEntov “non displaceable fiber theorem,” which asserts that if you have a function from a compact symplectic manifold to described by n real functions whose pairwise Poisson brackets vanish, then there is a point whose preimage is not displaceable.
Partition of unity, classical registration, and cell phones.
A partition of unity is a collection of nonnegative valued real functions that sum up to 1. Suppose we are given an open cover of M by n sets and ask if there exists a partition of unity such that is supported on and all Poisson brackets vanish. Next comes a theorem of Entov Polterovich and Zapolsky which asserts that this is not possible for covers with small sets, namely, if all sets are displaceable. In fact, the theorem gives a quantitative relation between how small the sets in the cover are and a “measure of noncommutativity” for any partition of unity that respects this open cover. Both the proof and the interpretations of this theorem have strong relations to quantum mechanics. This was the next topic in Leonid’s lecture. Leonid gave us a choice between ideas of QM playing a role in the proof and QM interpretation of the result and connections to quantum noise. In the end he talked about both topics.
Before going quantum, note that if the sets in the cover represent areas covered by an antenna for cell phones, you can ask how to register cellphones to antennas and regard the partition of unity as a probabilistic recipe.
Quantum mechanics, The correspondence principle
Enters quantum mechanics. Here is a dictionary
The correspondence principle in physics states that the behavior of systems described by the theory of quantum mechanics reproduces classical physics in the limit.
POVMs and projector valued POVMs (vonNeumann observables).
Leonid talked about two notions of observables. The more general one is based on positive operator valued measures (briefly – POVM’s). The more special one is vonNeumann observables which are special cases of POVM’s (called projector valued POVM’s). POVM’s on the quantum side are analogs of partition of unity on the classic side, and they lead to a sort of “quantum registration.” (This is the familiar probabilistic aspect of quantum measurement.)
Quantum noise, noncommutativity and the unsharpness principle
Following Ozawa, and BuschHeinonenLahti, Leonid described a notion of “systematic quantum noise” and described a lower bound referred to as an “unsharpness principle” (Janssens 2006, MiyaderaImai, 2008, and Polterovich 2012) of the systematic noise in terms of non commutativity of the components of the POVM. Quantum noise, in this context, refers only to measurements, and systematic quantum noise describes the extent to which POVM’s are not vonNeumann observables.
An unsharpness principle for BerezinToeplitz quantization
Leonid described next the unsharpness principle based on the BerezinToeplitz quantization of a symplectic manifold. In this case we can talk about a POVM which corresponds to an open cover of the manifold by small sets. The conclusion is that these POVMs cannot be too close to projectorvalued POVM’s. The proof relies on the theorem of EntovPolterovichZapolsky, the (difficult) correspondence principles for the quantization, and the linearalgebraic unsharpness principle for POVM’s. (I will give some more details below.)
Links to Leonid’s papers
Here are links to Leonid’s papers on quantum noise: Quantum unsharpness and symplectic rigidity and Symplectic geometry of quantum noise.
Grete Hermann
Leonid briefly mentioned in his lecture the name of Grete Hermann. She was a German mathematician and philosopher, who is famous for her early work on the foundations of quantum mechanics and early criticism of the nohiddenvariable theorem by John von Neumann. Here is an English translation of her 1935 paper: The foundations of quantum mechanics in the philosophy of nature. At age 26 Hermann finished her Ph. D. in mathematics with Emmy Noether. In the 30s she participated in an underground movement against the Nazis and lived in exile from 1936 until 1946.
Symplecticism and skepticism: possible relations with my work
As some of you may know I am quite interested in quantum noise and quantum faulttolerance. My work is about properties and models of quantum noise which do not enable quantum fault tolerance believed to be crucial for building quantum computers. (Here are slides from a recent talk.) Ultimately, the hope is to use the theory of quantum errorcorrection and quantum faulttolerance to describe principles of quantum noise which do not enable computational superior devices based on quantum physics.
Leonid and I were surprised to discover that we are both interested in quantum noise, and some of the statements we made look linguistically similar. For example, we both talk about a certain “hardcore” noisy kernel that cannot be avoided, and relate it to measures of noncommutativity. Leonid talks about “smearing” while I talk about “smoothing,” etc.
Yet, there are also clear differences. The unsharpness principle talks about noisy measurements and not about noisy approximations to unitary evolutions or to pure states which are what my work is mainly about.
Yet again, there may be ways to reconcile these differences. Ideal quantum computer evolutions induce nonunitary operations on parts of the quantum memory, even when it comes to two qubits. (And I am quite interested in the case of two qubits.) Beside that, quantum faulttolerance is based fundamentally on nonunitary evolutions. Another interesting question is to see if my “smoothed Linblad evolutions” which are obtained from an arbitrary noisy evolution by adding a certain “smoothing” in time satisfy the unsharpness principle. And another interesting question is to see if physicsmodels of noisy quantum computers like the ones proposed by AharonovKitaevPreskill, and Preskill do obey the unsharpness principle.
It will be interesting to explore connections between Leonid’s work and mine. The notion of a quantum computer abstracts away the geometry and much of the physics and this is also the case for models of noisy quantum computers – both the standard ones and mine. The same is true for classical computers – classical computers can be used to describe classical physics but the laws of physics do not emerge from Turing machines or Boolean circuits. In the quantum and classical cases alike, more structure is needed. So in order to check my conjectures on the behavior of noisy quantum systems we either need to study very specific proposed implementations of quantum computers or other specific noisy quantum systems, or to consider some middle ground that manifests the physics. Symplectic geometry can give a useful such middle ground.
Other relations with quantum information and quantum computation
Yet again once more, it looks like the connection of symplectic geometry, quantization and noise with the theory of quantum information and computation need not be restricted to my little skeptical corner. Useful ideas and examples can flow in both directions and involve mainstream quantum computation. The symplectic angle is certainly a good thing to be aware of and explore (and for me it will probably be a slow process).
A few more details on quantization in symplectic geometry as explained by Yael Karshon.
The challenge is to associate to every symplectic manifold M a Hilbert space H and to every real valued smooth function on M a selfadjoint operator on H such that
 Linear combinations of functions go to linear combinations of operators,
 Poisson brackets of functions go to i times the commutator of operators,
 the function 1 goes to the identity operator, and
 a “complete” family of functions passes to a “complete” family of operators.
The axioms (1)(4) are attributed to Dirac. In (4), a family of functions is “complete” if it separates points almost everywhere and a family of operators is “complete” if it acts irreducibly. (There may be variations in these definitions. Some people require more, e.g., that the powers of a function be mapped to the powers of the corresponding operator.)
“No go theorems” say that there does not exist a correspondence (that is nontrivial in some sense) that satisfies the properties (1)(4). A “no go theorem” for was given by Groenweld and Van Hove. Later “no go theorems” were also found for some compact symplectic manifolds. The 1996 review paper “Obstruction results in quantization theory”, by Gotay, Grundling, and Tuynman, should be relevant.
The first step in Geometric Quantization, which is called Prequantization, more or less achieves (1), (2), (3) but fails at (4). One compromise is to define the correspondence not for all smooth functions, but, rather, to restrict it to a subPoissonalgebra of the smooth functions. With this compromise, Geometric quantization can achieve (1)(4). (But it depends on a choice of a socalled “polarization”. Often different choices give isomorphic answers but this is only partially understood.)
Other methods of quantization involve asymptotic in hbar. This means that the desired correspondence is demonstrated in the limit with respect to some parameter regarded as 1 over the Planck constant. One of these is the BerezinToeplitz quantization that Leonid works with. Another is Deformation Quantization.
BerezinToeplitz quantization, smearing, coherent noise, and quasistates as further explained by Leonid Polterovich
BerezinToeplitz quantization
BerezinToeplitz quantization is a procedure to move from a symplectic manifold M to a sequence of Hilbert spaces which satisfy in the limit (when m tends to infinity) the quantization requirements. Leonid did not explain the construction in the lecture but later explained to Dorit Aharonov, Guy Kindler, and me how it works for the special case where M is a Cartesian product of n copies of . Very roughly you associate to each an mdimensional Hilbert space and let m tend to infinity. The proofs of the correspondence principle: namely, the relation between commutators and Poisson brackets when m tends to infinity involve deep and difficult mathematics, with certain shortcuts when the symplectic manifolds have the extra structure of a “Kahler manifold.” While the main interest in the literature is for the case that m tends to infinity, for us, the case m=2 is quite interesting as it relates unitary evolution on an nqubit quantum computer with Hamiltonian evolution on a Cartesian product of 2spheres.
Quantum registration, smearing, unsmearing and coherent noise
POVMs can be used to describe a quantum registration rule analogous to the classical probabilistic rule based on partition of unity. Leonid described a statistical smearing operation on POMVs that increases noise. He asked to what extent we can denoise using unsmearing, and proved that, in certain circumstances, a certain amount of “inherent noise” persistent under unsmearing must remain.
Quantum and symplectic quasistates
The lecture mentioned briefly another interesting aspect of the classicalquantum correspondence through symplectic geometry. Gleason proved in 1957 that for Hilbert spaces of dimension 3 or more every “quasistate” is a state. (Quasi states are defined based on linearity requirement just when the observables are commuting.) Non linear symplectic “quasistates” do exist and this is related to deep developments in symplectic geometry. Leonid’s talk shows that quasistates provided by symplectic geometry vanish on functions with dispaceable (“small”) supports. This readily rules out existence of Poisson commuting partitions of unity with displaceable supports.)
More
Happy new year, everybody!
A planned “Kazhdan’s seminar” spring 2014.
In 2003/2004 David Kazhdan and I ran a seminar on polytopes, toric varieties, and related combinatorics and algebra. (A lot has happened since and this spring Sam Payne and I will give together a course at Yale on similar topics this spring. There will be a separate post about it.) David and I felt that it is time to run another such event in 2014, perhaps establishing a tradition for a decennial joint seminar. So next spring, the plan is that David with me and Leonid and hopefully also Michael and Dorit will devote one of David’s Sunday seminars to computation, quantumness, symplectic geometry, and information.
A 1965 letter by Richard Palais
In a widely circulated but unpublished letter in 1965, Richard Palais explained the symplectic formulation of Hamiltonian mechanics. See this MO question.
Small and large in mathematics
Different notions of “small” and “large” and the tension between them are quite important in many areas of mathematics. Of course, sets of measure zero, sets of Bairecategory one, sets of lower dimensions, subsets of smaller (infinite) cardinality, come to mind. In the symplectic context displaceable sets are small: note that the lowerdimensional equator is symplectically “large” while caps with positive area are “small.”
Let me remind myself that I should attempt to blog some time about deep recent results on “nullsets” in Eucledian spaces connected also to combinatorics. (Meanwhile, here are links to two papers by Alberti, Csörnyei, and Preiss, Structure of null sets in the plane and applications, and Diﬀerentiability of Lipschitz functions, structure of null sets, and other problems.)
Trivia question
In theoretical computer science, what do the terms “Yaelism” and “Adamology” refer to?
Camels and elephants through the eye of a needle
The term “symplectic camel” refers to a quote of Jesus: “It is easier for a camel to pass through the eye of a needle than for a rich man to enter heaven.” (I learned about it when it was used in Aram Harrow’s reply in one part of our quantum debate, See also this post on The Quantum Pontiff ) A nice discussion of this phrase can be found here. The Jewish analog (from the Talmud) is about passing an elephant through the eye of a needle which is used to describe making convoluted arguments which have no basis in reality, attributed to the scholars of Pompeditha. Rabbi Shesheth answered Rabbi Amram “Maybe you are from the school at Pumbeditha, where they can make an elephant pass through the eye of a needle.”
Greg Kuperberg referred in this context to: Rowan Atkinson – Conservative Conference
“It is easier for a rich man to pass through the eye of a needle than…for a camel to!”
An additional clarification on symplectic camels by Yael
Gromov Nonsqueezing and the Symplectic Camel Theorem are two different theorems. (The Wikipedia article is unclear about this.) The Symplectic Camel theorem says this. Take , say, with coordinates Remove the hyperplane minus a ball of radius r in this hyperplane.
Thus, we get two “rooms” separated by a “wall” but with a “hole” in the wall. If R<r then a ball of radius R that lies entirely in the “left room” can be continuously translated through the “hole” into the “right room” If R>r we cannot move the ball to the “right room” continuously by translations nor rigid transformations but we can move it through volume preserving transformations (by first squishing it so it becomes long and narrow). The theorem says that we cannot do this symplectically: if R > r then there is no path of symplectic embeddings of the ball of radius R that starts with an embedding into and ends with an embedding into (An interesting open question is whether there exists a “compact camel“: a compact symplectic manifold in which the space of symplectic embeddings of a ball of some fixed radius R into the manifold is disconnected.)
The Quantum FaultTolerance Debate Updates
In a couple of days, we will resume the debate between Aram Harrow and me regarding the possibility of universal quantum computers and quantum fault tolerance. The debate takes place over GLL (Godel’s Lost Letter and P=NP) blog.
The Debate
Where were we?
My initial post “Perpetual Motion of The 21st Century?” presented my conjectures regarding how noisy quantum computers and noisy quantum evolutions really behave.
Aram’s first post was entitled “Flying Machines of the 21st Century?” It mainly dealt with the question “How is it possible that quantum faulttolerance is impossible (or really really hard) while classical fault tolerance is possible (and quite easy). Aram claimed that my conjectures, if true, exclude also classical computers.
Aram’s second post entitled “Nature does not conspire” dealt mainly with correlated errors. Aram claimed that it is unreasonable to assume strong correlation of errors as my conjectures imply and that the conjectured relation between the signal and noise is in tension with linearity of quantum mechanics.
Aram’s third post “The Quantum superPAC” raised two interesting thoughtexperiments and discussed also intermediate models.
Each post ended with a small rejoinder, and included a short description of the ealier discussion. The discussion was quite extensive and very interesting.
What’s next
Aram and Steve Flammia wrote an interesting manuscript with appealing counterexamples to my Conjecture C. Our next planned post (it now has appeared) will discuss this matter.
Next, I will conclude with a post discussing Aram’s two main points from his first and second posts and some related issues which I find important.
These posts are mostly written but since Aram was busy with pressing deadlines we waited several weeks before posting them. I also enjoyed the break, as the extensive discussion period was quite tiring.
A very short introduction to my position/approach
1) The crux of matter is noise
A Discussion and a Debate
Heavier than air flight of the 21 century?
The very first post on this blog entitled “Combinatorics, Mathematics, Academics, Polemics, …” asked the question “Are mathematical debates possible?” We also had posts devoted to debates and to controversies.
A few days ago, the first post in a discussion between Aram Harrow, a brilliant computer scientists and quantum information researcher (and a decorated debator), and myself on quantum error correction was launched in Dick Lipton and Ken Regan’s bigleague blog, Gödel’s Lost Letter and P=NP.
The central question we would like to discuss is:
Are universal quantum computers based on quantum error correction possible.
In preparation for the public posts, Ken, Aram, Dick, and me are having very fruitful and interesting email discussion on this and related matters, and also the post itself have already led to very interesting comments. Ken is doing marvels in editing what we write.
Dick opened the post by talking on perpetual motion machines which is ingenious because it challenges both sides of the discussion. Perpetual motion turned out to be impossible: will quantum computers enjoy the same fate? On the other hand (and closer to the issue at hand), an argument against quantum mechanics based on the impossibility of perpetual motion by no other than Einstein turned out to be false, are skeptical ideas to quantum computers just as bogus? (The answer could be yes to both questions.) Some people claimed that heavierthanair flight might is a better analogy. Sure, perhaps it is better.
But, of course, analogies with many human endeavors can be made, and for these endeavors, some went one way, and some went the other way, and for some we don’t know.
Although this event is declared as a debate, I would like to think about it as a discussion. In the time scale of such a discussion what we can hope for is to better understand each other positions, and, not less important, to better understand our own positions. (Maybe I will comment here about some meta aspects of this developing discussion/debate.)
A real debate
A real emerging debate is if we (scientists) should boycott Elsevier. I tend to be against such an action, and especially against including refereeing papers for journals published by Elsevier as part of the boycott. I liked, generally speaking, Gowers’s critical post on Elsevier, but the winds of war and associated rhetoric are not to my liking. The universities are quite powerful, and they deal, negotiate and struggle with scientific publishers, and other similar bodies, on a regular basis. I tend to think that the community of scientists should not be part of such struggles and that such involvement will harm the community and science. This is a real debate! But it looks almost over. Many scientists joined the boycott and not many opposing opinions were made. It looks that we will have a little war and see some action. Exciting, as ever.
Aaronson and Arkhipov’s Result on Hierarchy Collapse
Scott Aaronson gave a thoughtprovoking lecture in our Theory seminar three weeks ago. (Actually, this was eleven months ago.) The slides are here . The lecture discussed two results regarding the computational power of quantum computers. One result from this paper gives an oracleevidence that there are problems in BQP outside the polynomial hierarchy. The method is based on “magnification” of results on bounded depth circuits. (It is related to the LinialNisan conjecture.)
The second result that we are going to discuss in this post (along with some of my provoked thoughts) is a recent result of Scott Aaronson and Alex Arkhipov which asserts that if the power of quantum computers can be simulated by digital computers then the polynomial hierarchy collapses. More precisely, their result asserts that if sampling probability distribution created by quantum computers (this is abbreviated as QSAMPLE) is in P then the polynomial hieararchy collapses to its third level.
The beautiful and important paper of Aaronson and Arkhipov is now out. Its main point of view is related to what I describe in the sixth section about “photon machines”. Update: Let me mention related idependent results by Michael J. Bremner, Richard Jozsa, Dan J. Shepherd in the paper entitled: “Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy“.
Here is the plan for this post
1) The polynomial hierarchy and results about hierarchy collapse
2) The Aaronson Arkhipov (AA) theorem and its proof
3) Two problems posed by AA
Those are: does P=BQP already leads to a collapse of the polynomial hierarchy? And does APPROXIMATEQSAMPLE already leads to a collapse?
4) Does fault tolerance allow QSAMPLE (on the nose)? (Answer: yes)
5) Is there a quantum analog to Aaronson and Arkhipov’s result and what is the computational power of quantum computers?
6) Three Two competing scenarios
7) Aaronson and Arkhipov photon machines and the complexity class BOSONSAMPLING.
Continue reading
Octonions to the Rescue
Xavier Dahan and JeanPierre Tillich’s Octonionbased Ramanujan Graphs with High Girth.
Update (February 2012): Non associative computations can be trickier than we expect. Unfortunately, the paper by Dahan and Tillich turned out to be incorrect.
Update: There is more to be told about the background of the new exciting paper. In particular, I would like to tell you more about regular graphs with high girth. (I started below.) The Ramanujan graphs story is, of course, also fascinating so at the very least I should give good links.
Michael Atiyah‘s lecture at IAS physics last Friday was entertaining, educational and quite provocative.
The talk started with the following thesis: There are four fundamental forces of nature and there are four division rings over the reals. The real numbers, complex numbers, Quaternions and the Octonions. Atiyah expects that the Octonions will play a major role in physics and will allow a theory which accounts for gravitation. He described some specific steps in this direction and related ideas and connections. At the end of the talk, Atiyah’s thesis looked more plausible than in the beginning. His concluding line was: “you can regard what I say as nonsense, or you can claim that you know it already, but you cannot make these two claims together.” In any case, it looks that the people in the audience were rather impressed by and sympathetic to the Octonionic ideas of this wise energetic scientific tycoon.
The same day I received an email from Nati Linial. The subject was: “a good topic for your blog” and the email contained just a single link.
http://arxiv.org/PS_cache/arxiv/pdf/1011/1011.2642v1.pdf
Nati is my older academic brother and often I regard our relations as similar to typical relations between older and younger (biological) brothers. When he tells me what to do I often rebel, but usually at the end I do as he says and most of the times he is right.
So I waited a couple of hours before looking at the link. Indeed, 1011.2642v1.pdf is a great paper. It uses Octonions in place of Quaternions for the construction of Ramanujan graphs and describes a wonderful breakthrough in creating small graphs with large girth. Peter Sarnak’s initial reaction to the new paper was: “wow”.
Here is a link to a paper entitled “Octonions” by John Baez, that appeared in Bull. AMS.
Some background:
Let be a regular graph with girth where is an odd integer. Continue reading
Benoît’s Fractals
Mandelbrot set
Benoît Mandelbrot passed away a few dayes ago on October 14, 2010. Since 1987, Mandelbrot was a member of the Yale’s mathematics department. This chapterette from my book “Gina says: Adventures in the Blogosphere String War” about fractals is brought here on this sad occasion.
A little demonstration of Mandelbrot’s impact: when you search in Google for an image for “Mandelbrot” do not get pictures of Mandelbrot himself but rather pictures of Mandelbrot’s creation. You get full pages of beautiful pictures of Mandelbrot sets
Benoit Mandelbrot (19242010)
Modeling physics by continuous smooth mathematical objects have led to the most remarkable achievements of science in the last centuries. The interplay between smooth geometry and stochastic processes is also a very powerfull and fruitful idea. Mandelbrot’s realization of the prominence of fractals and his works on their study can be added to this short list of major paradigms in mathematical modeling of real world phenomena.
Fractals
Fractals are beautiful mathematical objects whose study goes back to the late 19th century. The Sierpiński triangle and the Koch snowflake are early examples of fractals which are constructed by simple recursive rules. Continue reading
Itamar Pitowsky: Probability in Physics, Where does it Come From?
I came across a videotaped lecture by Itamar Pitowsky given at PITP some years ago on the question of probability in physics that we discussed in two earlier posts on randomness in nature (I, II). There are links below to the presentation slides, and to a video of the lecture.
A little over a week ago on Thursday, Itamar, Oron Shagrir, and I sat at our little CS cafeteria and discussed this very same issue. What does probability mean? Does it just represent human uncertainty? Is it just an emerging mathematical concept which is convenient for modeling? Do matters change when we move from classical to quantum mechanics? When we move to quantum physics the notion of probability itself changes for sure, but is there a change in the interpretation of what probability is? A few people passed by and listened, and it felt like this was a direct continuation of conversations we had while we (Itamar and I; Oron is much younger) were students in the early 70s. This was our last meeting and Itamar’s deep voice and good smile are still with me.
In spite of his illness of many years Itamar looked in good shape. A day later, on Friday, he met with a graduate student working on connections between philosophy and computer science. Yet another exciting new frontier. Last Wednesday Itamar passed away from sudden complications related to his illness.
Itamar was a great guy; he was great in science and great in the humanities, and he had an immense human wisdom and a modest, levelheaded way of expressing it. I will greatly miss him.
Here is a link to a Condolence page for Itamar Pitowsky
Probability in physics: where does it come from? 

(Here is the original link to the PIPS lecture) My post entitled Amazing possibilities about various fundamental limitations stated by many great minds that turned out to be wrong, was largely based on examples provided by Itamar.
Randomness in Nature II
In a previous post we presented a MO question by Liza about randomness:
What is the explanation of the apparent randomness of highlevel phenomena in nature?
1. Is it accepted that these phenomena are not really random, meaning that given enough information one could predict it? If so isn’t that the case for all random phenomena?
2. If there is true randomness and the outcome cannot be predicted – what is the origin of that randomness? (is it a result of the randomness in the micro world – quantum phenomena etc…)
Before I give the floor to the commentators, I would like to mention a conference on this topic that took place in Jerusalem a year ago. The title was “The Probable and the Improbable: The Meaning and Role of Probability in Physics” and the conference was in honor of Itamar Pitowsky. Let me also mention that the Wikipedia article on randomness is also a good resource.
Here are some of the answers offered here to Liza’s question.
One way to think about what it means to say that a physical process is “random” is to say that there is no algorithm which predicts its behavior precisely which runs significantly faster than the process itself. Morally I think this should be true of many “highlevel” phenomena. Continue reading