Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Designing programs that check their work
Journal of the ACM (JACM)
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the Power of Quantum Computation
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
On the Robustness of Functional Equations
SIAM Journal on Computing
Regular Article: On Quantum Algorithms for Noncommutative Hidden Subgroups
Advances in Applied Mathematics
An introduction to quantum computing for non-physicists
ACM Computing Surveys (CSUR)
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Hidden translation and orbit coset in quantum computing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Quantum Cryptography with Imperfect Apparatus
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
An improved quantum Fourier transform algorithm and applications
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The quantum fourier transform and extensions of the abelian hidden subgroup problem
The quantum fourier transform and extensions of the abelian hidden subgroup problem
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
SIAM Journal on Computing
Self-testing of quantum circuits
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 0.00 |
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. Our periodicity tester is efficient in Abelian groups and generalizes, in several aspects, previous periodicity testers. This is achieved by introducing a technique refining the majority correction process widely used for proving robustness of algebraic properties. The periodicity tester in non-Abelian groups and the common coset range tester are query efficient.