Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2312.17146 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916579655024640 |
|---|---|
| author | Anand, Abhinav Brown, Kenneth R. |
| author_facet | Anand, Abhinav Brown, Kenneth R. |
| contents | One promising application of near-term quantum devices is to prepare trial wavefunctions using short circuits for solving different problems via variational algorithms. For this purpose, we introduce a new circuit design that combines graph-based diagonalization circuits with arbitrary single-qubit rotation gates to get Hamiltonian-based graph states ansätze (H-GSA). We test the accuracy of the proposed ansatz in estimating ground state energies of various molecules of size up to 12-qubits. Additionally, we compare the gate count and parameter number complexity of the proposed ansatz against previously proposed schemes and find an order magnitude reduction in gate count complexity with slight increase in the number of parameters. Our work represents a significant step towards constructing compact quantum circuits with good trainability and convergence properties and applications in solving chemistry and physics problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_17146 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Hamiltonian-based graph-state ansatz for variational quantum algorithms Anand, Abhinav Brown, Kenneth R. Quantum Physics Chemical Physics One promising application of near-term quantum devices is to prepare trial wavefunctions using short circuits for solving different problems via variational algorithms. For this purpose, we introduce a new circuit design that combines graph-based diagonalization circuits with arbitrary single-qubit rotation gates to get Hamiltonian-based graph states ansätze (H-GSA). We test the accuracy of the proposed ansatz in estimating ground state energies of various molecules of size up to 12-qubits. Additionally, we compare the gate count and parameter number complexity of the proposed ansatz against previously proposed schemes and find an order magnitude reduction in gate count complexity with slight increase in the number of parameters. Our work represents a significant step towards constructing compact quantum circuits with good trainability and convergence properties and applications in solving chemistry and physics problems. |
| title | Hamiltonian-based graph-state ansatz for variational quantum algorithms |
| topic | Quantum Physics Chemical Physics |
| url | https://arxiv.org/abs/2312.17146 |