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 2-dimensional 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 non-squeezing 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 non-commutativity of Hamiltonian flow. Leonid continued to describe the Polterovich-Entov “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 pre-image is not displaceable.

### Partition of unity, classical registration, and cell phones.

A partition of unity is a collection of non-negative 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 non-commutativity” 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 (von-Neumann 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 von-Neumann 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, non-commutativity and the unsharpness principle

Following Ozawa, and Busch-Heinonen-Lahti, Leonid described a notion of “systematic quantum noise” and described a lower bound referred to as an “unsharpness principle” (Janssens 2006, Miyadera-Imai, 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 von-Neumann observables.

### An unsharpness principle for Berezin-Toeplitz quantization

Leonid described next the unsharpness principle based on the Berezin-Toeplitz 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 projector-valued POVM’s. The proof relies on the theorem of Entov-Polterovich-Zapolsky, the (difficult) correspondence principles for the quantization, and the linear-algebraic 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 *no-hidden-variable 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 fault-tolerance. 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 error-correction and quantum fault-tolerance 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 “hard-core” noisy kernel that cannot be avoided, and relate it to measures of non-commutativity. 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 non-unitary 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 fault-tolerance is based fundamentally on non-unitary 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 physics-models of noisy quantum computers like the ones proposed by Aharonov-Kitaev-Preskill, 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 self-adjoint 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 sub-Poisson-algebra of the smooth functions. With this compromise, Geometric quantization can achieve (1)-(4). (But it depends on a choice of a so-called “polarization”. Often different choices give isomorphic answers but this is only partially understood.)

Other methods of quantization involve asymptotic in *h*-bar. 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 Berezin-Toeplitz quantization that Leonid works with. Another is Deformation Quantization.

## Berezin-Toeplitz quantization, smearing, coherent noise, and quasi-states as further explained by Leonid Polterovich

### Berezin-Toeplitz quantization

Berezin-Toeplitz 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 *m*-dimensional 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 *n*-qubit quantum computer with Hamiltonian evolution on a Cartesian product of 2-spheres.

### 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 quasi-states

The lecture mentioned briefly another interesting aspect of the classical-quantum correspondence through symplectic geometry. Gleason proved in 1957 that for Hilbert spaces of dimension 3 or more every “quasi-state” is a state. (Quasi states are defined based on linearity requirement just when the observables are commuting.) Non linear symplectic “quasi-states” do exist and this is related to deep developments in symplectic geometry. Leonid’s talk shows that quasi-states 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 Baire-category one, sets of lower dimensions, subsets of smaller (infinite) cardinality, come to mind. In the symplectic context displaceable sets are small: note that the lower-dimensional 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 “null-sets” 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.)

Update: A sketch of a proof of Gromov’s non squeezing theorem is in this post by Terry Tao.

Dear Gil

Thank you for this terrific post! The topic “Symplectic Geometry, Quantization, and Quantum Noise” surely a Great Topic, in the sense that one can discuss it either forwards or backwards.

So here is my “backwards” take upon this topic (which I also posted on

Gödel’s Lost Letter):—————–

Geometric quantum mechanics can be pursued precisely in two

oppositedirections in the following sense. Instead of pursuinggeometric quantization(as the references you provide call it) the topic of interest can be specified asgeometric dequantization(as it might be called), that is, the pullback of quantum dynamics from Hilbert space onto lower-rank submanifolds of Hilbert space.There is no one book on dequantization, but it turns out to be pretty straightforward to learn the framework of John Lee’s outstanding textbook

Introduction to Smooth Manifolds— the concluding chapter of the Lee’s brand-new 2nd edition covers symplectic manifolds and Hamiltonian flows — and then translate the dynamical elements of Nielsen and Chuang’sQuantum Computation and Quantum Informationand of Landau and Lifshitz’Statistical Physics Part 1(especially the chapters on Onsager relations), and selected examples from Bird, et al.’sTransport Phenomena, and finally selected examples from our QSE Group’s ownPractical recipes for the model order reduction, dynamical simulation, and compressive sampling of large-scale open quantum systems, all into the unifying geometric language of John Lee’s outstandingly clear (2nd edition) textbook.There is no one step in this program that is difficult (or even new!) … but there are a *lot* of steps … and regrettably the effort is doubled because everyone’s mathematical notation (except Lee’s) is awkward and/or outdated … and then the effort is

redoubledbecause no two texts use the same notation or even the same physical intuitions. Ouch!Eventually I’ll post the resulting math/physics/engineering synthesis — most likely as a *long* article on the arxiv server — of which one conclusion will (informally) amount to:

The restriction regarding the validation test serves to accommodate “good enough” P-resource simulation of Aaronson-Arkhipov BosonSampling processes.

This conclusion (for me) represents a viable synthesis of the very best elements of the Kalai/Harrow debate. In the words of the famous joke:

You and Aram are both absolutely right!Happy New Year to everyone, and thank you for sustaining this find weblog Gil! 🙂

——————–

New years bonus:

. Shhh! Don’t tell anyone! 🙂A website with free WordPress LaTeX preview!Thanks for the comment, John. Moving backwards e.g. from quantum evolutions on n-qubit computer to a symplectic action on products of 2-spheres may lead to interesting examples and insights.

Gil, I have posted a collection of

four “concrete examples and insights” (from the existing literature) on Scott Aaronson’s weblog.Perhaps main insight is that the four (individually outstanding) quantum-physics articles are very far from agreeing with one another … here is an opportunity for symplectic clarification, eh? 🙂

LOL … it turns out that

Heinz Hopf(mathematically) andFelix Bloch(physically) anticipated this idea … by eighty-one years!The above observation is given a more nearly concrete form, as Point #46 in

Gil Kalai’s compendium of QC issues. Thank you, Gil, for your and Aram’s sustained, thoughtful, mutually respectful, and much-appreciated QC dialogue!Update: here is a video of a closely related lecture by Leonid from QStart.

Our planned 2014 Kazhdan seminar on quantum information, computation, quantization and symplectic geometry is planned now to fall 2019.

Pingback: Two Important Quantum Announcements! | Combinatorics and more