Quantum Bayesian Networks

May 31, 2012

Jim Simons Builds 3000 Mile Long Bridge

Filed under: Uncategorized — rrtucci @ 8:17 pm

Check out this great blog post in Richard Lipton’s and Ken Reagan’s wonderful blog (much better than this one). The post is about Jim Simons, an accomplished mathematician turned hedge fund manager and philanthropist. Simons had already endowed a math (and string theory) institute in Stony Brook. Now he is endowing a new institute at U.C Berkeley, one dedicated to computer science.

This is important for quantum computing because computer scientists cannot escape the lure of quantum mechanics. Can a moth resist flying towards the flame of a candle? Can a comet escape the gravitational pull of the Sun? Can flabby humans fend off the Borg?

For me, quantum computing is the byproduct that arises from the collision of two gigantic fields, computer science and quantum physics.

According to the Wikipedia article on him, Jim Simons has done a lot of good deeds with his money, including making donations to organizations concerned with health care and elementary education. It’s interesting that his string theory institute is on the east coast and his new computer science institute will be on the west coast. If he is planning a third science institute, I hope he goes for the geographical center: a quantum computing institute in Texas? (Contrary to what many people believe, not all the inhabitants of Texas are football addled, barbecue sauce smeared, gun-toting, bible thumping, mutant apes. I have a good friend in Austin that has never played American football in his life, although he does show a disturbing affinity for the barbie).

May 30, 2012

There is Gold in Them Science Hills. Elon Musk is Finding Lots of it.

Filed under: Uncategorized — rrtucci @ 5:05 pm

Sure, you can become a billionaire by dedicating your life to doing investment banking or advertisement in social networks, but will that lead to a very fulfilling life, and will it earn you the respect of your peers and loved ones? As Steve Jobs once said to Coke executive John Sculley: “Do you want to spend the rest of your life selling sugared water?” (or smelly water, one might say, in the case of investment banking.)

Suppose you want to advance science, because you appreciate its incredible beauty and extreme importance to the progress of mankind. Can you start a business, or work for one that does nice science? But a business must make a profit in order to survive. Are the two goals, making a profit and doing nice science, contradictory? No they’re not, the SpaceX news seemed to be telling us this week. 

This week, SpaceX, a private company, used its Falcon 9 rocket to put its unmanned, reusable Dragon capsule into low earth orbit. On May 25, 2012, the Dragon successfully docked with the International Space Station, delivering to it a 1/2 ton payload. An historic event in space exploration. To go where no man has gone before. The dawn of commercial space flight. A fascinating sci-tech business that promises to be very profitable too. Reminds me of quantum computing.

Elon Musk, a billionaire entrepreneur, an émigré from South Africa now living in California, is one of the founders of SpaceX. He also co-founded Tesla Motors and X.com, which later became Paypal. He is also a chairman of SolarCity. This is a person with a unique talent for founding and nurturing prosperous businesses that succeed in solving timely, pressing sci-tech problems. A guy that has a good nose for what is important in Sci-Tech and one who gets things done. I’m sure I speak for most science nerds when I say: Elon Musk, what you are doing is so cool! If his plate isn’t too full :) , I hope he considers starting a quantum computer company too! Or maybe he can guide or inspire others to start a Quantum SpaceX company. Quantum Space, an untapped, wild frontier.

Check out this article:

Elon Musk: Is he the real-life Tony Stark?
(By Tiffany Hsu, Columbus Dispatch – ‎May 29, 2012‎)

How about you? Will you become Quantum Computing Man or Woman? What are you doing to achieve that goal?

April 23, 2012

2001 A Space Odyssey – The QC Dawn of Man

Filed under: Uncategorized — rrtucci @ 7:28 pm

A tribe of String Theorists is shown in the primeval African desert picking fleas off each other and scavenging for food, competing with pigs for wild seeds and roots. A leopard kills one member of the tribe, and later that day they are driven away from their watering hole by an enemy tribe of apes. The future looks very grim for this tribe of String Theorists. The LHC is very unlikely to shed much light on their theories, and it’s also very unlikely that a successor to the LHC, one capable of probing substantially higher energies, will be built by the world community in the next few decades.

