Search NASA⌕ Search

SEARCH · Search NASA

Results for “semidefinite programming”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

Nondisturbing quantum measurements

We consider pairs of discrete quantum observables (POVMs) and analyze the relation between the notions of nondisturbance, joint measurability, and commutativity. We specify conditions under which these properties coincide or differ - depending, for instance, on the interplay between the number of outcomes and the Hilbert space dimension or on algebraic properties of the effect operators. We also show that (non-)disturbance is, in general, not a symmetric relation and that it can be decided and quantified by means of a semidefinite program.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Branch and Bound Approach for Truss Topology Design Problems with Valid Inequalities

One of the classical problems in the structural optimization field is the Truss Topology Design Problem (TTDP) which deals with the selection of optimal configuration for structural systems for applications in mechanical, civil, aerospace engineering, among others. In this paper we consider a TTDP where the goal is to find the stiffest truss, under a given load and with a bound on the total volume. The design variables are the cross-section areas of the truss bars that must be chosen from a given finite set. This results in a large-scale non-convex problem with discrete variables. This problem can be formulated as a Semidefinite Programming Problem (SDP problem) with binary variables. We propose a branch and bound algorithm to solve this problem. In this paper it is considered a binary formulation of the problem, to take advantage of its structure, which admits a Knapsack problem as subproblem. Thus, trying to improve the performance of the Branch and Bound, at each step, some valid inequalities for the Knapsack problem are included.

42 ENGINEERING↗

Superconductor to exciton condensate transition in a model copper-oxide material

Abstract Superconductivity and exciton condensation are fundamental phenomena in condensed matter physics, associated with the condensation of electron–electron and electron–hole pairs, respectively, into coherent quantum states. In this study, we present evidence of a superconductor to exciton condensate transition within the context of the three-band Hubbard model of copper-oxide-like materials. As the electron–electron repulsion increases, the superconducting phase is superseded by exciton condensation. In support of theoretical predictions—not yet realized experimentally—we observe the coexistence of the two condensates in the vicinity of the transition where the quantum states become a superposition of electron–electron and electron–hole condensates. Coexistence is rigorously computed from large eigenvalues and their eigenvectors in both the two-electron reduced density matrix (2-RDM) and the particle-hole RDM, which we obtain from a direct variational ground-state energy minimization with respect to the 2-RDM by semidefinite programming. We further discern that adjacent d orbitals and intervening p orbitals facilitate electron–electron pairing between copper orbitals, thereby supporting the superexchange mechanism for superconductivity. These observations suggest the feasibility of witnessing a superconductor to exciton condensate transition in copper-oxide analogs, bearing significant implications for identifying materials conducive to efficient transport processes.

Schouten, Anna O. (ORCID:0000000264255219)↗

Automorphic spectra and the conformal bootstrap

We describe a new method for constraining Laplacian spectra of hyperbolic surfaces and 2-orbifolds. The main ingredient is consistency of the spectral decomposition of integrals of products of four automorphic forms. Using a combination of representation theory of PSL 2 (R) and semidefinite programming, the method yields rigorous upper bounds on the Laplacian spectral gap. In several examples, the bound is nearly sharp. For instance, our bound on all genus-2 surfaces is λ 1 ≤ 3.8388976481, while the Bolza surface has λ 1 ≈ 3.838887258. The bounds also allow us to determine the set of spectral gaps attained by all hyperbolic 2-orbifolds. Our methods can be generalized to higher-dimensional hyperbolic manifolds and to yield stronger bounds in the two-dimensional case. The ideas were closely inspired by modern conformal bootstrap.

Kravchuk, Petr↗

Correlated purification for restoring 𝑁-representability in quantum simulation

