-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpublications.html
60 lines (59 loc) · 4.28 KB
/
publications.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
<html>
<head>
<!-- Disable caching -->
<meta http-equiv="pragma" content="no-cache">
<title>Publications</title>
</head>
<body>
<h1>PhD thesis</h1>
D. Rosenbaum. <a href="thesis.pdf">Quantum Computation and Isomorphism Testing</a>. June, 2015.
<h1>Publications</h1>
<ul>
<li>
D. Rosenbaum and F. Wagner. <a href="http://arxiv.org/abs/1312.1755">Beating the Generator-Enumeration Bound for p-Group Isomorphism</a>. arXiv:1312.1755.
<li>
D. Rosenbaum. <a href="http://arxiv.org/abs/1304.3935">Bidirectional Collision Detection and Faster Algorithms for Isomorphism Problems</a>. arXiv:1304.3935.
<li>
D. Rosenbaum. <a href="http://arxiv.org/abs/1205.0642">Breaking the n^(log n) Barrier for Solvable-Group Isomorphism</a>. SODA 2013.
</li>
<li>
D. Rosenbaum. <a href="http://arxiv.org/abs/1205.0036">Optimal Quantum Circuits for Nearest-Neighbor Architectures</a>. TQC 2013.
</li>
<li>
D. Rosenbaum and A. Harrow. <a href="http://arxiv.org/abs/1111.1462">Uselessness for an Oracle Model with Internal Randomness</a>. arXiv:1111.1462, accepted to QIC.
</li>
<li>
D. Rosenbaum. <a href="http://arxiv.org/abs/1011.4138">Quantum Algorithms for Tree Isomorphism and State Symmetrization</a>. arXiv:1011.4138.
</li>
<li>
D. Rosenbaum and M. Perkowski. <a href="MBFPAQC.pdf">Mapping Binary Functions to a Practical Adiabatic Quantum Computer</a>. In Proceedings of the 39th International Symposium on Multiple Valued Logic, pages 270 – 275, 2010. <sup>1</sup>
</li>
<li>
D. Rosenbaum. <a href="BSQDDs.pdf">Binary Superposed Quantum Decision Diagrams</a>. Quantum Information Processing, 9:463 – 496, 2009. <sup>2</sup>
<li>
D. Rosenbaum and M. Perkowski. <a href=ESQUID.pdf>Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants</a>. Physical Review A, 79:052310, 2009. <sup>3</sup>
</li>
<li>
D. Rosenbaum and M. Perkowski. <a href="EICOMQL.pdf">Efficient Implementation of Controlled Operations for Multivalued Quantum Logic</a>. In Proceedings of the 39th International Symposium on Multiple Valued Logic, pages 86 – 91, 2009. <sup>4</sup>
</li>
<li>
D. Rosenbaum and M. Perkowski. <a href="SQUID.pdf">Superposed Quantum State Initialization Using Disjoint Prime Implicants</a>. In Proceedings of the 38th International Symposium on Multiple Valued Logic, pages 144 – 149, 2008. <sup>5</sup>
</li>
</ul>
<a href="index.php">Back to the Main Page</a>
<br>
<br>
<small>
<small>
<p>I am required to provide the following information.</p>
<ol>
<li><a href="http://dx.doi.org/10.1109/ISMVL.2010.57">IEEE version</a> © 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.</li>
<li>The original publication is available at <a href="http://www.springerlink.com/content/r70w033717110244/?p=9092c2324b8c4f7d9df97ec76a788a61&pi=0">www.springerlink.com</a>. © Springer Science+Business Media, LLC, 2009.</li>
<li>© American Physical Society, 2009.</li>
<li><a href="http://dx.doi.org/10.1109/ISMVL.2009.27">IEEE version</a> © 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.</li>
<li><a href="http://dx.doi.org/10.1109/ISMVL.2008.24">IEEE version</a> © 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.</li>
</ol>
</small>
</small>
</body>
</html>