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

被引:10
|
作者
Gondzio, Jacek [1 ,2 ]
Gruca, Jacek A. [1 ,2 ,3 ]
Hall, J. A. Julian [1 ,2 ]
Laskowski, Wieslaw [3 ]
Zukowski, Marek [3 ]
机构
[1] Univ Edinburgh, Sch Math, Edinburgh EH9 3JZ, Midlothian, Scotland
[2] Univ Edinburgh, Maxwell Inst Math Sci, Edinburgh EH9 3JZ, Midlothian, Scotland
[3] Univ Gdansk, Inst Theoret Phys & Astrophys, PL-80952 Gdansk, Poland
基金
英国工程与自然科学研究理事会;
关键词
Quantum information; Large-scale optimization; Interior point methods; Matrix-free methods; INTERIOR-POINT METHODS; SIMPLEX-METHOD; SYSTEMS;
D O I
10.1016/j.cam.2013.12.003
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Impossibility 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 an innovative 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 substantially larger problems. 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. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:392 / 404
页数:13
相关论文
共 50 条
  • [41] On solving large-scale weighted least squares problems
    Baryamureeba, V
    NUMERICAL ANALYSIS AND ITS APPLICATIONS, 2001, 1988 : 59 - 67
  • [42] Solving large-scale multicriteria problems by the decomposition method
    Rabinovich, Ya. I.
    COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2012, 52 (01) : 60 - 74
  • [43] Efficiently solving very large-scale routing problems
    Arnold, Florian
    Gendreau, Michel
    Sorensen, Kenneth
    COMPUTERS & OPERATIONS RESEARCH, 2019, 107 : 32 - 42
  • [44] Solving large-scale eigenvalue problems in SciDAC applications
    Yang, C
    SciDAC 2005: Scientific Discovery Through Advanced Computing, 2005, 16 : 425 - 434
  • [45] CuLDA: Solving Large-scale LDA Problems on GPUs
    Xie, Xiaolong
    Liang, Yun
    Li, Xiuhong
    Tan, Wei
    HPDC'19: PROCEEDINGS OF THE 28TH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE PARALLEL AND DISTRIBUTED COMPUTING, 2019, : 195 - 205
  • [46] Solving Large-scale Stochastic Orienteering Problems with Aggregation
    Thayer, Thomas C.
    Carpin, Stefano
    2020 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2020, : 2452 - 2458
  • [48] EFFICIENT ALGORITHM FOR SOLVING LARGE-SCALE PORTFOLIO PROBLEMS
    BREEN, W
    JACKSON, R
    JOURNAL OF FINANCIAL AND QUANTITATIVE ANALYSIS, 1971, 6 (01) : 627 - 637
  • [49] Solving large-scale multicriteria problems by the decomposition method
    Ya. I. Rabinovich
    Computational Mathematics and Mathematical Physics, 2012, 52 : 60 - 74
  • [50] Cooperative optimization for solving large scale combinatorial problems
    Huang, XF
    THEORY AND ALGORITHMS FOR COOPERATIVE SYSTEMS, 2004, 4 : 117 - 156