Experimentally measured reduced density matrices (RDMs) often violate constraints that ensure they represent N-electron states—known as N-representability conditions—because of statistical and hardware noise. In this work, we present a correlated purification framework based on semidefinite programming to restore the accuracy of a noisy, unphysical two-electron RDM (2-RDM). The method performs a bi-objective optimization that minimizes both the many-electron energy and the nuclear norm of the correction to the measured 2-RDM. The nuclear norm, often employed in matrix completion, promotes low-rank corrections, while the energy term acts as a regularization term that can improve the purity of the ground state. While the method is particularly effective for ground states, it can also be applied to excited and nonstationary states by decreasing the weight of the energy relative to the error norm. In an application to fermionic shadow tomography of large hydrogen chains, correlated purification yields substantial reductions in both energy and 2-RDM error, achieving chemical accuracy across dissociation curves. This framework provides a robust strategy for tomography in many-body quantum simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Orbital angular momentum constraints in the variational optimization of the two-electron reduced-density matrix

The direct variational determination of the two-electron reduced-density matrix (2-RDM) corresponding to an atomic or molecular system is usually carried out in a basis of real-valued atom-centered Gaussian basis functions, under the assumption that the 2-RDM is a real-valued quantity. Furthermore, for systems that possess orbital angular momentum symmetry, the description of states with a well-defined, nonzero z projection of the orbital angular momentum requires a computational framework generalized to include either complex basis functions or a complex-valued 2-RDM. We consider a semidefinite program suitable for the direct optimization of a complex-valued 2-RDM and explore the role of orbital angular momentum constraints in systems that possess the relevant symmetries. For atomic systems, constraints on the expectation values of the square and z projection of the orbital angular momentum operator allow one to optimize 2-RDMs for multiple orbital angular momentum states. Similarly, in linear molecules, orbital angular momentum projection constraints enable the description of multiple electronic states and, moreover, the application of such constraints is essential for a qualitatively correct description of the electronic structure. For example, in the case of molecular oxygen, we demonstrate that orbital angular momentum constraints are necessary to recover the correct energy ordering of the lowest-energy singlet and triplet states near the equilibrium geometry. However, care must still be taken in the description of the dissociation limit, because the 2-RDM-based approach is not size consistent, and the size-consistency error varies dramatically, depending on the z projections of the spin and orbital angular momenta.

74 ATOMIC AND MOLECULAR PHYSICS↗

Efficient optimal minimum error discrimination of symmetric quantum states

This article deals with the quantum optimal discrimination among mixed quantum states enjoying geometrical uniform symmetry with respect to a reference density operator rho{sub 0}. It is well known that the minimal error probability is given by the positive operator-valued measure obtained as a solution of a convex optimization problem, namely a set of operators satisfying geometrical symmetry, with respect to a reference operator PI{sub 0} and maximizing Tr(rho{sub 0}PI{sub 0}). In this article, by resolving the dual problem, we show that the same result is obtained by minimizing the trace of a semidefinite positive operator X commuting with the symmetry operator and such that X>=rho{sub 0}. The new formulation gives a deeper insight into the optimization problem and allows to obtain closed-form analytical solutions, as shown by a simple but not trivial explanatory example. In addition to the theoretical interest, the result leads to semidefinite programming solutions of reduced complexity, allowing to extend the numerical performance evaluation to quantum communication systems modeled in Hilbert spaces of large dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast entanglement detection for unknown states of two spatial qutrits

We investigate the practicality of the method proposed by Maciel et al. [Phys. Rev. A. 80, 032325 (2009).] for detecting the entanglement of two spatial qutrits (three-dimensional quantum systems), which are encoded in the discrete transverse momentum of single photons transmitted through a multislit aperture. The method is based on the acquisition of partial information of the quantum state through projective measurements, and a data processing analysis done with semidefinite programs. This analysis relies on generating gradually an optimal entanglement witness operator, and numerical investigations have shown that it allows for the entanglement detection of unknown states with a cost much lower than full state tomography.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Family of loss-tolerant quantum coin-flipping protocols

We present a family of loss-tolerant quantum strong-coin-flipping protocols, each protocol differing in the number of qubits employed. For a single qubit we obtain a bias of 0.4, reproducing the result of Berlin et al. [Phys. Rev. A 80, 062321 (2009)], while for two qubits we obtain a bias of 0.3975. Numerical evidence based on semidefinite programming indicates that the bias continues to decrease as the number of qubits increases but at a small rate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Detecting multipartite classical states and their resemblances

