Expectation value estimation with parametrized quantum circuits
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915556246945792 |
|---|---|
| author | Wu, Bujiao Kong, Lingyu Yan, Yuxuan Wei, Fuchuan Liu, Zhenhuan |
| author_facet | Wu, Bujiao Kong, Lingyu Yan, Yuxuan Wei, Fuchuan Liu, Zhenhuan |
| contents | Estimating properties of quantum states, such as fidelities, molecular energies, and correlation functions, is a fundamental task in quantum information science. Due to the limitation of practical quantum devices, including limited circuit depth and connectivity, estimating even linear properties encounters high sample complexity. To address this inefficiency, we propose a framework that optimizes sample complexity for estimating the expectation value of any observable using a shallow parameterized quantum circuit. Within this framework, we introduce two decomposition algorithms, a tensor network approach and a greedy projection approach that decompose the target observable into a linear combination of multiple observables, each of which can be diagonalized with the shallow circuit. Using this decomposition, we then apply an importance sampling algorithm to estimate the expectation value of the target observable. We numerically demonstrate the performance of our algorithm by estimating the expectation values of some specific Hamiltonians and inner product of a Slater determinant with a pure state, highlighting advantages compared to some conventional methods. Additionally, we derive the fundamental lower bound for the sample complexity required to estimate a target observable using a given shallow quantum circuit, thereby enhancing our understanding of the capabilities of shallow circuits in quantum learning tasks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_19499 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Expectation value estimation with parametrized quantum circuits Wu, Bujiao Kong, Lingyu Yan, Yuxuan Wei, Fuchuan Liu, Zhenhuan Quantum Physics Estimating properties of quantum states, such as fidelities, molecular energies, and correlation functions, is a fundamental task in quantum information science. Due to the limitation of practical quantum devices, including limited circuit depth and connectivity, estimating even linear properties encounters high sample complexity. To address this inefficiency, we propose a framework that optimizes sample complexity for estimating the expectation value of any observable using a shallow parameterized quantum circuit. Within this framework, we introduce two decomposition algorithms, a tensor network approach and a greedy projection approach that decompose the target observable into a linear combination of multiple observables, each of which can be diagonalized with the shallow circuit. Using this decomposition, we then apply an importance sampling algorithm to estimate the expectation value of the target observable. We numerically demonstrate the performance of our algorithm by estimating the expectation values of some specific Hamiltonians and inner product of a Slater determinant with a pure state, highlighting advantages compared to some conventional methods. Additionally, we derive the fundamental lower bound for the sample complexity required to estimate a target observable using a given shallow quantum circuit, thereby enhancing our understanding of the capabilities of shallow circuits in quantum learning tasks. |
| title | Expectation value estimation with parametrized quantum circuits |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2407.19499 |