Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2403.07068 · Physical Review Letters

Optimizing Quantum Measurements by Partitioning Multisets of Observables

Otto Veltheim, Esko Keski-Vakkuri

Published Jan 22, 2025• 4 citations
arXivHTMLPDF

Abstract

Quantum tomography approaches typically consider a set of observables that we wish to measure, designing a measurement scheme that measures each of the observables and then repeats the measurements as many times as necessary. We show that instead of considering only the simple set of observables, one should consider a multiset of the observables taking into account the required repetitions, to minimize the number of measurements. This leads to a graph theoretic multicoloring problem. We show that the multiset method offers at most quadratic improvement but it is achievable. Furthermore, despite the NP-hard optimal coloring problem, the multiset approach with greedy coloring algorithms already offers asymptotically quadratic improvement in test cases.

DOI
10.1103/physrevlett.134.030801

Related papers

Optimal design of measurement settings for quantum-state-tomography experiments

Jun Li, Shilin Huang, Zhihuang Luo +3 more

Quantum state tomography is an indispensable but costly part of many quantum experiments. Typically, it requires measurements to be carried out in a number of different settings on a fixed experimental setup. The collected data are often informationally overcomplete, with the amount of information redundancy depending on the particular set of measurement settings chosen. This raises a question about how one should optimally take data so that the number of measurement settings necessary can be reduced. Here, we cast this problem in terms of integer programming. For a given experimental setup, standard integer-programming algorithms allow us to find the minimum set of readout operations that can realize a target tomographic task. We apply the method to certain basic and practical state-tomographic problems in nuclear-magnetic-resonance experimental systems. The results show that considerably fewer readout operations can be found using our technique than by using the previous greedy search strategy. Therefore, our method could be helpful for simplifying measurement schemes to minimize the experimental effort.

arXiv:1705.01524•Physical Review A•Sep 6, 2017•25 citations

Heuristically optimizing, synthesizing, and prioritizing measurement settings for quantum state tomography

Sumukh S. Moudghalya, Anton Frisk Kockum, Akshay Gaikwad

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 https://github.com/ssm8015/QST_GT.git.

quant-pharXiv:2609.02633•Sep 3, 2026•0 citations

Deterministic improvements of quantum measurements with grouping of compatible operators, non-local transformations, and covariance estimates

Tzu-Ching Yen, Aadithya Ganeshram, Artur F. Izmaylov

Obtaining the expectation value of an observable on a quantum computer is a crucial step in the variational quantum algorithms. For complicated observables such as molecular electronic Hamiltonians, one of the strategies is to present the observable as a linear combination of measurable fragments. The main problem of this approach is a large number of measurements required for accurate estimation of the observable's expectation value. We consider three previously studied directions that minimize the number of measurements: (1) grouping commuting operators using the greedy approach, (2) involving non-local unitary transformations for measuring, and (3) taking advantage of compatibility of some Pauli products with several measurable groups. The last direction gives rise to a general framework that not only provides improvements over previous methods but also connects measurement grouping approaches with recent advances in techniques of shadow tomography. Following this direction, we develop two measurement schemes that achieve a severalfold reduction in the number of measurements for a set of model molecules compared to previous state-of-the-art methods.

arXiv:2201.01471•npj Quantum Information•Feb 22, 2023•63 citations

Optimal Overlapping Tomography

Kiara Hansenne, Rui Qu, Lisa T. Weinbrenner +7 more

Characterizing large-scale quantum systems is central to fundamental physics and essential for applications of quantum technologies. While a full characterization requires exponentially increasing resources, focusing on application-relevant information can often lead to significantly simplified analysis. Overlapping tomography is such a scheme, allowing one to obtain all the information contained in specific subsystems of multiparticle quantum systems in an efficient manner, but the ultimate limits of this approach remain elusive. We present protocols for overlapping tomography that are optimal with respect to the number of measurement settings. First, by providing algorithmic approaches based on graph theory we find the minimal number of Pauli settings, relating overlapping tomography to the problem of covering arrays in combinatorics. This significantly reduces the number of measurement settings, showing for instance that two-body overlapping tomography of nearest neighbors in qubit systems with planar topologies can always be performed with nine Pauli settings. Second, we prove that using general projective measurements, all k-body marginals can be reconstructed with only 3^{k} settings, independently of the system size. Finally, we demonstrate the practical applicability of our methods in a six-photon experiment. Our results will find applications in learning noise and interaction patterns in quantum computers as well as characterizing fermionic systems in quantum chemistry.

