Graduate Student Solves Quantum Verification Problem

Your daily selection of the latest science news!

According to (This article and its images were originally posted on Quanta Magazine October 8, 2018 at 10:16AM.)

In the spring of 2017, Urmila Mahadev found herself in what most graduate students would consider a pretty sweet position. She had just solved a major problem in quantum computation, the study of computers that derive their power from the strange laws of quantum physics. Combined with her earlier papers, Mahadev’s new result, on what is called blind computation, made it “clear she was a rising star,” said Scott Aaronson, a computer scientist at the University of Texas, Austin.

Mahadev, who was 28 at the time, was already in her seventh year of graduate school at the University of California, Berkeley — long past the stage when most students become impatient to graduate. Now, finally, she had the makings of a “very beautiful Ph.D. dissertation,” said Umesh Vazirani, her doctoral adviser at Berkeley.

But Mahadev did not graduate that year. She didn’t even consider graduating. She wasn’t finished.

|
+ Got any news, tips or want to contact us directly? Feel free to email us: esistme@gmail.com.

To see more posts like these; please subscribe to our newsletter. By entering a valid email, you’ll receive top trending reports delivered to your inbox.

__

This article and images were originally posted on [Quanta Magazine] October 8, 2018 at 10:16AM. Credit to the original author and Quanta Magazine | ESIST.T>G>S Recommended Articles Of The Day.

 

 

 

Advertisements

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.