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:1909.08123 · Research in the Mathematical Sciences

On sets of maximally commuting and anticommuting Pauli operators

Rahul Sarkar, E. van den Berg

Published Feb 15, 2021• 26 citations
arXivHTMLPDF
DOI
10.1007/s40687-020-00244-1

Related papers

Inequivalent Representations of Commutator or Anticommutator Rings of Field Operators and Their Applications

M. Matejka, M. Noga

arXiv:quant-ph/0602043•International Journal of Theoretical Physics•Feb 7, 2007•1 citation

A theorem on canonical commutation and anticommutation relations

Gianfausto Dell’Antonio, Sergio Doplicher, David Pierre Ruelle

Communications in Mathematical Physics•Dec 1, 1966•42 citations

Efficient Construction of Involutory Linear Combinations of Anticommuting Pauli Generators for Large-Scale Iterative Qubit Coupled Cluster Calculations

Ilya G. Ryabinkin, Andrew Jena, Scott N. Genin

We present an efficient method for construction of a fully anticommutative set of Pauli generators (elements of the Pauli group) from a commutative set of operators that are composed exclusively from Pauli x̂ operators (purely X generators) and sorted by an associated numerical measure, such as absolute energy gradients. Our approach uses the Gauss–Jordan elimination applied to a binary matrix that encodes the set of X generators to bring it to the reduced row-echelon form, followed by the construction of an anticommutative system in a standard basis by means of a modified Jordan–Wigner transformation and returning to the original basis. The algorithm complexity is linear in the size of the X set and quadratic in the number of qubits. The resulting anticommutative sets are used to construct the qubit coupled cluster Ansatz with involutory linear combinations of anticommuting Paulis (QCC-ILCAP) proposed in J. Chem. Theory Comput. 2021, 17 (1), 66–78. We applied the iterative qubit coupled cluster method with the QCC-ILCAP Ansatz to calculations of ground-state potential energy curves for symmetric stretching of the water molecule (36 qubits) and dissociation of N 2 (56 qubits).

arXiv:2301.10690•Journal of Chemical Theory and Computation•Feb 23, 2023•8 citations

Fast Partitioning of Pauli Strings into Commuting Families for Expectation Value Measurements of Dense Operators

Andrew Lytle, Nouman Butt, Ben Reggio +1 more

The cost of measuring quantum expectation values of an operator can be reduced by grouping the Pauli string (SU(2) tensor product) decomposition of the operator into maximally commuting sets. We detail an algorithm, presented in [1], to partition the full set of m-qubit Pauli strings into the minimal number of commuting families, and benchmark the performance with dense Hamiltonians on IBM hardware. Here we also compare how our method scales compared to graph-theoretic techniques for the generally commuting case.

arXiv:2311.08551•International Symposium on Lattice Field Theory (LATTICE)•May 3, 2024•0 citations

Spin Operators and Pauli Matrices

Z. Ficek

•Apr 27, 2016•0 citations

Counterexamples to the fractional coloring conjecture for triply efficient shadow tomography

Jędrzej Stempin, Santiago Llorens, Felix Huber

Fractional graph colorings are useful for the Shadow tomography of Pauli observables. In practice, it is desirable that any experimentally interesting set of Pauli operators has a small fractional chromatic number $χ_{f}$ for its anticommutation graph. Conjecture 13 in King, Gosset, Kothari, and Babbush [PRX Quantum 6, 010336 (2025)] states that if $B_ε(\varrho)$ is the set of Pauli observables having expectation value magnitude at least $ε$ in some given quantum state $\varrho$, then the fractional chromatic number of the anticommutation graph $G$ induced by $B_ε(\varrho)$ is $O(ε^{-2})$. In other words, it asserts that there exists a constant $C$ such that $χ_{f} \cdot ε^2 \leq C$ on all states and graphs. If the conjecture were true, it would imply that there exists a triply efficient Pauli shadow tomography algorithm for {\it any} subset $S$ of Pauli observables, provided that there is also an efficient fractional coloring algorithm for the set $B_ε$. Here we show that the conjecture is false by constructing a family of states and observables for which no finite $C$ satisfying the bound exists. We also give a more general construction relying on the commutation index or $β$ number of a graph. The key ingredient in the proofs can be seen as an instance of the amplification trick, where fractional chromatic numbers, $β$ numbers, and expectation values are amplified through lexicographic graph products.

quant-pharXiv:2608.20113•Aug 21, 2026•0 citations
We present an efficient method for construction of a fully anticommutative set of Pauli generators (elements of the Pauli group) from a commutative set of operators that are composed exclusively from Pauli x̂ operators (purely X generators) and sorted by an associated numerical measure, such as absolute energy gradients. Our approach uses the Gauss–Jordan elimination applied to a binary matrix that encodes the set of X generators to bring it to the reduced row-echelon form, followed by the construction of an anticommutative system in a standard basis by means of a modified Jordan–Wigner transformation and returning to the original basis. The algorithm complexity is linear in the size of the X set and quadratic in the number of qubits. The resulting anticommutative sets are used to construct the qubit coupled cluster Ansatz with involutory linear combinations of anticommuting Paulis (QCC-ILCAP) proposed in J. Chem. Theory Comput. 2021, 17 (1), 66–78. We applied the iterative qubit coupled cluster method with the QCC-ILCAP Ansatz to calculations of ground-state potential energy curves for symmetric stretching of the water molecule (36 qubits) and dissociation of N 2 (56 qubits).
The cost of measuring quantum expectation values of an operator can be reduced by grouping the Pauli string (SU(2) tensor product) decomposition of the operator into maximally commuting sets. We detail an algorithm, presented in [1], to partition the full set of m-qubit Pauli strings into the minimal number of commuting families, and benchmark the performance with dense Hamiltonians on IBM hardware. Here we also compare how our method scales compared to graph-theoretic techniques for the generally commuting case.
Fractional graph colorings are useful for the Shadow tomography of Pauli observables. In practice, it is desirable that any experimentally interesting set of Pauli operators has a small fractional chromatic number χfχ_{f}χf​ for its anticommutation graph. Conjecture 13 in King, Gosset, Kothari, and Babbush [PRX Quantum 6, 010336 (2025)] states that if Bε(ϱ)B_ε(\varrho)Bε​(ϱ) is the set of Pauli observables having expectation value magnitude at least εεε in some given quantum state ϱ\varrhoϱ, then the fractional chromatic number of the anticommutation graph GGG induced by Bε(ϱ)B_ε(\varrho)Bε​(ϱ) is O(ε−2)O(ε^{-2})O(ε−2). In other words, it asserts that there exists a constant CCC such that χf⋅ε2≤Cχ_{f} \cdot ε^2 \leq Cχf​⋅ε2≤C on all states and graphs. If the conjecture were true, it would imply that there exists a triply efficient Pauli shadow tomography algorithm for {\it any} subset SSS of Pauli observables, provided that there is also an efficient fractional coloring algorithm for the set BεB_εBε​. Here we show that the conjecture is false by constructing a family of states and observables for which no finite CCC satisfying the bound exists. We also give a more general construction relying on the commutation index or βββ number of a graph. The key ingredient in the proofs can be seen as an instance of the amplification trick, where fractional chromatic numbers, βββ numbers, and expectation values are amplified through lexicographic graph products.