google ups ante and hedges QM computing bet by buying up Martinis lab

John Martinishi all, its not too often that one scoops both time magazine & wired, but that was indeed the case with my last blog on DWave at the beginning of the year.[a] it was so cool to see Time devote its cover story to DWave and quantum computing. however, could not manage to find a copy of the magazine to buy it! Time is far less iconic in this new 21st century era of cyberspace awash.

the massive/ exciting/ milestone news less than a week old justifying/ inspiring this new blog post is that Google is hedging its bets and hiring Martinis and his entire team at UCSB to work on an apparently hybrid mix of adiabatic and gate computing techniques, some pioneered in DWave and others in his own lab, respectively. details are very sketchy right now but its a major paradigm shift & phase/ game changer. it is speculated by the commentariat that DWave is probably/ understandably not too happy about this development & they have no comment so far. in contrast Martinis specializes in very many careful scientific papers on high fidelity, superconducting gate model which has achieved about 5 qubits to date and which serious scientists seem to endorse/ prefer.[b]

Continue reading

*** COLLATZ BREAKTHRU ***

:idea: :!: :!: :!: this is some code that was just written & run today & there is no choice but to archive (& share) it immediately! the basic idea is a riff on the last theme of looking at base-2 suffixes that lead to large glides. a simple obvious variation is to compare the “subsequent” (adjacent) “parity sequences” of nodes of this graph/ tree. a property of this recursive algorithm/ enumeration is that prefixes must match up to some position, the question is, how much? then one can just look at the “incremental work/ computation” to determine that a glide falls below, and how much is that work in general? the jawdropping finding here is that this work can be sorted into a FINITE 6 equivalence classes, disregarding the equivalent parity sequence prefixes.

:star: :star: :star: at this point think almost surely this property can be turned into an inductive proof based on the same algorithmic structure. :?:

Continue reading

Fields medals & Nevanlinna prize 2014

dsc00643

hi all. a busy and eventful week. ICM2014 announced winners for fields medal & Nevanlinna prize in South Korea.

collected a bunch of links in a short amt of time.

there is some historical consternation about how Pulitzer did not have a category in mathematics. that debate can be found elsewhere.

the Fields medal is “worth” “only” less than $15K in USD (in somewhat striking contrast to the recent announcement of up to 5 yearly $3M Breakthrough prizes and the $1M Abel prize). in terms of prestige, priceless. (but of course mathematicians are the least to worry about “practical applications” of their work right?) :star: :star: :star:

Gowers has a 1sthand account and is near-liveblogging the event. he has a lively/ colorful account including an adorable story about how Mirzakhani’s daughter was upset by costumes in the opening ceremony play. (semimiraculously, get quite a few hits from leaving comments/ links on his blogs.) it looks like all the lecture videos are available online.[a12]

the Fields medal is a bit rare also in how it has an age limit (40) as not! specified by its founder, but apparently the prize committee wanted to reward younger mathematicians, and emphasize fresh new breakthrough thinking, with major potential for future advances. 2-4 are awarded only every four years.[a]

Continue reading

collatz freaky alien landscape

:!: :idea: :?: wow, this showed up while finally researching into graph centers using an algorithm suggested/ recommended by suresh, an idea that occurred to me over ½ year ago and finally got around to coding it recently (after realizing a fairly good greedy algorithm was quite easy to implement and runs quickly… its actually quite conceptually similar to Minimum Spanning Tree one of my favorite algorithms). the graph centers idea was intriguing and seems to work well in finding “few” graph centers that “cover” (via “intermediate hubs”) “blockwise-pieces” of the collatz graph. after looking at it, it was noisy but was also hard to even see an upward trend in number of graph centers required for the higher blockwise-pieces. (need to write this up at some point; am going to just append the undocumented code for the last version below for now).

Continue reading

RIP robin williams. reflections on some personal/ math/ CS angles to his movies

Good-Will-Hunting-quotes-4hi all, a sad day yesterday as summer creeps to its end (by one basic measure its now over as many kids back in school already). my sig other is a big robin williams fan and have enjoyed/ admired him myself also over the years. however, brutally honestly/ truthfully (and there is some physical, emotional, spiritual brutality to this event/ tragedy), his manic energy did not always rub me the right way. something seemed a little off.

early on in his career, even in my teenage years he was cited zestily in moments of shared movie reviews/ comparisons and play/ frivolity by my humorous friends who somewhat unlike me were well-versed/ connected/ plugged in to movies, tv shows, hollywood & pop-culture. others cited his mythical connection to Boulder in his famous Mork and Mindy show, near where I grew up (some brief scenes/transition shots from that show are the real Boulder).[19]

he was extremely talented, a brilliant comedian and performer, but hollywood is the land of facades and masks, and it is now seen he was in some ways an archetype and poster boy of that. he was a court jester and a clown, and now the facepainted frown and tears are seen as more real than anyone imagined, in the dragon-eating-its-tail case of art imitating life, and life imitating art… :'(

Continue reading