Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics

This project is a theoretical research contribution rather than a software product. With 0 stars and minimal fork activity, it functions as a digital appendix to an arXiv paper. Its primary value is academic, establishing bounds on the simulability of non-Hermitian (NH) systems. From a competitive intelligence perspective, it lacks a technical moat (no proprietary codebase, data, or network effects) but offers high intellectual 'defensibility' in its specific niche of quantum complexity theory. Frontier labs (OpenAI, Google Quantum AI) are unlikely to compete directly as this is a foundational physics/CS proof rather than a tool for commercial advantage. The platform risk is non-existent because this is 'knowledge' rather than 'utility' software. The 'displacement' risk here is simply the publication of a more general or more restrictive proof by other academic groups (e.g., Scott Aaronson's group or Microsoft's Station Q). It serves as a gatekeeper for claims regarding the 'quantum advantage' of non-unitary dynamics, effectively proving such advantages are likely non-scalable.