A Game-Theoretic Quantum Algorithm for Solving Magic Squares
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914423458758656 |
|---|---|
| author | Chehade, Sarah Delgado, Andrea Wong, Elaine |
| author_facet | Chehade, Sarah Delgado, Andrea Wong, Elaine |
| contents | Variational quantum algorithms (VQAs) offer a promising near-term approach to finding optimal quantum strategies for playing non-local games. These games test quantum correlations beyond classical limits and enable entanglement verification. In this work, we present a variational framework for the Magic Square Game (MSG), a two-player non-local game with perfect quantum advantage. We construct a value Hamiltonian that encodes the game's parity and consistency constraints, then optimize parameterized quantum circuits to minimize this cost. Our approach builds on the stabilizer formalism, leverages commutation structure for circuit design, and is hardware-efficient. Compared to existing work, our contribution emphasizes algebraic structure and interpretability. We validate our method through numerical experiments and outline generalizations to larger games. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_13366 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Game-Theoretic Quantum Algorithm for Solving Magic Squares Chehade, Sarah Delgado, Andrea Wong, Elaine Quantum Physics Variational quantum algorithms (VQAs) offer a promising near-term approach to finding optimal quantum strategies for playing non-local games. These games test quantum correlations beyond classical limits and enable entanglement verification. In this work, we present a variational framework for the Magic Square Game (MSG), a two-player non-local game with perfect quantum advantage. We construct a value Hamiltonian that encodes the game's parity and consistency constraints, then optimize parameterized quantum circuits to minimize this cost. Our approach builds on the stabilizer formalism, leverages commutation structure for circuit design, and is hardware-efficient. Compared to existing work, our contribution emphasizes algebraic structure and interpretability. We validate our method through numerical experiments and outline generalizations to larger games. |
| title | A Game-Theoretic Quantum Algorithm for Solving Magic Squares |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2505.13366 |