Disgruntled and defeated, they sleep overnight in some crags surrounding a rocky crater. Upon awakening, they find that a black monolith, a Quantum Fog 9000 Quantum Computer, has appeared in the crater. They approach it shrieking and jumping, and eventually touch it cautiously.

Soon after encountering the Quantum Fog 9000 QC, one of the String Theorists sees QC simulations in a new light. He uses one to pound on a pile of bones, the skeletal remains of earlier theories. Shortly thereafter, the previously herbivorous tribe of String Theorists is shown eating meat. Presumably they’ve used their QC simulation to kill a pig.

Armed with QC simulations, the tribe of String Theorists attacks the enemy tribe at the watering hole and they kill its leader. As they beat him to death with their QC simulations, the other members of the enemy tribe are shown cowering back in fear.

Flush with victory, the leader of the tribe of String Theorists flings his QC simulation high up into the sky. In mid-flight, the QC simulation transmutes into a cylindrical spacecraft floating in space, orbiting a planet. It’s now millions of years after the dawn of Man, when String Theorists invented the first, primitive QC String Theory simulation tools. Now those tools have evolved into much more advanced QC simulations of quantum-gravity that are routinely used by advanced spacetime travelers.

More posts about String Theory in this blog:

References: (I may have borrowed some phrases from some of them)

April 17, 2012

Mirror, Mirror, on the Wall, What is the Most Symmetric State of Them All in Quantum SIT?

Filed under: Uncategorized — rrtucci @ 3:50 pm

SIT =Shannon Information Theory

Let H({\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N}) denote the classical entropy of a probability distribution of the random variables {\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N}.

Consider a Hilbert space {\cal H}_{\underline{a}_1}\otimes{\cal H}_{\underline{a}_2}\otimes\ldots\otimes{\cal H}_{\underline{a}_N} = {\cal H}_{\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N}. For any density matrix \rho_{\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N} that acts on {\cal H}_{\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N}, let S({\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N}) be its von Neumann entropy.

Suppose |\psi\rangle_{\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N}\in {\cal H}_{\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N} is a ket (pure quantum state) with density matrix given by \rho_{\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N} = [|\psi \rangle_{\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N}][h.c.]. Then it is well known (a consequence of the Schmidt decomposition or of the Araki-Lieb Inequality) that for this pure state

S({\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N})=0

S(\underline{a}_J) = S(\underline{a}_{J^c})

where J and J^c are disjoint sets whose union equals \{1, 2, \ldots, N\}, and where \underline{a}_J = (\underline{a}_j)_{j\in J} and \underline{a}_{J^c} = (\underline{a}_j)_{j\in J^c}. For example, if N=4, then we have

S(\underline{a}_1, \underline{a}_2, \underline{a}_3, \underline{a}_4)=0
S(\underline{a}_1) = S(\underline{a}_2, \underline{a}_3, \underline{a}_4) and permutations
S(\underline{a}_1, \underline{a}_2) = S(\underline{a}_3, \underline{a}_4) and permutations

Pure quantum states thus have a very high degree of symmetry. So much so that we can make a model of their entropy as follows. I’ll call it the RUM (Roots of Unity Model) of pure states.

Define

S(\underline{a}_J) = \left|\sum_{j\in J}  \underline{a}_j \right|

(note that the entropy contributions are summed coherently rather than incoherently. The latter is common for macroscopic classical systems)

where we now interpret {\underline{a}_1,\underline{a}_2, \ldots, \underline{a}_N} as the Nth roots of unity. In other words, we are now setting

\underline{a}_j = {\rm exp}(i\frac{2\pi (j-1)}{N}) for j=1, 2, \ldots, N.

The model works because

\sum_{j=1}^N \underline{a}_j = 0

so

\sum_{j\in J} \underline{a}_j = - \sum_{j\in J^c} \underline{a}_j

