Slideshow for Austin Quantum Computing meetup presentations, 2017

IMG_20170321_184122 Brian La Cour quantum computing presentationDr. Brian La Cour from University of Texas at Austin gave a presentation on the latest state of quantum computing to Austin's Quantum Computing meetup. Click the image to read more.
Date: 03/21/2017
Dr. Brian La Cour from University of Texas at Austin gave a presentation on the latest state of quantum computing to Austin's Quantum Computing meetup. In short, his points were these.

Meanwhile, Microsoft's approach to quantum computing is very far fetched and technologically unlikely, however, Microsoft is also creating high-level programming languages for quantum computer. Some open-source developers around the world are doing the same, and this is a good time for developers to get involved.

IMG_20170524_203441 Scott Aaronson at the Austin Quantum Computing meetupOn May 24, 2017 Scott Aaronson gave a talk at the Austin Quantum Computing meetup. The talk reiterated many important points and themes from Scott Aaronson's blog in the same entertaining, inspiring, and humorous way.
Date: 05/24/2017
On May 24, 2017 Scott Aaronson gave a talk at the Austin Quantum Computing meetup. The talk reiterated many important points and themes from Scott Aaronson's blog in the same entertaining, inspiring, and humorous way.

Scott Aaronson started his speech by considering alternative forms of computing, based on exotic physics models, and asked if they violate the Extended Church-Turing thesis (roughly speaking, can they be fundamentally faster than conventional computers). Turns out that relativity computer or Zeno's computer, which would be capable of doing that, can't exist in the physical world. But quantum computing appears to violate the Extended Church-Turing thesis. That's not to say that it can solve NP-complete problems in polynomial time. It also doesn't mean that it tries every answer simultaneously (this fallacy is one of Scott's major peeves), but rather uses interference to get the right answer.

IMG_20170524_193312 BQP - bounded-error quantum polynomial time complexity classOne of the more important slides from Scott Aaronson's talk shows a diagram where the BQP - bounded quantum polynomial time complexity class - fits in with other complexity classes. Click the image to read more.
Date: 05/24/2017
One of the more important slides from Scott Aaronson's talk at the Austin Quantum Computing meetup shows a diagram where the BQP - bounded-error quantum polynomial time complexity class - fits in with other complexity classes. BQP encompasses P -- polynomial complexity class -- but it is widely believed there are many NP-complete problems that are not in BQP. That means there are (most likely) no polynomial time algorithms for those problems, not even on quantum computers.

On the other hand, it is possible that there problems solvable by quantum computer with bounded errors in polynomial time that are not in NP. That is to say, if we can guess a possible solution, it is not possible to verify in polynomial time whether or not it is a solution. We would need a quantum computer to verify it.

Scott Aaronson started his speech by considering alternative forms of computing, based on exotic physics models, and asked if they violate the Extended Church-Turing thesis (roughly speaking, can they be fundamentally faster than conventional computers). Turns out that relativity computer or Zeno's computer, which would be capable of doing that, can't exist in the physical world. But quantum computing appears to violate the Extended Church-Turing thesis. That's not to say that it can solve NP-complete problems in polynomial time. It also doesn't mean that it tries every answer simultaneously (this fallacy is one of Scott's major peeves), but rather uses interference to get the right answer.

IMG_20170524_195449_ScottAaronson_QC_BlackHolesScott Aaronson ended his talk with a true cliffhanger when he mentioned his last year's resarch paper connecting quantum computation to the black hole firewall problem. He briefly mentioned it and said that there wasn't enough time to discuss it at this p
Date: 05/24/2017
Scott Aaronson ended his talk with a true cliffhanger when he mentioned his last year's resarch paper connecting quantum computation to the black hole firewall problem. He briefly mentioned it and said that there wasn't enough time to discuss it at this presentation.

IMG_20170524_195449 Scott Aaronson's research on quantum computing and black holesScott Aaronson ended his talk with a true cliffhanger when he mentioned his last year's resarch paper connecting quantum computation to the black hole firewall problem. He briefly mentioned it and said that there wasn't enough time to discuss it at this p
Date: 05/24/2017
Scott Aaronson ended his talk with a true cliffhanger when he mentioned his last year's resarch paper connecting quantum computation to the black hole firewall problem. He briefly mentioned it and said that there wasn't enough time to discuss it at this presentation. All he said was what is on this slide: "More broadly: We've been able to use ideas from quantum computing theory to get new insights into condensed-matter physics, quantum gravity, and even classical computer science (e.g. "quantum proofs for classical theorems")."

Scott Aaronson started his speech by considering alternative forms of computing, based on exotic physics models, and asked if they violate the Extended Church-Turing thesis (roughly speaking, can they be fundamentally faster than conventional computers). Turns out that relativity computer or Zeno's computer, which would be capable of doing that, can't exist in the physical world. But quantum computing appears to violate the Extended Church-Turing thesis. That's not to say that it can solve NP-complete problems in polynomial time. It also doesn't mean that it tries every answer simultaneously (this fallacy is one of Scott's major peeves), but rather uses interference to get the right answer.

JavaScript must be enabled for this page to function properly. However, it seems JavaScript is either disabled or not supported by your browser. Please enable JavaScript by changing your browser options, then try again.