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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis

Michael J. Bremner, Zhengfeng Ji, Mauro E. S. Morales, Luke Mathieson et al.
ACM Transactions on Quantum Computing
Quantum Computing Algorithms and Architecture
article

Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis

Michael J. Bremner, Zhengfeng Ji, Mauro E. S. Morales, Luke Mathieson, Xingjian Li
article en

Abstract

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.

ACM Transactions on Quantum ComputingVol. 6(4)
University of Technology Sydney (AU), Tsinghua University (CN)
Openalex Percentile: Top 89%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.