By comparing constructions of block encoding given by [1-4], we propose a way to extract dequantizability from advancements in dequantization techniques that have been led by Tang, as in [5]. Then we apply this notion to the sparse-access input model that is known to be BQP-complete in general, thereby conceived to be un-dequantizable. Our goal is to break down this belief by examining the sparse-access input model's instances, particularly their input matrices. In conclusion, this paper forms a dequantizability-verifying scheme that can be applied whenever an input is given.

翻译：通过比较文献[1-4]提出的块编码构造方法，我们提出了一种从Tang引领的去量子化技术进展（如文献[5]所示）中提取可去量子化性的途径。随后，我们将此概念应用于稀疏访问输入模型——该模型在一般情况下已知是BQP完全的，因而通常被认为不可去量子化。本文旨在通过考察稀疏访问输入模型的实例（特别是其输入矩阵）来打破这一固有认知。最终，本文构建了一种可验证可去量子化性的框架，该框架可在给定任意输入时应用。