Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlinearity regime.
Classification of dynamical Lie algebras generated by spin interactions on undirected graphs
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 8years
2026 8roles
background 2polarities
background 2representative citing papers
A first-moment operator diagnostic reveals exponentially many inequivalent initialization distributions avoid barren plateaus in variational quantum algorithms, with numerics indicating distinct attained minima.
Dynamic parameterized quantum circuits still leave a significant fraction of parameters untrainable despite cost anti-concentration, implying BP mitigation via DPQCs is at least as hard as designing BP-free unitaries.
Introduces Closest Accessible Symmetry reduction to analyze spectra of Hamiltonian interpolations by projecting onto closest accessible symmetries, yielding weakly coupled sectors that capture quantum phase transition signatures.
Develops an invariant-based framework connecting Pauli Lie algebras to transvection-generated Clifford subgroups for quantum reachability and dynamics analysis.
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.
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
-
Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlinearity regime.
-
Exponentially many initializations to avoid barren plateaus
A first-moment operator diagnostic reveals exponentially many inequivalent initialization distributions avoid barren plateaus in variational quantum algorithms, with numerics indicating distinct attained minima.
-
Challenges in Barren Plateau Mitigation with Dynamic Parameterized Quantum Circuits
Dynamic parameterized quantum circuits still leave a significant fraction of parameters untrainable despite cost anti-concentration, implying BP mitigation via DPQCs is at least as hard as designing BP-free unitaries.
-
Closest Accessible Symmetry reduction: a tool for Hamiltonian interpolation analysis
Introduces Closest Accessible Symmetry reduction to analyze spectra of Hamiltonian interpolations by projecting onto closest accessible symmetries, yielding weakly coupled sectors that capture quantum phase transition signatures.
-
From Pauli Strings to Quantum Dynamics: A Unified Characterization
Develops an invariant-based framework connecting Pauli Lie algebras to transvection-generated Clifford subgroups for quantum reachability and dynamics analysis.
-
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.
-
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.