A Symmetry-Based Taxonomy of Quantum Algorithms

• URL: http://arxiv.org/abs/2508.09236v1
• Date: Tue, 12 Aug 2025 12:08:43 GMT
• Title: A Symmetry-Based Taxonomy of Quantum Algorithms
• Authors: Sakshi Kumar, Sumit Chilkoti, Mrittunjoy Guha Majumdar,
• Abstract summary: We propose a taxonomy for quantum algorithms grounded in the fundamental symmetries, both continuous and discrete, underlying quantum state spaces, oracles, and circuit dynamics.<n>This symmetry-centric classification not only reflects the deep connection between symmetries and conservation laws in physics, but also yields practical benefits for scalable and reliable quantum computation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a taxonomy for quantum algorithms grounded in the fundamental symmetries, both continuous and discrete, underlying quantum state spaces, oracles, and circuit dynamics. By organizing algorithms according to their symmetry groups and invariants, we define distinct algorithm classes whose behavior, verification, and complexity can be characterized by the symmetries they preserve or exploit. This symmetry-centric classification not only reflects the deep connection between symmetries and conservation laws in physics, but also yields practical benefits for scalable and reliable quantum computation.

Related papers

• Anomalies on the Lattice, Homotopy of Quantum Cellular Automata, and a Spectrum of Invertible States [41.99844472131922]
  We develop a rigorous theory of anomalies on the lattice, which are obstructions to gauging global symmetries and the existence of trivial symmetric states.<n>We also construct $$-spectra of a class of invertible states and quantum cellular automata, which allows us to classify both anomalies and symmetry protected topological phases up to blend equivalence.
  arXiv  Detail & Related papers  (2025-12-01T19:00:01Z)
• Spin-Adapted Fermionic Unitaries: From Lie Algebras to Compact Quantum Circuits [0.013714053458441644]
  We introduce a minimum universal symmetry-adapted operator pool to further reduce the required quantum resources.<n>Conservation of symmetries plays a crucial role in both classical and quantum simulations of many-body systems.
  arXiv  Detail & Related papers  (2025-11-17T15:21:22Z)
• Predicting symmetries of quantum dynamics with optimal samples [41.42817348756889]
  Identifying symmetries in quantum dynamics is a crucial challenge with profound implications for quantum technologies.<n>We introduce a unified framework combining group representation theory and subgroup hypothesis testing to predict these symmetries with optimal efficiency.<n>We prove that parallel strategies achieve the same performance as adaptive or indefinite-causal-order protocols.
  arXiv  Detail & Related papers  (2025-02-03T15:57:50Z)
• Symmetric quantum computation [2.928964540437144]
  "symmetric quantum circuits" are a restricted model of quantum computation where the restriction is symmetry-based.<n>We show that symmetric quantum circuits go beyond the capabilities of their classical counterparts by efficiently implementing key quantum subroutines.
  arXiv  Detail & Related papers  (2025-01-02T11:54:13Z)
• Quantum Algorithms for Realizing Symmetric, Asymmetric, and Antisymmetric Projectors [3.481985817302898]
  Knowing the symmetries of a given system or state obeys or disobeys is often useful in quantum computing. We present a collection of quantum algorithms that realize projections onto the symmetric subspace. We show how projectors can be combined in a systematic way to effectively measure various projections in a single quantum circuit.
  arXiv  Detail & Related papers  (2024-07-24T18:00:07Z)
• Semicoherent Symmetric Quantum Processes: Theory and Applications [3.6190123930006317]
  We consider the interplay between the $varepsilon$-approximate processes and the exact symmetries in a semicoherent context. Our work paves the way for a deeper understanding and greater appreciation of how symmetries can be used to control quantum dynamics.
  arXiv  Detail & Related papers  (2024-03-08T17:33:33Z)
• Symmetry-restricted quantum circuits are still well-behaved [45.89137831674385]
  We show that quantum circuits restricted by a symmetry inherit the properties of the whole special unitary group $SU(2n)$. It extends prior work on symmetric states to the operators and shows that the operator space follows the same structure as the state space.
  arXiv  Detail & Related papers  (2024-02-26T06:23:39Z)
• Efficient quantum algorithms for testing symmetries of open quantum systems [17.55887357254701]
  In quantum mechanics, it is possible to eliminate degrees of freedom by leveraging symmetry to identify the possible physical transitions. Previous works have focused on devising quantum algorithms to ascertain symmetries by means of fidelity-based symmetry measures. We develop alternative symmetry testing quantum algorithms that are efficiently implementable on quantum computers.
  arXiv  Detail & Related papers  (2023-09-05T18:05:26Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Exact solutions of interacting dissipative systems via weak symmetries [77.34726150561087]
  We analytically diagonalize the Liouvillian of a class Markovian dissipative systems with arbitrary strong interactions or nonlinearity. This enables an exact description of the full dynamics and dissipative spectrum. Our method is applicable to a variety of other systems, and could provide a powerful new tool for the study of complex driven-dissipative quantum systems.
  arXiv  Detail & Related papers  (2021-09-27T17:45:42Z)

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.