Research

From Quantum Computing Theory Group

Adiabatic Methods for Quantum Computing		Topological Quantum Computing
Quantum Concatenated Code Hamiltonians		The Hidden Subgroup Problem
Novel Simulations of Quantum Physics		Self Correcting Quantum Computers

Funding

This research is sponsored by

under the following grants

• NSF grant 0916400, which is an AF grant: "Small: Graph Isomorphism and Quantum Random Walks by Anyons"
• NSF grant 0829937, which is a Emergy Models of Technology grant from the CCF division titled: "Robust Quantum Simulation Techniques for Fault-Tolerant Quantum Computation"
• NSF grant 0803478, which is a Quantum Information and Revolutionary Computing grant from the PHY division entitled "Quantum Concatenated Code Hamiltonians"
• NSF grant 0523359, which is a Emergy Models of Technology grant from the CCF division titled "Self-correcting Fault-Tolerant Quantum Computation"
• ARO/NSA grant W911NSF-06-1-0379, which is a quantum algorithms grant titled "The Hidden Subgroup Conjugacy Problem and Beyond"
• DARPA grant, which is a QuEST program grant titled "Robust Quantum Gadgets"