Skip to main content
SpringerLink
Log in

Conclusions and Prospects

  • Chapter
Automatic Quantum Computer Programming

Part of the book series: Genetic Programming ((GPEM,volume 7))

  • 649 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Albert, D. Z. (1992). Quantum Mechanics and Experience. Harvard University Press, Cambridge, Massachusetts.

    Google Scholar 

  • Angeline, P. J. and Kinnear, Jr., K. E., editors (1996). Advances in Genetic Program-ming 2. MIT Press, Cambridge, MA, USA.

    Google Scholar 

  • Angeline, P. J. and Pollack, J. B. (1992). The evolutionary induction of subroutines. In Proceedings of the Fourteenth Annual Conference of the Cognitive Science Society, Bloomington, Indiana, USA. Lawrence Erlbaum.

    Google Scholar 

  • Angeline, P. J. and Pollack, J. B. (1993). Evolutionary module acquisition. In Fo-gel, D. and Atmar, W., editors, Proceedings of the Second Annual Conference on Evolutionary Programming, pages 154–163, La Jolla, CA, USA.

    Google Scholar 

  • Banzhaf, W., Nordin, P., Keller, R. E., and Francone, F. D.(1998). Genetic Programming-An Introduction; On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann, dpunkt.verlag.

    Google Scholar 

  • Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., and Weinfurter, H. (1995). Elementary gates for quantum computation. Physical Review A, 52:3457–3467.

    Article  Google Scholar 

  • Barnum, H., Bernstein, H. J., and Spector, L. (2000). Quantum circuits for OR and AND of ORs. Journal of Physics A: Mathematical and General, 33(45):8047–8057.

    Article  MathSciNet  MATH  Google Scholar 

  • Beckman, D., Chari, A. N., Devabhaktuni, S., and Preskill, J. (1996). Efficient networks for quantum factoring. Technical Report CALT-68-2021, California Institute of Technology. http://xxx.lanl.gov/abs/quant-ph/9602016.

    Google Scholar 

  • Bell, J. S. (1993). Speakable and unspeakable in quantum mechanics. Cambridge University Press, Cambridge.

    Google Scholar 

  • Bennett, C. H. (1999). Quantum information theory. In Hey, A. J. G., editor, Feynman and Computation: Exploring the Limits of Computers, pages 177–190. Persus Books, Reading, Massachusetts.

    Google Scholar 

  • Bennett, C. H., Bernstein, H. J., Harrow, A,, Leung, D. W., Smolin, J. A,, and Spector, L. (2004). Evidence for unequal efficiencies of some quantum gates for forward communication, backward communication and entanglement generation, discovered in part by genetic programming. (in preparation).

    Google Scholar 

  • Brooks, M., editor (1999). Quantum Computing and Communications. Springer-Verlag, London.

    MATH  Google Scholar 

  • Brown, J. (2000). Minds, Machines and the Multiverse: The Quest for the Quantum Computer. Simon & Schuster.

    Google Scholar 

  • Burke, E., Gustafson, S., and Kendall, G. (2002a). A survey and analysis of diversity measures in genetic programming. In Langdon, W. B., Cantu-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M. A., Schultz, A. C., Miller, J. F., Burke, E., and Jonoska, N., editors, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 716–723, New York. Morgan Kaufmann Publishers.

    Google Scholar 

  • Burke, E., Gustafson, S., Kendall, G., and Krasnogor, N. (2002b). Advanced popula-tion diversity measures in genetic programming. In Guervós, J.-J. M., Adamidis, P., Beyer, H.-G., nas, J.-L. F.-V., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature-PPSN VII, number 2439 in Lecture Notes in Computer Science, LNCS, page 341 ff., Granada, Spain. Springer-Verlag.

    Google Scholar 

  • Chen, J. C. (2002). Quantum Computation and Natural Language Processing. PhD thesis, Department of Computer Science, University of Hamburg, Vogt-Kolln-Strae 30, D-22527 Hamburg, Germany. http://nats-www.informatik.uni-hamburg.de/-joseph/dis/.

    Google Scholar 

  • Christensen, S. and Oppacher, F. (2001). What can we learn from no free lunch? A first attempt to characterize the concept of a searchable function. In Spector, L., Goodman, E. D., Wu, A., Langdon, W. B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M. H., and Burke, E., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 1219–1226, San Francisco, California, USA. Morgan Kaufmann.

    Google Scholar 

  • Cramer, N. L. (1985). A representation for the adaptive generation of simple sequential programs. In Grefenstette, J. J., editor, Proceedings of an International Conference on Genetic Algorithms and the Applications, pages 183–187, Carnegie-Mellon University, Pittsburgh, PA, USA.

    Google Scholar 

  • Crawford-Marks, R. and Spector, L. (2002). Size control via size fair genetic operators in the PushGP genetic programming system. In Langdon, W. B., Cantu-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M. A., Schultz, A. C., Miller, J. F., Burke, E., and Jonoska, N., editors, GECCO 2002: Proceedings of the Genetic and Evolu-tionary Computation Conference, pages 733–739, New York. Morgan Kaufmann Publishers.

    Google Scholar 

  • Deutsch, D. (1997). The Fabric of Reality. Penguin Books.

    Google Scholar 

  • Deutsch, D. and Jozsa, R. (1992). Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London Ser.A, A439:553–558.

    Article  MathSciNet  Google Scholar 

  • Droste, S., Jansen, T., and Wegener, I. (1999). Perhaps not a free lunch but at least a free appetizer. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., and Smith, R. E., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 833–839, Orlando, Florida, USA. Morgan Kaufmann.

    Google Scholar 

  • Edmonds, B. (2001). Meta-genetic programming: Co-evolving the operators of variation. Elektrik, 9(1):13–29. Turkish Journal Electrical Engineering and Computer Sciences.

    Google Scholar 

  • Ekart, A. and Nemeth, S. Z. (2001). Selection based on the pareto nondomination cri-terion for controlling code growth in genetic programming. Genetic Programming and Evolvable Machines, 2(1):61–73.

    Article  MATH  Google Scholar 

  • Elitzur, A. C. and Vaidman, L. (1993). Quantum mechanical interaction-free measurements. Foundation of Physics, 23:987–997. http://arxiv.org/abs/hep-th/9305002.

    Article  Google Scholar 

  • Feynman, R. P. (1985). QED: The Strange Theory of Light and Matter. Princeton University Press.

    Google Scholar 

  • Feynman, R. P. (1996). Feynman Lectures on Computation. Perseus Publishing, Cambridge, Massachusetts.

    Google Scholar 

  • Fogel, D. B. and Atmar, J. W. (1990). Comparing genetic operators with Gaussian mutations in simulated evolutionary processes using linear systems. Biological Cybernetics, 63(2):111–114.

    Article  Google Scholar 

  • Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley.

    Google Scholar 

  • Graham, P. (1994). On Lisp: advanced techniques for Common Lisp. Prentice-Hall, Englewood Cliffs, NJ 07632, USA.

    Google Scholar 

  • Grover, L. K. (1997). Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, pages 325–328.

    Google Scholar 

  • Gruau, F. (1994). Genetic micro programming of neural networks. In Kinnear, Jr., K. E., editor, Advances in Genetic Programming, chapter 24, pages 495–518. MIT Press.

    Google Scholar 

  • Gruska, J. (1999). Quantum Computing. McGraw-Hill Publishing Company, Maidenhead, Berkshire.

    Google Scholar 

  • Hallgren, S. (2002). Polynomial-time quantum algorithms for pell’s equation and the principal ideal problem. In Proceedings of the 34th ACM Symposium on Theory of Computing.

    Google Scholar 

  • Hallgren, S., Russell, A., and Ta-Shma, A. (2003). The hidden subgroup problem and quantum computation using group representations. SIAM J. Cornput., 32(4):916–934.

    Article  MathSciNet  MATH  Google Scholar 

  • Hey, A. J. G., editor (1999). Feynman and Computation: Exploring the Limits of Computers. Persus Books, Reading, Massachusetts.

    MATH  Google Scholar 

  • Hogg, T. (1998). Highly structured searches with quantum computers. Physical ReviewLetters, 80:2473–2476.

    Article  Google Scholar 

  • Hogg, T. (2000). Quantum search heuristics. Physical Review A, 61:052311.

    Article  Google Scholar 

  • Holland, J. H. (1992). Adaptation in Natural and Artificial Systems: An introductory analysis with applications to biology, control, and artificial intelligence. The MIT Press, Cambridge, Massachusetts. First edition 01975.

    Google Scholar 

  • Igel and Toussaint (2003). On classes of functions for which no free lunch results hold. IPL: Information Processing Letters, 86.

    Google Scholar 

  • Jozsa, R. (1997). Entanglement and quantum information. In Hugett, S., Mason, L., Todd, K. P., Tsou, S. T., and Woodhouse, N. J., editors, Geometric Issues in the Foundations of Science. Oxford University Press. http://arXiv.org/quant-ph/9707034.

    Google Scholar 

  • Kinnear, Jr., K. E., editor (1994a). Advances in Genetic Programming. MIT Press, Cambridge, MA.

    Google Scholar 

  • Kinnear, Jr., K. E. (1994b). Alternatives in automatic function definition: A comparison of performance. In Kinnear, Jr., K. E., editor, Advances in Genetic Programming, chapter 6, pages 119–141. MIT Press.

    Google Scholar 

  • Klein, J. (2002). BREVE: a 3d environment for the simulation of decentralized systems and artificial life. In Standish, R. K., Bedau, M. A., and Abbass, H. A., editors, Proceedings of Artificial Life VIII, the 8th International Conference on the Simulation and Synthesis of Living Systems, pages 329–334. The MIT Press. http://www.spiderland.org/breve/breve-klein-alife2002.pdf.

    Google Scholar 

  • Koza, J. (1990). Genetic programming: A paradigm for genetically breeding populations of computer programs to solve problems. Technical Report STAN-CS-90-1314, Dept. of Computer Science, Stanford University.

    Google Scholar 

  • Koza, J. R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA.

    MATH  Google Scholar 

  • Koza, J. R. (1994). Genetic Programming 11: Automatic Discovery of Reusable Programs. MIT Press, Cambridge Massachusetts.

    Google Scholar 

  • Koza, J. R., David Andre, Bennett III, F. H., and Keane, M. (1999). Genetic Programming 111: Darwinian Invention and Problem Solving. Morgan Kaufman.

    Google Scholar 

  • Koza, J. R., Keane, M. A., Streeter, M. J., Mydlowec, W., Yu, J., and Lanza, G. (2003). Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers.

    Google Scholar 

  • Kwiat, P., Weinfurter, H., Herzog, T., Zeilinger, A., and Kasevich, M. (1995). Interaction-free quantum measurements. Physical Review Letters, 74:4763–4766.

    Article  Google Scholar 

  • Landauer, R. (1999). Information is inevitably physical. In Hey, J. G., editor, Feynman and Computation: Exploring the Limits of Computers, pages 77–92. Perseus Books, Reading, MA.

    Google Scholar 

  • Langdon, W. B. (1998). Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! Kluwer, Boston.

    Google Scholar 

  • Langdon, W. B., Soule, T., Poli, R., and Foster, J. A. (1999). The evolution of size and shape. In Spector, L., Langdon, W. B., O’Reilly, U.-M., and Angeline, P. J., editors, Advances in Genetic Programming 3, chapter 8, pages 163–190. MIT Press, Cambridge, MA, USA.

    Google Scholar 

  • Leier, A. and Banzhaf, W. (2003a). Evolving Hogg’s quantum algorithm using lineartree GP. In Cantú-Paz, E., Foster, J. A., Deb, K., Davis, D., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Standish, R., Kendall, G., Wilson, S., Harman, M., Wegener, J., Dasgupta, D., Potter, M. A., Schultz, A. C., Dowsland, K., Jonoska, N., and Miller, J., editors, Genetic and Evolutionary Computation-GECCO-2003, volume 2723 of LNCS, pages 390–400, Chicago. Springer-Verlag.

    Google Scholar 

  • Leier, A. and Banzhaf, W. (2003b). Exploring the search space of quantum programs. In Sarker, R. et al., editors, Proc. 2003 Congress on Evolutionary Computation (CEC'O3), Canberra, volume 1, pages 170–177, Piscataway NJ. IEEE Press.

    Chapter  Google Scholar 

  • Luke, S. (2000). Issues in Scaling Genetic Programming: Breeding Strategies, Tree Generation, and Code Bloat. PhD thesis, Department of Computer Science, University of Maryland, A. V. Williams Building, University of Maryland, College Park, MD 20742 USA. http://www.cs.gmu.edu/-sean/papers/thesis2p.pdf.

    Google Scholar 

  • Luke, S. and Spector, L. (1998). A revised comparison of crossover and mutation in genetic programming. In Koza, J. R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D. B., Garzon, M. H., Goldberg, D. E., Iba, H., and Riolo, R., editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 208–213, University of Wisconsin, Madison, Wisconsin, USA. Morgan Kaufmann.

    Google Scholar 

  • Massey, P., Clark, J., and Stepney, S. (2004). Evolving quantum circuits and programs through genetic programming. In Deb, K., Poli, R., Spector, L., Thierens, D., Beyer, H.-G., Tettamanzi, A., Lanzi, P. L., Tyrrell, A., Foster, J., Banzhaf, W., Holland, O., Floreano, D., Burke, E., Harman, M., Darwen, P., and Dasgupta, D., editors, Genetic and Evolutionary Computation-GECCO-2004. Springer-Verlag.

    Google Scholar 

  • McCarthy, J., Levin, M., et al. (1966). LISP 1.5 Programmer’s Manual. MIT.

    Google Scholar 

  • Milburn, G. J. (1997). Schrodinger’s Machines: The Quantum Technology Reshaping Everyday Life. W. H. Freeman and Company, New York.

    Google Scholar 

  • Mitchell, M. (1996). An Introduction to Genetic Algorithms. MIT Press.

    Google Scholar 

  • Montana, D. J. (1993). Strongly typed genetic programming. BBN Technical Report #7866, Bolt Beranek and Newman, Inc., 10 Moulton Street, Cambridge, MA 02138,USA.

    Google Scholar 

  • Nielsen, M. A. and Chuang, I. L. (2000). Quantum Computation and Quantum Information. Cambridge University Press, Cambridge.

    MATH  Google Scholar 

  • Obenland, K. and Despain, A. (1998). A parallel quantum computer simulator. http://arxiv.org/quant-ph/9804039.

    Google Scholar 

  • O’Neill, M. and Ryan, C. (2003). Grammatical Evolution: Evolutionary Automatic Programming in a Arbitrary Language, volume 4 of Genetic programming. Kluwer Academic Publishers.

    Google Scholar 

  • Penrose, R. (1989). The Emperor’s New Mind: concerning computers, minds, and the laws of physics. Oxford University Press.

    Google Scholar 

  • Penrose, R. (1997). The Large, the Small and the Human Mind. Cambridge University Press.

    Google Scholar 

  • Perkis, T. (1994). Stack-based genetic programming. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, volume 1, pages 148–153, Orlando, Florida, USA. IEEE Press.

    Chapter  Google Scholar 

  • Perkowski, M., Lukac, M., Pivtoraiko, M., Kerntopf, P., Folgheraiter, M., Lee, D., Kim, H., Kim, H., Hwangboo, W., Kim, J.-W., and Choi, Y. (2003). A hierarchical approach to computer aided design of quantum circuits. In Proceedings of 6th International Symposium on Representations and Methodology of Future Computing Technology, RM 2003, pages 201–209. http://www.ee.pdx.edu/-mperkows/=PUBLICATIONS/PDF-2003/Perkowski.pdf.

    Google Scholar 

  • Polito, J., Daida, J., and Bersano-Begey, T. F. (1997). Musica ex machina: Composing 16th-century counterpoint with genetic programming and symbiosis. In Angeline, P. J., Reynolds, R. G., McDonnell, J. R., and Eberhart, R., editors, Evolutionary Programming VI: Proceedings of the Sixth Annual Conference on Evolutionary Programming, volume 1213 of Lecture Notes in Computer Science, Indianapolis, Indiana, USA. Springer-Verlag.

    Google Scholar 

  • Racine, A., Schoenauer, M., and Dague, P. (1998). A dynamic lattice to evolve hierarchically shared subroutines: DL’GP. In Banzhaf, W., Poli, R., Schoenauer, M., and Fogarty, T. C., editors, Proceedings of the First European Worlcshop on Genetic Programming, volume 1391 of LNCS, pages 220–232, Paris. Springer-Verlag.

    Google Scholar 

  • Rieffel, E. and Polak, W. (2000). An introduction to quantum computing for nonphysicists. http://arxiv.org/quant-ph/9809016.

    Google Scholar 

  • Riolo, R. L. and Worzel, B. (2003). Genetic Programming Theory and Practice. Kluwer, Boston, MA, USA.

    MATH  Google Scholar 

  • Roberts, S. C., Howard, D., and Koza, J. R. (2001). Evolving modules in genetic programming by subtree encapsulation. In Miller, J. F., Tomassini, M., Lanzi, P. L., Ryan, C., Tettamanzi, A. G. B., and Langdon, W. B., editors, Genetic Programming, Proceedings of EuroGP’2001, volume 2038 of LNCS, pages 160–175, Lake Como, Italy. Springer-Verlag.

    Google Scholar 

  • Robinson, A. (2001). Genetic programming: Theory, implementation, and the evolution of unconstrained solutions. Division 111 thesis, Hampshire College. http://hampshire.edu/lspector/robinson-div3.pdf.

    Google Scholar 

  • Rylander, B., Soule, T., Foster, J., and Alves-Foss, J. (2001). Quantum evolutionary programming. In Spector, L., Goodman, E. D., Wu, A., Langdon, W. B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M. H., and Burke, E., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 1005–1011, San Francisco, California, USA. Morgan Kaufmann.

    Google Scholar 

  • Schmidhuber, J. (1987). Evolutionary principles in self-referential learning. on learning now to learn: The meta-meta-meta...-hook. Diploma thesis, Technische Universitat Munchen, Germany.

    Google Scholar 

  • Schumacher, C., Vose, M. D., and Whitley, L. D. (2001). The no free lunch and problem description length. In Spector, L., Goodman, E. D., Wu, A., Langdon, W. B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M. EI., and Burke, E., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 565-570, San Francisco, California, USA. Morgan Kaufmann.

    Google Scholar 

  • Shapiro, J. H. and Hirota, O., editors (2003). Proceedings of the 6th International Conference on Quantum Communication, Measurement, and Computing. Rinton Press, Princeton, New Jersey.

    Google Scholar 

  • Shor, P. W. (1994). Algorithms for quantum computation: Discrete logarithms and factoring. In Goldwasser, S., editor, Proceedings of the 35th Annuai Symposium on Foundations of Computer Science. IEEE Computer Society Press.

    Google Scholar 

  • Shor, P. W. (1998). Quantum computing. Documenta Mathematica, Extra Volume ICM:467-486. http://east.camel.math.ca/EMIS/journals/DMJDMV/xvol-icm / OO/Shor.MAN.ps.gz.

    Google Scholar 

  • Spector, L. (1996). Simultaneous evolution of programs and their control structures. In Angeline, P. J. and Kinnear, Jr., K. E., editors, Advances in Genetic Programming 2, chapter 7, pages 137–154. MIT Press, Cambridge, MA, USA.

    Google Scholar 

  • Spector, L. (2001). Autoconstructive evolution: Push, pushGP, and pushpop. In Spector, L., Goodman, E. D., Wu, A., Langdon, W. B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M. H., and Burke, E., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 137–146, San Francisco, California, USA. Morgan Kaufmann.

    Google Scholar 

  • Spector, L. (2002). Adaptive populations of endogenously diversifying pushpop organisms are reliably diverse. In Standish, R. K., Bedau, M. A., and Abbass, H. A., editors, Proceedings of Artificial Life VIII, the 8th International Conference on the Simulation and Synthesis of Living Systems, pages 142–145. The MIT Press.

    Google Scholar 

  • Spector, L. (2003). An essay concerning human understanding of genetic programming. In Riolo, R. L. and Worzel, B., editors, Genetic Programming Theory and Practice, chapter 2, pages 11–24. Kluwer.

    Google Scholar 

  • Spector, L. and Alpern, A. (1994). Criticism, culture, and the automatic generation of artworks. In Proceedings of Twelfth National Conference on Artificial Intelligence, pages 3–8, Seattle, Washington, USA. AAAI Press/MIT Press.

    Google Scholar 

  • Spector, L., Barnum, H., and Bernstein, H. J. (1998). Genetic programming for quantum computers. In Koza, J. R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D. B., Garzon, M. H., Goldberg, D. E., Iba, H., and Riolo, R., editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 365–373, University of Wisconsin, Madison, Wisconsin, USA. Morgan Kaufmann.

    Google Scholar 

  • Spector, L., Barnum, H., Bernstein, H. J., and Swami, N. (1999a). Finding a betterthan-classical quantum AND/OR algorithm using genetic programming. In Angeline, P. J., Michalewicz, Z., Schoenauer, M., Yao, X., and Zalzala, A., editors, Proceedings of the Congress on Evolutionary Computation, volume 3, pages 2239–2246, Mayflower Hotel, Washington D.C., USA. IEEE Press.

    Google Scholar 

  • Spector, L., Barnum, H., Bernstein, H. J., and Swamy, N. (1999b). Quantum computing applications of genetic programming. In Spector, L., Langdon, W. B., O’Reilly, U.-M., and Angeline, P. J., editors, Advances in Genetic Programming 3, chapter 7, pages 135–160. MIT Press, Cambridge, MA, USA.

    Google Scholar 

  • Spector, L. and Bernstein, H. J. (2003). Communication capacities of some quantum gates, discovered in part through genetic programming. In Shapiro, J. H. and Hirota, O., editors, Proceedings of the Sixth International Conference on Quantum Communication, Measurement, and Computing (QCMC), pages 500–503. Rinton Press.

    Google Scholar 

  • Spector, L. and Klein, J. (2002). Evolutionary dynamics discovered via visualizationin the BREVE simulation environment. In Smith, T., Bullock, S., and Bird, J., editors, Beyond Fitness: Visualising Evolution-Work. of Artificial Life VIII: 8th Int. Conf. Simulation and Synthesis of Living Systems.

    Google Scholar 

  • Spector, L., Klein, J., Perry, C., and Feinstein, M. (2003a). Emergence of collective behavior in evolving populations of flying agents. In Cantú-Paz, E., Foster, J. A., Deb, K., Davis, D., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Standish, R., Kendall, G., Wilson, S., Harman, M., Wegener, J., Dasgupta, D., Potter, M. A., Schultz, A. C., Dowsland, K., Jonoska, N., and Miller, J., editors, Genetic and Evolutionary Computation-GECCO-2003, volume 2723 of LNCS, pages 61–73, Chicago. Springer-Verlag.

    Google Scholar 

  • Spector, L., Langdon, W. B., O’Reilly, U.-M., and Angeline, P. J., editors (1999c). Advances in Genetic Programming 3. MIT Press, Cambridge, MA, USA.

    Google Scholar 

  • Spector, L., Perry, C., and Klein, J. (2003b). Push 2.0 programming language description. Technical report, School of Cognitive Science, Hampshire College. http://hampshire.edu/lspector/push2-description.html.

    Google Scholar 

  • Spector, L. and Robinson, A. (2002a). Genetic programming and autoconstructive evolution with the push programming language. Genetic Programming and Evolvable Machines, 3(1):7–40.

    Article  MATH  Google Scholar 

  • Spector, L. and Robinson, A. (2002b). Multi-type, self-adaptive genetic programming as an agent creation tool. In Barry, A. M., editor, GECCO 2002: Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference, pages 73–80, New York. AAAI. http://hampshire.edu/lspector/pubs/ecomas2002-spector-toappear.pdf.

    Google Scholar 

  • Spector, L. and Stoffel, K. (1996a). Automatic generation of adaptive programs. In Maes, P., Mataric, M. J., Meyer, J.-A., Pollack, J., and Wilson, S. W., editors, Proceedings of the Fourth International Conference on Simulation of Adaptive Behavior: Fbom animals to animats 4, pages 476–483, Cape Code, USA. MIT Press.

    Google Scholar 

  • Spector, L. and Stoffel, K. (199613). Ontogenetic programming. In Koza, J. R., Goldberg, D. E., Fogel, D. B., and Riolo, R. L., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 394–399, Stanford University, CA, USA. MIT Press.

    Google Scholar 

  • Steane, A. (1998). Quantum computing. Reports on Progress in Physics, 61:117–173. http://xxx.lanl.gov/abs/quant-ph/9708022.

    Article  MathSciNet  Google Scholar 

  • Steele Jr., G. L. (1984). Common LISP: The Language. Digital Press, Burlington, Mass.

    Google Scholar 

  • Stoffel, K. and Spector, L. (1996). High-performance, parallel, stack-based genetic programming. In Koza, J. R., Goldberg, D. E., Fogel, D. B., and Riolo, R. L., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 224–229, Stanford University, CA, USA. MIT Press.

    Google Scholar 

  • Surkan, A. J. and Khuskivadze, A. (2001). Evolution of quantum algorithms for computer of reversible operators. In Stoica, A., Lohn, J., Katz, R., Keymeulen, D., and Zebulum, R. S., editors, The 2002 NASA/DoD Conference on Evolvable Hardware, pages 186–187, Long Beach, California. Jet Propulsion Laboratory, California Institute of Technology, IEEE Computer Society.

    Google Scholar 

  • Tchernev, E. (1998). Forth crossover is not a macromutation? In Koza, J. R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D. B., Garzon, M. H., Goldberg, D. E., Iba, H., and Riolo, R., editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 381–386, University of Wisconsin, Madison, Wisconsin, USA. Morgan Kaufmann.

    Google Scholar 

  • Udrescu-Milosav, M. (2003). Quantum Algorithms Implementation: Circuit Design Principles and Entanglement Analysis. PhD thesis, University Politehnica Timisoara, Romania.

    Google Scholar 

  • Vaidman, L. (1996). Interaction-free measurements. http://arxiv.org/quant-ph/9610033.

    Google Scholar 

  • van Dam, W., Hallgren, S., and Ip, L. (2002). Quantum algorithms for some hidden shift problems. http://arxiv.org/quant-ph/0211140.

    Google Scholar 

  • van Dam, W. and Seroussi, G. (2002). Efficient quantum algorithms for estimating Gauss sums. http://arxiv.org/quant-ph/0207131.

    Google Scholar 

  • Viamontes, G. F., Markov, I. L., and Hayes, J. P. (2003). Improving gate-level simulation of quantum circuits. http://arxiv.org/quant-ph/0309060.

    Google Scholar 

  • Viamontes, G. F., Rajagopalan, M., Markov, I. L., and Hayes, J. P. (2002). Gate-level simulation of quantum circuits. http://arxiv.org/quant-ph/0208003.

    Google Scholar 

  • Whitley, D. (1999). A free lunch proof for gray versus binary encodings. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., and Smith, R. E., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 726–733, Orlando, Florida, USA. Morgan Kaufmann.

    Google Scholar 

  • Wiles, J. and Tonkes, B. (2002). Visualisation of hierarchical cost surfaces for evolutionary computation. In Proceedings of the 2002 Congress on Evolutionary Computation, pages 157–162.

    Google Scholar 

  • Williams, C. P. and Clearwater, S. H. (1998). Explorations in Quantum Computing. Springer-Verlag, New York.

    Google Scholar 

  • Williams, C. P. and Gray, A. G. (1999). Automated design of quantum circuits. In Williams, C. P., editor, Quantum Computing and Quantum Communications: First NASA International Conference, QCQC198, number 1509 in Lecture Notes in Computer Science, LNCS, pages 113–125, Palm Springs, California, USA. Springer-Verlag.

    Google Scholar 

  • Wolpert, D. H. and Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Trans. on Evolutionary Computation, 1(1):67–82.

    Article  Google Scholar 

  • Woodward, J. R. and Neil, J. R. (2003). No free lunch, program induction and combinatorial problems. In Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., and Costa, E., editors, Genetic Programming, Proceedings of EuroGP’2003, volume 2610 of LNCS, pages 479–488, Essex. Springer-Verlag.

    Google Scholar 

Download references

Editor information

Editors and Affiliations

  1. Hampshire College, USA

    Lee Spector

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

(2004). Conclusions and Prospects. In: Spector, L. (eds) Automatic Quantum Computer Programming. Genetic Programming, vol 7. Springer, Boston, MA . https://doi.org/10.1007/978-0-387-36791-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-36791-0_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-36496-4

  • Online ISBN: 978-0-387-36791-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation