Quantum heuristics for linear optimization over large separable operators
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908568033165312 |
|---|---|
| author | Mohan, Ankith Haug, Tobias Bharti, Kishor Sikora, Jamie |
| author_facet | Mohan, Ankith Haug, Tobias Bharti, Kishor Sikora, Jamie |
| contents | Optimizing over separable quantum objects is challenging for two key reasons: determining separability is NP-hard, and the dimensionality of the problem grows exponentially with the number of qubits. We address both challenges by introducing a heuristic algorithm that leverages a quantum co-processor to significantly reduce the problem's dimensionality. We then numerically demonstrate that see-saw-type optimization performs well in lower-dimensional settings. A notable feature of our approach is that it yields feasible solutions, not just bounds on the optimal value, in contrast to many outer-approximation-based methods. We apply our method to the problem of finding separable states with minimal energy for a given Hamiltonian and use this to define an entanglement measure for its ground space. Finally, we demonstrate how our approach can approximate the separable ground energy of Hamiltonians up to 28 qubits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_25585 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum heuristics for linear optimization over large separable operators Mohan, Ankith Haug, Tobias Bharti, Kishor Sikora, Jamie Quantum Physics Optimizing over separable quantum objects is challenging for two key reasons: determining separability is NP-hard, and the dimensionality of the problem grows exponentially with the number of qubits. We address both challenges by introducing a heuristic algorithm that leverages a quantum co-processor to significantly reduce the problem's dimensionality. We then numerically demonstrate that see-saw-type optimization performs well in lower-dimensional settings. A notable feature of our approach is that it yields feasible solutions, not just bounds on the optimal value, in contrast to many outer-approximation-based methods. We apply our method to the problem of finding separable states with minimal energy for a given Hamiltonian and use this to define an entanglement measure for its ground space. Finally, we demonstrate how our approach can approximate the separable ground energy of Hamiltonians up to 28 qubits. |
| title | Quantum heuristics for linear optimization over large separable operators |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2509.25585 |