We study various types of multipartite states lying near the quantum-classical boundary. The so-called classical states are precisely those in which each party can perfectly identify a locally held state without disturbing the global state, a task known as nondisruptive local state identification (NDLID). We show NDLID to be closely related local broadcasting, and we introduce a class of states called generalized classical states which allow for both NDLID and multipartite broadcasting when the most general quantum measurements are permitted. Simple analytical methods and a physical criterion are given for detecting whether a multipartite state is classical or generalized classical. For deciding the latter, a semidefinite programming algorithm is presented which may find use in other fields such as signal processing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rank restriction for the variational calculation of two-electron reduced density matrices of many-electron atoms and molecules

Variational minimization of the ground-state energy as a function of the two-electron reduced density matrix (2-RDM), constrained by necessary N-representability conditions, provides a polynomial-scaling approach to studying strongly correlated molecules without computing the many-electron wave function. Here we introduce a route to enhancing necessary conditions for N representability through rank restriction of the 2-RDM. Rather than adding computationally more expensive N-representability conditions, we directly enhance the accuracy of two-particle (2-positivity) conditions through rank restriction, which removes degrees of freedom in the 2-RDM that are not sufficiently constrained. We select the rank of the particle-hole 2-RDM by deriving the ranks associated with model wave functions, including both mean-field and antisymmetrized geminal power (AGP) wave functions. Because the 2-positivity conditions are exact for quantum systems with AGP ground states, the rank of the particle-hole 2-RDM from the AGP ansatz provides a minimum for its value in variational 2-RDM calculations of general quantum systems. To implement the rank-restricted conditions, we extend a first-order algorithm for large-scale semidefinite programming. The rank-restricted conditions significantly improve the accuracy of the energies; for example, the percentages of correlation energies recovered for HF, CO, and N{sub 2} improve from 115.2%, 121.7%, and 121.5% without rank restriction to 97.8%, 101.1%, and 100.0% with rank restriction. Similar results are found at both equilibrium and nonequilibrium geometries. While more accurate, the rank-restricted N-representability conditions are less expensive computationally than the full-rank conditions.

74 ATOMIC AND MOLECULAR PHYSICS↗

One-dimensional reflection in the quantum mechanical bootstrap

We describe the application of the quantum mechanical bootstrap to the solution of one-dimensional scattering problems. By fixing a boundary and modulating the Robin parameter of the boundary conditions we are able to extract the reflection coefficient for various potentials and compare to physical expectations. This includes an application of semidefinite programming to solving a half line Schrodinger problem with arbitrary Robin boundary conditions. Finally, the WKB approximation is used to numerically determine the scattering behavior of the exponential potential of Liouville theory. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Ancilla-Free Quantum Error Correction Codes for Quantum Metrology

Quantum error correction has recently emerged as a tool to enhance quantum sensing under Markovian noise. It works by correcting errors in a sensor while letting a signal imprint on the logical state. This approach typically requires a specialized error-correcting code, as most existing codes correct away both the dominant errors and the signal. To date, however, few such specialized codes are known, among which most require noiseless, controllable ancillas. We show here that such ancillas are not needed when the signal Hamiltonian and the error operators commute, a common limiting type of decoherence in quantum sensors. We give a semidefinite program for finding optimal ancilla-free sensing codes in general, as well as closed-form codes for two common sensing scenarios: qubits undergoing dephasing, and a lossy bosonic mode. Lastly, we analyze the sensitivity enhancement offered by the qubit code under arbitrary spatial noise correlations, beyond the ideal limit of orthogonal signal and noise operators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Many-Body Theory from a Solution of the N -Representability Problem

