1. Dequantizability from inputs
- Author
-
Kim, Tae-Won and Choi, Byung-Soo
- Subjects
Quantum Physics ,Computer Science - Computational Complexity ,Computer Science - Data Structures and Algorithms - Abstract
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.
- Published
- 2024