S(\underline{a}_J) =|\sum_{j\in J} \underline{a}_j| = |\sum_{j\in J^c} \underline{a}_j| = S(\underline{a}_{J^c}).

Henceforth we will abbreviate \sum_{j\in J}  \underline{a}_j = \sum \underline{a}_J

I bet a lot of people have discovered RUM before, but I myself discovered it on my own yesterday. I find RUM very helpful because (besides being good for numbing pain and inducing forgetfulness :) ) it helps me visualize better the entropy of a pure quantum state. For example, it “explains” to me why quantum conditional entropies can be negative. Indeed, suppose J and K are two disjoint subsets of \{1,2,\ldots,N\}. Then

S(\underline{a}_J|\underline{a}_K) = S(\underline{a}_{J\cup K} ) - S(\underline{a}_K) =|\sum \underline{a}_{J \cup K}| - |\sum \underline{a}_K|

Also, the Araki-Lieb and sub additivity inequalities

|S(\underline{a}_J) - S(\underline{a}_K)| \leq S(\underline{a}_J ,\underline{a}_K)\leq S(\underline{a}_J) + S(\underline{a}_K)

become the well known triangle inequalities

\left|\;\;|\sum\underline{a}_J| - |\sum\underline{a}_K|\;\;\right| \leq |\sum\underline{a}_{J \cup K}|\leq |\sum \underline{a}_J| + |\sum \underline{a}_K|

April 9, 2012

Quantum Bayesian Networks, The Ultimate Mixology Guide

Filed under: Uncategorized — rrtucci @ 7:30 pm

Check out my new paper

An Introduction to Quantum Bayesian Networks for Mixed States
by Robert R. Tucci (arxiv abstract)

The paper is a fairly elementary pedagogical introduction. It’s sort of a prelude to a more researchy paper that I am trying to write next.

I’m very pleased that I was able to draw all the pictures of the paper in LaTex “native” fashion, using only LaTex macros (xypic and cancel). The LaTex Gods have been generous to me once again.

This was the original cover of the paper, but my editor nixed it:


Picture Credits:

The drawing of a man making snow angels on the sand of a sandbox is of course The Vitruvian Man by Leonardo da Vinci. So why did Leonardo write backwards? Historians don’t know for certain but many believe it was because Leonardo was left-handed and he wanted to write quickly with a quill pen without smudging the ink with his hand.

The drawing of a letter U with an eyeball resting on the fat (classical) leg of the U could have been a sketch done by an abstract modernist painter like Dali or Picasso, or it could have been a depiction of a creature from another planet, the u-tube cyclops?, but it’s really a drawing made by John Archibald Wheeler (professor at Princeton Univ. for almost 40 years, PhD advisor to Richard Feynman, Hugh Everett and many, many others). The drawing symbolizes the feedback between the observer and the observed in quantum mechanics.

April 1, 2012

China’s Muppet Communiqué

Filed under: Uncategorized — rrtucci @ 12:01 am

It seems to me that cyberspying between the US and China is at an all time high right now, and destined to keep growing. As evidence of this, consider the following news articles. Note also the huge number of responses that these articles have elicited throughout the web.

In light of all this spying activity, it didn’t surprise me one bit when I read the following news item today.

WASHINGTON DC — April 1, 2012 — This secret communique, emanating from the highest ranks of the Chinese Communist Party, was recently intercepted by Julian Assange’s WikiLeaks organization:

To all venerable members of Chinese Communist Party:

Dear comrades, disturbing news is:

(1) Quantum Computer (量子计算机) has been called “Hydrogen Bomb of Cyberspace” and “Doomsday Machine” by American Imperialists puppet masters (these quotes obtained by venerable cyberspy number 1337).

(2) IBM already has blueprint for QC and thinks can build QC in the next 5-10 years. (this data obtained by venerable cyberspy number 1709)

(3) NSA is building top-secret cyberspying facility in Utah(cost of 2 billion USD = 12 billion yuan = 4 billion bowls of rice). Completion date: 2013, year of the SNAKE- not good. (this data obtained by venerable cyberspy number 3059)

