Machine learning framework for quantum sampling of highly constrained, continuous optimization problems
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
In recent years, there is growing interest in using quantum computers for solving combinatorial optimization problems. In this work, we developed a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder and a factorization machine. The factorization machine is trained as a low-dimensional, binary surrogate model for the continuous design space and sampled using various QUBO samplers. Using the D-Wave Advantage hybrid sampler and simulated annealing, we demonstrate that by repeated resampling and retraining of the factorization machine, our framework finds designs that exhibit figures of merit exceeding those of its training set. We showcase the framework's performance on two inverse design problems by optimizing (i) thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering. This technique can be further scaled to leverage future developments in quantum optimization to solve advanced inverse design problems for science and engineering applications.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
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 · cited 2×
“For example, the D-Wave’s quantum annealers are actively used for addressing the QUBO problems via encoding the QUBO parameters into a system of coupled superconducting qubits and retrieving the lowest energy configuration via quantum annealing 17,18 .”
BackgroundMethodQuantum 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×
“This equivalence enables direct mapping of a broad range of physics/chemistry optimization problems into the combinatorial optimization domain and the use of various physical platforms to perform highly efficient QUBO-based optimization via physical processes 14–16 .”
MethodSelf-citationInverse design in nanophotonics
Molesky, S., Lin, Z., Piggott, A. Y., Jin, W., Vucković, J., & Rodriguez, A. W. (2018) · Nature Photonics · doi:10.1038/s41566-018-0246-9 · Cited by 1,818
Adjoint shape optimization applied to electromagnetic design
Lalau-Keraly, C. M., Bhargava, S., Miller, O. D., & Yablonovitch, E. (2013) · Optics Express · doi:10.1364/oe.21.021693 · Cited by 753
Colloquium : Quantum annealing and analog quantum computation
Das, A., & Chakrabarti, B. K. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1061 · Cited by 700
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008) · SIAM Review · doi:10.1137/080734479 · Cited by 395
Review of numerical optimization techniques for meta-device design [Invited]
Campbell, S. D., Sell, D., Jenkins, R. P., Whiting, E. B., Fan, J. A., & Werner, D. H. (2019) · Optical Materials Express · doi:10.1364/ome.9.001842 · Cited by 322 · cited 1×
“It has recently been demonstrated that advanced optimization frameworks, such as genetic algorithms 70 and adjoint topology optimization 71 , can be used to develop various types of dielectric meta-devices.”
BackgroundOpportunities and challenges for quantum-assisted machine learning in near-term quantum computers
Perdomo-Ortiz, A., Benedetti, M., Realpe-Gómez, J., & Biswas, R. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab859 · Cited by 274 · cited 1×
“…our framework provides a long-sought-after example of a quantum-assisted, machine learning algorithm that has potential for quantum-supremacy 23 , uses noisy intermediate-scale quantum platforms for practical engineering problems 24 , and could fully leverage future developments in quantum…”
Background
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
“Finite-element design: [178] Material design: [99, 189] time, they argued that the size/number of subQUBOs sent to the quantum annealer needs to be maximized/minimized, resulting in fewer calls to the QPU and lower communication and embedding times.”
High-Performance Transparent Radiative Cooler Designed by Quantum Computing
Kim, S., Shang, W., Moon, S., Pastega, T., Lee, E., & Luo, T. (2022) · ACS Energy Letters · doi:10.1021/acsenergylett.2c01969 · Cited by 119
Kim, S., Jung, S., Bobbitt, A., Lee, E., & Luo, T. (2024) · Cell Reports Physical Science · doi:10.1016/j.xcrp.2024.101847 · Cited by 28
Chemical design with GPU-based Ising machines
Mao, Z., Matsuda, Y., Tamura, R., & Tsuda, K. (2023) · Digital Discovery · doi:10.1039/d3dd00047h · Cited by 23
Kim, S., Wu, S., Jian, R., Xiong, G., & Luo, T. (2023) · ACS Applied Materials & Interfaces · doi:10.1021/acsami.3c08214 · Cited by 22
Quantum annealing-aided design of an ultrathin-metamaterial optical diode
Kim, S., Park, S.-J., Moon, S., Zhang, Q., Hwang, S., Kim, S.-K., Luo, T., & Lee, E. (2024) · Nano Convergence · doi:10.1186/s40580-024-00425-6 · Cited by 20
A review on machine learning-guided design of energy materials
Kim, S., Xu, J., Shang, W., Xu, Z., Lee, E., & Luo, T. (2024) · Progress in Energy · doi:10.1088/2516-1083/ad7220 · Cited by 19
Metadata
- Authors
- Wilson, B. A., Kudyshev, Z. A., Kildishev, A. V., Kais, S., Shalaev, V. M., & Boltasseva, A.
- Venue
- Applied Physics Reviews
- Publisher
- AIP Publishing
- Published
- 2021-12-01
- Volume
- 8
- Issue
- 4
- ISSN
- 1931-9401 (ISSN-L)
- OpenAlex
- W3158500083
- Cited by
- 39
- References
- 11
- FWCI
- 2.03
- Type
- journal article
- Language
- en
- Open access
- green
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.