IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-032-00385-0_68.html
   My bibliography  Save this book chapter

Quantum-Inspired Heuristics

In: Handbook of Heuristics

Author

Listed:
  • Seán McGarraghy

    (University College Dublin, School of Business)

  • Milena Venkova

    (Technological University of Dublin, School of Mathematics & Statistics)

Abstract

Physical processes can inspire the design of algorithms and (meta)heuristics. In recent years, a number of such algorithms, implemented on both quantum and classical computers, have been developed and applied. In this chapter, we provide an outline of the range of these algorithms, focusing on those inspired by quantum physics, and describe some applications, particularly to problems in the domain of operational research. The chapter begins with an overview of the most relevant concepts from physics, including digital quantum computing, annealing, and spin glasses. We give a high-level overview of the current state of quantum computing, including hardware, and discuss its potential and current limitations. The simulated annealing algorithm, as well as the related simulated quantum annealing algorithm, is introduced. The chapter concludes with evolutionary and swarm-based algorithms that derive inspiration from quantum mechanics. Because of the enormous scope of work done in quantum-inspired algorithms and quantum computing, the chapter is necessarily selective in the material covered.

Suggested Citation

  • Seán McGarraghy & Milena Venkova, 2025. "Quantum-Inspired Heuristics," Springer Books, in: Rafael Martí & Panos M. Pardalos & Mauricio G.C. Resende (ed.), Handbook of Heuristics, edition 0, chapter 11, pages 259-317, Springer.
  • Handle: RePEc:spr:sprchp:978-3-032-00385-0_68
    DOI: 10.1007/978-3-032-00385-0_68
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-032-00385-0_68. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.