M
Martin Rötteler
Researcher at Princeton University
Publications - 30
Citations - 1098
Martin Rötteler is an academic researcher from Princeton University. The author has contributed to research in topics: Quantum computer & Quantum algorithm. The author has an hindex of 18, co-authored 30 publications receiving 1002 citations.
Papers
More filters
Proceedings ArticleDOI
Mutually unbiased bases are complex projective 2-designs
TL;DR: It is demonstrated that maximal sets of MUBs come with a rich combinatorial structure by showing that they actually are the same objects as the complex projective 2-designs with angle set {0, 1/d}.
Journal ArticleDOI
Asymmetric quantum codes: constructions, bounds and performance
TL;DR: This paper derives asymmetric codes using a combination of Bose–Chaudhuri–Hocquenghem (BCH) and finite geometry low-density parity-check (LDPC) codes and shows that the asymmetric quantum codes offer two advantages, namely to allow a higher rate without sacrificing performance when compared with symmetric codes and vice versa to allowed a higher performance whenCompared with symmetrical codes of comparable rates.
Proceedings ArticleDOI
Discrete cosine transforms on quantum computers
TL;DR: It is shown that it is possible to realize the discrete cosine transforms and the discrete sine transforms of size N/spl times/N and types I, II, III and IV with as little as O(log/sup 2/N) operations on a quantum computer; whereas the known fast algorithms on a classical computer need O(N logN) Operations.
Proceedings ArticleDOI
Limitations of quantum coset states for graph isomorphism
TL;DR: In this paper, it was shown that entangled quantum measurements on at least Ω(n log n) coset states are necessary to get useful information for the case of graph isomorphism, matching an information theoretic upper bound.
Book ChapterDOI
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
TL;DR: In this paper, it was shown that perfect quantum network coding with classical network coding is possible over a network with k source-target pairs if there exists a classical linear (or vector-linear) coding scheme over a finite ring.