Domain wall encoding of discrete variables for quantum annealing and QAOA
Open accessThe DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
In this paper I propose a new method of encoding discrete variables into Ising model qubits for quantum optimisation. 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 2019 Algorithms12 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. 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891 · cited 1×
“In a flux qubit quantum annealer, the Ising spins are already formed from the two lowest energy states of an infinite ladder for each qubit, and modelling these additional states is sometimes important to fully understand the dynamics [46].”
BackgroundFrom the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Spatial search by quantum walk
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.022314 · Cited by 725 · cited 1×
“On one hand, it is known that a speedup is not possible for quantum search in too low of a dimension [40], however, low dimensionality is only problematic in dimensions less than 4 , meaning that if this result carries over from search to optimization (it is not a priori clear that it would), then…”
BackgroundMinor-embedding in adiabatic quantum computation: I. The parameter setting problem
Choi, V. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0082-9 · Cited by 410
Finding low-energy conformations of lattice protein models by quantum annealing
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., & Aspuru-Guzik, A. (2012) · Scientific Reports · doi:10.1038/srep00571 · Cited by 366
A quantum annealing architecture with all-to-all connectivity from local interactions
Lechner, W., Hauke, P., & Zoller, P. (2015) · Science Advances · doi:10.1126/sciadv.1500838 · Cited by 256
Reverse quantum annealing approach to portfolio optimization problems
Venturelli, D., & Kondratyev, A. (2019) · Quantum Machine Intelligence · doi:10.1007/s42484-019-00001-w · Cited by 233
Optimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle
Yang, Z.-C., Rahmani, A., Shabani, A., Neven, H., & Chamon, C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021027 · Cited by 210 · cited 1×
“[20] Zhi-Cheng Yang, Armin Rahmani, Alireza Shabani, Hartmut Neven, and Claudio Chamon.”
BackgroundXY mixers: Analytical and numerical results for the quantum alternating operator ansatz
Wang, Z., Rubin, N. C., Dominy, J. M., & Rieffel, E. G. (2020) · Physical Review A · doi:10.1103/physreva.101.012320 · Cited by 190
Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
Stollenwerk, T., O'Gorman, B., Venturelli, D., Mandra, S., Rodionova, O., Ng, H., Sridhar, B., Rieffel, E. G., & Biswas, R. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2019.2891235 · Cited by 129
Next-Generation Topology of D-Wave Quantum Processors
Boothby, K., Bunyk, P., Raymond, J., & Roy, A. (2020) · arXiv · doi:10.48550/arxiv.2003.00133 · Cited by 125
Quantum Annealing for Constrained Optimization
Hen, I., & Spedalieri, F. M. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.5.034007 · Cited by 114 · cited 1×
“Specialized drivers for quantum annealing which act over a feasible subspace has been examined previously for other problem encodings [22, 47, 48].”
BackgroundHOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
FARHI, E., GOLDSTONE, J., GUTMANN, S., & NAGAJ, D. (2008) · International Journal of Quantum Information · doi:10.1142/s021974990800358x · Cited by 81
A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
Marsh, S., & Wang, J. B. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2171-3 · Cited by 50
Cited by
Quantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
“It has been shown to be more efficient in different test problems [18, 31, 32].”
Designing metamaterials with quantum annealing and factorization machines
Kitai, K., Guo, J., Ju, S., Tanaka, S., Tsuda, K., Shiomi, J., & Tamura, R. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013319 · Cited by 181
Sawaya, N. P. D., Menke, T., Kyaw, T. H., Johri, S., Aspuru-Guzik, A., & Guerreschi, G. G. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0278-0 · Cited by 163
Quantum Shuttle: traffic navigation with Quantum computing
Yarkoni, S., Neukart, F., Tagle, E. M. G., Magiera, N., Mehta, B., Hire, K., Narkhede, S., & Hofmann, M. (2020) · Proceedings of the 1st ACM SIGSOFT International Workshop on Architectures and Paradigms for Engineering Quantum Software · doi:10.1145/3412451.3428500 · Cited by 50
High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
Pelofske, E., Bärtschi, A., Golden, J., & Eidenbenz, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00064 · Cited by 15
Metadata
- Authors
- Chancellor, N.
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2019-08-06
- Volume
- 4
- Issue
- 4
- Pages
- 045004
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W2922475749
- Cited by
- 87
- References
- 15
- FWCI
- 2.88
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.