Difference between revisions of "Research"
From Quantum Computing Theory Group
| Line 18: | Line 18: | ||
[[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 0523359, which is a QuTM EMT grant titled "Self-correcting Fault-Tolerant Quantum Computation | + | * NSF grant 0803478, which is a Physics Quantum Information grant titled "Quantum Concatenated Code Hamiltonians" |
| + | * NSF grant 0523359, which is a QuTM EMT grant titled "Self-correcting Fault-Tolerant Quantum Computation" | ||
*ARO/NSA grant W911NSF-06-1-0379, which is a quantum algorithms grant title "The Hidden Subgroup Conjugacy Problem and Beyond" | *ARO/NSA grant W911NSF-06-1-0379, which is a quantum algorithms grant title "The Hidden Subgroup Conjugacy Problem and Beyond" | ||
Revision as of 21:01, 12 August 2008
 |
 | ||
| Self Correcting Quantum Computers | The Hidden Subgroup Problem | ||
 |
| ||
| Novel Simulations of Quantum Physics | align="center"|Self Correcting Quantum Computers |
Funding
This research is sponsored by
under the following grants
- NSF grant 0803478, which is a Physics Quantum Information grant titled "Quantum Concatenated Code Hamiltonians"
- NSF grant 0523359, which is a QuTM EMT grant titled "Self-correcting Fault-Tolerant Quantum Computation"
- ARO/NSA grant W911NSF-06-1-0379, which is a quantum algorithms grant title "The Hidden Subgroup Conjugacy Problem and Beyond"
