Abstract | ||
---|---|---|
We construct efficient or query efficient quantum property testers for two existential group properties which have exponential query complexity both for their decision problem in the quantum and for their testing problem in the classical model of computing. These are periodicity in groups and the common coset range property of two functions having identical ranges within each coset of some normal subgroup. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1007/978-3-540-45138-9_36 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
property testing,quantum computing,satisfiability,quantum computer,model of computation,decision problem | Conference | 2747 |
ISSN | Citations | PageRank |
0302-9743 | 5 | 0.60 |
References | Authors | |
18 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Katalin Friedl | 1 | 173 | 14.18 |
Frédéric Magniez | 2 | 570 | 44.33 |
Miklos Santha | 3 | 728 | 92.42 |
Pranab Sen | 4 | 394 | 26.65 |