Said General Secretary of the Communist party Xiao Xiao Shūjì:

USA is weak, heavily indebted country ruled by rich, 1% of people. China will counter American QC imperialist threat with 5 year and 12 year plans to build DRAGON QC. Cost of 200 billion USD = 1200 billion yuan = 400 billion bowls of rice (each bowl ALSO INCLUDES an egg roll on the side). Completion date: 2014, year of the HORSE- good luck year. Our selling bullet points: (for PowerPoint presentation to members of Chinese Communist Party)

  • Will build DRAGON QC in top-secret Foxconn-Lenovo facility, using smart, productive child labor, and world-class Taiwanese technology. Top Secret Facility will be called Lucky Golden QC Facility Number 1.
  • Will hire, at twice their current salary,
    • most diabolical executives from Goldmann Sachs to do business planning
    • best scientists from American and European universities to do scientific planning
    • phone hacking human hyenas from News Corps to demoralize competition
  • Will use DRAGON QC for codebreaking, development of biological weapons, monitoring of our citizens, and spying on other countries.
  • Will share QC technology with Iran, North Korea, Syria and Nigeria.
  • Will deploy DRAGON QC near US mainland, at our new Bejucal Base in Cuba.

Venerable Chinese super spy number 007 has been sleeper mole in USA since 1997. He or she graduated from Harvard. He or she worked at Goldmann Sachs under tutelage of Darth Vader (Lawrence Summers), but left Goldmann Sachs in 2012 because too toxic. Now he or she is highly paid lobbyist like Newt Gingrich. Venerable secret agent 007 advises: “America is China’s muppet. Let’s rip out their eyeballs”.

America is slow turtle. China poised to win QC race and dominate cyberspace.

“We’ve caught them napping.” (Custer’s last words).
(Hee, hee, this is old American joke, according to venerable cyberspy number 1200. Americans pretty funny)

Xinhua News Agency, official press agency of the government of the People’s Republic of China, has come up with the following inspirational posters to inform our citizenry of the true news:

Five minutes to midnight (Doomsday is when America builds QC)


Inside View of American Spy Agency NSA

The Heart of Darkness (in America)

March 31, 2012

Dogs is people too, and bluffing a pride of lions

Filed under: Uncategorized — rrtucci @ 11:57 am

This is very technical and nerdy, but I find it really cool.

Recently, Carlen and Lieb proved a very nice inequality for entanglement. Check out

Bounds for Entanglement via an Extension of Strong Subadditivity of Entropy

by Eric A. Carlen, Elliott H. Lieb

Let me try to summarize their main result.

Consider a bipartite density matrix \rho_{12}, and define \rho_1 = {\rm tr_2}\rho_{12} and the same with 1 and 2 swapped. Suppose S_{12} is the von Neumann entropy of 12, S_{1} is that of 1 and S_{2} is that of 2. Call the classical counterparts of these entropies H_{12}, H_{1} and H_{2}. Call S_{2|1} = S_{12} - S_1 (respectively, H_{2|1} = H_{12} - H_1) the quantum (resp., classical) conditional spread (or conditional variance) of 2 given 1.

One can show that

H_{2|1}\geq 0,
H_{1|2}\geq 0

so classically, conditional spreads must be positive (or zero). However, in quantum mechanics such spreads can be negative. The Araki-Lieb inequality S_{12}\geq |S_1-S_2| says that

S_{2|1}\geq -S_2,
S_{1|2}\geq -S_1.

Now, having a negative conditional spread is a bit of a dog, because spreads are not supposed to be negative.

The new Carlen/Lieb inequality teaches us that dogs can count too. If E is entanglement (either entanglement of formation or squashed entanglement), then, according to Carlen/Lieb,

E\geq max(-S_{1|2}, -S_{2|1}, 0)

So a dog (i.e, a negative conditional spread S_{1|2}<0) forces the entanglement to be greater than zero by -S_{1|2}. An example of a highly influential dog.

