IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i17p3103-d900837.html
   My bibliography  Save this article

Quantum Tree Search with Qiskit

Author

Listed:
  • Andreas Wichert

    (Department of Computer Science and Engineering, INESC-ID & Instituto Superior Técnico, University of Lisbon, 2740-122 Porto Salvo, Portugal)

Abstract

We indicate the quantum tree search qiskit implementation by popular examples from symbolical artificial intelligence, the 3-puzzle, 8-puzzle and the ABC blocks world. Qiskit is an open-source software development kit (SDK) for working with quantum computers at the level of circuits and algorithms from IBM. The objects are represented by symbols and adjectives. Two principles are presented. Either the position description (adjective) is fixed and the class descriptors moves (is changed) or, in the reverse interpretation, the class descriptor is fixed and the position descriptor (adjective) moves (is changed). We indicate how to decompose the permutation operator that executes the rules by the two principles. We demonstrate that the the branching factor is reduced by Grover’s amplification to the square root of the average branching factor and not to the maximal branching factor as previously assumed.

Suggested Citation

  • Andreas Wichert, 2022. "Quantum Tree Search with Qiskit," Mathematics, MDPI, vol. 10(17), pages 1-28, August.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:17:p:3103-:d:900837
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/17/3103/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/17/3103/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Luís Tarrataca & Andreas Wichert, 2013. "Quantum Iterative Deepening with an Application to the Halting Problem," PLOS ONE, Public Library of Science, vol. 8(3), pages 1-9, March.
    2. M. W. Johnson & M. H. S. Amin & S. Gildert & T. Lanting & F. Hamze & N. Dickson & R. Harris & A. J. Berkley & J. Johansson & P. Bunyk & E. M. Chapple & C. Enderud & J. P. Hilton & K. Karimi & E. Ladiz, 2011. "Quantum annealing with manufactured spins," Nature, Nature, vol. 473(7346), pages 194-198, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Byron Tasseff & Tameem Albash & Zachary Morrell & Marc Vuffray & Andrey Y. Lokhov & Sidhant Misra & Carleton Coffrin, 2024. "On the emerging potential of quantum annealing hardware for combinatorial optimization," Journal of Heuristics, Springer, vol. 30(5), pages 325-358, December.
    2. Jia Si & Shuhan Yang & Yunuo Cen & Jiaer Chen & Yingna Huang & Zhaoyang Yao & Dong-Jun Kim & Kaiming Cai & Jerald Yoo & Xuanyao Fong & Hyunsoo Yang, 2024. "Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems," Nature Communications, Nature, vol. 15(1), pages 1-12, December.
    3. Marcello Calvanese Strinati & Claudio Conti, 2022. "Multidimensional hyperspin machine," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    4. Kevin Wils & Boyang Chen, 2023. "A Symbolic Approach to Discrete Structural Optimization Using Quantum Annealing," Mathematics, MDPI, vol. 11(16), pages 1-29, August.
    5. Bin Yan & Nikolai A. Sinitsyn, 2022. "Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian," Nature Communications, Nature, vol. 13(1), pages 1-12, December.
    6. Fabian Böhm & Diego Alonso-Urquijo & Guy Verschaffelt & Guy Van der Sande, 2022. "Noise-injected analog Ising machines enable ultrafast statistical sampling and machine learning," Nature Communications, Nature, vol. 13(1), pages 1-13, December.
    7. Yuqian Zhao & Zhaohua Ma & Zhangzhen He & Haijun Liao & Yan-Cheng Wang & Junfeng Wang & Yuesheng Li, 2024. "Quantum annealing of a frustrated magnet," Nature Communications, Nature, vol. 15(1), pages 1-9, December.

    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:gam:jmathe:v:10:y:2022:i:17:p:3103-:d:900837. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.