A workshop I very much regret missing because I was in Italy, “IBM Workshop on Fault-Tolerant Quantum Computation” now has all of their presentations online.
physics.QP
The arxiv has announced a restructuring of its categories. Quant-ph will be known as physics.QP and its moderators are Daniel Gottesman and Lev Vaidman:
physics.QP Quantum Physics (Daniel Gottesman, Lev Vaidman)
quantum information and associated physical effects, quantum computation, experimental quantum devices, non-determinism experiments and interpretations
I have no idea what “non-determinism experiments” refers to. Apparently there are some really good experimentalists out there who run experiments with no noise.
Quantum Letterman
According to the ISI Web of Science, here are the top cited papers under a “subject” search of “quantum computation”:
1. Loss D, DiVincenzo DP
Quantum computation with quantum dots
PHYSICAL REVIEW A 57 (1): 120-126 JAN 1998
Times Cited: 1003
2. Bouwmeester D, Pan JW, Mattle K, et al.
Experimental quantum teleportation
NATURE 390 (6660): 575-579 DEC 11 1997
Times Cited: 837
3. Ohno Y, Young DK, Beschoten B, et al.
Electrical spin injection in a ferromagnetic semiconductor heterostructure
NATURE 402 (6763): 790-792 DEC 16 1999
Times Cited: 758
4. Gershenfeld NA, Chuang IL
Bulk spin-resonance quantum computation
SCIENCE 275 (5298): 350-356 JAN 17 1997
Times Cited: 617
5. MONROE C, MEEKHOF DM, KING BE, et al.
DEMONSTRATION OF A FUNDAMENTAL QUANTUM LOGIC GATE
PHYSICAL REVIEW LETTERS 75 (25): 4714-4717 DEC 18 1995
Times Cited: 595
6. DIVINCENZO DP
QUANTUM COMPUTATION
SCIENCE 270 (5234): 255-261 OCT 13 1995
Times Cited: 594
7. SHOR PW
SCHEME FOR REDUCING DECOHERENCE IN QUANTUM COMPUTER MEMORY
PHYSICAL REVIEW A 52 (4): R2493-R2496 OCT 1995
Times Cited: 565
8. BARENCO A, BENNETT CH, CLEVE R, et al.
ELEMENTARY GATES FOR QUANTUM COMPUTATION
PHYSICAL REVIEW A 52 (5): 3457-3467 NOV 1995
Times Cited: 557
9. Ekert A, Jozsa R
Quantum computation and Shor’s factoring algorithm
REVIEWS OF MODERN PHYSICS 68 (3): 733-753 JUL 1996
Times Cited: 525
10. Knill E, Laflamme R, Milburn GJ
A scheme for efficient quantum computation with linear optics
NATURE 409 (6816): 46-52 JAN 4 2001
Times Cited: 435
What this means is beyond me, but what the heck, who said I was going to provide useful information on this blog!
Who Will Program the Quantum Computers?
Quantum computers can break many of today’s modern public key cryptosystems. Hence there are lots of three and four letter agencies in governments around the world who are very interested in getting a quantum computer built. (If we put our paranoid hats on, we can ask: are there any countries that are pursuing a secret project for quantum computing? Is it beyond possibility that China, for example, has a secret quantum computing project, and that they will beat the rest of the world to building a quantum computer? Could this be the next Sputnik? OK, enough paranoid mode!) What will the sensitive nature of quantum computers current killer application, breaking public key cryptosystems, mean for researchers in quantum computation? Will it mean that the first large scale quantum computers, when they are built, will have restricted access? Will all hell break loose once quantum computers which can break today’s public key cryptosystems? I’m not just thinking about spy versus spy schemes, but instead, I’m thinking about financial transactions, online use of credit cards, and the whole of the electronic economy. Sometimes it feels like it is a shame that the main attention grabbing algorithm for quantum computers is factoring. Other times, I think about the above line of reasoning, as it scares the bejesus out of me.
How will we make the transition from a world where public key cryptosystems are no longer secure? Will we use the unbroken cryptosystems (lattice based, and linear decoding based?) which have drawbacks which are fairly severe? Will we install quantum key distribution into our networks? And will this transition be gradual, or will it hit like a shockwave, as serious size quantum computers get built over a short span of time?
Interestingly, I don’t think the quantum computing community has had a serious dialogue about these issues. At least not that I know of. Sure we talk about these things over lunches in quantum groups around the world, but is there any consensus over how the public quantum computing community should deal with these issues?
Bohring Fault-Tolerance
(Update: Sean Barret points out that his comment when I first posted this was exactly the point I talk about in this post. Somehow my brain didn’t register this when I read his comment. Doh.)
Back from a workshop in Arlington, VA.
One of the most interesting events in this workshop was that Daniel Lidar talked (all to briefly) about his (along with Alicki and Zanardi’s) objections to the theory of fault-tolerant quantum computation. I’ve talked about this before here, where the resulting discussion in the comments was very interesting. At the workshop, Hideo Mabuchi brought up something about the paper which I had totally missed. In particular, the paper says that (almost all) constructions of fault-tolerant quantum computation are based upon three assumptions. The first of these is that the time to execute a gate times the Bohr frequency of the system should be on the order of unity. The second assumption is a constant supply of fresh ancillas. The third is that the error correlations decay exponentially in time and in space.
What Hideo pointed out was that this first assumption is actually too strong and is not assumed in the demonstrations/proofs of the theory of fault-tolerant quantum computation. The Bohr frequency of a system is the frequency which comes from the energy spacings of the system doing the quantum computing. The Bohr frequency is (usually) related to the upper limit on the speed of computation (see my post here), but is not the speed which is relevant for the theory of fault-tolerance. In fault-tolerance, one needs gates which are fast in comparison to the decoherence/error rate of your quantum system. Typically one works with gate speeds in implementations of quantum computers which are much slower than the Bohr frequency. For example, in the this implementation of a controlled-NOT gate in ion traps at NIST, the relevant Bohr frequency is in the gigahertz range, while the gate speeds are in the hundreds of kilohertz range. What is important for fault-tolerance is not that this first number, the Bohr frequency, is faster than your decoherence rates/error rates (which it is), but instead that the gate speed (roughly the Rabi frequency) is faster than your decoherence rates/error rates (which is also true.) In short, the first assumption used to question the theory of fault-tolerance doesn’t appear to me to be the right assumption.
So does this mean that we don’t need to worry about non-Markovian noise? I don’t think so. I think in many solid state implementations of quantum computers, there is a strong possibility of non-Markovian noise. But I don’t now see how the objection raised by Alicki, Lidar, and Zanardi applies to many of the quantum computing proposed systems. Quantifying the non-Markovian noise, if it exists, in different physical implementations is certainly an interesting problem, and an important task for the experimentalists (and something they are making great progess on, I might add.) Along these lines it is also important to note that there are now fault-tolerant constructions for non-Markovain noise models (Terhal and Burkard, quant-ph/0402104 and Aliferis, Gottesman, and Preskill, quant-ph/0504218.) Interestingly, these models postulate non-Markovian models which are extremely strong in the sense that the memory correlations are possibly infinitely long. However, it is likely that any non-Markovian noise in solid state systems isn’t of this severly adversarial form. So understanding how the “amount” of non-Markovian dynamics effects the threshold for fault-tolerance is an interesting question.
Quantum Problem
Richard Feynman:
We always have had a great deal of difficulty in understanding the world view that quantum mechanics represents. At least I do, because I’m an old enough man that I haven’t got to the point that this stuff is obvious to me. Okay, I still get nervous with it … you know how it always is, every new idea, it takes a generation or two until it becomes obvious that there’s no real problem. It has not yet become obvious to me that there’s no real problem. I cannot define the real problem, therefore I suspect there’s no real problem, but I’m not sure there’s no real problem.
Whenever I read this, I think, “poor quantum theory.” It seems that many of us have a problem with quantum theory, but quantum theory, it has no problem with us!
A Serious Version
A resubmission, quant-ph/0507189. Much, much, more serious:
Title: |0>|1>+|1>|0>
Authors: S.J. van Enk
Comments: A more serious version, almost 2.36 pages, but still an unnormalized title
Note: replaced with revised version Thu, 11 Aug 2005 17:17:52 GMT (6kb)
Quantum Algorithms People
I’m putting together a talk right now and I was trying to make a list of people who have worked in the past or are now working in the field of quantum algorithms. Below the fold is the list I have right now. If anyone in the know spots someone I miss please let me know (and apologies in advance for those who I’ve left out!) This list is a modified verision of a list of people stolen from Wim van Dam’s home of the homepages. (Thanks for doing the hard work Wim!)
Continue reading “Quantum Algorithms People”
Warning: Negative Information Ahead
The paper quant-ph/050562 has been out for a while now, and I kept meaning to comment on it, but somehow never got around to it. Now it’s hit big time. This month in Nature has the article article, “Partial Quantum Information” by Michal Horodecki, Jonathan Oppenheim and Andreas Winter, along with the a nice intro written by Patrick Hayden. Johnathan Oppenheim also has a really really good popular explanation here . Normally I would write a little explaining this result, but Patrick’s intro and Johnathan Oppenheim’s web page are so good that, well, you should just get your info from the horse’s mouth (so to speak.) But I will tell a story related to this work.
When I was an undergraduate I spent the summer between my junior and senior years working for Nicholas Cerf and Chris Adami. Specifically I was working on trying to find quantum algorithms to efficiently solve NP-complete problems. I call this my summer spent banging my head against the wall. Not a very effective summer, research wise, but I learned a lot about quantum computing over that summer. Anyways, Cerf and Adami worked for Professor Steve Koonin (I think they were both postdocs, but I’m not sure if I remember this correctly.) When I was a freshman at Caltech, I was wandering around campus a few weeks after I showed up on campus, and I saw these two guys having a really animated conversation outside on a bench. One of the guys was really really tall, and the other guy was fairly short and looked EXACTLY like Steve Rick Moranis. I mean exactly. This being Los Angeles, and me being a hick from the sticks, I was only a few feet away from asking the shorter guy for an autograph, when I chickened out. Which is a good thing, because it turns out that this guy was none other than Steve Koonin! (Koonin, by the way, was an undergrad at Caltech. He went to MIT and got his Ph.D. in three years. Three years! Now that’s the power of a Caltech education 😉 ) Some of you will find it funny that the second guy on that bench, I later learned, was Jeff Kimble. Many of you will know Professor Kimble from his demonstration of a quantum logic gate in a cavity QED system in 1995 (as well as a plethora of other cool cavity QED results.)
Back to the story at hand! So I worked for Cerf and Adami. At the time, they had this really strange paper (see here and here) where they talked about negative quantum information. In particular they noticed that if you took the conditional Shannon entropy and converted it over to the quantum mechanical conditional von Neumann entropy, then while the classical conditional entropy was always positive, the quantum mechanical conditional entropy could be negative. For example, a Bell pair had a conditional von Neumann entropy of negative one (bit). This was strange, and one question that their work raised is what exactly this negative number might mean. Another question along these lines arose a little later when the conditional entropy showed up in the quantum channel capacity. Here, however, when the conditional entropy showed up as negative, the capacity was set to zero (creating the so-called mutual information.) Having a negative capacity for a noisy quantum channel didn’t seem like a reasonable thing! What the current work describe above does is to actually given an operational meaning to this mysterious quantity the conditional quantum entropy. By operational, this means that those negative numbers now have an intpretation in terms of a protocl which operates at a rate related to those negative numbers. Read the article to see how this all works out. It is very nice. The author promise a more detail paper (with a date stamp of 2005, so soon) which I’m looking forward to.
(Thanks to Saheli and Grant for pointing me to Johnathan’s web page. Grant, who is a student in the class I am teaching, emailed the class mailing list with links to the negative quantum information web pages, and the comment “It’s possible we may leave this class knowing less than when we started!!!” Hopefully, the same effect hasn’t happened to you after reading this post 😉 )
Foundations of Quantum Theory, Quantum Gravity, and Quantum Computing
On a couple of blogs (Not Even Wrong and LuboÅ¡ Motl’s reference frame) a question has creeped up which is what role studies of the foundations of quantum theory have in a future theory of quantum gravity. At the Strings2005 conference in Toronto recently, this question was raised during a panel discussion. When someone claimed that foundations hasn’t contributed anything to physics, Lee Smolin apparently said something to the effect that study of foundations of quantum theory has given us quantum computing.
It is true that the original thinkers about quantum computers, and in particular I’m thinking about David Deutsch, where inspired by interpretation issues in quantum theory. But I think the relationship between foundational studies of quantum theory and what is now quantum information science is a bit different. I think that foundational studies have played the role of a “clarifier” in quantum information science. Instead of many results being motivated by foundational issues directly, studies in foundations have lead those in quantum computing to a better understanding of what quantum theory is and what it is not. I certainly think that banging my head up against the different interpretations of quantum theory has given me a very good grasp of the limits of what quantum theory can say and what it cannot say. Thus I think that quantum information science has benefited immensely by listening to the foundation crowd and learning just exactly what is so different about quantum theory. So, while the interpretations themselves don’t have any gigantic successes (one could argue for smaller ones!), I think they are an essential base which betters the field of quantum computing.
Now back to quantum gravity. Whether or not the foundations of quantum theory has anything to say about quantum gravity, I think, is a question we can debate until the cows come in. There are certainly very good philosophical points of view that the strain between gravity and quantum theory must be broken in some nontrivial manner, and whether we break quantum theory or gravity is, I think, an intriguing question. But if we take quantum computing as an example, the lesson that may be learned is that by careful study of quantum theory you can gain an appreciation for it which might allow you to make progress in forming a quantum theory of gravity. I must say that I am often shocked by the lack of understanding of the details of quantum theory among high energy physicists. Sure they use it every day. But do they really deeply get the theory and what it can and can not do? Of course this is a very prejudiced statement coming from a very prejudiced quantum computing dude. We hold quantum theory fairly sacred and hate to see it abused. I’m also sure that high energy physicists are greatly pained by quantum information scientists lack of understanding of “real” physics!
My person views on the relationship between foundations and quantum gravity are about as close as I get to pseudoscientific gobldy-gook. I gave a talk on those views once. It was supposed to be one hour and it ran to two. Sometimes I contemplate writing a book about these views… Penrose did it, so why can’t I? 😉