Quantum Query as a State Decomposition
arXiv:1602.07716 · doi:10.1016/j.tcs.2018.03.017
Abstract
The Quantum Query Model is a framework that allows us to express most known quantum algorithms. Algorithms represented by this model consist on a set of unitary operators acting over a finite Hilbert space, and a final measurement step consisting on a set of projectors. In this work, we prove that the application of these unitary operators before the measurement step is equivalent to decomposing a unit vector into a sum of vectors and then inverting some of their relative phases. We also prove that the vectors of that sum must fulfill a list of properties and we call such vectors a Block Set. If we define the measurement step for the Block Set Formulation similarly to the Quantum Query Model, then we prove that both formulations give the same Gram matrix of output states, although the Block Set Formulation allows a much more explicit form. Therefore, the Block Set reformulation of the Quantum Query Model gives us an alternative interpretation on how quantum algorithms works. Finally, we apply our approach to the analysis and complexity of quantum exact algorithms.
arXiv comment30 pages, 2 figures. In this version, we changed title, corrected typos, and added a new lower-bound result (Sec. 6)
References in corpus (8)
- An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
- Negative weights make adversaries stronger
- On exact quantum query complexity
- Generalizations of the distributed Deutsch-Jozsa promise problem
- Exact quantum query complexity of EXACT and THRESHOLD
- Characterizations of symmetrically partial Boolean functions with exact quantum query complexity
- From Quantum Query Complexity to State Complexity
- Exact quantum algorithms have advantage for almost all Boolean functions