{"title":"Squeezing quantum information through a classical channel","authors":"A. FuchsChristopher, SasakiMasahide","doi":"10.5555/2011544.2011545","DOIUrl":"https://doi.org/10.5555/2011544.2011545","url":null,"abstract":"In this paper we propose a general method to quantify how \"quantum\" a set of quantum states is. The idea is to gauge the quantumness of the set by the worst-case difficulty of transmitting the stat...","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71126000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Circuit for Shor's algorithm using 2n+3 qubits","authors":"BeauregardStephane","doi":"10.5555/2011517.2011525","DOIUrl":"https://doi.org/10.5555/2011517.2011525","url":null,"abstract":"We try to minimize the number of qubits needed to factor an integer of n bits using Shor's algorithm on a quantum computer. We introduce a circuit which uses 2n + 3 qubits and 0(n3lg(n)) elementary...","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2003-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71125995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"NMR quantum information processing and entanglement","authors":"LaflammeRaymond, CoryDavid, NegrevergneCamille, ViolaLorenza","doi":"10.5555/2011422.2011427","DOIUrl":"https://doi.org/10.5555/2011422.2011427","url":null,"abstract":"In this essay we discuss the issue of quantum information and recent nuclear magnetic resonance (NMR) experiments. We explain why these experiments should be regarded as quantum information process...","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"35 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2002-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71126030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Working with ARMs","authors":"G. Gottlob, R. Pichler","doi":"10.1006/INCO.2000.2915","DOIUrl":"https://doi.org/10.1006/INCO.2000.2915","url":null,"abstract":"An atomic representation of a Herbrand model (ARM) is a finite set of (not necessarily ground) atoms over a given Herbrand universe. Each ARM represents a possibly infinite Herbrand interpretation. This concept has emerged independently in different branches of computer science as a natural and useful generalization of the concept of finite Herbrand interpretation. It was shown that several recursively decidable problems on finite Herbrand models (or interpretations) remain decidable on ARMs.The following problems are essential when working with ARMs: Deciding the equivalence of two ARMs, deciding subsumption between ARMs, and evaluating clauses over ARMs. These problems were shown to be decidable, but their computational complexity has remained obscure so far. The previously published decision algorithms require exponential space. In this paper, we prove that all mentioned problems are coNP-complete.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"46 1","pages":"183-207"},"PeriodicalIF":1.0,"publicationDate":"2001-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88660600","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using Tableaux to Automate the Lambek and Other Categorial Calculi","authors":"S. Luz","doi":"10.1006/INCO.1999.2853","DOIUrl":"https://doi.org/10.1006/INCO.1999.2853","url":null,"abstract":"We argue that, although labeled deduction can be quite costly in general, the complexity of keeping track of the label constraints built to encode the structure of the proofs does not necessarily render the strategy impractical. The point is illustrated with LLKE, a tableaux system for specification and test of categorial grammars. The paper presents and discusses the application of theorem proving in labeled analytic tableaux to natural language processing (NLP), describes algorithms and rules for tableau generation, introduces a new label-checking strategy, and identifies places where the complexity of the task can be tamed.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"121 1","pages":"206-225"},"PeriodicalIF":1.0,"publicationDate":"2000-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74835096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sequentiality, monadic second-order logic and tree automata","authors":"H. Comon","doi":"10.1006/INCO.1999.2838","DOIUrl":"https://doi.org/10.1006/INCO.1999.2838","url":null,"abstract":"Abstract Given a term rewriting system R and a normalizable term t, a redex is needed if in any reduction sequence of t to a normal form, this redex will be contracted. Roughly, R is sequential if there is an optimal reduction strategy in which only needed redexes are contracted. More generally, G. Huet and J.-J. Levy have defined the sequentiality of a predicate P on partially evaluated terms (1991, “Computational Logic: Essays in Honor of Alan Robinson”, MIT Press, Cambridge, MA, pp. 415–443). We show here that the sequentiality of P is definable in SkS, the monadic second-order logic with k successors, provided P is definable in SkS. We derive several known and new consequences of this remark: (1) strong sequentiality, as defined by Huet and Levy of a left linear (possibly overlapping) rewrite system is decidable, (2) NV-sequentiality, as defined in (M. Oyamaguchi, 1993, SIAM J. Comput.19, 424–437), is decidable, even in the case of overlapping rewrite systems (3) sequentiality of any linear shallow rewrite system is decidable. Then we describe a direct construction of a tree automaton recognizing the set of terms that do have needed redexes, which again, yields immediate consequences: (1) Strong sequentiality of possibly overlapping linear rewrite systems is decidable in EXPTIME, (2) For strongly sequential rewrite systems, needed redexes can be read directly on the automaton.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"1 1","pages":"25-51"},"PeriodicalIF":1.0,"publicationDate":"2000-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83505510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Symbolic computation and exact distributions of nonparametric test statistics","authors":"W. D. Ma, A. D. Bucchianico, P. Laanvander","doi":"10.1111/1467-9884.00208","DOIUrl":"https://doi.org/10.1111/1467-9884.00208","url":null,"abstract":"We show how to use computer algebra for computing exact distributions of nonparametric test statistics. We give several examples of nonparametric statistics with explicit probability-generating functions that can be handled this way. In particular, we give a new table of critical values of the Jonckheere–Terpstra test that extends previous tables.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"367 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"1999-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76589326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Perceived prominence and the metrical-prosodic structure of Dutch sentences","authors":"Karijn Helsloot, B. Streefkerk","doi":"10.1075/cilt.234.13hel","DOIUrl":"https://doi.org/10.1075/cilt.234.13hel","url":null,"abstract":"In this paper we present a metrical-prosodic analysis of Dutch read aloud sentences, based on perceived prominences. Metrical-prosodic constraints are formulated which can be used as input for Text-to-Speech systems. A four level metrical grid representation is introduced, corresponding to four degrees of prominence, including no prominence. A distinction is made between input and output constraints. The former refer to the prosodic representation of lexically distinguished categories; the latter to sentence-level prosodic well-fonnedness. Constraints may be in conflict with each other. The conflicting constraints are relatively ranked in a constraint hierarchy. The higher ranked constraint will win at the cost of the lower ranked one.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"66 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89504624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Myth of Rescue","authors":"I. Haande","doi":"10.4324/9780203026410","DOIUrl":"https://doi.org/10.4324/9780203026410","url":null,"abstract":"","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"27 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88749465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Subsingular vectors of the topological N=2 Superconformal Algebra","authors":"B. Gato-Rivera, J. Rosado","doi":"10.1016/S0550-3213(97)00827-4","DOIUrl":"https://doi.org/10.1016/S0550-3213(97)00827-4","url":null,"abstract":"","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"2013 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"1997-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86474728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}