Computational Complexity of Quantum Satisfiability

Quantum logic generalizes, and in dimension one coincides with, Boolean propositional logic. We introduce the weak and strong satisfiability problem for quantum logic formulas, and show both NP-complete in dimension two as well. For higher-dimensional spaces R d and C d with d≥3 fixed, on the other...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2011 IEEE 26th Annual Symposium on Logic in Computer Science s. 175 - 184
Hlavní autori: Herrmann, C., Ziegler, M.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.06.2011
Predmet:
Complexity theory
Computational modeling
Hilbert space
Polynomials
Quantum computing
Quantum mechanics
Turing machines
ISBN:9781457704512, 145770451X
ISSN:1043-6871
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Quantum logic generalizes, and in dimension one coincides with, Boolean propositional logic. We introduce the weak and strong satisfiability problem for quantum logic formulas, and show both NP-complete in dimension two as well. For higher-dimensional spaces R d and C d with d≥3 fixed, on the other hand, we show the problem to be complete for the nondeterministic Blum-Shub-Smale model of real computation. This provides a unified view on both Turing and real BSS complexity theory, and adds (a perhaps more natural and combinatorially flavoured) one to the still sparse list of NP R -complete problems, mostly pertaining to real algebraic geometry. Our proofs rely on (a careful examination of) works by John von Neumannas well as contributions by Hagge et. al (2005,2007,2009). We finally investigate the problem over Indefinite finite dimensions and relate it to NON-commutative semi algebraic geometry.
AbstractList Quantum logic generalizes, and in dimension one coincides with, Boolean propositional logic. We introduce the weak and strong satisfiability problem for quantum logic formulas, and show both NP-complete in dimension two as well. For higher-dimensional spaces R d and C d with d≥3 fixed, on the other hand, we show the problem to be complete for the nondeterministic Blum-Shub-Smale model of real computation. This provides a unified view on both Turing and real BSS complexity theory, and adds (a perhaps more natural and combinatorially flavoured) one to the still sparse list of NP R -complete problems, mostly pertaining to real algebraic geometry. Our proofs rely on (a careful examination of) works by John von Neumannas well as contributions by Hagge et. al (2005,2007,2009). We finally investigate the problem over Indefinite finite dimensions and relate it to NON-commutative semi algebraic geometry.
Author Ziegler, M.
Herrmann, C.
Author_xml – sequence: 1
  givenname: C.
  surname: Herrmann
  fullname: Herrmann, C.
  organization: Math. Dept., Tech. Univ. of Darmstadt, Darmstadt, Germany
– sequence: 2
  givenname: M.
  surname: Ziegler
  fullname: Ziegler, M.
  organization: Math. Dept., Tech. Univ. of Darmstadt, Darmstadt, Germany
BookMark eNotjMtqwzAQAFWaQpM0px578Q_Y3V2tLOlYTB8BQylpz0GJJFDxI8Q2NH_f9HEahoFZiFnXd0GIW4QCEex9va42BQFiYS7EymoDurSKGQkufx1ZaQ2skGZijsAyL43Ga7EYhk8AoJJhLqjq28M0ujH1nWuyH2vCVxpPWR-zt8l149Rmm3MeYnK71JzLjbiKrhnC6p9L8fH0-F695PXr87p6qPOEWo05kiKFEjwEAO-NjrJkzXvDES1bS545eu3CjmxUwWMgCuXeKW9QSm3lUtz9fVMIYXs4ptYdT1tlNRAq-Q3TEEec
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS.2011.8
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9780769544120
0769544126
EndPage 184
ExternalDocumentID 5970215
Genre orig-research
GroupedDBID --Z
23M
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i175t-12525130d0e00dd87f36474c84f194992d44fd7aeb29f5ed1e22e6ca5d8133793
IEDL.DBID RIE
ISBN 9781457704512
145770451X
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000297350400019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1043-6871
IngestDate Wed Aug 27 03:28:38 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-12525130d0e00dd87f36474c84f194992d44fd7aeb29f5ed1e22e6ca5d8133793
PageCount 10
ParticipantIDs ieee_primary_5970215
PublicationCentury 2000
PublicationDate 2011-June
PublicationDateYYYYMMDD 2011-06-01
PublicationDate_xml – month: 06
  year: 2011
  text: 2011-June
