Year: 2019
Type: article
Abstract: Matched instances of the quantum satisfiability problem have an interesting property: They always have a product state solution. However, it is not clear how to find such a solution efficiently. Recenttly some progress on this question has been made by considering restricted instances of this problem. In this note we consider a different restriction of the problem which turns out to be solvable by techniques of linear algebra.
Author: Goerdt, Andreas
Institution: Chemnitz University of Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7048722780
