Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.13273 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916255411208192 |
|---|---|
| author | Kim, Tae-Won Choi, Byung-Soo |
| author_facet | Kim, Tae-Won Choi, Byung-Soo |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_13273 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Dequantizability from inputs Kim, Tae-Won Choi, Byung-Soo Quantum Physics Computational Complexity Data Structures and Algorithms 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. |
| title | Dequantizability from inputs |
| topic | Quantum Physics Computational Complexity Data Structures and Algorithms |
| url | https://arxiv.org/abs/2405.13273 |