Difference between revisions of "Research"
From Quantum Computing Theory Group
Line 24: | Line 24: | ||
[[Image:Nsf.jpg|150px]] [[Image:Aro.jpg|150px]] [[Image:Nsa.gif|150px]]<br> | [[Image:Nsf.jpg|150px]] [[Image:Aro.jpg|150px]] [[Image:Nsa.gif|150px]]<br> | ||
under the following grants | 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 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 0803478, which is a Quantum Information and Revolutionary Computing grant from the PHY division entitled "Quantum Concatenated Code Hamiltonians" |
Revision as of 15:21, 17 October 2009
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"