Difference between revisions of "QW ("Q-Dub"): Quantum Computing Theory Group"
Line 6: | Line 6: | ||
Welcome to the [[QW ("Q-Dub"): Quantum Computing Theory Group]] at [http://www.washington.edu/ UW]. | Welcome to the [[QW ("Q-Dub"): Quantum Computing Theory Group]] at [http://www.washington.edu/ UW]. | ||
− | <randomimage size="150" float="right" choices="Grid.jpg|Agt.jpg"> A quantum computer is a device which computes explicitly using 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 cryptography 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. | + | <randomimage size="150" float="right" choices="Grid.jpg|Agt.jpg"/> A quantum computer is a device which computes explicitly using 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 cryptography 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. |
[[Image:Hs.png|thumb|left|200px|[[Research|A Hidden Subgroup State]]]] Our group [[Research|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. | [[Image:Hs.png|thumb|left|200px|[[Research|A Hidden Subgroup State]]]] Our group [[Research|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. |
Revision as of 19:27, 4 November 2010
Welcome to the QW ("Q-Dub"): Quantum Computing Theory Group at UW.
<randomimage size="150" float="right" choices="Grid.jpg|Agt.jpg"/> A quantum computer is a device which computes explicitly using 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 cryptography 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
- David Rosenbaum has a new paper on breaking the n^(log n) barrier for solvable-group isomorphism, arXiv:1205.0642 (5/28/2012)
- David Rosenbaum has a new paper on optimal quantum circuits for nearest-neighbor architectures, arXiv:1205.0036 (4/30/2012)
- Jijiang (Johnny) Yan and Dave Bacon have a new paper on the arXiv showing that the local Pauli Commuting Hamiltonian problem is in P, arXiv:1203.3906 (3/20/12)
- David Rosenbaum and Aram Harrow have a new paper on the arXiv concerning uselessness for oracles with internal randomness, arXiv:1111.1462 (11/7/11)
- Congrats to David Rosenbaum for winning a National Defense Science & Engineering Graduate Fellowship! (4/19/11)
- Congrats to David Rosenbaum for winning an NSF Graduate Research Fellowship! (4/5/11)
- The picture Gregory Crosswhite made for his automatic subsystem code paper is PRA kaleidoscope image for February 2011 (3/15/11)
- Congrats to Paul Pham for passing his quals! (3/3/11)
- Aram Harrow is now research faculty at UW. (3/1/11)
- Gregory Crosswhite and Dave Bacon's paper on automatic subsystem codes has been published in Physical Review A (2/11/11)
- Dave Bacon has published an essay in ACM's Ubiquity on the question "What is Computation?" (12/21/10)
- Congrats to Jonathan Shi for winning a Mary Gates Research Scholarship (12/17/10)
- Dave Bacon and Steve Flammia's paper on adiabatic cluster state quantum computing has been published in Phys. Rev. A Rapid Communications (10/27/10)
- Gregory Crosswhite and Dave Bacon have a new paper on the arXiv concerning CodeQuest: the search for subsystem codes, arXiv:1009.2203 (9/14/10)
- Isaac Crosson, Dave Bacon, and Ken Brown's paper on ground state computing has been published in Physical Review E. (9/3/10)
- Aram Harrow has arrived at UW as visiting faculty. (8/15/10)
- Isaac Crosson, Dave Bacon, and Ken Brown have a new paper on the arXiv, arXiv:1006.4388, concerning making a model of classical computing fault-tolerant. (6/23/10)
- William Johnson, who spent a summer working in the QW group on the hidden subgroup problem, has been named a Putnam Fellow for finishing in the top five of the Putnam Mathematical Competition. Congrats Will! Seattle Times article 1 Seattle Times article 2 (3/22/10)
- A paper Dave Bacon is coauthor on is the seventh most cited publication in quantum computing in the last decade, according to this study (3/21/10)
- Dave Bacon and Wim van Dam have an article out in February's Communications of the ACM on recent progress on quantum algorithms. (2/1/10)
- Dave Bacon and Steve Flammia have a new paper out, uniting the forces of adiabatic quantum computing and one-way quantum computing, arXiv:0912.2098 (12/14/09)
- Dave Bacon and Steve Flammia's paper on adiabatic gate teleportation has been published in Physical Review Letters (9/18/09)
- Congrats to Alice Neels (CSE) and Roger Wolfson (Physics) for both earning their Master's degrees (and Alice passing her quals) (6/5/09)
Funded by the NSF, IARPA, ARO, DARPA, and AFOSR
Calendar
<googleagenda>7pbn5m092j1qdf2lne1agqf3no@group.calendar.google.com</googleagenda>
Recent Group Publications
2013
- David Rosenbaum Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing
2012
- A 2D Nearest-Neighbor Quantum Architecture for Factoring
- Paul Pham, Krysta M. Svore
- Adiabatic Quantum Transistors
- Dave Bacon, Steven T. Flammia, Gregory M. Crosswhite
- Approximation of real error channels by Clifford channels and Pauli measurements
- Mauricio Gutiérrez, Lukas Svec, Alexander Vargo, Kenneth R. Brown
- Efficient Distributed Quantum Computing
- Robert Beals, Stephen Brierley, Oliver Gray, Aram W. Harrow, Samuel Kutin, Noah Linden, Dan Shepherd, Mark Stather
- Hypercontractivity, Sum-of-Squares Proofs, and their Applications
- Boaz Barak, Fernando G.S.L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou
- David Rosenbaum Breaking the n^(log n) Barrier for Solvable-Group Isomorphism
- David Rosenbaum Optimal Quantum Circuits for Nearest-Neighbor Architectures
- Jijiang Yan, Dave Bacon The k-local Pauli Commuting Hamiltonians Problem is in P
2011
- D. Rosenbaum, Aram Harrow Uselessness for an Oracle Model with Internal Randomness
- D. Rosenbaum, Quantum Algorithms for Tree Isomorphism and State Symmetrization
- G. M. Crosswhite and D. Bacon, Automated Searching for Quantum Subsystem Codes, Phys. Rev. A 83, 022307 (2011)
2010
- D. Bacon, Ubiquity symposium 'What is computation?': Computation and Fundamental Physics Ubiquity, December 2010 volume (2010)
- D. Bacon and S.T. Flammia, Adiabatic Cluster State Quantum Computing, Phys. Rev. A, 82, 030303(R) (2010)
- I. J. Crosson, D. Bacon, and Ken R. Brown, Making Classical Ground State Spin Computing Fault-Tolerant Phys. Rev. E, 82, 031106 (2010)
- D. Bacon, Quantize Your Computer Science. Computing in Science & Engineering, 12(5), 5 (2010)
- D. Bacon W. van Dam, Recent Progress in Quantum Algorithms Communications of the ACM, 53(2), 84 (2010)
2009
- D. Bacon and S.T. Flammia, Adiabatic Gate Teleportation, Phys. Rev. Lett. 103, 120504 (2009)
- T. Decker, J. Driasma, and P. Wocjan, Quantum Algorithm for Identifying Hidden Polynomial Function Graphs, Quantum Information and Computation, 3, 0215 (2009)
2008
- D. Bacon, Stability of Quantum Concatenated Code Hamiltonians, Phys. Rev. A, 78, 042324 (2008)
- G. M. Crosswhite and D. Bacon. Finite automata for caching in matrix product algorithms, Phys. Rev. A 78, 012356 (2008)
- 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)
- 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)
- D. Bacon, Populist Quantum Theory, Nature Physics 4, 509 - 510 (2008)
- D. Bacon and T. Decker, The Optimal Single Copy Measurement for the Hidden Subgroup Problem. Physical Review A, 77, 032335 (2008)
- D. Bacon, How a Clebsch-Gordan Transform Helps to Solve the Heisenberg Hidden Subgroup Problem. Quantum Information and Computation, 8, 438-467 (2008)