Here, in this study, we present a many-body theory based on a solution of the N-representability problem in which the ground-state two-particle reduced density matrix (2-RDM) is determined directly without the many-particle wave function. We derive an equation that re-expresses physical constraints on higher-order RDMs to generate direct constraints on the 2-RDM, which are required for its derivation from an N-particle density matrix, known as N-representability conditions. The approach produces a complete hierarchy of 2-RDM constraints that do not depend explicitly upon the higher RDMs or the wave function. By using the two-particle part of a unitary decomposition of higher order constraint matrices, we can solve the energy minimization by semidefinite programming in a form where the low-rank structure of these matrices can be potentially exploited. We illustrate by computing the ground-state electronic energy and properties of the H 8 ring.

74 ATOMIC AND MOLECULAR PHYSICS↗

Convex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor

Finding the transient and steady state properties of open quantum systems is a central problem in various fields of quantum technologies. Here, in this work, we present a quantum-assisted algorithm to determine the steady states of open system dynamics. By reformulating the problem of finding the fixed point of Lindblad dynamics as a feasibility semidefinite program, we bypass several well-known issues with variational quantum approaches to solving for steady states. We demonstrate that our hybrid approach allows us to estimate the steady states of higher dimensional open quantum systems and discuss how our method can find multiple steady states for systems with symmetries.

97 MATHEMATICS AND COMPUTING↗

Matrix Completion Using Alternating Minimization for Distribution System State Estimation

This paper examines the problem of state estimation in power distribution systems under low-observability conditions. The recently proposed constrained matrix completion method which combines the standard matrix completion method and power flow constraints has been shown to be effective in estimating voltage phasors under low-observability conditions using single-snapshot information. However, the method requires solving a semidefinite programming (SDP) problem, which becomes computationally infeasible for large systems and if multiple-snapshot (time-series) information is used. This paper proposes an efficient algorithm to solve the constrained matrix completion problem with time-series data. This algorithm is based on reformulating the matrix completion problem as a bilinear (non-convex) optimization problem, and applying the alternating minimization algorithm to solve this problem. This paper proves the summable convergence of the proposed algorithm, and demonstrates its efficacy and scalability via IEEE 123-bus system and a real utility feeder system. This paper also explores the value of adding more data from the history in terms of computation time and estimation accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Photovoltaic Inverter Controllers Seeking AC Optimal Power Flow Solutions

This paper considers future distribution networks featuring inverter-interfaced photovoltaic (PV) systems, and addresses the synthesis of feedback controllers that seek real- and reactive-power inverter setpoints corresponding to AC optimal power flow (OPF) solutions. The objective is to bridge the temporal gap between long-term system optimization and real-time inverter control, and enable seamless PV-owner participation without compromising system efficiency and stability. The design of the controllers is grounded on a dual ..epsilon..-subgradient method, while semidefinite programming relaxations are advocated to bypass the non-convexity of AC OPF formulations. Global convergence of inverter output powers is analytically established for diminishing stepsize rules for cases where: i) computational limits dictate asynchronous updates of the controller signals, and ii) inverter reference inputs may be updated at a faster rate than the power-output settling time.

14 SOLAR ENERGY↗

Comparison of statistical and deterministic frameworks of uncertainty quantification

Two different approaches to the prediction problem are compared employing a realistic example— combustion of natural gas—with 102 uncertain parameters and 76 quantities of interests. One approach, termed bound-to-bound data collaboration (abbreviated to B2B), deploys semidefinite programming algorithms where the initial bounds on unknowns are combined with initial bounds of experimental data to produce new uncertainty bounds for the unknowns that are consistent with the data and, finally, deterministic uncertainty bounds for prediction in new settings. The other approach is statistical and Bayesian, referred to as BCP (for Bayesian calibration and prediction). It places prior distributions on the unknown parameters and on the parameters of the measurement error distributions and produces posterior distributions for model parameters and posterior distributions for model predictions in new settings. The predictions from the two approaches are consistent; a very large degree of overlap exists between B2B bounds and the support of the BCP predictive distribution. Interpretation and comparison of the results is closely connected with assumptions made about the model and experimental data and how they are used in both settings. As a result, the principal conclusion is that use of both methods protects against possible violations of assumptions in the BCP approach and conservative specifications and predictions using B2B.

97 MATHEMATICS AND COMPUTING↗