522 citations · 2.3k across the 64 of their papers we have counts for
6 papers · 1 filter
Random measurement bases, quantum state distinction and applications to the hidden subgroup problem
Pranab Sen
We show that measuring any two quantum states by a random POVM, under a suitable definition of randomness, gives probability distributions having total variation distance at least…
Limitations of Quantum Coset States for Graph Isomorphism
Sean Hallgren, Martin Roetteler, Pranab Sen
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by…
On Approximately Symmetric Informationally Complete Positive Operator-Valued Measures and Related Systems of Quantum States
Andreas Klappenecker, Martin Roetteler, Igor Shparlinski +1
We address the problem of constructing positive operator-valued measures (POVMs) in finite dimension consisting of operators of rank one which have an inner product close…
On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group
Jaikumar Radhakrishnan, Martin Roetteler, Pranab Sen
The hidden subgroup problem (HSP) provides a unified framework to study problems of group-theoretical nature in quantum computing such as order finding and the discrete logarithm p…
Thresholds for Linear Optics Quantum Computing with Photon Loss at the Detectors
Marcus Silva, Martin Roetteler, Christof Zalka
We calculate the error threshold for the linear optics quantum computing proposal by Knill, Laflamme and Milburn [Nature 409, pp. 46--52 (2001)] under an error model where photon d…
Mutually Unbiased Bases are Complex Projective 2-Designs
Andreas Klappenecker, Martin Roetteler
Mutually unbiased bases (MUBs) are a primitive used in quantum information processing to capture the principle of complementarity. While constructions of maximal sets of d+1 such b…