Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.13721 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909511217840128 |
|---|---|
| author | Shang, Zhong-Xia Zhao, Qi |
| author_facet | Shang, Zhong-Xia Zhao, Qi |
| contents | Estimating quantum amplitude, or the overlap between two quantum states, is a fundamental task in quantum computing and underpins numerous quantum algorithms. In this work, we introduce a novel algorithmic framework for quantum amplitude estimation by transforming pure states into their matrix forms (Matrixization) and encoding them into non-diagonal blocks of density operators and diagonal blocks of unitary operators. Utilizing the construction details of state preparation circuits, we systematically reconstruct amplitude estimation algorithms within the novel matrixization framework through a technique known as channel block encoding. Compared with the standard approach, amplitude estimation through matrixization can have a different complexity that depends on the entanglement properties of the two quantum states. Specifically, our new algorithm can have exponentially smaller gate complexity when one of the two quantum states is prepared by a linear-depth quantum circuit that is below maximal entanglement under a certain bi-partition and the other state is maximally entangled. We later generalize this result to broader regimes and discuss implications. Our results demonstrate that the near-optimal performance of the standard amplitude estimation algorithm can be surpassed in specific cases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_13721 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Entanglement-induced exponential advantage in amplitude estimation via state matrixization Shang, Zhong-Xia Zhao, Qi Quantum Physics Estimating quantum amplitude, or the overlap between two quantum states, is a fundamental task in quantum computing and underpins numerous quantum algorithms. In this work, we introduce a novel algorithmic framework for quantum amplitude estimation by transforming pure states into their matrix forms (Matrixization) and encoding them into non-diagonal blocks of density operators and diagonal blocks of unitary operators. Utilizing the construction details of state preparation circuits, we systematically reconstruct amplitude estimation algorithms within the novel matrixization framework through a technique known as channel block encoding. Compared with the standard approach, amplitude estimation through matrixization can have a different complexity that depends on the entanglement properties of the two quantum states. Specifically, our new algorithm can have exponentially smaller gate complexity when one of the two quantum states is prepared by a linear-depth quantum circuit that is below maximal entanglement under a certain bi-partition and the other state is maximally entangled. We later generalize this result to broader regimes and discuss implications. Our results demonstrate that the near-optimal performance of the standard amplitude estimation algorithm can be surpassed in specific cases. |
| title | Entanglement-induced exponential advantage in amplitude estimation via state matrixization |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2408.13721 |