From Pauli Strings to Quantum Dynamics: A Unified Characterization

• URL: http://arxiv.org/abs/2606.09773v1
• Date: Mon, 08 Jun 2026 17:33:15 GMT
• Title: From Pauli Strings to Quantum Dynamics: A Unified Characterization
• Abstract summary: We focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem.<n>We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections.<n>We show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Understanding the dynamical properties of quantum systems is an essential task in quantum computing, quantum control, and many-body physics. Tools such as representation theory and Lie theory provide crucial information on reachability and computational power. However, this information can be difficult to access exactly or compute efficiently for arbitrary generating sets. Here we focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem. We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections, through the symplectic properties of the Pauli strings. This allows us to give an invariant-based perspective on these objects and their reachability, in the language of Pauli orbits, symmetries, and invariant subspaces. The invariant-based approach provides efficient algorithms for identifying Lie algebras and orbits, as well as a simple framework for analyzing structured Pauli generating sets. We also show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups. We illustrate the framework through structured examples from variational quantum algorithms, restricted quantum computation, many-body systems, and random circuits.

Related papers

• A High-Performance Pauli-Algebra Framework for Large-Scale Quantum Simulations [17.193239183791277]
  We present a high-performance Pauli-algebra framework tailored to quantum many-body and quantum-chemical simulations.<n>The framework combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations.<n>The resulting Julia/Ctexttt++ implementation accelerates Pauli multiplication, Hamiltonian construction, and operator--state multiplication in sparse and symmetry-adapted many-electron spaces.
  arXiv  Detail & Related papers  (2026-06-27T14:51:19Z)
• Matrix Elements of Fermionic Gaussian Operators in Arbitrary Pauli Bases: A Pfaffian Formula [0.0]
  We introduce a fully explicit and general Pfaffian formula for the matrix elements of fermionic Gaussian operators between arbitrary Pauli product states.<n>The resulting framework enables scalable computations across diverse fields.
  arXiv  Detail & Related papers  (2025-06-03T12:37:06Z)
• A complete theory of the Clifford commutant [0.2796197251957244]
  The Clifford group plays a central role in quantum information science.<n>It is the building block for many error-correcting schemes and matches the first three moments of the Haar measure over the unitary group.<n>At the heart of understanding many properties of the Clifford group lies the Clifford commutant.
  arXiv  Detail & Related papers  (2025-04-16T17:21:34Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Full classification of Pauli Lie algebras [0.29998889086656577]
  We provide a comprehensive classification of Lie algebras generated by an arbitrary set of Pauli operators. We find a no-go result for the existence of small Lie algebras beyond the free-fermionic case in the Pauli setting. These results bear significant impact in ideas in a number of fields like quantum control, quantum machine learning, or classical simulation of quantum circuits.
  arXiv  Detail & Related papers  (2024-07-31T18:00:11Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Attribute Fusion-based Evidential Classifier on Quantum Circuits [22.096543893284995]
  Dempster-Shafer Theory (DST) as an effective and robust framework for handling uncertain information is applied in decision-making and pattern classification. People attempt to address the issue by taking advantage of its consistency with quantum computing to implement DST operations on quantum circuits and realize speedup. In this paper, we find that Boolean algebra as an essential mathematical tool bridges the definition of DST and quantum computing.
  arXiv  Detail & Related papers  (2024-01-02T15:01:20Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Clifford Algebras, Quantum Neural Networks and Generalized Quantum Fourier Transform [0.0]
  We propose models of quantum neural networks through Clifford algebras. The Clifford algebras are the natural framework for multidimensional data analysis in a quantum setting.
  arXiv  Detail & Related papers  (2022-06-03T20:29:59Z)
• Pauli component erasing quantum channels [58.720142291102135]
  We propose a family of quantum maps that preserve or completely erase the components of a multi-qubit system. For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace. We show that the obtained family of channels forms a semigroup and derive its generators.
  arXiv  Detail & Related papers  (2022-05-12T00:11:43Z)
• Classical shadows with Pauli-invariant unitary ensembles [0.0]
  We consider the class of Pauli-invariant unitary ensembles that are invariant under multiplication by a Pauli operator. Our results pave the way for more efficient or robust protocols for predicting important properties of quantum states.
  arXiv  Detail & Related papers  (2022-02-07T15:06:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.