Quantum tests for the linearity and permutation invariance of Boolean functions
- Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021 (United States)
- SUPA, School of Engineering and Physical Sciences, Heriot-Watt University, Edinburgh EH14 4AS (United Kingdom)
The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is {epsilon}-far from having that property. The performance of the algorithm is judged by how many calls need to be made to the black box in order to determine, with high probability, which of the two alternatives is the case. Here we present two quantum algorithms, the first to determine whether the function is linear and the second to determine whether it is symmetric (invariant under permutations of the arguments). Both require order {epsilon}{sup -2/3} calls to the oracle, which is better than known classical algorithms. In addition, in the case of linearity testing, if the function is linear, the quantum algorithm identifies which linear function it is. The linearity test combines the Bernstein-Vazirani algorithm and amplitude amplification, while the test to determine whether a function is symmetric uses projective measurements and amplitude amplification.
- OSTI ID:
- 22095589
- Journal Information:
- Physical Review. A, Vol. 84, Issue 6; Other Information: (c) 2011 American Institute of Physics; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
Application of quantum algorithms to the study of permutations and group automorphisms
Non-Boolean Quantum Amplitude Amplification and Quantum Mean Estimation