Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis
We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computational basis states of Hamming weight k . The Hamming weight constraint can have a physical interpretation as a constraint on the number of excitations allowed or the particle number in a system. We prove that this problem is in QW[1] , the first level of the quantum weft hierarchy, and that it is hard for QM[1] , the quantum analogue of M[1] . Our results show that this problem cannot be fixed parameter quantum tractable (FPQT) unless certain natural quantum analogue of the exponential time hypothesis (ETH) is false.
Authors
- Michael J. Bremner (ORCID: https://orcid.org/0000-0001-7240-4686)
- Zhengfeng Ji (ORCID: https://orcid.org/0000-0002-7659-3178)
- Mauro E. S. Morales (ORCID: https://orcid.org/0000-0003-3222-3623)
- Luke Mathieson (ORCID: https://orcid.org/0000-0001-6470-2296)
- Xingjian Li (ORCID: https://orcid.org/0000-0002-8058-7491)
Institutions
- University of Technology Sydney (AU)
- Tsinghua University (CN)
Publication Details
- Journal
- ACM Transactions on Quantum Computing
- Published
- 2025-08-08
- DOI
- https://doi.org/10.1145/3759156
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00