Dequantizability from inputs
Quantum Physics
2024-05-24 v1 Computational Complexity
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.
Cite
@article{arxiv.2405.13273,
title = {Dequantizability from inputs},
author = {Tae-Won Kim and Byung-Soo Choi},
journal= {arXiv preprint arXiv:2405.13273},
year = {2024}
}