Quantum Computing and Quantum Information Harry Buhrman, University of Amsterdam Host: Physics Department This is the colloquium for the OSU Department of Physics
Abstract: Quantum computers hold great promise as the next generation hardware. They are based on counter intuitive phenomena from quantum mechanics, like superposition, interference, and entanblement. The basic building block of a quantum computer is a quantum bit or qubit, which unlike a classical bit can be in a quantum superposition (a simultaneous combination) of both 0 and 1. In the 1990s it was demonstrated that, for specific problems, quantum algorithms run on a quantum computer can massively outperform classical computers. The famous quantum algorithm of Peter Shor shows that a quantum computer can factor large numbers and thus breaks most of modern-day cryptography.
Recent years have witnessed important breakthroughs in the development of the hardware for a quantum computer. IBM announced a roadmap towards a 1000 qubit machine in 2023 and Google performed a "quantum superiority" experiment using a 5e qubit device. What can we compute on a quantum computer and how can it be useful? In this talk I will give a short introduction to quantum computing and quantum information. In addition I will show surprising connections between this new paradigm and seemingly unrelated areas in computer science, mathematics and physics. The talk will be accessible without knowledge of quantum mechanics.
To add/edit talks, please log in on the department web page, then return to Announce. Alternatively if you know the Announce
username/password, click the link below: