Pith. sign in

REVIEW 2 cited by

Scaling of symmetry-restricted quantum circuits

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.09962 v2 pith:DVUM3V5F submitted 2024-06-14 quant-ph

classification quant-ph
keywords mathcalgroupactingemployednumberpropertiesqubitssubspaces
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The intrinsic symmetries of physical systems have been employed to reduce the number of degrees of freedom of systems, thereby simplifying computations. In this work, we investigate the properties of $\mathcal{M}SU(2^N)$, $\mathcal{M}$-invariant subspaces of the special unitary Lie group $SU(2^N)$ acting on $N$ qubits, for some $\mathcal{M}\subseteq M_{2^N}(\mathbb{C})$. We demonstrate that for certain choices of $\mathcal{M}$, the subset $\mathcal{M}SU(2^N)$ inherits many topological and group properties from $SU(2^N)$. We then present a combinatorial method for computing the dimension of such subspaces when $\mathcal{M}$ is a representation of a permutation group acting on qubits $(GSU(2^N))$, or a Hamiltonian $(H^{(N)}SU(2^N))$. The Kronecker product of $\mathfrak{su}(2)$ matrices is employed to construct the Lie algebras associated with different permutation-invariant groups $GSU(2^N)$. Numerical results on the number of dimensions support the the developed theory.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Analysis of quantum neural network performance via edge cases

    quant-ph 2025-06 conditional novelty 4.0 of 10

    Edge-case graphs show that permutation-invariant and cyclic-invariant quantum neural networks do not learn a simple edge-counting surrogate for graph connectedness.

  2. Clique detection using symmetry-restricted quantum circuits

    quant-ph 2025-06 reject novelty 4.0 of 10

    Permutation-invariant quantum circuits label cliques in small random graphs more accurately than cyclic-invariant or standard ansatze in simulation.

Pith tools