Difference between revisions of "Research"
From Quantum Computing Theory Group
Line 1: | Line 1: | ||
{|border="1" cellpadding="3" | {|border="1" cellpadding="3" | ||
|- | |- | ||
− | | || width=10px| || | + | |[[Image:Agt.png|250px|center]] || width=10px| || |
|- | |- | ||
|align="center"|[[Research:Adiabatic Methods For Quantum Computing|Adiabatic Methods for Quantum Comuting]] || ||align="center"|[[Research:Quantum Gadgdets|Quantum Gadgets]] | |align="center"|[[Research:Adiabatic Methods For Quantum Computing|Adiabatic Methods for Quantum Comuting]] || ||align="center"|[[Research:Quantum Gadgdets|Quantum Gadgets]] |
Revision as of 15:19, 17 October 2009
Adiabatic Methods for Quantum Comuting | Quantum Gadgets | |
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 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"