New Pauli orbit and modified Gell-Mann bases enable polynomial-cost Lie-algebraic simulation for permutation-equivariant and bounded-excitation quantum dynamics.
Full classification of pauli lie algebras
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 5verdicts
UNVERDICTED 5roles
background 1polarities
background 1representative citing papers
Stabilizer redundancy from error-correcting codes reduces the choice of physical operators for a logical target to a least-squares problem with closed-form solution, allowing native hardware Hamiltonians to replace costly swaps.
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
A frustration graph formalism for prime-d qudit observables yields a unitary map to generalized Pauli form plus bounds on observable sums used for qudit entanglement quantification.
Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.
citing papers explorer
-
Enabling Lie-Algebraic Classical Simulation beyond Free Fermions
New Pauli orbit and modified Gell-Mann bases enable polynomial-cost Lie-algebraic simulation for permutation-equivariant and bounded-excitation quantum dynamics.
-
Stabilizers for Compiling Logical Circuits under Hardware Constraints
Stabilizer redundancy from error-correcting codes reduces the choice of physical operators for a logical target to a least-squares problem with closed-form solution, allowing native hardware Hamiltonians to replace costly swaps.
-
On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
-
Frustration graph formalism for qudit observables
A frustration graph formalism for prime-d qudit observables yields a unitary map to generalized Pauli form plus bounds on observable sums used for qudit entanglement quantification.
-
Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors
Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.