Category: Quantum Computing

Posted on

DARPA's on a QuEST

It looks like DARPA is getting back into funding academic research in quantum computing. Here is a new BAA for a program called QuEST. And it looks like they want revolution, not evolution:

DARPA is soliciting innovative research proposals in the area of Quantum Entanglement Science and Technology (QuEST). Proposed research should investigate innovative approaches that enable revolutionary advances in the fundamental understanding of quantum information science related to “small” quantum systems. Specifically excluded is research which primarily results in incremental improvement to the existing state of practice or knowledge.

Since I strongly believe quantum computers will be built on a revolution, and not an evolution, this makes me happy. Now if I can just find an experimentalist crazy enough to try some of my wacky ideas 🙂

Posted on

Shor Calculations (Quantum Wonkish)

Over at Emergent Chaos I found an article which throws down the gauntlet over quantum computers. And there isn’t anything I cherish more than gauntlets thrown down!
Note: I should preface this by saying that I don’t consider myself a over the top hyper of quantum computers in the sense attacked by the author. I find quantum computers fascinating, would really like to see if one can be built, but find the hyperbole that accompanies any small advance in the field a bit over the top. However I also think the article misses a lot of important points (and insinuates that people haven’t actually thought about these points, something which I find as annoying as quantum computing hype.)
Update: Say it ain’t so Bruce. Say it ain’t so.
Continue reading “Shor Calculations (Quantum Wonkish)”

Posted on

ACM Transactions on Computation Theory

As noted by Lance, the new journal ACM Transactions on Computation Theory is now accepting papers. Note for quantum computing theorists:

ACM Transactions on Computation Theory will cover theoretical computer science complementing the scope of the ACM Transactions on Algorithms and the ACM Transactions on Computational Logic including, but not limited to, computational complexity, foundations of cryptography, randomness in computing, coding theory, models of computation including parallel, distributed and quantum and other emerging models, computational learning theory, theoretical computer science aspects of areas such as databases, information retrieval, economic models and networks.

So next time you write a paper which involves QMA, the Hidden Subgroup, etc. etc. make sure to give ToCT a look!

Posted on

In Conclusion…Can You Hold For a Second?

How cut-throat is arXiv:0803.0272? This cut-throat (taken from v2 of the paper):

X. CONCLUSION AND FURTHER READING
This section will be completed when our error correction simulations have generated more data.

Reminds me of my idea to write a paper and submit it to the arxiv entitled “An Efficient Quantum Algorithm for the Graph Isomorphism Problem.” Sure, version 1, won’t have the algorithm, but hey, why should I make you wait?

Posted on

Qubits, Qbits, qbits, qubits, q-bits, and light nanoseconds

Hurray! My letter to Physics Today along with a delightful response from N. David Mermin has been published. I particularly enjoyed Mermin’s closing line:

It may be quixotic (but certainly not Qxotic) to try to correct the spelling of an entire community, but I owe it my best shot. What else is retirement good for?

Sweet! Now I can check off from my list of things to do in life: “Get published in Physics Today over issues related to my literature degree.”

Posted on

Quantum Algorithms and the Strange Nature of Quantum Theory

Over at Information Processing, the InfoProcessor talks about teaching Bell’s theorem:

I find that the hardest thing about teaching this material in class is that, after half a year of training students’ brains to think quantum mechanically, it is extremely difficult to get them to feel the weirdness of Bell’s theorem and spooky action. It all seems quite normal to them in the context of the course — they know how to calculate, and that’s just how quantum mechanics works!

Continue reading “Quantum Algorithms and the Strange Nature of Quantum Theory”

Posted on

If Only the ACLU Were Alice and Bob

There are days when I wish quantum cryptography was a mature, installed, technology. Today is one of those days. Why? You might think its because I’m a quantum obsessed physicist whose daily sustenance depends on the future of quantum information science. But no. Today I wish quantum cryptography were installed because today the Supreme Court rejected a challenge to the Bush administration’s domestic spying program;

The Supreme Court rejected a challenge Tuesday to the Bush administration’s domestic spying program.
The justices’ decision, issued without comment, is the latest setback to legal efforts to force disclosure of details of the warrantless wiretapping that began after the Sept. 11 attacks.
The American Civil Liberties Union wanted the court to allow a lawsuit by the group and individuals over the wiretapping program. The 6th U.S. Circuit Court of Appeals dismissed the suit, saying the plaintiffs could not prove their communications had been monitored

If only the ACLU’s clients had been using quantum cryptography, then they would know that their phone lines were being tapped, and they would have the record to prove it. Of course what the judges probably really meant was that the plaintiffs could not prove their communication had been monitored by the government’s domestic spying plan. Sadly, quantum cryptographers have yet to develop a method for identifying the name of the attacker when eavesdropping occurs on quantum key distribution.

Posted on

Quantum Sloan Winners

Sloan awards have been announced for this year. On the list I noticed at least two three quantum computing/information related names: Alexandre Blais (University of Sherbrooke), Andris Ambainis (University of Waterloo), and Jason Petta (Princeton.) Congrats!