In U(1)-symmetric random circuits, initial states with lower stabilizer Rényi entropy generate nonstabilizerness faster than those with higher entropy, with the effect also depending on spatial charge structure and extending to SU(2) circuits and Hamiltonian dynamics.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Quantum algorithms achieve polynomial advantage for synchronization estimation and super-polynomial advantage for no-phase-locking certification in higher-order simplicial Kuramoto models under stated assumptions.
A deterministic recursive quantum circuit prepares antisymmetric states for η fermions in N orbitals with O(η²√N) T-gates and O(√N) dirty ancillas, outperforming sorting methods for η ≲ √N.
citing papers explorer
-
Nonstabilizerness Mpemba Effects
In U(1)-symmetric random circuits, initial states with lower stabilizer Rényi entropy generate nonstabilizerness faster than those with higher entropy, with the effect also depending on spatial charge structure and extending to SU(2) circuits and Hamiltonian dynamics.
-
Efficient Quantum Algorithms for Higher-Order Coupled Oscillators
Quantum algorithms achieve polynomial advantage for synchronization estimation and super-polynomial advantage for no-phase-locking certification in higher-order simplicial Kuramoto models under stated assumptions.
-
Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping
A deterministic recursive quantum circuit prepares antisymmetric states for η fermions in N orbitals with O(η²√N) T-gates and O(√N) dirty ancillas, outperforming sorting methods for η ≲ √N.