A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A Reformulation Of The Quantum Query Model With A Linear Condition For Exact Algorithms
2016
Zenodo
We present a reformulation of the Quantum Query Model (QQM) without considering the measurement step. Our new formulation is described by a set of vectors satisfying some properties, which we call a Block Set. Given an algorithm in QQM we prove that there is an equivalent algorithm in the Block Set Formulation (BSF). If we keep the same measurement step, then we prove that both formulations have the same Gram Matrix of the output states, and the BSF allows us to describe it explicitly. Finally,
doi:10.5281/zenodo.50143
fatcat:n2kfyyr6tjhjzmdjpvectzjf4e