Classical computers with classical algorithms are inherently unable to simulate quantum systems using sub-exponential time and space complexity due to the exponential growth of the amount of data required to represent such systems completely. Quantum computing exploits the unique, non-classical properties of the quantum systems from which they are built, allowing them to process exponentially large quantities of information in only polynomial time. This kind of computational power could have applications to a multitude of problems outside quantum mechanics, and in the same way that classical computation.

The study of quantum algorithms has diverged greatly from simply simulating quantum physical systems to impact a wide variety of fields, including information theory, cryptography, language theory, and mathematics, etc. In the QSEC, the team develops novel quantum algorithms combining the expertise of GMU physicists, mathematicians, computer scientists, and industrial collaborators, with specific research interests in quantum tomography, energy-efficient computing, and searching algorithms.



The Quantum Computing team and collaborators meet weekly in a seminar series and roundtable discussion. Contact the group leaders for more information.