P.S. I recently wrote some email to Profs. Lieb and Carlen asking them something about their paper. I felt infinitely dumb in their email presence, like a mouse in the presence of lions (As you probably know, The Lion and the Mouse is a beautiful fable by Aesop.) But I believe I successfully muddled and bluffed my way through the conversation. Amazing but true, it is possible to bluff a pride of lions. If you don’t believe me, watch this amazing YouTube video, entitled “BBC – Men stealing meat from lions”. In the video, 3 extremely courageous and also extremely foolish African guys, with scant weapons other than their daunting audacity, intentionally walk right into the middle of a pride of lions that is having dinner.

March 15, 2012

Judea Pearl Wins Turing Award For Bayesian Networks

Filed under: Uncategorized — rrtucci @ 6:46 pm

Check out

A Turing Award for Helping Make Computers Smarter
By Steve Lohr (New York Times, March 15, 2012)

Excerpts:

Google search, I.B.M.’s Watson Jeopardy-winning computer, credit-card fraud detection and automated speech recognition.

There seems not much in common on that list. But it is a representative sampling of the kinds of modern computing chores that use the ideas and technology developed by Judea Pearl, the winner of this year’s Turing Award.

Dr. Pearl, 75, a professor at the University of California, Los Angeles, is being honored for his contributions to the development of artificial intelligence.

In the 1970s and 1980s, the dominant approach to artificial intelligence was to try to capture the process of human judgment in rules a computer could use. They were called rules-based expert systems.

Dr. Pearl championed a different approach of letting computers calculate probable outcomes and answers. It helped shift the pursuit of artificial intelligence onto more favorable terrain for computing.

Dr. Pearl’s work on Bayesian networks — named for the 18th-century English mathematician Thomas Bayes — provided “a basic calculus for reasoning with uncertain information, which is everywhere in the real world,” said Stuart Russell, a professor of computer science at the University of California, Berkeley. “That was a very big step for artificial intelligence.”

Of course, I believe Bayesian networks are highly relevant to quantum computing and quantum Shannon Information theory. Quantum Mechanics is, after all, just another probability theory.

I first heard of Bayesian Networks from Bill Gates, founder of Microsoft.

Okay, Okay, I don’t really know the guy. I don’t even know his chauffeur. Nevertheless, there is some kernel of truth, this time at least, to my statements.

Since that day, forever etched in my memory, when I overheard Bill Gates’s boffo remarks about Bayesian Networks, I have been a devoted fan of them, especially of their quantum version. My very first paper in ArXix is entitled, appropriately enough, “Quantum Bayesian Nets”. My understanding of q-b-nets has increased quite a lot since that paper. Many of my subsequent papers have dealt with q-b-nets (better than cabinets). Sometime ago, I wrote a Mac application called “Quantum Fog” that does quantum Bayesian networks. (It uses algorithms of exponential complexity so it is only intended for pedagogical purposes. ) And of course, this blog is named after qbnets, and many of its post are about the very subject.

Addendum: Above, I only mentioned Judea Pearl’s work on Bayesian networks. More recently, Pearl has also written some papers and a book on his own theory of causality (which is an extra structure built on top of the foundation of Bayesian networks). However, to date, his theory of causality (“causality calculus”) has been used by others MUCH less frequently than his previous work on Bayesian networks, especially in industrial computer applications.

March 9, 2012

CMI, A Universal Translator Built by the SIT-ian Race

Filed under: Uncategorized — rrtucci @ 6:13 am

I am currently trying very hard to write a long, crazy paper on quantum SIT (Shannon Information Theory). So I’m thinking a lot about SIT these days. Here is a short “song” about the subject.

Sometimes two parties cannot understand each other without the help of an intermediary.

When the two parties involved are made of people, we human beings have invented clever devices and human professions whose goal is to intervene, and mediate a transaction between the two parties. For example,

  • devices – Rosetta stone, translation dictionaries, Google’s Translate, DARPA’s TRANSTAC, Universal Translator in “Star Trek” (and many other sci-fi stories), C3PO in “Star Wars”, dog2human translation devices in “Up”…
  • people – nearly simultaneous, human translators and interpreters of languages, sign language interpreters, marriage brokers and matchmakers, conflict mediators, divorce lawyers, judges…

