Physics Department News
How quantum do you need to be to check a quantum computer?
Quantum computers are capable of solving certain problems whose scale lies outside that of classical computers. For some of these problems not even the solution can be efficiently checked with a classical computer. While schemes can verify an arbitrary quantum computation with a limited set of quantum operations, the minimum quantum resources to perform such a verification is an open question. Samuele, Theodoros, and Animesh from the quantum information group have published a paper on verification in Physical Review A (DOI: ) demonstrating an improvement on the existing requirements for schemes to verify quantum computations. In this work the authors demonstrate a verification scheme which works with a further reduced number of such quantum operations.
Predictable aspects of the variable likelihood of extreme space weather events
Solar activity drives Earth鈥檚 space weather. Each solar cycle has a different intensity but we found cycle invariant properties constraining the chance of space storms which affect systems at Earth.
The ability to precisely visualize the atomic geometry of the interactions between a drug and its protein target in structural models is critical in predicting the correct modifications in previously identified inhibitors to create more effective next generation drugs. We have combined VR visualization with fast algorithms for simulating intramolecular motions of protein flexibility, in an effort to further improve structure-led drug design by exposing molecular interactions that might be hidden in the less informative static models.