Metraipolis › archive › dc_ccba37076afc
Heuristically optimizing, synthesizing, and prioritizing measurement settings for quantum state tomography — arXiv:2609.02633
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.02633
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T06:05:44.326Z
- SHA-256 of the archived text
c98c0717384d04e82b3a8ec8c9ff722732869596be6fa62265e8568c7eb36e3e- Stable URL of this page
https://metraipolis.com/documento/dc_ccba37076afc
How to cite
Heuristically optimizing, synthesizing, and prioritizing measurement settings for quantum state tomography — arXiv:2609.02633 — arXiv (en), https://arxiv.org/abs/2609.02633 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ccba37076afc (Metraipolis archive dc_ccba37076afc, sha256 c98c0717384d04e82b3a8ec8c9ff722732869596be6fa62265e8568c7eb36e3e)
BibTeX
@misc{dcccba37076afc,
title = {Heuristically optimizing, synthesizing, and prioritizing measurement settings for quantum state tomography — arXiv:2609.02633},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.02633},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ccba37076afc; sha256 c98c0717384d04e82b3a8ec8c9ff722732869596be6fa62265e8568c7eb36e3e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.02633. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A key task in many quantum-computing applications, e.g., quantum simulation and quantum state tomography (QST), is to partition an arbitrary set of operators into mutually commuting subsets for efficient measurements. However, brute-force approaches to this task quickly become intractable as the number and dimensionality of operators grow. Here, we reformulate operator partitioning as a graph-coloring (GC) problem and develop an efficient computational framework to solve it, balancing accuracy and efficiency. Our framework enables leveraging a range of GC algorithms, which we benchmark for operator partitioning. Then, we demonstrate their utility in optimizing QST experiments, where determining non-overlapping data acquisition settings for QST is a major challenge, and prioritizing among these settings, i.e., selecting the experiments that provide the most information. We further show how to perform these experiments by synthesizing Clifford circuits for joint measurement of commuting Pauli operators in multi-qubit systems. We validate our framework across multi-qubit (up to five qubits), multi-qutrit (up to three qutrits), and hybrid qubit-qutrit systems. Our results show that heuristic GC methods substantially reduce the number of required measurement settings for QST and enable priority-based scheduling that maximizes the information gain per experiment. The optimization converges within minutes on a student-grade laptop, providing speedups of several orders of magnitude over brute-force methods already for these relatively small quantum systems. This demonstrates the potential of GC heuristics as a scalable and practical tool for characterization of noisy intermediate-scale quantum devices. We have made the Python implementation of our GC framework to optimize and schedule QST experiments publicly available at this https URL . Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-03 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.02633 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T05:51:04.246Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).