When the two parties involved are objects instead of people, we often come up with devices to mediate transactions (e.g, electronic transistors, fluid valves, bridges,…)

Star Trek's Universal Translator (looks like a cordless microphone)

Since SIT (Shannon Information Theory) is an attempt to model in a very general way the communication of information between several parties, it’s not surprising that SIT has its own universal translator. Indeed, in SIT one defines a “universal translator function” called the CMI (Conditional Mutual Information), pronounced by me as “see-me”. CMI, denoted here by H(\underline{a}:\underline{b}|\underline{c}), is a real valued function with 3 slots filled by the random variables \underline{a}, \underline{b}, \underline{c}. (In what follows, we will indicate random variables by underlining.) In H(\underline{a}:\underline{b}|\underline{c}), \underline{a}, \underline{b} are the two parties that are having trouble understanding each other and \underline{c} is the mediator.

In classical SIT, one defines

  • the entropy (i.e., the variance or spread) of \underline{a} by
    H(\underline{a}) = \sum_a P(a) \log \frac{1}{P(a)},

  • the conditional spread (of \underline{a} given \underline{b}) by
    H(\underline{a} |\underline{b}) = \sum_{a,b} P(a,b) \log \frac{1}{P(a|b)},

  • the mutual information (MI) (i.e., the correlation) between \underline{a} and \underline{b} by
    H(\underline{a}:\underline{b}) = \sum_{a,b} P(a,b) \log \frac{P(a,b)}{P(a)P(b)},

  • the CMI by
    H(\underline{a}:\underline{b}|\underline{c}) = \sum_{a,b,c} P(a,b,c) \log \frac{P(a,b|c)}{P(a|c)P(b|c)}.

But note that H(\underline{a}), H(\underline{a}|\underline{b}) and H(\underline{a}:\underline{b}) can all be expressed in terms of the CMI. Indeed,

H(\underline{a}) = H(\underline{a}:\underline{a}|empty)

H(\underline{a}|\underline{b}) = H(\underline{a}:\underline{a}|\underline{b})

H(\underline{a}:\underline{b}) = H(\underline{a}:\underline{b}|empty)

So the spread, conditional spread and MI are all just special cases of CMI.

CMI has many nice properties, by which I mean that it satisfies some cool equalities (a.k.a. identities) and inequalities.

One identity that I find really neat is

H(\underline{a}|\underline{c}) = H(\underline{a}:\underline{x}|\underline{c}) + H(\underline{a}|\underline{x},\underline{c}).

I usually remember this one by the mnemonic :\underline{x} + |\underline{x} = 1. Basically, this identity is saying to me that the spread of \underline{a} can be decomposed into a correlation (of \underline{a} and \underline{x}) plus a conditional spread (of \underline{a} given \underline{x}).

Another cool identity satisfied by CMI is the chain rule, which says basically that the “:” operator behaves sort of like a differential operator.

CMI also satisfies a slew of cool inequalities; for instance, CMI >= 0, the data processing inequalities, Fano’s inequality, and subadditivity (a.k.a. the independence bound).

This blog post is just a quick introduction to CMI. For a more complete discussion of CMI, you might consult the SIT textbooks mentioned below.

Almost every statement in both Cover&Thomas’ book and Papa the Camel’s book, two great books on classical SIT, involves CMI (or one of the aforementioned special cases of CMI). Thus, CMI is pretty universal!

So far we have discussed classical CMI. One can also define a quantum version of CMI. The quantum version of CMI again shows up almost everywhere in Mark Wilde’s very complete book on quantum SIT. (By the way, Mark’s book is excellent and free.)

Quantum CMI can even be used to define quantum entanglement.

There are, however, correlations between 4 or more random variables that cannot be expressed in terms of CMI. (or can they be?) So the fact that most of the classical and quantum SIT books talk almost exclusively about CMI does not mean that CMI is the most general SIT function possible, and that all others can be expressed in terms of CMI. It just means that most of our current SIT-ing knowledge involves correlations of <= 3 random variables, because that is the lowest fruit in the tree of SIT. So there are limits to the universality of CMI. Our universal translator is not perfect, but it’s the best one we have on board the starship Enterprise.

