Benchmarking variational quantum simulation against an exact solution Article Swipe
Implementing variational quantum algorithms with noisy intermediate-scale quantum machines of up to a hundred of qubits is nowadays considered as one of the most promising routes towards achieving quantum practical advantage. In multiqubit circuits, running advanced quantum algorithms is hampered by the noise inherent to quantum gates which distances us from the idea of universal quantum computing. Basing on a one-dimensional quantum spin chain with competing symmetric and asymmetric pairwise exchange interactions herein, we discuss capabilities of quantum algorithms with special attention paid to hardware-efficient variational eigensolver. A delicate interplay between magnetic interactions allows one to stabilize a chiral state that destroys homogeneity of magnetic ordering, making thus this solution to be highly entangled. Quantifying entanglement in terms of quantum concurrence, we argue that, while being capable of correctly reproducing a uniform magnetic configuration, variational ansatz is not able to provide a detailed description to a chiral magnetic background. The latter naturally limits application range of variational quantum computing to solve quantum simulation tasks.
Related Topics To Compare & Contrast
- Type
- preprint
- Language
- en
- Landing Page
- https://arxiv.org/abs/2105.06208v1
- OA Status
- green
- Cited By
- 3
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W3163792723