Back to Search
Start Over
Quantum Parameterized Complexity
- Publication Year :
- 2022
-
Abstract
- Parameterized complexity theory was developed in the 1990s to enrich the complexity-theoretic analysis of problems that depend on a range of parameters. In this paper we establish a quantum equivalent of classical parameterized complexity theory, motivated by the need for new tools for the classifications of the complexity of real-world problems. We introduce the quantum analogues of a range of parameterized complexity classes and examine the relationship between these classes, their classical counterparts, and well-studied problems. This framework exposes a rich classification of the complexity of parameterized versions of QMA-hard problems, demonstrating, for example, a clear separation between the Quantum Circuit Satisfiability problem and the Local Hamiltonian problem.<br />Comment: 23 pages, 1 figure
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2203.08002
- Document Type :
- Working Paper