Solving large-scale optimization problems related to Bell's theorem
From MaRDI portal
(Redirected from Publication:2252425)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Abstract: Impossibility of finding local realistic models for quantum correlations due to entanglement is an important fact in foundations of quantum physics, gaining now new applications in quantum information theory. We present an in-depth description of a method of testing the existence of such models, which involves two levels of optimization: a higher-level non-linear task and a lower-level linear programming (LP) task. The article compares the performances of the existing implementation of the method, where the LPs are solved with the simplex method, and our new implementation, where the LPs are solved with a matrix-free interior point method. We describe in detail how the latter can be applied to our problem, discuss the basic scenario and possible improvements and how they impact on overall performance. Significant performance advantage of the matrix-free interior point method over the simplex method is confirmed by extensive computational results. The new method is able to solve problems which are orders of magnitude larger. Consequently, the noise resistance of the non-classicality of correlations of several types of quantum states, which has never been computed before, can now be efficiently determined. An extensive set of data in the form of tables and graphics is presented and discussed. The article is intended for all audiences, no quantum-mechanical background is necessary.
Recommendations
- A quantum interior-point predictor–corrector algorithm for linear programming
- Long-step path-following algorithm for quantum information theory: some numerical aspects and applications
- Computing the maximum violation of a Bell inequality is an NP-problem
- Fast quantum subroutines for the simplex method
- Quantum bilinear optimization
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 992796 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Simplex Method for Function Minimization
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Extreme quantum entanglement in a superposition of macroscopically distinct states
- Interior point methods 25 years later
- Matrix-free interior point method
- Numerical recipes. The art of scientific computing.
- Optimized unrolling of nested loops
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Spectral decomposition of Bell's operators for qubits
- The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling
Cited in
(2)
This page was built for publication: Solving large-scale optimization problems related to Bell's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252425)