arXiv:2408.05730•Physical Review Letters•Jul 14, 2025•6 citations

Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms

Young-Hyun Oh, Hamed Mohammadbagherpoor, Patrick Dreher +3 more

The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach. Graph coloring is one of the essential fields to provide an efficient solution for combinatorial applications such as flight scheduling, frequency allocation in networking, and register allocation. In particular, some optimization algorithms have been proposed to solve the multi-coloring graph problems but most of the cases a simple searching method would be the best approach to find an optimal solution for graph coloring problems. However, this naive approach can increase the computation cost exponentially as the graph size and the number of colors increase. To mitigate such intolerable overhead, we investigate the methods to take the advantages of quantum computing properties to find a solution for multi-coloring graph problems in polynomial time. We utilize the variational quantum eigensolver (VQE) technique and quantum approximate optimization algorithm (QAOA) to find solutions for three combinatorial applications by both transferring each problem model to the corresponding Ising model and by using the calculated Hamiltonian matrices. Our results demonstrate that VQE and QAOA algorithms can find one of the best solutions for each application. Therefore, our modeling approach with hybrid quantum algorithms can be applicable for combinatorial problems in various fields to find an optimal solution in polynomial time.

arXiv:1911.00595•Nov 1, 2019•12 citations

Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization

Tristan Zaborniak, Prashanti Priya Angara, Vikram Khipple Mulligan +2 more

We introduce a qubit- and gate-efficient higher-order unconstrained binary optimization (HUBO) encoding for graph partitioning problems requiring label-count minimization. This widely applicable class of problems includes minimum graph coloring, minimum \textit{k}-cut, and community detection. To the best of our knowledge, this is the first work to address the optimization versions of these problems in a quantum setting, rather than only their decision counterparts. Our construction encodes each vertex variable in a number of bits logarithmic in the number of available labels---the information-theoretic minimum---and employs a novel lexicographic penalty system that implicitly minimizes partition count without requiring dedicated indicator variables. We derive provably sufficient conditions on all penalty coefficients, including those arising from Rosenberg quadratization, guaranteeing feasibility and optimality of the lowest-energy solution. Analogous conditions are derived for a one-hot encoding to enable controlled comparison. We also show that our encoding reduces two-qubit gate count per layer of the quantum approximate optimization algorithm (QAOA). Benchmarking on a quantum annealer demonstrates that our logarithmic encoding greatly improves solution quality and time-to-solution for minimum graph coloring relative to one-hot encoding, with greater advantage as problem size increases.