PublicationDecade 2010
PublicationTitle 2011 IEEE 26th Annual Symposium on Logic in Computer Science
PublicationTitleAbbrev lics
PublicationYear 2011
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002640
ssib026767165
ssj0000669898
Score 1.7841094
Snippet Quantum logic generalizes, and in dimension one coincides with, Boolean propositional logic. We introduce the weak and strong satisfiability problem for...
SourceID ieee
SourceType Publisher
StartPage 175
SubjectTerms Complexity theory
Computational modeling
Hilbert space
Polynomials
Quantum computing
Quantum mechanics
Turing machines
Title Computational Complexity of Quantum Satisfiability
URI https://ieeexplore.ieee.org/document/5970215
WOSCitedRecordID wos000297350400019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3Pa8IwFH6o7LCT23TsNznsuMy0Jk16lskGIg634U3aJgEP0yFW8L_fyw8dg112a1IoTdrkfe-9fN8DuM-FK2jMC8oTKyivhKIIjnJalbrEO0Zpny74GMnxWM1m-aQBDwcujDHGHz4zj-7S5_L1qqpdqKyH4NeZqCY0pcwCV2v_76ROeCyJGbuwC_vSiIddGQ1_VCbo0wy9BE_yElI6fZXZXvspttNI5EtY3hu9DKZB6VP9KsDi7c-w_b83P4HuD5GPTA4m6hQaZnkG7X0lBxIXdgfS0BUDg8S1nFDmZkdWlrzWOPv1J5l6IsQiCHvvuvA-fHobPNNYTYEuECJsKCIZxDJ9pplhTGslrZOO55XiNnEKNanm3GpZoKudW2F0YtLUZFUhtEI_FpfxObSWq6W5AMILlhUm07IsFUdEozIrtTC5ZgU-VuhL6LgpmH8FwYx5HP3V393XcBwCtS60cQOtzbo2t3BUbXFQ6zv_lb8BBfufIA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNETKhh_24NHK9to1-5MJBAnwYCGG9nWNuEgGMJM-O997QrGxIu3tUuWtVv7vvde3_cB3CfcChqzjLLQcMoKLimCo4QWucrxjpbKpQveUzEcyuk0GdXgYVcLo7V2h8_0o710uXy1LEobKmsj-LUmag_2rXKWr9ba_j2RpR4Lfc6u2oedOOJuX0bT77kJOjRGP8GVeXEhLMPKdMv-5NuRL-ULg6SdDrrjiutT_pJgcRao1_jfux9D66eUj4x2RuoEanpxCo2tlgPxS7sJUdXlQ4PEtixV5npDloa8ljj_5QcZu1KIeUXtvWnBW-9p0u1Tr6dA5wgS1hSxDKKZTqACHQRKSWEseTwrJDOh5aiJFGNGiQyd7cRwrUIdRTouMq4kerK4kM-gvlgu9DkQlgVxpmMl8lwyxDQyNkJxnaggw8dydQFNOwWzz4oyY-ZHf_l39x0c9icv6SwdDJ-v4KgK29pAxzXU16tS38BB8YUDXN26L_4NijKiaQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2011+IEEE+26th+Annual+Symposium+on+Logic+in+Computer+Science&rft.atitle=Computational+Complexity+of+Quantum+Satisfiability&rft.au=Herrmann%2C+C.&rft.au=Ziegler%2C+M.&rft.date=2011-06-01&rft.pub=IEEE&rft.isbn=9781457704512&rft.issn=1043-6871&rft.spage=175&rft.epage=184&rft_id=info:doi/10.1109%2FLICS.2011.8&rft.externalDocID=5970215
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1043-6871&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1043-6871&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1043-6871&client=summon