Entangled FindSet

Would be cool to use quantum entanglement to do instant FindSets (seeing if two elements are contained in the same set) for Kruskal MST algorithm.

Say each vertex is a photon.  Whenever you do a union you entangle the photons.  Then all you have to do to compare if the photons belong to the same set is to see if they are entangled.

This FindSet operation is already really fast O(lg*n).  However, this would be a constant time lookup.

What would the rest of the quantum MST algorithm be?




tv channel

The animation for the channel number on our tv (you know how when you change the channel it tells you what channel you are now on) changed today.  Made me wonder how that happens.  I thought that was defined by the tv… Strange.


This is totally awesome!!  One of my ideas is becoming an app soon.  They just started and are trying to get funding through kickstarter https://www.kickstarter.com/projects/1190241008/warblr-an-app-that-recognises-birds-from-their-son?ref=nav_search.  They seem to have a lot of media support and there app seems to work!  Totally awesome.

Fast Company did an article about it http://www.fastcoexist.com/3037817/fund-this/the-original-tweeting-this-app-is-like-shazam-for-bird-songs.

https://drewsblog.herokuapp.com/?p=1741 my original post on my idea which essentially Warblr.  So, cool.  Can’t wait to try it out.  I’ll have to follow this and see how they do.