quant-pharXiv:2604.21123•Apr 24, 2026•0 citations
Quantum tomography approaches typically consider a set of observables that we wish to measure, designing a measurement scheme that measures each of the observables and then repeats the measurements as many times as necessary. We show that instead of considering only the simple set of observables, one should consider a multiset of the observables taking into account the required repetitions, to minimize the number of measurements. This leads to a graph theoretic multicoloring problem. We show that the multiset method offers at most quadratic improvement but it is achievable. Furthermore, despite the NP-hard optimal coloring problem, the multiset approach with greedy coloring algorithms already offers asymptotically quadratic improvement in test cases.
Quantum state tomography is an indispensable but costly part of many quantum experiments. Typically, it requires measurements to be carried out in a number of different settings on a fixed experimental setup. The collected data are often informationally overcomplete, with the amount of information redundancy depending on the particular set of measurement settings chosen. This raises a question about how one should optimally take data so that the number of measurement settings necessary can be reduced. Here, we cast this problem in terms of integer programming. For a given experimental setup, standard integer-programming algorithms allow us to find the minimum set of readout operations that can realize a target tomographic task. We apply the method to certain basic and practical state-tomographic problems in nuclear-magnetic-resonance experimental systems. The results show that considerably fewer readout operations can be found using our technique than by using the previous greedy search strategy. Therefore, our method could be helpful for simplifying measurement schemes to minimize the experimental effort.
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 https://github.com/ssm8015/QST_GT.git.
Obtaining the expectation value of an observable on a quantum computer is a crucial step in the variational quantum algorithms. For complicated observables such as molecular electronic Hamiltonians, one of the strategies is to present the observable as a linear combination of measurable fragments. The main problem of this approach is a large number of measurements required for accurate estimation of the observable's expectation value. We consider three previously studied directions that minimize the number of measurements: (1) grouping commuting operators using the greedy approach, (2) involving non-local unitary transformations for measuring, and (3) taking advantage of compatibility of some Pauli products with several measurable groups. The last direction gives rise to a general framework that not only provides improvements over previous methods but also connects measurement grouping approaches with recent advances in techniques of shadow tomography. Following this direction, we develop two measurement schemes that achieve a severalfold reduction in the number of measurements for a set of model molecules compared to previous state-of-the-art methods.
Characterizing large-scale quantum systems is central to fundamental physics and essential for applications of quantum technologies. While a full characterization requires exponentially increasing resources, focusing on application-relevant information can often lead to significantly simplified analysis. Overlapping tomography is such a scheme, allowing one to obtain all the information contained in specific subsystems of multiparticle quantum systems in an efficient manner, but the ultimate limits of this approach remain elusive. We present protocols for overlapping tomography that are optimal with respect to the number of measurement settings. First, by providing algorithmic approaches based on graph theory we find the minimal number of Pauli settings, relating overlapping tomography to the problem of covering arrays in combinatorics. This significantly reduces the number of measurement settings, showing for instance that two-body overlapping tomography of nearest neighbors in qubit systems with planar topologies can always be performed with nine Pauli settings. Second, we prove that using general projective measurements, all k-body marginals can be reconstructed with only 3^{k} settings, independently of the system size. Finally, we demonstrate the practical applicability of our methods in a six-photon experiment. Our results will find applications in learning noise and interaction patterns in quantum computers as well as characterizing fermionic systems in quantum chemistry.
The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach. Graph coloring is one of the essential fields to provide an efficient solution for combinatorial applications such as flight scheduling, frequency allocation in networking, and register allocation. In particular, some optimization algorithms have been proposed to solve the multi-coloring graph problems but most of the cases a simple searching method would be the best approach to find an optimal solution for graph coloring problems. However, this naive approach can increase the computation cost exponentially as the graph size and the number of colors increase. To mitigate such intolerable overhead, we investigate the methods to take the advantages of quantum computing properties to find a solution for multi-coloring graph problems in polynomial time. We utilize the variational quantum eigensolver (VQE) technique and quantum approximate optimization algorithm (QAOA) to find solutions for three combinatorial applications by both transferring each problem model to the corresponding Ising model and by using the calculated Hamiltonian matrices. Our results demonstrate that VQE and QAOA algorithms can find one of the best solutions for each application. Therefore, our modeling approach with hybrid quantum algorithms can be applicable for combinatorial problems in various fields to find an optimal solution in polynomial time.
We introduce a qubit- and gate-efficient higher-order unconstrained binary optimization (HUBO) encoding for graph partitioning problems requiring label-count minimization. This widely applicable class of problems includes minimum graph coloring, minimum \textit{k}-cut, and community detection. To the best of our knowledge, this is the first work to address the optimization versions of these problems in a quantum setting, rather than only their decision counterparts. Our construction encodes each vertex variable in a number of bits logarithmic in the number of available labels---the information-theoretic minimum---and employs a novel lexicographic penalty system that implicitly minimizes partition count without requiring dedicated indicator variables. We derive provably sufficient conditions on all penalty coefficients, including those arising from Rosenberg quadratization, guaranteeing feasibility and optimality of the lowest-energy solution. Analogous conditions are derived for a one-hot encoding to enable controlled comparison. We also show that our encoding reduces two-qubit gate count per layer of the quantum approximate optimization algorithm (QAOA). Benchmarking on a quantum annealer demonstrates that our logarithmic encoding greatly improves solution quality and time-to-solution for minimum graph coloring relative to one-hot encoding, with greater advantage as problem size increases.