Dr Nicholas Chancellor nicholas.chancellor@durham.ac.uk
Teaching Fellow QO
Domain wall encoding of discrete variables for quantum annealing and QAOA
Chancellor, Nicholas
Authors
Abstract
In this paper I propose a new method of encoding discrete variables into Ising model qubits for quantum optimization. The new method is based on the physics of domain walls in one dimensional Ising spin chains. I find that these encodings and the encoding of arbitrary two variable interactions is possible with only two body Ising terms. Following on from similar results for the `one hot' method of encoding discrete variables [Hadfield et. al. Algorithms 12.2 (2019): 34] I also demonstrate that it is possible to construct two body mixer terms which do not leave the logical subspace, an important consideration for optimising using the quantum alternating operator ansatz (QAOA). I additionally discuss how, since the couplings in the domain wall encoding only need to be ferromagnetic and therefore could in principle be much stronger than anti-ferromagnetic couplers, application specific quantum annealers for discrete problems based on this construction may be beneficial. Finally, I compare embedding for synthetic scheduling and colouring problems with the domain wall and one hot encodings on two graphs which are relevant for quantum annealing, the chimera graph and the Pegasus graph. For every case I examine I find a similar or better performance from the domain wall encoding as compared to one hot, but this advantage is highly dependent on the structure of the problem. For encoding some problems, I find an advantage similar to the one found by embedding in a Pegasus graph compared to embedding in a chimera graph.
Citation
Chancellor, N. (2019). Domain wall encoding of discrete variables for quantum annealing and QAOA. Quantum Science and Technology, 4(4), Article 045004. https://doi.org/10.1088/2058-9565/ab33c2
Journal Article Type | Article |
---|---|
Acceptance Date | Jul 19, 2019 |
Online Publication Date | Aug 6, 2019 |
Publication Date | Oct 31, 2019 |
Deposit Date | Aug 2, 2019 |
Publicly Available Date | Aug 6, 2019 |
Journal | Quantum Science and Technology |
Publisher | IOP Publishing |
Peer Reviewed | Peer Reviewed |
Volume | 4 |
Issue | 4 |
Article Number | 045004 |
DOI | https://doi.org/10.1088/2058-9565/ab33c2 |
Files
Published Journal Article
(1.2 Mb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Copyright Statement
Original content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.
You might also like
Graphical structures for design and verification of quantum error correction
(2023)
Journal Article
Using copies can improve precision in continuous-time quantum computing
(2023)
Journal Article
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
(2023)
Journal Article
Controller-Based Energy-Aware Wireless Sensor Network Routing Using Quantum Algorithms
(2022)
Journal Article
Modernizing quantum annealing II: genetic algorithms with the inference primitive formalism
(2022)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search