Are you a CMI user, a.k.a. a CMI-an? (pronounced the same way as the word “simian”)

March 1, 2012

Purveyors of Quantum Bustle Skirts

Filed under: Uncategorized — rrtucci @ 9:54 pm

Check out the following article

Secret codes ready to take quantum leap in space
(Mar 2012, MSNBC) By Jeremy Hsu

Excerpts,

“If we can build these quantum key distribution systems and make them global, we will be able to transfer information in such a way that if there’s a hacker who tries to find this information, we will know,” said Raymond LaFlamme, director of the Institute for Quantum Computing at the University of Waterloo in Ontario. “Then we will be able to find a better way to encrypt that bit of information.”

The European Space Agency has even pushed for a “QUEST” space experiment that would test quantum communication to and from the International Space Station. Researchers discussed such ideas during the annual meeting of the American Association for the Advancement of Science in Vancouver on Feb. 19.

The Canadian Space Agency is working on plans for its Quantum Encryption and Science Satellite, while the European Union has teamed up with China’s Academy of Sciences for an intercontinental quantum key distribution test. The European Union also continues to work on using the space station to transfer a quantum key between ground stations separated by 870 miles.

Meanwhile, Japan has been running its own Earth-based quantum key distribution network in Tokyo. The country could launch an experimental satellite in four or five years, said Masahide Sasaki, director of the National institute of Information and Communications Technology in Tokyo.

The U.S. has seemed strangely absent from the quantum communications discussion, researchers agreed.

He forgot to mention that the US already spent millions of dollars in a boondoggle quantum network. It was built by the defense contractor Raytheon-BNN in Boston. (Ref) Maybe the US realized after they had built it, that there was no use for it.

The most common use of the word “bustle” is to describe a situation full of activity, as in the sentence “the small harbor bustled with boats”. However, the word is also the name of a kind of frame worn under a skirt to make it puff out conspicuously in the derrière. Bustles were commonly used during the Victorian era (the period of Queen Victoria’s reign, 1837-1901). Victorians were big fans of good science and technology (Charles Darwin, Sherlock Holmes…). But they also patented the bustle. I find Victorian bustles decidedly ugly and unsexy. Especially so when compared with other historic female fashions, like, for instance, my favorite, flapper outfits from the roaring twenties (think naughty girls, jazz, swing dance, speakeasies, art deco, slang such as “bee’s knees”).

Quantum cryptography, a flourishing fashion in the quantum information field, reminds me of the Victorian bustle skirt. The public is clamoring for sexy quantum computers (the equivalent of flapper outfits), but instead, some governments are spending millions of dollars to subsidize research aimed at producing quantum crypto (the equivalent of bigger bustles).

The heads of 3 prestigious scientific institutes

  • Artur Ekert (director of Centre for Quantum Technologies in Singapore)

  • Raymond Laflamme (director of the Institute for Quantum Computing in Waterloo, Canada.)

  • Anton Zeilinger (head of his own team at University of Vienna in Austria)

(Each one has a personal Wikipedia page longer than the ones for Einstein and Feynman combined :) )

have been recently putting out press releases ardently proclaiming the wondrous, game changing research that their institutes are conducting into making bigger quantum bustle skirts.

Meanwhile, almost at the same time, IBM has been reporting on their truly exciting advances in the hot topic of building superconducting QCs. IBM is the bee’s knees right now. It makes the 3 institutes mentioned above look as glamorous as the bustled Victorian lady in the following photo.


IBM

Institutes headed by Ekert, Laflamme, Zeilinger

I’ve spoken about quantum cryptography in previous blog posts. See, for example:

Post Quantum Crypto

A must read is Bruce Schneier’s opinion about quantum cryto.

Next Page »

Theme: Rubric. Blog at WordPress.com.

Follow

Get every new post delivered to your Inbox.