Skip to main content
  • 294 Accesses

Abstract

GQA combines genetic algorithm with quantum computing. Instead of binary, numeric or symbolic representation, we introduce qubit chromosome representation. GQA is used in the process of geometric constraint solving in order to get the solution sequence. The proposed algorithm is offered in a quantum spirit, to allow analogue quantum computers to solve global optimization problems. GQA can solve problems in polynomial time instead of the exponential time required by classical algorithm. The experiment indicates that GQA is good for the fast solving for general geometric constraint problem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Yuan Bo, Research and Implementation of Geometric Constraint Solving Technology, Doctor dissertation of Tsinghua University, 1999

    Google Scholar 

  2. R. Joan-Arinyo, M. V. Luzon, and A. Soto ”Constructive Geometric Constraint Solving : A New Application of Genetic Algorithms“, September, 2002

    Google Scholar 

  3. Zhong Cheng, Chen Guoliang Quantum computation and its application, GuangXi University Transaction (natural science edition) March, 2002 26(1)

    Google Scholar 

  4. S. Lloyd, Science 1993, (261) : 1569

    Google Scholar 

  5. S. Lloyd , Science 1994, (263), 695

    Google Scholar 

  6. D. Divincenzo, Science, 1995, (270) : 255

    Google Scholar 

  7. Kuk-Hyun Han , Jong-Hwan Kim Genetic Quantum Algorithm and its application Combinatorial Optimization Problem, 2000

    Google Scholar 

  8. Ajit Narayanan Quantum computing for beginners, IEEE 1999

    Google Scholar 

  9. A. Yao, in Proceedings of the 34th Annual Symposium of Foundation of Computer Science. (IEEE Computer Society, Los Almamitos, CA), 352, 1993,

    Google Scholar 

  10. D. Deusch, Proc. Roy. Soc London Ser, 73, A425, 1989.

    Google Scholar 

  11. A. Barenco et al. , Phys. Rev. 3457, A52, 1995.

    Google Scholar 

  12. E. Fredkin and T. Toffoli, Int. J. Theor. Phys. , 21, 219, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  13. Pothen A and Fan C J. ”Computing the block triangular form of a sparse matrix“. ACM Trans.Mathematical Software, 16(4): 303–324, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  14. H. F. Chau and F. Wilczek, Phys. Rev. lett. , 74, 75, 1995

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media New York

About this paper

Cite this paper

Cao, C., Fu, W., Li, W. (2004). The Research of a New Geometric Constraint Solver. In: Yan, XT., Jiang, CY., Juster, N.P. (eds) Perspectives from Europe and Asia on Engineering Design and Manufacture. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-2212-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-2212-8_20

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-015-7003-9

  • Online ISBN: 978-1-4020-2212-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics