{"id":"https://openalex.org/W2396575890","doi":null,"title":"Public-qubits versus private-coins.","display_name":"Public-qubits versus private-coins.","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2396575890","mag":"2396575890"},"language":"en","primary_location":{"id":"mag:2396575890","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc19.html#Yakaryilmaz12a","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},"volume":null,"type":"preprint","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002142749","display_name":"Abuzer Yakary\u0131lmaz","orcid":"https://orcid.org/0000-0002-2372-252X","observed_orcids":["https://orcid.org/0000-0002-2372-252X"]},"institutions":[{"id":"https://openalex.org/I91123046","display_name":"University of Latvia","ror":"https://ror.org/05g3mes96","country_code":"LV","type":"education","lineage":["https://openalex.org/I91123046"]}],"countries":["LV"],"is_corresponding":true,"raw_author_name":"Abuzer Yakary\u0131lmaz","raw_affiliation_strings":["Univ of Latvia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ of Latvia","institution_ids":["https://openalex.org/I91123046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002142749"],"corresponding_institution_ids":["https://openalex.org/I91123046"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":null,"first_page":"130","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.5878999829292297,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.5878999829292297,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.27730000019073486,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.07810000330209732,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-interactive-proofs","display_name":"quantum interactive proofs","score":0.7540000081062317},{"id":"https://openalex.org/keywords/quadrature-amplitude-modulation","display_name":"quadrature amplitude modulation","score":0.7960000038146973},{"id":"https://openalex.org/keywords/nexp","display_name":"NEXP","score":0.4059999883174896},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.546999990940094}],"concepts":[{"id":"https://openalex.org/C59030546","wikidata":"https://www.wikidata.org/wiki/Q7265371","display_name":"QAM","level":5,"score":0.5703476667404175},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5583925843238831},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5483508706092834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5315356850624084},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5058083534240723},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4609431028366089},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.4388420283794403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39592742919921875},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.3215469717979431},{"id":"https://openalex.org/C32409245","wikidata":"https://www.wikidata.org/wiki/Q749753","display_name":"Quadrature amplitude modulation","level":4,"score":0.23701152205467224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17073068022727966},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.08253160119056702},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0796690583229065},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06752851605415344},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06487473845481873},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2396575890","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc19.html#Yakaryilmaz12a","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W134131117","https://openalex.org/W147131300","https://openalex.org/W183793023","https://openalex.org/W186014684","https://openalex.org/W1495032358","https://openalex.org/W1498051073","https://openalex.org/W1521651075","https://openalex.org/W1528588003","https://openalex.org/W1627385003","https://openalex.org/W1633109858","https://openalex.org/W1959691716","https://openalex.org/W2044141959","https://openalex.org/W2046176315","https://openalex.org/W2057638793","https://openalex.org/W2077968161","https://openalex.org/W2092977061","https://openalex.org/W2096390054","https://openalex.org/W2100827027","https://openalex.org/W2150161776","https://openalex.org/W2155854620","https://openalex.org/W2164423904","https://openalex.org/W2293988196","https://openalex.org/W2295995314"],"related_works":["https://openalex.org/W2155854620","https://openalex.org/W7097228354","https://openalex.org/W4414452352","https://openalex.org/W2018274308","https://openalex.org/W1498051073","https://openalex.org/W1984976620","https://openalex.org/W7215086839","https://openalex.org/W2952170582","https://openalex.org/W285434819","https://openalex.org/W1622104893"],"abstract_inverted_index":{"We":[0,23,45,174],"introduce":[1],"a":[2,16,93,189,200,210],"new":[3,31],"public":[4,32],"quantum":[5,18],"interactive":[6,36],"proof":[7,37,125],"system,":[8,126,193,203],"namely":[9],"qAM,":[10],"by":[11,69,79,148],"augmenting":[12],"the":[13,41,111,128,139,152,164,180],"verifier":[14],"with":[15,34,105,133,151],"fixed-size":[17],"register":[19],"in":[20,40,186,207],"Arthur-Merlin":[21],"game.":[22],"focus":[24],"on":[25],"spacebounded":[26],"verifiers,":[27],"and":[28,160,171,204],"compare":[29],"our":[30,114],"system":[33,39,96],"private-coin":[35,57,142],"(IP)":[38],"same":[42,153],"space":[43,154],"bounds.":[44],"show":[46,85,137],"that":[47,64,86,138],"qAM":[48,149,182,192,202,212],"systems":[49,71,150],"not":[50,67,74,100],"only":[51],"can":[52,144],"simulate":[53],"all":[54],"known":[55,75,140,166],"space-bounded":[56,141],"protocols,":[58],"but":[59],"also":[60,145],"implements":[61],"some":[62],"protocols":[63,143],"are":[65,120,169],"either":[66],"implementable":[68],"IP":[70,80,162],"or":[72],"currently":[73],"to":[76,102],"be":[77,103,131,146],"simulated":[78,147],"systems.":[81],"More":[82],"specifically,":[83],"we":[84,136],"for":[87,179],"any":[88],"Turing-recognizable":[89],"language,":[90],"there":[91,194],"exists":[92],"constant-space":[94,159,190,201],"weak-qAM":[95],"(the":[97,118],"nonmembers":[98,129],"do":[99],"need":[101],"rejected":[104,132],"high":[106,134],"probability),":[107],"and,":[108],"different":[109],"from":[110],"classical":[112],"case,":[113],"protocol":[115],"has":[116,188,209],"perfect-completeness":[117],"members":[119],"accepted":[121],"exactly).":[122],"For":[123],"strong":[124],"where":[127],"must":[130],"probability,":[135],"bound.":[155],"In":[156],"case":[157],"of":[158],"log-space":[161,211],"systems,":[163],"best":[165],"lower":[167,177],"bounds":[168,178],"ASPACE(n)":[170],"EXP,":[172],"respectively.":[173],"obtain":[175],"better":[176],"corresponding":[181],"systems:":[183],"Each":[184],"language":[185,198,206],"NP":[187],"(exp-time)":[191],"is":[195],"an":[196],"NEXP-complete":[197],"having":[199],"each":[205],"NEXP":[208],"system.":[213]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}