- Can quantum computers efficiently compute factorials?
- BaconCamp?
- Day Took Er Silicon Valley Jrbs?
- I wonder how I’d do on a RQ test?
Through The Eye of the Beholder
Scott the optimizer asks a question on a wim:
Come up with a catchy name for growth rates of the form 2^(n^&alpha) , 0< &alpha<1.
I thought the answer was obvious: “probably in BQP.”
update: does html superscript not work in a blockquote? I guess the answer is yes.
Climbing Mt. Scalable
The survey of abused words in quantum computing shows the word “exponential” as having an, um, exponential, lead over its competitors. My own personal choice for the most abused word was “scalable,” a word that is, in my opinion, the least debated, but most important, concept in quantum computing today. A word which everyone uses but whose definition is strangely missing from all almost all papers that use the word. Here are some thoughts on this word, what it means to particular groups, and what I, in my own pomposity, think the word really should mean.
Note the title of this post is ripped off from the title of quant-ph/0204157, a classic paper on “scalability” in quantum computing.
Continue reading “Climbing Mt. Scalable”
National Initiative in Quantum Information Science
John Preskill writes to me about workshop being quickly organized in response to the release of a report by US National Science and Technology Council calling for a national initiative in quantum information science. I saw this report a while back and have some half written blog posts about it that I need to finish off. Anyway the workshop website is http://www.eas.caltech.edu/qis2009/index.html. Everyone in the quantum information science is invited to attend and the registration and deadlines are, like, almost now!
Here is the blurb from the website:
In January 2009, the United States National Science and Technology Council issued a report on A Federal Vision for Quantum Information Science. The report proposes that:
The United States … create a scientific foundation for controlling, manipulating, and exploiting the behavior of quantum matter, and for identifying the physical, mathematical, and computational capabilities and limitations of quantum information processing systems in order to build a knowledge base for this 21st century technology.
This Workshop on Quantum Information Science (QIS) has been organized in response to the NSTC report. It brings together leading theorists and experimenters drawn from physical science, computer science, mathematics, and engineering who will assess recent progress in QIS and identify major goals and challenges for future research.
The workshop will include open evening sessions so that all participants can express their views concerning the priorities for a national QIS initiative. The workshop will be followed by a report that will be submitted to the federal agencies that sponsor or perform QIS research.
Note: Deadline for workshop rate at the Marriott is Wednesday, April 8, 5:00pm EST.
Best Paper Awards
A note from Ivan Deutsch, Secretary-Treasurer of the APS GQI topical group about the winners of the best student paper awards:
We are pleased to announce the Best Student Paper awards for the 2009 APS March Meeting. For the best experimental paper, the winner is
Eric Lucero, UCSB
for his paper J17.1, “High fidelity gates in Josephson phase qubits”.
For the best theoretical paper, the winner is
Lev Bishop, Yale University
for his paper V17.9, “Towards proving non-classicality with a 3-qubit GHZ state in circuit QED”.
Congratulations to the future Doctors Lucero and Bishop!
Words That Make Me Cringe
What Am I? I Choose Neither
Lately I’ve been giving a lot of thought to a question that I’m nearly constantly asked: “So…[long pause]…are you a physicist…[long pause]…or are you a computer scientist?” Like many theorists in quantum computing, a field perched between the two proud disciplines of physics and computer science (and spilling its largess across an even broader swath of fields), I struggle with answering this question. Only today, after a long and torturous half year (where by torture, I mean interviewing for jobs, not the eerily contemporaneous fall of the world’s finances) in which I have been daily contemplating what to do with my life, did it finally dawn on me that I actually know the answer to this question: I’m neither, damnit! Not both. Not one or the other. No, I’m neither a physicist nor a computer scientist.
Warning! Extended, and I mean extended, wildly meandering story below. Probably only of interest to my mom. Proceed with caution, or, to get to the point, skip to the end!
Continue reading “What Am I? I Choose Neither”
Discovery Channel Production Company Trademarks "Qubit"
Kamil sends along a pointer to www.playqubit.com. “Qubit,” according to the website is a new quiz show on the Discovery channel:
Qubit is a quiz show for the 21st century – fast-paced, cut-throat and fun!
Driven by stunning HD visuals, Qubit showcases science, technology and natural history. Not your ordinary quiz show, Qubit challenges convention by including the odd, unique and truly quirky aspects of the world of science.
Sounds like a fun show.
But “Qubit”? Really? I wonder if the PR firm that sold them on that name knew what the word meant and whether Ben Schumacher is offended or ecstatic? And I’m kicking myself for not, thinking of trademarking qubit myself (At the end of the about page: “Qubit is a trademark of Exploration Production Inc.”) Does this mean every talk I give I’m going to have to stick the little TM mark after qubit?
TQC 2009 Registration Open
Dear Colleagues,
Online registration is now open for the 4th Workshop on Theory of Quantum
Computation, Communication and Cryptography (Waterloo, May 11-13, 2009) at
the following website:
http://www.iqc.ca/tqc2009
The deadline for early registration with a reduced registration fee is
March 29, 2009, which coincides with the deadline for booking
accommodation with guaranteed rate. Online registration will be closed
after May 3, 2009.
The program consists of invited talks, contributed talks, and poster
presentations.
(1) Invited speakers include:
Masato Koashi (Osaka University)
John Preskill (Caltech)
Miklos Santha (Universit Paris Sud)
Graeme Smith (IBM Watson)
Stephanie Wehner (Caltech)
(2) Contribuited talks include:
* Salah Aly. “Asymmetric Quantum Cyclic Codes”
* Cedric Beny. “A necessary condition for approximate quantum error
correction”
* Jean-Christian Boileau and Joseph Renes. “Optimal State Merging
Without Decoupling”
* Earl Campbell and Dan Browne. “Neither magical nor classical?”
* Wim van Dam and Qingqing Yuan. “Quantum algorithm for Online Memory
Checking”
* Demerson N. Gonalves, Renato Portugal and Carlos Magno Martins
Cosme. “Solutions to the Hidden Subgroup Problem on some Metacyclic
Groups”
* Min-Hsiu Hsieh and Mark Wilde. “Optimal trading of classical
communication, quantum communication, and entanglement”
* Takeshi Koshiba and Takanori Odaira. “Statistically-Hiding Quantum
Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function”
* Michael Nathanson. “Asymptotic state discrimination with LOCC”
* Miguel Navascus, Masaki Owari and Martin B. Plenio. “Entanglement
Theory Applied”
* Miguel Navascus, Masaki Owari and Martin B. Plenio. “On the power of
PPT constraint in the symmetric extension test of the separability
problem”
* Masaki Owari, Martin B. Plenio, Eugene S. Polzik, Alessio Serafini
and Michael M. Wolf. “Quantum benchmarks for the teleportation and storage
of squeezed states for noisy squeezed states”
* Stefano Pirandola, Samuel Braunstein and Seth Lloyd. “On the
security and degradability of Gaussian channels”
* Jon Tyson. “Two-sided estimates of minimum-error distinguishability
of mixed quantum states via generalized Holevo-Curlander bounds”
* James Wootton, Ville Lahtinen and Jiannis Pachos. “Universal quantum
computation with a non-abelian topological memory”
For further details, such as the workshop program, registration,
accommodation and transportation, please refer to the workshop website:
http://www.iqc.ca/tqc2009
We look forward to seeing you in Waterloo.
Sincerely,
TQC 2009 Organizing Committee
NEC Quantum Internships
Martin writes to tell me that there are student internships in quantum information technology available at NEC this summer (see here and here):
The Quantum IT group at NEC Laboratories America, Princeton, NJ has summer internship positions available for graduate students interested in quantum computing. Areas of interest include:
- Quantum algorithms
- Quantum communication
- Quantum complexity
- Quantum cryptography
- Quantum error correction
- Quantum fault tolerance
More information about the Quantum IT group can be found at Quantum IT Group Website. Interested students can send their resume to internship [[[at]]] nec-labs.com and reference “Quantum-Intern” in the subject line.