Welcome to the Quantum Computing Theory Group at UW.

A quantum computer is a device which computes according to the laws of quantum physics in contrast to today's modern computers which behave classically. Building such a computer offers the potential to drastically alter which algorithmic problems take a long time to compute, and which can be computed efficiently. Most famously, a large enough quantum computer could efficiently factor numbers, and hence break numerous widely used crypographic schemes. While only small scale quantum computers have been built, a worldwide community of researchers is attempting to build larger quantum computers, and is exploring the consequences of viewing computing and information processing through the lens of quantum theory. Our group studies all aspects of the quantum computing from ideas about how to build a quantum computer, to the quantum algorithms which will run on these future quantum computers. In addition we are interested in everything and anything that lies between the boundary of computer science and physics.

News

• Dave Bacon has a new paper out, arXiv:0808.1074. (8/4/08)
• Gregory Crosswhite and Dave Bacon's paper on matrix product states has been published in Physical Review A. (7/29/08)
• Gregory Crosswhite's paper with Guifre Vidal and Andrew Dougherty has been published in Physical Review B (7/15/08)
• A book review of David Mermin's new quantum computing book written by Dave Bacon has appeared in Nature physics. (7/6/08)
• Dave Bacon has a new paper out, arXiv:0806.2160. (6/12/08)
• Gregory Crosswhite's paper with Guifre Vidal and Andrew Dougherty, arXiv:0804.2504, has been accepted for publication in Physical Review B. (6/13/08)
• Gregory Crosswhite and Dave Bacon's paper on matrix product states, arXiv:0708.1221, has been accepted for publication in Physical Review A. (6/6/08)
• Gregory Crosswhite has a new paper out, arXiv:0804.2504, which describes work he did with Guifre Vidal and Andrew Doherty on new methods for the efficient simulation of quantum systems with long range interactions. (4/17/08)
• Dave Bacon's letter to "Physics Today" and a delightful response from David Mermin has appeared. (3/7/08)

(more news)

Sponsored by the NSF, ARO and NSA

Calendar

Recent Group Publications

Submitted

• D. Bacon, Simon's Algorithm, Clebsch-Gordan Sieves, and Hidden Symmetries of Multiple Squares, arXiv:0808.0174
  • arXiv:0808.0174
• D. Bacon, The Stability of Quantum Concatenated Code Hamiltonians, arXiv:0806.2160
  • arXiv:0806.2160
• T. Decker, J. Driasma, and P. Wocjan, Quantum Algorithm for Identifying Hidden Polynomial Function Graphs Submitted (2008)
  • arXiv:0706.1219

2008

• G. M. Crosswhite and D. Bacon. Finite automata for caching in matrix product algorithms, Phys. Rev. A 78, 012356 (2008)
  • arXiv:0708.1221 published version
• G. M. Crosswhite, A. C. Doherty, and G. Vidal. Applying matrix product operators to model systems with long-range interactions, Phys. Rev. B 78, 035116 (2008)
  • arXiv:0804.2504 published version
• D. Janzing and T. Decker How Much is a Quantum Controller Controlled by the Controlled System? Applicable Algebra in Engineering, Communication and Computing, 19, 241-258 (2008)
  • arXiv:0708.1505 published version
• D. Bacon, Populist Quantum Theory, Nature Physics 4, 509 - 510 (2008)
  • published version
• D. Bacon and T. Decker, The Optimal Single Copy Measurement for the Hidden Subgroup Problem. Physical Review A, 77, 032335 (2008)
  • arXiv:0706.4478 published version
• D. Bacon, How a Clebsch-Gordan Transform Helps to Solve the Heisenberg Hidden Subgroup Problem. Quantum Information and Computation, 8, 438-467 (2008)
  • arXiv:quant-ph/0612107 published version

(more publications)