Return to search

Matched instances of Quantum Sat (QSat): Product state solutions of restrictions

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.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32742
Date18 January 2019
CreatorsGoerdt, Andreas
PublisherTechnische Universität Chemnitz
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/updatedVersion, doc-type:article, info:eu-repo/semantics/article, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess

Page generated in 0.0019 seconds