(Enter summary)
Abstract: We present the view of quantum algorithms as a search-theoretic
problem. We show that the Fourier transform, used to solve the
Abelian hidden subgroup problem, is an example of an efficient elimination
observable which eliminates a constant fraction of the candidate
secret states with high probability. Finally, we show that elimination
observables do not always exist by considering the geometry of the
hidden subgroup states of the dihedral group DN .
1 Introduction
In the classic game... (Update)
Context of citations to this paper: More
...samples in the HSP algorithm) is enough to reconstruct the hidden subgroup, with exponential classical post processing time. In [23, 22, 25], they address the question of whether or not any algorithm is possible at all. They show that the tensor products of coset states for di...
...[5] give a solution for the HSP over the dihedral group D n with polynomially many queries and exponential (classical sequential) time. In [6] and [7] they address whether any measurement will distinguish subgroup states. Roetteler and Beth [19] give a solution to the HSP for...
Cited by: More
Shor's Algorithm is Optimal - Ip (2003)
(Correct)
Analysing the Quantum Fourier Transform for Finite Groups through .. - Murphy (2001)
(Correct)
The Hidden Subgroup Problem and Quantum Computation Using.. - Hallgren, Russell
(Correct)
Active bibliography (related documents): More All
0.3: Comparison Of 2-D Fft Implementations On The Intel Paragon - Massively Parallel..
(Correct)
0.3: A New Approach for Computing Multi-dimensional.. - Kechriotis, An.. (1995)
(Correct)
0.3: Effective Search Problems - Kummer, Stephan (1994)
(Correct)
Similar documents based on text: More All
0.4: Quantum Computation and Lattice Problems - Regev (2002)
(Correct)
0.1: Hidden Subgroup States are Almost Orthogonal - Ettinger, Høyer, Knill (1999)
(Correct)
0.1: On Quantum Algorithms for Noncommutative Hidden Subgroups - Ettinger, Høyer (2000)
(Correct)
Related documents from co-citation: More All
6: Quantum measurements and the Abelian stabilizer problem
- Yu - 1995
6: Hidden subgroup states are almost orthogonal
- Ettinger, yer et al. - 1999
6: On quantum algorithms for noncommutative hidden subgroups
- Ettinger, yer - 1999
BibTeX entry: (Update)
Mark Ettinger and Peter Hyer. Quantum state detection via elimination. Technical report, quantph /9905099, 1999. http://citeseer.ist.psu.edu/article/ettinger99quantum.html More
@article{ ettinger99quantum,
author = "Mark Ettinger and Peter H{\o}yer",
title = "On Quantum Algorithms for Noncommutative Hidden Subgroups",
journal = "Lecture Notes in Computer Science",
volume = "1563",
pages = "478--487",
year = "1999",
url = "citeseer.ist.psu.edu/article/ettinger99quantum.html" }
Citations (may not include all citations):
40
Quantum measurements and the Abelian stabilizer problem (context) - Kitaev
34
Quantum Detection and Estimation Theory (context) - Carl - 1976
29
Group-theoretic algorithms and graph isomorphism (context) - Christoph - 1982
3
Mathematics of multidimensional Fourier transform algorithms (context) - Richard, An et al. - 1997
3
Wiley-Teubner Series in Computer Science (context) - Martin - 1988
1
Available at Los Alamos e-Print achive as (context) - Mark, Hyer et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://nis-www.lanl.gov/~ettinger/): More
Quantum Time-Frequency Transforms - Ettinger
(Correct)
Hidden Subgroup States are Almost Orthogonal - Ettinger, Høyer, Knill (1999)
(Correct)
Random Play of Combinatorial Games - Ettinger
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC