Solving large-scale optimization problems related to Bell's theorem

DOI10.1016/j.cam.2013.12.003zbMath1293.81011arXiv1204.3587OpenAlexW2153112940WikidataQ62476673 ScholiaQ62476673MaRDI QIDQ2252425

J. A. J. Hall, Jacek Gondzio, Wiesław Laskowski, Marek Żukowski, Jacek A. Gruca

Publication date: 17 July 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.3587

zbMATH Keywords

large-scale optimizationmatrix-free methodsinterior point methodsquantum information

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Highly noise resistant multiqubit quantum correlations

Uses Software

• LAPACK
• GLPK
• SciPy
• fminsearch

Cites Work

• Matrix-free interior point method
• Interior point methods 25 years later
• Optimized unrolling of nested loops
• The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling
• Spectral decomposition of Bell's operators for qubits
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
• Extreme quantum entanglement in a superposition of macroscopically distinct states
• Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
• A Simplex Method for Function Minimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving large-scale optimization problems related to Bell's theorem