Skip to main content

Probability and Cumulative Dice Sums

Post a Comment

Coursera: Quantum Mechanics and Quantum Computation

Quantum Mechanics and Quantum Computation

About the Course

Quantum computation is a remarkable subject, and is based on one of the great computational discoveries that computers based on quantum mechanics are exponentially powerful. This course aims to make this cutting-edge material broadly accessible to undergraduate students, including computer science majors who do not have any prior exposure to quantum mechanics. The course will introduce qubits (or quantum bits) and quantum gates, the basic building blocks of quantum computers. It will cover the fundamentals of quantum algorithms, including the quantum fourier transform, period finding, and Shor's iconic quantum algorithm for factoring integers efficiently. The course will also explore the prospects for quantum algorithms for NP-complete problems and basic quantum cryptography.

The course will not assume any prior background in quantum mechanics. Instead, it will use the language of qubits and quantum gates to introduce the basic axioms of quantum mechanics. This treatment of quantum mechanics has the advantage of both being conceptually simple and of highlighting the paradoxes at the heart of quantum mechanics. The most important pre-requisite for the course is a good understanding of basic linear algebra, including vectors, matrices, inner products, eigenvectors and eigenvalues, etc.

About the Instructor(s)

Umesh Vazirani is the Strauch Distinguished Professor of Electrical Engineering and Computer Science at University of California, Berkeley, and is the director of the Berkeley Quantum Information and Computation Center. Prof. Vazirani has done foundational work on the computational foundations of randomness, algorithms and novel models of computation. His 1993 paper with Ethan Bernstein helped launch the field of quantum complexity theory. He is the author of two books "An introduction to computational learning theory" with Michael Kearns and "Algorithms" with Sanjoy Dasgupta and Christos Papadimitriou.
Optional Assignment: Week 1 (LaTeX and pdf)

Comments

  1. PegasusApril 14, 2013 at 2:52 PM

    Hi, I can't get the videos of this course, for I was not signed in :(

    It says to me "We are sorry, but the enrollment for Quantum Mechanics and Quantum Computation is currently closed". Where can I get the video lectures now? :(

    ReplyDelete
    Replies
    1. Christopher D. LongApril 14, 2013 at 6:41 PM

      I do believe they were available for download during the course, so someone may have made them available as a BitTorrent.

      Delete

Post a Comment

Popular posts from this blog

Notes on Setting up a Titan V under Ubuntu 17.04

I recently purchased a Titan V GPU to use for machine and deep learning, and in the process of installing the latest Nvidia driver's hosed my Ubuntu 16.04 install. I was overdue for a fresh install of Linux, anyway, so I decided to upgrade some of my drives at the same time. Here are some of my notes for the process I went through to get the Titan V working perfectly with TensorFlow 1.5 under Ubuntu 17.04. Old install: Ubuntu 16.04 EVGA GeForce GTX Titan SuperClocked 6GB 2TB Seagate NAS HDD + additional drives New install: Ubuntu 17.04 Titan V 12GB / partition on a 250GB Samsung 840 Pro SSD (had an extra around) /home partition on a new 1TB Crucial MX500 SSD New WD Blue 4TB HDD + additional drives You'll need to install Linux in legacy mode, not UEFI, in order to use Nvidia's proprietary drivers for the Titan V. Note that Linux will cheerfully boot in UEFI mode, but will not load any proprietary drivers (including Nvidia's). You'll need proprietary d
Post a Comment
Read more

Mixed Models in R - Bigger, Faster, Stronger

When you start doing more advanced sports analytics you'll eventually starting working with what are known as hierarchical, nested or mixed effects models . These are models that contain both fixed and random effects . There are multiple ways of defining fixed vs random random effects , but one way I find particularly useful is that random effects are being "predicted" rather than "estimated", and this in turn involves some "shrinkage" towards the mean. Here's some R code for NCAA ice hockey power rankings using a nested Poisson model (which can be found in my hockey GitHub repository ): model <- gs ~ year+field+d_div+o_div+game_length+(1|offense)+(1|defense)+(1|game_id) fit <- glmer(model, data=g, verbose=TRUE, family=poisson(link=log) ) The fixed effects are year , field (home/away/neutral), d_div (NCAA division of the defense), o_div (NCAA division of the offense) and game_length (number of overtime
3 comments
Read more

A Bayes' Solution to Monty Hall

For any problem involving conditional probabilities one of your greatest allies is Bayes' Theorem . Bayes' Theorem says that for two events A and B, the probability of A given B is related to the probability of B given A in a specific way. Standard notation: probability of A given B is written \( \Pr(A \mid B) \) probability of B is written \( \Pr(B) \) Bayes' Theorem: Using the notation above, Bayes' Theorem can be written:  \[ \Pr(A \mid B) = \frac{\Pr(B \mid A)\times \Pr(A)}{\Pr(B)} \] Let's apply Bayes' Theorem to the Monty Hall problem . If you recall, we're told that behind three doors there are two goats and one car, all randomly placed. We initially choose a door, and then Monty, who knows what's behind the doors, always shows us a goat behind one of the remaining doors. He can always do this as there are two goats; if we chose the car initially, Monty picks one of the two doors with a goat behind it at random. Assume we pick Door 1 an
20 comments
Read more