Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ruling out efficient quantum algorithms for abelian mixed-state HS unless QSZK=BQP.
Title resolution pending
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 8roles
background 2polarities
background 2representative citing papers
Under local amplitude damping the n-qubit GHZ family loses entanglement at damping strength γ_e but regains magic at γ_+ satisfying γ_e + γ_+ = 1 for every n, with the reborn magic residing in a fully separable state.
A dichotomy for path-containment problems shows some are solvable with linear queries while others are equivalent to cycle problems and admit a quantum-walk algorithm with query complexity Õ(n^{3/2 - α_k}) where α_k decays exponentially in k, plus a conditional lower bound.
For any distribution of pure n-qubit states, a QAE with k encoder ancillas and n decoder ancillas achieves the optimal average fidelity among all CPTP encoder-decoder pairs, with the encoder threshold proven sharp.
BOOOM parametrizes Stiefel manifold optimization into Euclidean angle space using global Givens rotations and solves it with recursive modified pattern search for loss-agnostic black-box problems.
Noise in LUCJ sampling for QSCI on N2 expands the configuration space beyond the ideal ansatz and, when paired with recovery, produces more accurate CI energies than noiseless sampling.
A review that defines Galois qudits over binary extension fields, their Clifford hierarchies, Pauli measurements, stabilizer tableaux, qubit mappings, and quantum Reed-Solomon codes.
citing papers explorer
-
Quantum state isomorphism problems for groups
Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ruling out efficient quantum algorithms for abelian mixed-state HS unless QSZK=BQP.
-
Sudden death of entanglement, rebirth of magic
Under local amplitude damping the n-qubit GHZ family loses entanglement at damping strength γ_e but regains magic at γ_+ satisfying γ_e + γ_+ = 1 for every n, with the reborn magic residing in a fully separable state.
-
Quantum algorithms for path and cycle containment problems
A dichotomy for path-containment problems shows some are solvable with linear queries while others are equivalent to cycle problems and admit a quantum-walk algorithm with query complexity Õ(n^{3/2 - α_k}) where α_k decays exponentially in k, plus a conditional lower bound.
-
Toward the Goldilocks blind compression of quantum states
For any distribution of pure n-qubit states, a QAE with k encoder ancillas and n decoder ancillas achieves the optimal average fidelity among all CPTP encoder-decoder pairs, with the encoder threshold proven sharp.
-
BOOOM: Loss-Function-Agnostic Black-Box Optimization over Orthonormal Manifolds for Machine Learning and Statistical Inference
BOOOM parametrizes Stiefel manifold optimization into Euclidean angle space using global Givens rotations and solves it with recursive modified pattern search for loss-agnostic black-box problems.
-
Noise and Configuration Recovery Impact on Quantum Selected Configuration Interaction
Noise in LUCJ sampling for QSCI on N2 expands the configuration space beyond the ideal ansatz and, when paired with recovery, produces more accurate CI energies than noiseless sampling.
-
A Review of Galois Qudits
A review that defines Galois qudits over binary extension fields, their Clifford hierarchies, Pauli measurements, stabilizer tableaux, qubit mappings, and quantum Reed-Solomon codes.
- Coherent control of spinmons