The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Efficient partition of integer optimization problems with one-hot encoding
Open accessAbstract
Quantum annealing is a heuristic algorithm for solving combinatorial optimization problems, and hardware for implementing this algorithm has been developed by D-Wave Systems Inc. The current version of the D-Wave quantum annealer can solve unconstrained binary optimization problems with a limited number of binary variables. However, the cost functions of several practical problems are defined by a large number of integer variables. To solve these problems using the quantum annealer, integer variables are generally binarized with one-hot encoding, and the binarized problem is partitioned into small subproblems. However, the entire search space of the binarized problem is considerably larger than that of the original integer problem and is dominated by infeasible solutions. Therefore, to efficiently solve large optimization problems with one-hot encoding, partitioning methods that extract subproblems with as many feasible solutions as possible are required. In this study, we propose two partitioning methods and demonstrate that they result in improved solutions.
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
Wu, F. Y. (1982) · Reviews of Modern Physics · doi:10.1103/revmodphys.54.235 · Cited by 3,570
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
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
Defining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601
Amin, M. H., Andriyash, E., Rolfe, J., Kulchytskyy, B., & Melko, R. (2018) · Physical Review X · doi:10.1103/physrevx.8.021050 · Cited by 520
What is the Computational Value of Finite-Range Tunneling?
Denchev, V. S., Boixo, S., Isakov, S. V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., & Neven, H. (2016) · Physical Review X · doi:10.1103/physrevx.6.031015 · Cited by 399
Mathematical foundation of quantum annealing
Morita, S., & Nishimori, H. (2008) · Journal of Mathematical Physics · doi:10.1063/1.2995837 · Cited by 381
Nonnegative/Binary matrix factorization with a D-Wave quantum annealer
O’Malley, D., Vesselinov, V. V., Alexandrov, B. S., & Alexandrov, L. B. (2018) · PLOS ONE · doi:10.1371/journal.pone.0206653 · Cited by 140
Adiabatic quantum programming: minor embedding with hard faults
Klymko, C., Sullivan, B. D., & Humble, T. S. (2014) · Quantum Information Processing · doi:10.1007/s11128-013-0683-9 · Cited by 99
Research works printed but not linked: 39
- Karkpatrick, S., Gelatt, C. D. & Vecchi, M. P. Optimization by simulated annealing. Sci. 220, 671–680, https://doi.org/10.1126/science.220.4598.671 (1983). · DOI · Paper page
- Santoro, G. E., Martoňák, R., Tosatti, E. & Car, R. Theory of quantum annealing of an ising spin glass. Sci. 295, 2427–2430, https://doi.org/10.1126/science.1068774 (2002). · DOI · Paper page
- Martoňák, R., Santoro, G. E. & Tosatti, E. Quantum annealing of traveling-salesman problem. Phys. Rev. E 70, 057701, https://doi.org/10.1103/PhysRevE.70.057701 (2004). · DOI · Paper page
- Stella, L., Santoro, G. E. & Tosatti, E. Optimization by quantum annealing: Lessons from simple cases. Phys. Rev. B 72, 014303, https://doi.org/10.1103/PhysRevB.72.014303 (2005). · DOI
- Battaglia, D. A., Santoro, G. E. & Tosatti, E. Optimization by quantum annealing: Lessons from hard satisfiability problems. Phys. Rev. E 71, 066707, https://doi.org/10.1103/PhysRevE.71.066707 (2005). · DOI
- Zanca, T. & Santoro, G. E. Quantum annealing speedup over simulated annealing on random ising chains. Phys. Rev. B 93, 224431, https://doi.org/10.1103/PhysRevB.93.224431 (2016). · DOI
- Wauters, M. M., Fazio, R., Nishimori, H. & Santoro, G. E. Direct comparison of quantum and simulated annealing on a fully connected ising ferromagnet. Phys. Rev. A 96, 022326, https://doi.org/10.1103/PhysRevA.96.022326 (2017). · DOI
- Katzgraber, H. G., Hamze, F., Zhu, Z., Ochoa, A. J. & Munoz-Bauza, H. Seeking quantum speedup through spin glasses: The good, the bad, and the ugly. Phys. Rev. X 5, 031026, https://doi.org/10.1103/PhysRevX.5.031026 (2015). · DOI
- Wang, C., Chen, H. & Jonckheere, E. Quantum versus simulated annealing in wireless interference network optimization. Sci. Rep. 6, 25797, https://doi.org/10.1038/srep25797 (2016). · DOI
- Rosenberg, G. et al. Solving the optimal trading trajectory problem using a quantum annealer. IEEE J. Sel. Top. Signal Process. 10, 1053–1060, https://doi.org/10.1109/JSTSP.2016.2574703 (2016). · DOI · Paper page
- Boyda, E. et al. Deploying a quantum annealing processor to detect tree cover in aerial imagery of california. PLoS ONE 12((2)), e0172505, https://doi.org/10.1371/journal.pone.0172505 (2017). · DOI
- Neukart, F. et al. Traffic flow optimization using a quantum annealer. Front. ICT 4, 29, https://doi.org/10.3389/fict.2017.00029 (2017). · DOI · Paper page
- Baldassi, C. & Zecchina, R. Efficiency of quantum vs. classical annealing in nonconvex learning problems. Proc. Natl. Acad. Sci. 115, 1457–1462, https://doi.org/10.1073/pnas.1711456115 (2018). · DOI
- Yarkoni, S., Plaat, A. & Back, T. First results solving arbitrarily structured maximum independent set problems using quantum annealing. In 2018 IEEE Congress on Evolutionary Computation (CEC), 1–6, https://doi.org/10.1109/CEC.2018.8477865 (2018). · DOI
- Adachi, S. H. & Henderson, M. P. Application of quantum annealing to training of deep neural networks. Preprint at https://arxiv.org/abs/1510.06356 (2015). · arXiv
- Benedetti, M., Realpe-Gómez, J., Biswas, R. & Perdomo-Ortiz, A. Quantum-assisted learning of hardware-embedded probabilistic graphical models. Phys. Rev. X 7, 041052, https://doi.org/10.1103/PhysRevX.7.041052 (2017). · DOI
- Harris, R. et al. Phase transitions in a programmable quantum spin glass simulator. Sci. 361, 162–165, https://doi.org/10.1126/science.aat2025 (2018). · DOI · Paper page
- King, A. D. et al. Observation of topological phenomena in a programmable lattice of 1,800 qubits. Nat. 560, 456–460, https://doi.org/10.1038/s41586-018-0410-x (2018). · DOI · Paper page
- Streif, M., Neukart, F. & Leib, M. Solving quantum chemistry problems with a d-wave quantum annealer. Preprint at https://arxiv.org/abs/1811.05256 (2018). · DOI
- Ohzeki, M., Miki, A., Miyama, M. J. & Terabe, M. Control of automated guided vehicles without collision by quantum annealer and digital devices. Preprint at https://arxiv.org/abs/1812.01532 (2018). · DOI
- Kitai, K. et al. Expanding the horizon of automated metamaterials discovery via quantum annealing. Preprint at https://arxiv.org/abs/1902.06573 (2019). · arXiv
- Irie, H., Wongpaisarnsin, G., Terabe, M., Miki, A. & Taguchi, S. Quantum annealing of vehicle routing problem with time, state and capacity. In Quantum Technology and Optimization Problems (2019). · DOI
- Nishimura, N., Tanahashi, K., Suganuma, K., Miyama, M. J. & Ohzeki, M. Item listing optimization for e-commerce websites based on diversity. Preprint at https://arxiv.org/abs/1903.12478 (2019). · DOI
- Bunyk, P. I. et al. Architectural considerations in the design of a superconducting quantum annealing processor. IEEE Transactions. Appl. Supercond. 24, 1700110, https://doi.org/10.1109/TASC.2014.2318294 (2014). · DOI · Paper page
- Rosenberg, G. et al. Building an iterative heuristic solver for a quantum annealer. Comput. Optim Appl 65, 845, https://doi.org/10.1007/s10589-016-9844-y (2016). · DOI
- Narimani, A., Saeed, S. S., Changiz, R & Zaribafiyan, A. Combinatorial optimization by decomposition on hybrid cpu–non-cpu solver architectures. Preprint at https://arxiv.org/abs/1708.03439 (2017). · arXiv
- Ahuja, R. K., Ergun, O., Orlin, J. B. & Punnen, A. P. A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123, 75–102, https://doi.org/10.1016/S0166-218X(01)00338-9 (2002). · DOI · Paper page
- Hamze, F. & Freitas, N. D. From fields to trees. In The 20th conference on Uncertainty in Artificial Intelligence (AUAI Press, Arlington, Virginia, 2004), 243–250 (2004).
- Fix, A., Chen, J., Boros, E. & Zabih, R. Approximate mrf inference using bounded treewidth subgraphs. In Computer Vision – ECCV 2012, 385–398, https://doi.org/10.1007/978-3-642-33718-5_28 (2012). · DOI
- Decelle, A. & Krzakala, F. Belief-propagation-guided monte-carlo sampling. Phys. Rev. B 89, 214421, https://doi.org/10.1103/PhysRevB.89.214421 (2014). · DOI
- Selby, A. Efficient subgraph-based sampling of ising-type models with frustration. Preprint at https://arxiv.org/abs/1409.3934 (2014). · arXiv
- Okada, S., Ohzeki, M., Terabe, M. & Taguchi, S. Improving solutions by embedding larger subproblems in a d-wave quantum annealer. Sci. Rep. 9, 2098, https://doi.org/10.1038/s41598-018-38388-4 (2019). · DOI
- Choi, V. Minor-embedding in adiabatic quantum computation: Ii. minor-univerdal graph design. Quantum Inf. Process. 10, 343–353, https://doi.org/10.1007/s11128-010-0200-3 (2011). · DOI · Paper page
- Boothby, T., King, A. D. & Roy, A. Fast clique minor generation in chimera qubit connectivity graphs. Quantum Inf Process. 15, 495, https://doi.org/10.1007/s11128-015-1150-6 (2016). · DOI
- Okada, S., Ohzeki, M. & Tanaka, K. The efficient quantum and simulated annealing of potts models using a half-hot constraint. Preprint at https://arxiv.org/abs/1904.01522 (2019). · arXiv
- Gross, D. J., Kanter, I. & Sompolinsky, H. Mean-field theory of the potts glass. Phys. Rev. Lett. 55, 304, https://doi.org/10.1103/PhysRevLett.55.304 (1985). · DOI · Paper page
- Nishimori, H. & Stephen, M. J. Gauge-invariant frustrated potts spin-glass. Phys. Rev. B 27, 5644–5652, https://doi.org/10.1103/PhysRevB.27.5644 (1983). · DOI
- Çağlar, T. & Berker, A. N. Chiral potts spin glass in d = 2 and 3 dimensions. Phys. Rev. E 94, 032121, https://doi.org/10.1103/PhysRevE.94.032121 (2016). · doi:10.1103/physreve.94.032121
- Cai, J., Macready, B. & Roy, A. A practical heuristic for finding graph minors. Preprint at https://arxiv.org/abs/1406.2741 (2014). · arXiv
Cited by
Wang, K., Tian, J., Zheng, C., Yang, H., Ren, J., Liu, Y., Han, Q., & Zhang, Y. (2021) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2021.104813 · Cited by 361
Benchmark Test of Black-box Optimization Using D-Wave Quantum Annealer
Koshikawa, A. S., Ohzeki, M., Kadowaki, T., & Tanaka, K. (2021) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.064001 · Cited by 43
Self-citationQuantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
Gemeinhardt, F., Garmendia, A., Wimmer, M., Weder, B., & Leymann, F. (2024) · ACM Computing Surveys · doi:10.1145/3620668 · Cited by 22
Improving Quantum Annealing Performance on Embedded Problems
(2020) · Supercomputing Frontiers and Innovations · doi:10.14529/jsfi200403 · Cited by 6
Metadata
- Authors
- Okada, S., Ohzeki, M., & Taguchi, S.
- Venue
- Scientific Reports
- Published
- 2019-09-10
- Volume
- 9
- Issue
- 1
- Pages
- 13036-13036
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W2950452700
- Cited by
- 190
- References
- 10
- FWCI
- 5.64
- Type
- journal article
- Language
- en
- Open access
- gold
- Licence
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Funders
- MEXT | Japan Society for the Promotion of Science (KAKENHI 19H01095, KAKENHI 16H04382)
- MEXT | Next Generation High-Performance Computing Infrastructures and Applications R&D Program
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient partition of integer optimization problems with one-hot encoding. https://app.cochat.ai/papers/10.1038/s41598-019-49539-6
- The paper
- Okada, S., Ohzeki, M., & Taguchi, S. (2019). Efficient partition of integer optimization problems with one-hot encoding. Scientific Reports. https://doi.org/10.1038/s41598-019-49539-6
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.