The Quantum Pontiff

Round We Go

Lest you think I’m not working:


  1. #1 RyanR
    March 24, 2010

    The video you have requested is not available.

  2. #2 Dave Bacon
    March 24, 2010

    Ah youtube is a bit slow. Should work now.

  3. #3 QuasiNewton
    March 24, 2010

    Are you working on an App where you can traverse/explore 3D graphs using “few finger gestures” ?

  4. #4 Dave Bacon
    March 24, 2010

    Hah, no. But that would be fun 🙂

  5. #5 Dave Bacon
    March 24, 2010

    Any guesses as to where this graph comes from?

  6. #6 QuasiNewton
    March 24, 2010

    Depiction of a (parallel?) algorithm?

  7. #7 Ian Durham
    March 24, 2010

    If I guess correctly, will you send me an updated list of GQI committee members for the newsletter? 🙂

  8. #8 Justin Dove
    March 24, 2010

    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.

  9. #9 John the Fisherman
    March 25, 2010

    Distance-2 toric code where blue is data, red is ancilla, and your notation is confusing.

  10. #10 David
    March 25, 2010

    I don’t get it. To my eye, nothing is happening.

  11. #11 Dave Bacon
    March 25, 2010

    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.

  12. #12 Dave Bacon
    March 25, 2010

    @David: it’s just rotating yes. The question is “what is this graph?”

  13. #13 David
    March 25, 2010

    Ohh, not dynamical. Rotating is just for giggles, or to show us all the edges. This is part of the conformal graphs thing?

  14. #14 Dave Bacon
    March 25, 2010

    Yes for giggles and to show the edges! Not part of a conformal graph thing.

  15. #15 David
    March 25, 2010

    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?

  16. #16 Justin Dove
    March 25, 2010

    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.

  17. #17 Dave Bacon
    March 26, 2010

    [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

  18. #18 Hongkong Phooey
    March 26, 2010

    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 (?)

  19. #19 Dave Bacon
    March 26, 2010

    It’s a “famous” construction. Well famous among the small group of people who have caught graph isomorphism disease…

  20. #20 aram
    March 27, 2010

    I guess it’s related to the Hadamard code?

  21. #21 Peter Love
    March 27, 2010

    Hi Dave,

    Nice! Never mind what it is, how did you make it? Is this vpython?


  22. #22 Dave Bacon
    March 28, 2010

    plus a video screen capture utility

New comments have been disabled.