8/01/01                                Refs for EECS 598, Fall 2001

   * - available electronically
   quant-ph refers to  http://arxiv.org/archive/quant-ph

------------------------------------------------------------------------------
  A. General Introduction to Quantum Computing

   *1. A. Eckert et al.: ``Basic Concepts In Quantum Computation'',
       Lecture Notes, 2000 (37 p.)
   *2. E. Rieffel and W. Polak: ``An Introduction to Quantum Computing
       for Non-physicists'', ACM Computing Surveys, 32(2) 300-335, 
       Sept. 2000, (36 p.)  
   *3. NSF: ``Quantum Information Science'', Report of NSF Workshop,
       Arlington, VA, Oct. 1999 (38 p.)
   *4. M. Steffen et al.: ``Toward Quantum Computation: a Five-qubit
       Quantum Processor'', IEEE Micro, March-April 2001, pp. 24-34
       (11p).
   *5. J. Preskill: ``Quantum Computing: Pro and Con'',
       quant-ph/9705032 v.3, Aug 1997 (17 p.)
   *6. Yu. I. Manin, ``Quantum Computing And Shor's Factoring Algorithm'',
       (http://citeseer.nj.nec.com/155106.html)
------------------------------------------------------------------------------
  B. Classical Circuits and Related Discrete Structures

    Generic reference:  G. Hachtel and F. Somenzi, 
                ``Logic Synthesis and Verification Algorithms'', 3 ed., 2000

   *0. T. Toffoli, "Reversible Computing", Tech. Memo
       MIT/LCS/TM-151, MIT Lab for Comp. Sci, 1980. (36 p.)

   *1. M. Perkowski et al.: ``A General Decomposition For Reversible Logic'',
       Reed-Muller workshop, Aug. 2001 (18 p.)

   *2. A. Mishchenko: ``Implicit Representation of Discrete Objects'',
       Proc. of 3d Oregon Symposium on Logic, Design,and Learning (LDL '00), 
       May 22 2000, Porland, Oregon. 

   *3. A. Mishchenko: ``A Tutorial on Zero-suppressed Binary Decision Diagrams''
       manuscript, 2001.

   *4. M. Thornton and V. S. S. Nair, ``Behavioral Synthesis of Combinational 
       Logic Using Spectral Based Heuristics'', ACM Transactions on Design 
       Automation of Electronic Systems, vol. 4, no. 2, April 1999, pp. 219-230.

   *5. D. Jankovic, R. S. Stankovic and R. Drechsler:
       ``Decision Diagram Method for Calculation of Pruned Walsh Transform'',
       IEEE Transactions on Computers, Vol. 50, No. 2, February 2001

------------------------------------------------------------------------------
  C. Quantum Circuits and Architecture

    *1. A. Barenko et al.: ``Elementary Gates For Quantum Computation'',
        Physi. Review A (52), 3457-3467, 1995 (11 p.)

    *2. V. Vedral, A. Barenko and A. Eckert, ``Quantum Networks for
        Elementary Arithmetic Operations'', quant-ph/9511018, Nov. 1995. (12 p.)

    *3. G. Cybenko: ``Reducing Quantum Computations to Elementary Unitary 
        Operations'', Comp. in Sci. and Engin., March/April 2001, pp. 27-32.(6p)

    *4. S. Bettelli, L. Serafini and T. Calarco,
        ``Toward an architecture for quantum programming'',
        IRST technical report 0103-010 (22p.), available at 
        http://xxx.lanl.gov/abs/cs.PL/0103009

------------------------------------------------------------------------------
  D. Algorithms

    *1. P. Shor: ``Polynomial-time Algorithms For Prime Factorization and
        Discrete Logarithm on a Quantum Computer'', SIAM Journal of Computing,
	26(5) 1484-1509, Oct 1997, (26 p.)

    *2. A. Eckert and R. Jozsa: ``Quantum Computation and Shor's Factoring
        Algorithm'', Rev. Mod. Phys., 68(3) 733-753, (21 p.)

    *3. L. K. Grover: ``Searching With Quantum Computers'',
        Dr. Dobbs, April 2001; also available as quant-ph/0011118, 
	Nov. 20 (10 p.)
	 
    *4. L. K. Grover: ``From Schrodinger's Equation to the Quantum Search
        Algorithm'', Winter Inst. on Foundations of Quantum Theory,
	Calcutta, Jan 2000 (15 p.)

    *5. L. Hales and S. Hallgren, ``An Improved Quantum Fourier Transform
        Algorithm and Applications'', ACM Symp. on Foundations of Computer
	Science, Nov. 2000. (11 p.)