Difference between revisions of "QW ("Q-Dub"): Quantum Computing Theory Group"
(→Recent Publications) |
(→Recent Publications) |
||
Line 18: | Line 18: | ||
= Recent Publications = | = Recent Publications = | ||
− | {{:Publications}}(more publications | + | {{:Publications}} [[Publications (more publications)]] |
Revision as of 18:01, 1 February 2008
Welcome to the Quantum Computing Theory Group.
A quantum computer is a device which computes according to the laws of quantum physics. Building such a computer offers the potential to drastically change the space of what is difficult or easy for a computing device to calculate. 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 research 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
Calendar
<googleagenda>7pbn5m092j1qdf2lne1agqf3no@group.calendar.google.com</googleagenda>
Recent 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)