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

Description

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.

Links & Downloads

1. urn:nbn:de:bsz:ch1-qucosa2-327426
2. https://monarch.qucosa.de/id/qucosa%3A32742
3. https://monarch.qucosa.de/api/qucosa%3A32742/attachment/ATT-0/
4. https://monarch.qucosa.de/api/qucosa%3A32742/attachment/ATT-1/

Tags

info:eu-repo/classification/ddc/004

ddc:004

Quantencomputer

Additional Fields

Identifer	oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32742
Date	18 January 2019
Creators	Goerdt, Andreas
Publisher	Technische Universität Chemnitz
Source Sets	Hochschulschriftenserver (HSSS) der SLUB Dresden
Language	English
Detected Language	English
Type	info:eu-repo/semantics/updatedVersion, doc-type:article, info:eu-repo/semantics/article, doc-type:Text
Rights	info:eu-repo/semantics/openAccess