Newsgroups: comp.ai.jair.announce
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!newsfeed.internetmci.com!in2.uu.net!news.reference.com!cnn.nas.nasa.gov!eos!kronos.arc.nasa.gov!jair-ed
From: jair-ed@ptolemy.arc.nasa.gov
Subject: New Article, Quantum Computing and Phase ...
Message-ID: <1996Mar27.190346.5531@ptolemy-ethernet.arc.nasa.gov>
Originator: jair-ed@polya.arc.nasa.gov
Lines: 40
Sender: usenet@ptolemy-ethernet.arc.nasa.gov (usenet@ptolemy.arc.nasa.gov)
Nntp-Posting-Host: polya.arc.nasa.gov
Organization: NASA/ARC Computational Sciences Division
Date: Wed, 27 Mar 1996 19:03:46 GMT
Approved: jair-ed@ptolemy.arc.nasa.gov

JAIR is pleased to announce the publication of the following article:

Hogg, T. (1996)
  "Quantum Computing and Phase Transitions in Combinatorial Search", 
   Volume 4, pages 91-128.

   Available in HTML, Postscript (565K) and compressed Postscript (230K).
   An online appendix (ascii appendix containing matrix values) is also a available (32K).
   For quick access via your WWW browser, use this URL:
     http://www.cs.washington.edu/research/jair/abstracts/hogg96a.html
   More detailed instructions are below.

   Abstract: We introduce an algorithm for combinatorial search on
   quantum computers that is capable of significantly concentrating
   amplitude into solutions for some NP search problems, on average. This
   is done by exploiting the same aspects of problem structure as used by
   classical backtrack methods to avoid unproductive search choices. This
   quantum algorithm is much more likely to find solutions than the
   simple direct use of quantum parallelism. Furthermore, empirical
   evaluation on small problems shows this quantum algorithm displays the
   same phase transition behavior, and at the same location, as seen in
   many previously studied classical search methods. Specifically,
   difficult problem instances are concentrated near the abrupt change
   from underconstrained to overconstrained problems.

The article is available via:
   
 -- comp.ai.jair.papers (also see comp.ai.jair.announce)

 -- World Wide Web: The URL for our World Wide Web server is
       http://www.cs.washington.edu/research/jair/home.html
    For direct access to this article and related files try:
       http://www.cs.washington.edu/research/jair/abstracts/hogg96a.html

 -- Anonymous FTP from either of the two sites below.

    Carnegie-Mellon University (USA):
	ftp://p.gp.cs.cmu.edu/usr/jair/pub/volume4/hogg96a.ps
    The University of Genoa (Italy):
	ftp://ftp.mrg.dist.unige.it/pub/jair/pub/volume4/hogg96a.ps

    The compressed PostScript file is named hogg96a.ps.Z (230K)
    An online appendix is also available, named hogg96a-appendix.txt (32K).

 -- automated email. Send mail to jair@cs.cmu.edu or jair@ftp.mrg.dist.unige.it
    with the subject AUTORESPOND and our automailer will respond. To
    get the Postscript file, use the message body GET volume4/hogg96a.ps 
    (Note: Your mailer might find this file too large to handle.) 
    To obtain the online appendix, use the body GET volume4/hogg96a-appendix.txt
    Only one can file be requested in each message.

 -- JAIR Gopher server: At p.gp.cs.cmu.edu, port 70. 

For more information about JAIR, visit our WWW or FTP sites, or
send electronic mail to jair@cs.cmu.edu with the subject AUTORESPOND
and the message body HELP, or contact jair-ed@ptolemy.arc.nasa.gov.



