UvA-DARE (Digital Academic Repository) On quantum computation theory van Dam, W.K. Publication date 2002 Link to publication Citation for published version (APA): van Dam, W. K. (2002). On quantum computation theory. Institute for Logic, Language and Computation. General rights It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons). Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible. UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl) Download date:26 Sep 2021 Bibliography y [1]] Leonard M. Adleman, Jonathan Demarrais, and Ming-Deh A. Huang. Quantum computability.. SIAM Journal on Computing, 26(5): 1524-1540, October 1997. [2]] Manindra Agrawal and V. Arvind. Quasi-linear truth-table reductions to p- selectivee sets. Theoretical Computer Science, 158(l-2):361-370, May 1996. [3]] Dorit Aharonov, Alexei Kitaev, and Noam Nisan. Quantum circuits with mixed states.. In Proceedings of the 30th Annual ACM Symposium on Theory of Com- puting,puting, pages 20-30,1998. [4]] Amihood Amir, Richard Beigel, and William I. Gasarch. Some connections betweenn bounded query classes and nonuniform complexity. In Proceedings of thethe 5th Annual Conference on Structure in Complexity Theory, pages 232-243, 1990. [5]] Amihood Amir and William I. Gasarch. Polynomial terse sets. Information and Computation,Computation, 77(l):37-56, April 1988. [6]] José L. Balcazar, Josep Diaz, and Joaquim Gabarró. Structural Complexity, volumee 1. Springer-Verlag, 1988. [7]] José L. Balcazar, Josep Diaz, and Joaquim Gabarró. Structural Complexity, volumee 2. Springer-Verlag, 1990. [8]] Adriano Barenco, Andre Berthiaume, David Deutsch, Artur Ekert, Richard Jozsa,, and Chiara Macchiavello. Stabilisation of quantum computations by sym- metrisation.. SIAM Journal on Computing, 26(5): 1541-1557, 1997. [9]] H. Barnum, CM. Caves, C.A. Fuchs, R. Jozsa, and B. Schumacher. Noncom- mutingg mixed states cannot be broadcast. Physical Review Letters, 76(15):2821- 2828,, 1996. quant-ph archive, report no. 9511010. 97 7 98 8 Bibliography Bibliography [10]] Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald dee Wolf. Quantum lower bounds by polynomials. In Proceedings of the 39th AnnualAnnual Symposium on Foundations of Computer Science, pages 352-361, Los Alamitos,, California, November 1998. IEEE Computer Society Press, quant-ph archive,, report no. 9802049. [11]] Richard Beigel. Query-limited Reducibilities. Ph.d. dissertation, Department off Computer Science, Stanford University, 1987. Available on the web via: http://www.eecs.lehigh.edu/~beigel/papers/. [12]] Richard Beigel. NP-hard sets are P-superterse unless R = NP. Technical report, Johnss Hopkins University, 1988. technical report no. 88-4. [[ 13] Richard Beigel. Bounded queries to SAT and the Boolean hierarchy. Theoretical ComputerComputer Science, 84(2): 199-223, 1991. Available on the web via: http: //www.eecs.lehigh.edu/~beigel/papers/. [14]] Richard Beigel, R. Chang, and M. Ogiwara. A relationship between difference hierarchiess and relativized polynomial hierarchies. Mathematical Systems The- ory,ory, 26(3):293-310, 1993. [15]] Richard Beigel and William I. Gasarch. On the complexity of finding the chro- maticc number of a recursive graph I: The bounded case. Annals of Pure and AppliedApplied Logic, 45(1): 1-38, 1989. [16]] Richard Beigel, William I. Gasarch, John Gill, and Jr. James C. Owings. Terse, supertersee and verbose sets. Information and Computation, 103:68-85, 1993. [17]] Richard Beigel, Martin Kummer, and Frank Stephan. Approximable sets. In- formationformation and Computation, 120(2):304-314, 1995. [18]] Riccardo Benedetti and Jean-Jacques Risler. Real algebraic and semi-algebraic sets.sets. Hermann, 1990. [19]] Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani. Strengthss and weaknesses of quantum computing. SIAM Journal on Com- puting,puting, 26(5): 1510-1523, October 1997. Also on the quant-ph archive, report no.. 9701001. [20]] Charles H. Bennett and Gilles Brassard. Quantum cryptography: Public key dis- tributionn and coin tossing. In Proceedings of the IEEE International Conference onon Computers, Systems, and Signal Processing, pages 175-179, 1984. [21]] Charles H. Bennett and Stephen Wiesner. Communication via one- and two- particlee operators on Einstein-Podolsky-Rosen states. Physical Review Letters, 69:2881-2884,, 1992. Bibliography Bibliography 99 9 [22]] Ethan Bernstein and Umesh Vazirani. Quantum complexity theory. SI AM Jour- nalnal on Computing, 26(5): 1411-1473, October 1997. [23]] Andre Berthiaume and Gilles Brassard. Oracle quantum computing. Journal of ModernModern Optics, 41(12):2521-2535, 1994. [24]] Manuel Blum, Michael Luby, and Ronitt Rubinfeld. Self-testing/correcting with applicationss to numerical problems. Journal of Computer and System Sciences, 47(3):549-595,, 1990. [25]] Michel Boyer, Gilles Brassard, Peter H0yer, and Alain Tapp. Tight bounds on quantumm searching. Fortschritte der Physik, 46(4-5):493-505, 1998. quant-ph archive,, report no. 9605034. [26]] P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani Roychowdhury, and Farrokh Vatan.. On universal and fault-tolerant quantum computing: A novel basis and aa new constructive proof of universality for Shor's basis. In Proceedings of the 40th40th Annual Symposium on Foundations of Computer Science, pages 486-494, 1999. [27]] Harry Buhrman and Lance Fortnow. Two queries. In Proceedings of the 13th IEEEIEEE Conference on Computational Complexity, pages 13-19, New York, 1998. IEEEE Computer Society Press. Available on the web via http: //www. cs. uchicago.edu/~fortnow/papers/. [28]] Harry Buhrman and Wim van Dam. Bounded quantum query complexity. In ProceedingsProceedings of the 14th Annual IEEE Conference on Computational Comlexity, pagess 149-156,1999. quant-ph report no. 9903035. [29]] Samuel R. Buss and Louise Hay. On truth-table reducibility to SAT. Information andand Computation, 91(0:86-102, March 1991. [30]] Gregory Chaitin. On the length of programs for computing finite binary se- quences.. Journal of the ACM, 13(4):547-569, 1966. [311 ] Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca. Quantum algorithmss revisited. Proceedings of the Royal Society of London A, 454:339- 354,1998.. quant-ph report no. 9708016. [32]] Henri Cohen. A Course in Computational Algebraic Number Theory, volume 1388 of Graduate Texts in Mathematics. Springer-Verlag, 1993. [33]] Charles J. Colbourn and Jeffrey H. Dinitz, editors. The CRC Handbook of Com- binatorialbinatorial Designs. Series on Discrete Mathematics and Applications. CRC Press,, 1996. 100 0 Bibliography Bibliography [34]] Stephen A. Cook. The complexity of theorem-proving procedures. In Proceed- ingsings of the 3rd ACM Symposium Theory of Computing, pages 151-158, Shaker Heights,, Ohio, 1971. [35]] Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. Wiley Seriess in Telecommunications. John Wiley & Sons, Inc., 1991. [36]] Wim van Dam. Two classical queries versus one quantum query. Technical Reportt 9806090, quant-ph report, 1998. [37]] Wim van Dam and Sean Hallgren. Efficient quantum algorithms for shifted quadraticc character problems, quant-ph report 0011067, Los Alamos archive, Novemberr 2000. [38]] David Deutsch. Quantum theory, the Church-Turing principle and the universal quantumm computer. Proceedings of the Royal Society of London A, 400:97-117, 1985. [39]] David Deutsch and Richard Jozsa. Rapid solution of problems by quantum com- putation.. Proceedings of the Royal Society of London A, 439:553-558, 1992. [40]] Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser. A limit onn the speed of quantum computation in determining parity. Physical Review Letters,Letters, 81:5442-5444, 1998. quant-ph archive, report no. 9802045. [41]] Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser. How manyy functions can be distinguished with k quantum queries? quant-ph 9901012,, Los Alamos archive, January 1999. [42]] Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser. Invariant quantumm algorithms for insertion into an ordered list. Technical Report 9901059, quant-phh report, 1999. [43]] Lance Fortnow and John Rogers. Complexity limitations on quantum computa- tion.. In Proceedings of the 13th IEEE Conference on Computational Complex- ity,ity, pages 202-209, 1998. cc.CC archive, report no. 9811023. [44]] Christopher A. Fuchs and Jeroen van de Graaf. Cryptographic distinguishability measuress for quantum mechanical states. IEEE Transactions on Information 77i*ory,45(4):1216-1227,, 1999. [45]] Peter Gacs. Quantum algorithmic entropy. Journal of Physics A: Mathematical andand General, 34:6859-6880, 2001. quant-ph report no. 0011046. [46]] Michael R. Garey and David S. Johnson. Computers and Intractability: A guide toto the theory of NP-completeness.