Lest you think I’m not working:
The video you have requested is not available.
Ah youtube is a bit slow. Should work now.
Are you working on an App where you can traverse/explore 3D graphs using “few finger gestures” ?
Hah, no. But that would be fun 🙂
Any guesses as to where this graph comes from?
Depiction of a (parallel?) algorithm?
If I guess correctly, will you send me an updated list of GQI committee members for the newsletter? 🙂
It looks like some sort of depiction of a group or algebraic structure. I guess that’s the obvious part (or not, who knows). I can’t see all the connections. At first glance it looks like it is a set of subsets closed under unions and symmetric differences. Not sure about the red stuff though.
Distance-2 toric code where blue is data, red is ancilla, and your notation is confusing.
I don’t get it. To my eye, nothing is happening.
John you are stereotyping me 🙂 Nope not related to the toric code.
I’m surprised no one has spotted the pattern in the graph. I’m not as surprised that no one knows what it is…the only people I know who might know that answer are CS theorists.
@David: it’s just rotating yes. The question is “what is this graph?”
Ohh, not dynamical. Rotating is just for giggles, or to show us all the edges. This is part of the conformal graphs thing?
Yes for giggles and to show the edges! Not part of a conformal graph thing.
The edges from the (a,b) boxes are hard to see [white background and thicker lines might be better for display?]
I’m trying to discern why you are interested in combinations of two things chosen from four? Is the four item node in the graph adjacent to any of the (a,b) boxes?
Well how about a full description of the adjacencies? After all, if the video was high enough quality and we had good enough eyes, that data would be available to us.
[0,1,2,3] – a1,a2,a3,a0
[0,1] – a0,b2,a1,b3
[0,2] – b1,a2,b3,a0
[0,3] – b2,b1,a0,a3
[1,2] – b0,a1,b3,a2
[1,3] – a1,b0,b2,a3
[2,3] – a2,a3,b0,b1
 – b1,b3,b2,b0
Uhmm, if there’s a number x in , then there’s a connection to ax, if not, it’s connected to bx, e.g. empty  is connected to all b’s, [0,1,2,3] is connected to all a’s. I guess that’s not enough to be of interest to a CS theorist (?)
It’s a “famous” construction. Well famous among the small group of people who have caught graph isomorphism disease…
I guess it’s related to the Hadamard code?
Nice! Never mind what it is, how did you make it? Is this vpython?
plus a video screen capture utility
New comments have been temporarily disabled. Please check back soon.
This blog has moved. The new location is http://dabacon.org/pontiff.
So long and thanks for all the…
Yep, it’s that time again. Paper dance time!
Making Classical Ground State Spin Computing Fault-Tolerant
Oh, damn, I missed Bacon Camp. Well I’ll just have to go camping myself ?
Congrats to Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous for being selected a best…
I grew up in the small town of Yreka, CA (“Yreka Bakery” backwards is…) that sits…