Search results

From Quantum Computing Theory Group
Jump to: navigation, search
  • |[[Image:DJR-Picture-Cropped.jpg|120px]] || '''David Rosenbaum''' [http://www.cs.washington.edu/homes/djr/ more info]
    4 KB (547 words) - 19:14, 11 December 2016
  • * [[user:djr | David Rosenbaum]] has a new paper on breaking the n^(log n) barrier for s * [[user:djr | David Rosenbaum]] has a new paper on optimal quantum circuits for nearest
    9 KB (1,231 words) - 03:35, 29 May 2012
  • * [[User:Djr|D. Rosenbaum]], '''Quantum Algorithms for Tree Isomorphism and State Symmet
    152 bytes (17 words) - 01:17, 21 March 2012
  • * [[User:Djr|D. Rosenbaum]], [http://www.cs.washington.edu/homes/aram/ Aram Harrow] '''U
    199 bytes (26 words) - 01:16, 21 March 2012
  • * [[user:djr | David Rosenbaum]] '''Optimal Quantum Circuits for Nearest-Neighbor Archit
    151 bytes (15 words) - 00:53, 3 May 2012
  • * [[user:djr | David Rosenbaum]] '''Breaking the n^(log n) Barrier for Solvable-Group Is
    153 bytes (18 words) - 03:34, 29 May 2012
  • * [[user:djr | David Rosenbaum]] '''Bidirectional Collision Detection and Faster Determi
    170 bytes (17 words) - 04:01, 12 May 2013