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:math-ph/0112015 · Theoretical and Mathematical Physics

On a problem posed by Pauli

Boris Zelikovich Moroz, A. M. Perelomov

Published Oct 1, 1994• 22 citations
arXivHTMLPDF
DOI
10.1007/bf01079256

Related papers

Pauli problem and related mathematical problems

Павел Андреевич Белоусов, Rais Sal'manovich Ismagilov

Theoretical and Mathematical Physics•Oct 1, 2008•8 citations

The Problem of Small Violations of the Pauli Principle

A. Yu. Ignatiev, V.A. Kuzmin

Springer eBooks•Jan 1, 1989•0 citations

On a question of W. Pauli

Boris Zelikovich Moroz, A. M. Perelomov

•Jan 1, 1993•1 citation

Simple algorithms to test and learn local Hamiltonians

Francisco Escudero Gutiérrez

We consider the problems of testing and learning an $n$-qubit $k$-local Hamiltonian from queries to its evolution operator with respect the 2-norm of the Pauli spectrum, or equivalently, the normalized Frobenius norm. For testing whether a Hamiltonian is $ε_1$-close to $k$-local or $ε_2$-far from $k$-local, we show that $O(1/(ε_2-ε_1)^{8})$ queries suffice. This solves two questions posed in a recent work by Bluhm, Caro and Oufkir. For learning up to error $ε$, we show that $\exp(O(k^2+k\log(1/ε)))$ queries suffice. Our proofs are simple, concise and based on Pauli-analytic techniques.

arXiv:2404.06282•Apr 9, 2024•15 citations

Efficient Pauli Operator Generation via Hierarchical Matrix Compression for Quantum-Ready Electromagnetic Solvers

Noora Al-Sultani, Su Yan

Quantum linear solvers require expressing the system matrix as a sum of Pauli operators, a process whose computational cost scales exponentially with problem size. For electromagnetic integral equations discretized by the method of moments (MoM), the resulting dense impedance matrices pose a significant challenge for quantum operator generation. This paper demonstrates that hierarchical matrix$(\mathcal{H}$-matrix) compression provides an effective mechanism for reducing Pauli operator complexity. By restricting Pauli decomposition to low-rank far-field blocks identified through$\mathcal{H}$-matrix partitioning, the number of significant Pauli terms is reduced by over 95% compared to full-matrix decomposition, while maintaining approximation accuracy on the order of 10−5in relative Frobenius norm. Numerical experiments on a spherical scatterer confirm that the proposed block-wise approach offers a practical pathway toward quantum-compatible formulations of large-scale electromagnetic problems.

Digest - IEEE Antennas and Propagation Society. International Symposium•Jul 1, 2026•0 citations

Combining moment matrices, symmetric extension, and Lovász theta: $Φ_{\text{E8}}$ is entangled

Jȩdrzej Stempin, Gerard Anglès Munné, Santiago Llorens +1 more

We solve an open problem in entanglement theory posed by Yu et al., {\it Nature Communications 12, 1012 (2021)}. The problem is to show, via an entanglement witness, that the $14$-qubit state $Φ_{\text{E8}}$ is entangled. Inspired by a method from quantum codes, we combine symmetric extension with moment matrices to prove that $Φ_{\text{E8}}$ is entangled. The proof has the form of a rational infeasibility certificate for a semidefinite program, yielding an explicit entanglement witness. Our approach unifies and extends several earlier methods that involve the Lovász theta number of the Pauli anti-commutativity graph, promising scalability and flexibility in further applications.

quant-pharXiv:2605.13832•May 14, 2026•0 citations
We consider the problems of testing and learning an nnn-qubit kkk-local Hamiltonian from queries to its evolution operator with respect the 2-norm of the Pauli spectrum, or equivalently, the normalized Frobenius norm. For testing whether a Hamiltonian is ε1ε_1ε1​-close to kkk-local or ε2ε_2ε2​-far from kkk-local, we show that O(1/(ε2−ε1)8)O(1/(ε_2-ε_1)^{8})O(1/(ε2​−ε1​)8) queries suffice. This solves two questions posed in a recent work by Bluhm, Caro and Oufkir. For learning up to error εεε, we show that exp⁡(O(k2+klog⁡(1/ε)))\exp(O(k^2+k\log(1/ε)))exp(O(k2+klog(1/ε))) queries suffice. Our proofs are simple, concise and based on Pauli-analytic techniques.
Quantum linear solvers require expressing the system matrix as a sum of Pauli operators, a process whose computational cost scales exponentially with problem size. For electromagnetic integral equations discretized by the method of moments (MoM), the resulting dense impedance matrices pose a significant challenge for quantum operator generation. This paper demonstrates that hierarchical matrix(H(\mathcal{H}(H-matrix) compression provides an effective mechanism for reducing Pauli operator complexity. By restricting Pauli decomposition to low-rank far-field blocks identified throughH\mathcal{H}H-matrix partitioning, the number of significant Pauli terms is reduced by over 95% compared to full-matrix decomposition, while maintaining approximation accuracy on the order of 10−5in relative Frobenius norm. Numerical experiments on a spherical scatterer confirm that the proposed block-wise approach offers a practical pathway toward quantum-compatible formulations of large-scale electromagnetic problems.
Combining moment matrices, symmetric extension, and Lovász theta: ΦE8Φ_{\text{E8}}ΦE8​ is entangled
We solve an open problem in entanglement theory posed by Yu et al., {\it Nature Communications 12, 1012 (2021)}. The problem is to show, via an entanglement witness, that the 141414-qubit state ΦE8Φ_{\text{E8}}ΦE8​ is entangled. Inspired by a method from quantum codes, we combine symmetric extension with moment matrices to prove that ΦE8Φ_{\text{E8}}ΦE8​ is entangled. The proof has the form of a rational infeasibility certificate for a semidefinite program, yielding an explicit entanglement witness. Our approach unifies and extends several earlier methods that involve the Lovász theta number of the Pauli anti-commutativity graph, promising scalability and flexibility in further applications.