Many Physical Design Problems are Sparse QCQPs

• URL: http://arxiv.org/abs/2303.17691v1
• Date: Thu, 30 Mar 2023 20:10:57 GMT
• Title: Many Physical Design Problems are Sparse QCQPs
• Abstract summary: Physical design applies to a desired objective (e.g. strong light-matter interactions) to quantum equations. computing an optimal design highlights the possibility of developing global optimal design differential equations.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Physical design refers to mathematical optimization of a desired objective (e.g. strong light--matter interactions, or complete quantum state transfer) subject to the governing dynamical equations, such as Maxwell's or Schrodinger's differential equations. Computing an optimal design is challenging: generically, these problems are highly nonconvex and finding global optima is NP hard. Here we show that for linear-differential-equation dynamics (as in linear electromagnetism, elasticity, quantum mechanics, etc.), the physical-design optimization problem can be transformed to a sparse-matrix, quadratically constrained quadratic program (QCQP). Sparse QCQPs can be tackled with convex optimization techniques (such as semidefinite programming) that have thrived for identifying global bounds and high-performance designs in other areas of science and engineering, but seemed inapplicable to the design problems of wave physics. We apply our formulation to prototypical photonic design problems, showing the possibility to compute fundamental limits for large-area metasurfaces, as well as the identification of designs approaching global optimality. Looking forward, our approach highlights the promise of developing bespoke algorithms tailored to specific physical design problems.

Related papers

• Multi-material Multi-physics Topology Optimization with Physics-informed Gaussian Process Priors [5.910614452545977]
  We propose a framework based on physics-informed Gaussian processes (PIGPs)<n>In our approach, the primary, adjoint, and design variables are represented by independent GP priors.<n>We demonstrate the capability of the proposed framework on benchmark TO problems such as compliance minimization, heat conduction optimization, and compliant mechanism design.
  arXiv  Detail & Related papers  (2026-02-19T19:28:18Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• Constrained Optimization via Quantum Zeno Dynamics [23.391640416533455]
  We introduce a technique that uses quantum Zeno dynamics to solve optimization problems with multiple arbitrary constraints, including inequalities. We show that the dynamics of quantum optimization can be efficiently restricted to the in-constraint subspace on a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2022-09-29T18:00:40Z)
• Quantum topology optimization of ground structures using noisy intermediate-scale quantum devices [8.325359814939517]
  We study the usage of quantum computers as a potential solution to topology optimization problems. Several experiments, including a real device experiment, show that the proposed method successfully obtained the optimal configurations.
  arXiv  Detail & Related papers  (2022-07-19T10:39:28Z)
• Gradient descent globally solves average-case non-resonant physical design problems [0.0]
  This paper addresses optimisation problems occurring in a wide variety of physical design problems, including but not limited to optical engineering, quantum control, structural engineering. The physics of the state of the system is often the question of the convergence globally optimal design.
  arXiv  Detail & Related papers  (2021-11-04T16:22:07Z)
• Speeding up Computational Morphogenesis with Online Neural Synthetic Gradients [51.42959998304931]
  A wide range of modern science and engineering applications are formulated as optimization problems with a system of partial differential equations (PDEs) as constraints. These PDE-constrained optimization problems are typically solved in a standard discretize-then-optimize approach. We propose a general framework to speed up PDE-constrained optimization using online neural synthetic gradients (ONSG) with a novel two-scale optimization scheme.
  arXiv  Detail & Related papers  (2021-04-25T22:43:51Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Offline Model-Based Optimization via Normalized Maximum Likelihood Estimation [101.22379613810881]
  We consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points. This problem setting emerges in many domains where function evaluation is a complex and expensive process. We propose a tractable approximation that allows us to scale our method to high-capacity neural network models.
  arXiv  Detail & Related papers  (2021-02-16T06:04:27Z)
• Physics-informed neural networks with hard constraints for inverse design [3.8191831921441337]
  We propose a new deep learning method -- physics-informed neural networks with hard constraints (hPINNs) -- for solving topology optimization. We demonstrate the effectiveness of hPINN for a holography problem in optics and a fluid problem of Stokes flow.
  arXiv  Detail & Related papers  (2021-02-09T03:18:15Z)
• QGOpt: Riemannian optimization for quantum technologies [0.0]
  We introduce QGOpt, the library for constrained optimization in quantum technology. We show two application examples: quantum gate decomposition and quantum tomography.
  arXiv  Detail & Related papers  (2020-11-03T18:11:53Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.