- AutorIn
- Andreas Goerdt Technische Universität Chemnitz
- Titel
- Matched instances of Quantum Sat (QSat)
- Untertitel
- Product state solutions of restrictions
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:ch1-qucosa2-327426
- Abstract (EN)
- 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.
- Freie Schlagwörter (EN)
- Quantum computing, Satisfiability, Matched instance, Solution finding
- Klassifikation (DDC)
- 004
- Normschlagwörter (GND)
- Quantencomputer
- Publizierende Institution
- Technische Universität Chemnitz, Chemnitz
- Version / Begutachtungsstatus
- aktualisierte Version
- URN Qucosa
- urn:nbn:de:bsz:ch1-qucosa2-327426
- Veröffentlichungsdatum Qucosa
- 18.01.2019
- Dokumenttyp
- Artikel
- Sprache des Dokumentes
- Englisch