Semidefinite programming relaxations for quantum correlations

Bennett, Charles H, Aram W. Harrow, Debbie W. Leung, and John A. Smolin (2003), “On the capacities of bipartite Hamiltonians and unitary gates,” IEEE Trans. Inf. Theory 49

1911

Earlier work this paper cites.

Bowles, Joseph, Flavio Baccari, and Alexia Salavrakos (2020), “Bounding sets of sequential quantum correlations and device-independent randomness certification,” Quantum 4

Original

1911

Earlier work this paper cites.

Bunandar, Darius, Luke CG Govia, Hari Krovi, and Dirk Englund (2020), “Numerical finite-key analysis of quantum key distribution,” npj Quantum Inf. 6

Original

1911

Earlier work this paper cites.

Rosset, Denis, Felipe Montealegre-Mora, and Jean-Daniel Bancal (2021), “RepLAB: A computational/numerical approach to representation theory,” in Quantum Theory and Symmetries , CRM Series in Mathematical Physics, edited by M. B. Paranjape, Richard MacKenzie, Zora Thomova, Pavel Winternitz, and William Witczak-Krempa (Springer Cham, Switerland) pp. 643–653, https://github.com/replab/replab , arXiv:1911.09154

Original

1911

Earlier work this paper cites.

Tavakoli, Armin, Máté Farkas, Denis Rosset, Jean-Daniel Bancal, and Jędrzej Kaniewski (2021b), “Mutually unbiased bases and symmetric informationally complete measurements in Bell experiments,” Sci. Adv. 7

Original

1912

Earlier work this paper cites.

Weilenmann, Mirjam, Benjamin Dive, David Trillo, Edgar A. Aguilar, and Miguel Navascués (2020), “Entanglement detection beyond measuring fidelities,” Phys. Rev. Lett. 124

Original

1912

Earlier work this paper cites.

Heisenberg, Werner (1925), “Über quantentheoretische umdeutung kinematischer und mechanischer beziehungen,” Z. Phys. 33

1925

Earlier work this paper cites.

Einstein, Albert, Boris Podolsky, and Nathan Rosen (1935), “Can quantum-mechanical description of physical reality be considered complete?” Phys. Rev. 47

1935

Earlier work this paper cites.

Schrödinger, Erwin (1935), “Discussion of probability relations between separated systems,” Math. Proc. Camb. Philos. Soc. 31

1935

Earlier work this paper cites.

Shannon, Claude E (1948), “A mathematical theory of communication,” Bell Syst. Tech. J. 27

1948

Earlier work this paper cites.

Grothendieck, Alexander (1953), “Résumé de la théorie métrique des produits tensoriels topologiques,” Bol. Soc. Mat. São Paulo 8

1953

Earlier work this paper cites.

Frank, Marguerite, and Philip Wolfe (1956), “An algorithm for quadratic programming,” Nav. Res. Logist. Q. 3

1956

Earlier work this paper cites.

Shannon, Claude (1956), “The zero error capacity of a noisy channel,” IRE Trans. Inf. Theory 2

1956

Earlier work this paper cites.

Bell, John S (1964), “On the Einstein Podolsky Rosen paradox,” Physics Physique Fizika 1

1964

Earlier work this paper cites.

Bell, John S (1966), “On the problem of hidden variables in quantum mechanics,” Rev. Mod. Phys. 38

1966

Earlier work this paper cites.

Gilbert, Elmer G (1966), “An iterative procedure for computing the minimum of a quadratic form on a convex set,” SIAM J. Control 4

1966

Earlier work this paper cites.

Shannon, Claude E, Robert G. Gallager, and Elwyn R. Berlekamp (1967), “Lower bounds to error probability for coding on discrete memoryless channels. I,” Inf. Control 10

1967

Earlier work this paper cites.

Kochen, Simon, and Ernst Specker (1968), “The problem of hidden variables in quantum mechanics,” Indiana Univ. Math. J. 17

1968

Earlier work this paper cites.

Clauser, John F, Michael A. Horne, Abner Shimony, and Richard A. Holt (1969), “Proposed experiment to test local hidden-variable theories,” Phys. Rev. Lett. 23

1969

Earlier work this paper cites.

Park, James L (1970), “The concept of transition in quantum mechanics,” Found. Phys. 1

1970

Earlier work this paper cites.

Jamiołkowski, Andrzej (1972), “Linear transformations which preserve trace and positive semidefiniteness of operators,” Rep. Math. Phys. 3

1972

Earlier work this paper cites.

Karp, Richard M (1972), “Reducibility among combinatorial problems,” in Complexity of Computer Computations. The IBM Research Symposia Series , edited by Raymond E. Miller, James W. Thatcher, and Jean D. Bohlinger, Chap. 9 (Springer US, Boston, MA) pp. 85–103

1972

Earlier work this paper cites.

Golub, Gene H (1973), “Some modified matrix eigenvalue problems,” SIAM Rev. 15

1973

Earlier work this paper cites.

Holevo, Alexander S (1973), “Bounds for the quantity of information transmitted by a quantum communication channel,” Problems Inf. Transmission 9

1973

Earlier work this paper cites.

Choi, Man-Duen (1975), “Completely positive linear maps on complex matrices,” Linear Algebra Appl. 10

1975

Earlier work this paper cites.

Uhlmann, Armin (1976), “The ‘transition probability’ in the state space of a ∗ * -algebra,” Rep. Math. Phys. 9

1976

Earlier work this paper cites.

Laudisa, Federico (2023), “How and when did locality become ‘local realism’? A historical and critical analysis (1963-1978),” Stud. Hist. Philos. Sci. 97

Original

1978

Earlier work this paper cites.

Lovász, László (1979), “On the Shannon capacity of a graph,” IEEE Trans. Inf. Theory 25

1979

Earlier work this paper cites.

Tsirelson, Boris S (1980), “Quantum generalizations of Bell’s inequality,” Lett. Math. Phys. 4

1980

Earlier work this paper cites.

Ivanović, Igor D (1981), “Geometrical description of quantal state determination,” J. Phys. A: Math. Gen. 14

1981

Earlier work this paper cites.

Dieks, Dennis (1982), “Communication by EPR devices,” Phys. Lett. A 92

1982

Earlier work this paper cites.

Fine, Arthur (1982), “Hidden variables, joint probability, and the Bell inequalities,” Phys. Rev. Lett. 48

1982

Earlier work this paper cites.

Wootters, William K, and Wojciech H. Zurek (1982), “A single quantum cannot be cloned,” Nature 299

1982

Earlier work this paper cites.

Wiesner, Stephen (1983), “Conjugate coding,” ACM SIGACT News 15

1983

Earlier work this paper cites.

Davis, Philip J, and Philip Rabinowitz (1984), Methods of numerical integration (Courier Corporation, North Chelmsford, MA)

1984

Earlier work this paper cites.

Gisin, Nicolas (1984), “Quantum measurements and stochastic processes,” Phys. Rev. Lett. 52

1984

Earlier work this paper cites.

Karmarkar, Narendra K (1984), “A new polynomial-time algorithm for linear programming,” Combinatorica 4

1984

Earlier work this paper cites.

Khalfin, Leonid A, and Boris S. Tsirelson (1985), “Quantum and quasi-classical analogs of Bell inequalities,” in Symposium on the Foundations of Modern Physics , edited by P. Lahti and P. Mittelstaedt (World Scientific Singapore) pp. 441–460

1985

Earlier work this paper cites.

Tomiyama, Jun (1985), “On the geometry of positive maps in matrix algebras. II,” Linear Algebra Appl. 69

1985

Earlier work this paper cites.

Summers, Stephen J, and Reinhard F. Werner (1987), “Maximal violation of Bell’s inequalities is generic in quantum field theory,” Commun. Math. Phys. 110

1987

Earlier work this paper cites.

Tsirelson, Boris S (1987), “Quantum analogues of the Bell inequalities. The case of two spatially separated domains,” J. Sov. Math. 36

1987

Earlier work this paper cites.

Landau, Lawrence J (1988), “Empirical two-point correlation functions,” Found. Phys. 18

1988

Earlier work this paper cites.

Werner, Reinhard F (1989), “Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model,” Phys. Rev. A 40

1989

Earlier work this paper cites.

Wootters, William K, and Brian D. Fields (1989), “Optimal state-determination by mutually unbiased measurements,” Ann. Phys. 191

1989

Earlier work this paper cites.

Ekert, Artur K (1991), “Quantum cryptography based on Bell’s theorem,” Phys. Rev. Lett. 67

1991

Earlier work this paper cites.

Kamath, Anil P, and Narendra K. Karmarkar (1991), “A continuous approach to compute upper bounds in quadratic maximization problems with integer constraints,” in Recent Advances in Global Optimization , Princeton Series in Computer Science, edited by Christodoulos A. Floudas and Panos M. Pardalos (Princeton University Press, Princeton) pp. 125–140

1991

Earlier work this paper cites.

Alizadeh, Farid (1992), “Optimization over the positive-definite cone: interior point methods and combinatorial applications,” in Advances in optimization and parallel computing , edited by Panos M. Pardalos (North-Holland, Amsterdam)

1992

Earlier work this paper cites.

Bennett, Charles H, and Stephen J. Wiesner (1992), “Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states,” Phys. Rev. Lett. 69

1992

Earlier work this paper cites.

Braunstein, Samuel L, Alfred Mann, and Michael Revzen (1992), “Maximal violation of Bell inequalities for mixed states,” Phys. Rev. Lett. 68

1992

Earlier work this paper cites.

Popescu, Sandu, and Daniel Rohrlich (1992), “Which states violate Bell’s inequality maximally?” Phys. Lett. A 169

1992

Earlier work this paper cites.

Bennett, Charles H, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, and William K. Wootters (1993), “Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels,” Phys. Rev. Lett. 70

1993

Earlier work this paper cites.

Hughston, Lane P, Richard Jozsa, and William K. Wootters (1993), “A complete classification of quantum ensembles having a given density matrix,” Phys. Lett. A 183

1993

Earlier work this paper cites.

Kamath, Anil P, and Narendra K. Karmarkar (1993), “An O ⁡ ( n L ) O(nL) iteration algorithm for computing bounds in quadratic optimization problems,” in Complexity in Numerical Optimization , edited by Panos M. Pardalos (World Scientific) pp. 254–268

1993

Earlier work this paper cites.

Tsirelson, Boris S (1993), “Some results and problems on quantum Bell-type inequalities,” Hadron. J. Suppl. 8

1993

Earlier work this paper cites.

Żukowski, Marek, Anton Zeilinger, Michael A. Horne, and Artur K. Ekert (1993), “‘Event-ready-detectors’ Bell experiment via entanglement swapping,” Phys. Rev. Lett. 71

1993

Earlier work this paper cites.

Nesterov, Yurii, and Arkadii Nemirovskii (1994), Interior-Point Polynomial Algorithms in Convex Programming (Society for Industrial and Applied Mathematics, Philadelphia)

1994

Earlier work this paper cites.

Popescu, Sandu, and Daniel Rohrlich (1994), “Quantum nonlocality as an axiom,” Found. Phys. 24

1994

Earlier work this paper cites.

Goemans, Michel X, and David P. Williamson (1995), “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” J. ACM 42

1995

Earlier work this paper cites.

Froissart, M (1981), “Constructive generalization of Bell’s inequalities,” Il Nuovo Cimento B (1971-1996) 64

1996

Earlier work this paper cites.

Horodecki, Michał, Paweł Horodecki, and Ryszard Horodecki (1996), “Separability of mixed states: necessary and sufficient conditions,” Phys. Lett. A 223

1996

Earlier work this paper cites.

Peres, Asher (1996), “Separability criterion for density matrices,” Phys. Rev. Lett. 77

1996

Earlier work this paper cites.

Vandenberghe, Lieven, and Stephen Boyd (1996), “Semidefinite programming,” SIAM Rev. 38

1996

Earlier work this paper cites.

Bennett, Charles H, David P. DiVincenzo, and John A. Smolin (1997), “Capacities of quantum erasure channels,” Phys. Rev. Lett. 78

1997

Earlier work this paper cites.

Lloyd, Seth (1997), “Capacity of the noisy quantum channel,” Phys. Rev. A 55

1997

Earlier work this paper cites.

Schumacher, Benjamin, and Michael D. Westmoreland (1997), “Sending classical information via noisy quantum channels,” Phys. Rev. A 56

1997

Earlier work this paper cites.

Holevo, Alexander S (1998), “The capacity of the quantum channel with general signal states,” IEEE Trans. Inf. Theory 44

1998

Earlier work this paper cites.

Horodecki, Michał, Paweł Horodecki, and Ryszard Horodecki (1998), “Mixed-state entanglement and distillation: Is there a ‘bound’ entanglement in nature?” Phys. Rev. Lett. 80

1998

Earlier work this paper cites.

Mayers, Dominic, and Andrew Yao (1998), “Quantum cryptography with imperfect apparatus,” in Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280) (IEEE, New York) pp. 503–509, arXiv:quant-ph/9809039

1998

Earlier work this paper cites.

Pan, Jian-Wei, Dik Bouwmeester, Harald Weinfurter, and Anton Zeilinger (1998), “Experimental entanglement swapping: Entangling photons that never interacted,” Phys. Rev. Lett. 80

1998

Earlier work this paper cites.

Vértesi, Tamás, and Károly F. Pál (2011), “Nonclassicality threshold for the three-qubit Greenberger-Horne-Zeilinger state,” Phys. Rev. A 84

Original

1998

Earlier work this paper cites.

Wootters, William K (1998), “Entanglement of formation of an arbitrary state of two qubits,” Phys. Rev. Lett. 80

1998

Earlier work this paper cites.

Bennett, Charles H, Peter W. Shor, John A. Smolin, and Ashish V. Thapliyal (1999), “Entanglement-assisted classical capacity of noisy quantum channels,” Phys. Rev. Lett. 83

1999

Earlier work this paper cites.

van Dam, Wim (1999), Nonlocality and communication complexity , Ph.D. thesis (University of California, Santa Barbara)

1999

Earlier work this paper cites.

Horodecki, Michał, Paweł Horodecki, and Ryszard Horodecki (1999), “General teleportation channel, singlet fraction, and quasidistillation,” Phys. Rev. A 60

1999

Earlier work this paper cites.

Nayak, Ashwin (1999), “Optimal lower bounds for quantum automata and random access codes,” in Proceedings of the 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) (IEEE, New York) pp. 369–376, arXiv:quant-ph/9904093

1999

Earlier work this paper cites.

Ogawa, Tomohiro, and Hiroshi Nagaoka (1999), “Strong converse to the quantum channel coding theorem,” IEEE Trans. Inf. Theory 45

1999

Earlier work this paper cites.

Rains, E M (1999), “Rigorous treatment of distillable entanglement,” Phys. Rev. A 60

1999

Earlier work this paper cites.

Sturm, Jos F (1999), “Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones,” Optim. Method Softw. 11

1999

Earlier work this paper cites.

Vidal, Guifré, and Rolf Tarrach (1999), “Robustness of entanglement,” Phys. Rev. A 59

1999

Earlier work this paper cites.

Winter, Andreas (1999), “Coding theorem and strong converse for quantum channels,” IEEE Trans. Inf. Theory 45

Original

1999

Earlier work this paper cites.

Lewenstein, Maciej, Barbara Kraus, J. Ignacio Cirac, and Paweł Horodecki (2000), “Optimization of entanglement witnesses,” Phys. Rev. A 62

2000

Earlier work this paper cites.

Nesterov, Yurii (2000), “Squared functional systems and optimization problems,” in High performance optimization , Applied Optimization, edited by Hans Frenk, Kees Roos, Tamás Terlaky, and Shuzhong Zhang (Springer) pp. 405–440

2000

Earlier work this paper cites.

Parrilo, Pablo A (2000), Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , Ph.D. thesis (California Institute of Technology)

2000

Earlier work this paper cites.

Shor, Peter W, and John Preskill (2000), “Simple proof of security of the BB84 quantum key distribution protocol,” Phys. Rev. Lett. 85

2000

Earlier work this paper cites.

Terhal, Barbara M (2000), “Bell inequalities and the separability criterion,” Phys. Lett. A 271

2000

Earlier work this paper cites.

Terhal, Barbara M, and Paweł Horodecki (2000), “Schmidt number for density matrices,” Phys. Rev. A 61

2000

Earlier work this paper cites.

Wolkowicz, Henry, Romesh Saigal, and Lieven Vandenberghe (2000), Handbook of Semidefinite Programming (Springer, New York)

2000

Earlier work this paper cites.

Aloy, Albert, Matteo Fadel, and Jordi Tura (2021), “The quantum marginal problem for symmetric states: applications to variational optimization, nonlocality and self-testing,” New J. Phys. 23

Original

2001

Earlier work this paper cites.

Galvão, Ernesto F (2001), “Feasible quantum communication complexity protocol,” Phys. Rev. A 65

2001

Earlier work this paper cites.

Hanson, Eric P, Vishal Katariya, Nilanjana Datta, and Mark M. Wilde (2022), “Guesswork with quantum side information,” IEEE Trans. Inf. Theory 68

Original

2001

Earlier work this paper cites.

Hayden, Patrick M, Michal Horodecki, and Barbara M Terhal (2001), “The asymptotic entanglement cost of preparing a quantum state,” J. Phys. A: Math. Gen. 34

2001

Earlier work this paper cites.

Jennewein, Thomas, Gregor Weihs, Jian-Wei Pan, and Anton Zeilinger (2001), “Experimental nonlocality proof of quantum teleportation and entanglement swapping,” Phys. Rev. Lett. 88

2001

Earlier work this paper cites.

Ji, Zhengfeng, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen (2020), “MIP*=RE,” arXiv:2001.04383

Original

2001

Earlier work this paper cites.

Lasserre, Jean B (2001), “Global optimization with polynomials and the problem of moments,” SIAM J. Optim. 11

2001

Earlier work this paper cites.

Nakata, Maho, Hiroshi Nakatsuji, Masahiro Ehara, Mitsuhiro Fukuda, Kazuhide Nakata, and Katsuki Fujisawa (2001), “Variational calculations of fermion second-order reduced density matrices by semidefinite programming algorithm,” J. Chem. Phys. 114

2001

Earlier work this paper cites.

Rains, Eric M (2001), “A semidefinite program for distillable entanglement,” IEEE Trans. Inf. Theory 47

2001

Earlier work this paper cites.

Sørensen, Anders S, and Klaus Mølmer (2001), “Entanglement and extreme spin squeezing,” Phys. Rev. Lett. 86

2001

Earlier work this paper cites.

Tavakoli, Armin, and Nicolas Gisin (2020), “The Platonic solids and fundamental tests of quantum mechanics,” Quantum 4

Original

2001

Earlier work this paper cites.

Vidal, Guifré, and J. Ignacio Cirac (2001), “Irreversibility in asymptotic manipulations of entanglement,” Phys. Rev. Lett. 86

2001

Earlier work this paper cites.

Werner, Reinhard F, and Michael M. Wolf (2001), “Bell inequalities and entanglement,” Quantum Inf. Comput. 1

2001

Earlier work this paper cites.

Åberg, Johan, Ranieri Nery, Cristhiano Duarte, and Rafael Chaves (2020), “Semidefinite tests for quantum network topologies,” Phys. Rev. Lett. 125

Original

2002

Earlier work this paper cites.

Ambainis, Andris, Ashwin Nayak, Amnon Ta-Shma, and Umesh Vazirani (2002), “Dense quantum coding and quantum finite automata,” J. ACM 49

2002

Earlier work this paper cites.

Audenaert, Koenraad, and Bart De Moor (2002), “Optimizing completely positive maps using semidefinite programming,” Phys. Rev. A 65

2002

Earlier work this paper cites.

Bennett, Charles H, Peter W. Shor, John A. Smolin, and Ashish V. Thapliyal (2002), “Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem,” IEEE Trans. Inf. Theory 48

2002

Earlier work this paper cites.

Collins, Daniel, Nicolas Gisin, Noah Linden, Serge Massar, and Sandu Popescu (2002), “Bell inequalities for arbitrarily high-dimensional systems,” Phys. Rev. Lett. 88

2002

Earlier work this paper cites.

Doherty, Andrew C, Pablo A. Parrilo, and Federico M. Spedalieri (2002), “Distinguishing separable and entangled states,” Phys. Rev. Lett. 88

2002

Earlier work this paper cites.

Donald, Matthew J, Michał Horodecki, and Oliver Rudolph (2002), “The uniqueness theorem for entanglement measures,” J. Math. Phys. 43

2002

Earlier work this paper cites.

Gisin, Nicolas, Grégoire Ribordy, Wolfgang Tittel, and Hugo Zbinden (2002), “Quantum cryptography,” Rev. Mod. Phys. 74

2002

Earlier work this paper cites.

King, Christopher (2002), “Additivity for unital qubit channels,” J. Math. Phys. 43

2002

Earlier work this paper cites.

Kitaev, Alexei Y, Alexander H. Shen, and Mikhail N. Vyalyi (2002), Classical and quantum computation , Graduate Studies in Mathematics, Vol. 47 (American Mathematical Society)

2002

Earlier work this paper cites.

de Klerk, Etienne (2002), Aspects of Semidefinite Programming , Applied Optimization, Vol. 65 (Springer, New York)

2002

Earlier work this paper cites.

Kraft, Tristan, Sébastien Designolle, Christina Ritz, Nicolas Brunner, Otfried Gühne, and Marcus Huber (2021a), “Quantum entanglement in the triangle network,” Phys. Rev. A 103

Original

2002

Earlier work this paper cites.

Navascués, Miguel, Elie Wolfe, Denis Rosset, and Alejandro Pozas-Kerstjens (2020b), “Genuine network multipartite entanglement,” Phys. Rev. Lett. 125

Original

2002

Earlier work this paper cites.

Vidal, Guifré, and Reinhard F. Werner (2002), “Computable measure of entanglement,” Phys. Rev. A 65

2002

Earlier work this paper cites.

Audenaert, Koenraad, Martin B. Plenio, and Jens Eisert (2003), “Entanglement cost under positive-partial-transpose-preserving operations,” Phys. Rev. Lett. 90

2003

Earlier work this paper cites.

Brassard, Gilles (2003), “Quantum communication complexity,” Found. Phys. 33

2003

Earlier work this paper cites.

Gurvits, Leonid (2003), “Classical deterministic complexity of Edmonds’ problem and quantum entanglement,” in Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (STOC ’03) (Association for Computing Machinery, New York, NY, USA) Chap. 1, pp. 10–19, arXiv:quant-ph/0303055

2003

Earlier work this paper cites.

Horodecki, Michał, Aditi Sen(De), and Ujjwal Sen (2003), “Rates of asymptotic entanglement transformations for bipartite mixed states: Maximally entangled states are not special,” Phys. Rev. A 67

2003

Earlier work this paper cites.

King, Christopher (2003), “The capacity of the quantum depolarizing channel,” IEEE Trans. Inf. Theory 49

2003

Earlier work this paper cites.

Luo, Ming-Xing (2021), “New genuinely multipartite entanglement,” Adv. Quantum Technol. 4

Original

2003

Earlier work this paper cites.

Masanes, Lluís (2003), “Necessary and sufficient condition for quantum-generated correlations,” arXiv:quant-ph/0309137

2003

Earlier work this paper cites.

Nguyen, H Chau, Sébastien Designolle, Mohamed Barakat, and Otfried Gühne (2020), “Symmetries between measurements in quantum mechanics,” arXiv:2003.12553

Original

2003

Earlier work this paper cites.

Śliwa, Cezary (2003), “Symmetries of the Bell correlation inequalities,” Phys. Lett. A 317

2003

Earlier work this paper cites.

Tavakoli, Armin (2020), “Semi-device-independent certification of independent quantum state and measurement devices,” Phys. Rev. Lett. 125

Original

2003

Earlier work this paper cites.

Verstraete, Frank, and Henri Verschelde (2003), “Optimal teleportation with a mixed state of two qubits,” Phys. Rev. Lett. 90

2003

Earlier work this paper cites.

Wei, Tzu-Chieh, and Paul M. Goldbart (2003), “Geometric measure of entanglement and applications to bipartite and multipartite quantum states,” Phys. Rev. A 68

2003

Earlier work this paper cites.

Beigi, Salman (2021), “Separation of quantum, spatial quantum, and approximate quantum correlations,” Quantum 5

Original

2004

Earlier work this paper cites.

Bell, John S (1975), “The theory of local beables,” in Speakable and unspeakable in quantum mechanics , edited by Simon Capelin, Chap. 7 (Cambridge University Press) pp. 52–62, (2004 reprint)

2004

Earlier work this paper cites.

Bourennane, Mohamed, Manfred Eibl, Christian Kurtsiefer, Sascha Gaertner, Harald Weinfurter, Otfried Gühne, Philipp Hyllus, Dagmar Bruß, Maciej Lewenstein, and Anna Sanpera (2004), “Experimental detection of multipartite entanglement using witness operators,” Phys. Rev. Lett. 92

2004

Earlier work this paper cites.

Boyd, Stephen, and Lieven Vandenberghe (2004), Convex Optimization (Cambridge University Press, Cambridge, England)

2004

Earlier work this paper cites.

Christandl, Matthias, and Andreas Winter (2004), “Squashed entanglement: An additive entanglement measure,” J. Math. Phys. 45

2004

Earlier work this paper cites.

Collins, Daniel, and Nicolas Gisin (2004), “A relevant two qubit Bell inequality inequivalent to the CHSH inequality,” J. Phys. A: Math. Gen. 37

2004

Earlier work this paper cites.

Doda, Mirdit, Marcus Huber, Gláucia Murta, Matej Pivoluska, Martin Plesch, and Chrysoula Vlachou (2021), “Quantum key distribution overcoming extreme noise: Simultaneous subspace coding using high-dimensional entanglement,” Phys. Rev. Appl. 15

Original

2004

Earlier work this paper cites.

Doherty, Andrew C, Pablo A. Parrilo, and Federico M. Spedalieri (2004), “Complete family of separability criteria,” Phys. Rev. A 69

2004

Earlier work this paper cites.

Eisert, Jens, Philipp Hyllus, Otfried Gühne, and Marcos Curty (2004), “Complete hierarchies of efficient approximations to problems in entanglement theory,” Phys. Rev. A 70

2004

Earlier work this paper cites.

Gatermann, Karin, and Pablo A. Parrilo (2004), “Symmetry groups, semidefinite programs, and sums of squares,” J. Pure Appl. Algebra 192

2004

Earlier work this paper cites.

Ghosh, Sibasish, Guruprasad Kar, Anirban Roy, and Debasis Sarkar (2004), “Distinguishability of maximally entangled states,” Phys. Rev. A 70

2004

Earlier work this paper cites.

Hulpke, Florian, Dagmar Bruß, Maciej Lewenstein, and Anna Sanpera (2004), “Simplifying Schmidt number witnesses via higher-dimensional embeddings,” Quantum Inf. Comput. 4

2004

Earlier work this paper cites.

Koashi, Masato, and Andreas Winter (2004), “Monogamy of quantum entanglement and other correlations,” Phys. Rev. A 69

2004

Earlier work this paper cites.

Löfberg, Johan (2004), “YALMIP: a toolbox for modeling and optimization in MATLAB,” in Proceedings of the IEEE International Symposium on Computer-Aided Control Systems and Design (IEEE, New York) pp. 284–289, https://yalmip.github.io/

2004

Earlier work this paper cites.

Mayers, Dominic, and Andrew Yao (2004), “Self testing quantum apparatus,” Quantum Inf. Comput. 4

2004

Earlier work this paper cites.

Renes, Joseph M, Robin Blume-Kohout, Andrew J. Scott, and Carlton M. Caves (2004), “Symmetric informationally complete quantum measurements,” J. Math. Phys. 45

2004

Earlier work this paper cites.

Shor, Peter W (2004), “Equivalence of additivity questions in quantum information theory,” Commun. Math. Phys. 246

2004

Earlier work this paper cites.

Bernards, Fabian, and Otfried Gühne (2020), “Generalizing optimal Bell inequalities,” Phys. Rev. Lett. 125

Original

2005

Earlier work this paper cites.

Bertsimas, Dimitris, and Ioana Popescu (2005), “Optimal inequalities in probability theory: A convex optimization approach,” SIAM J. Optim. 15

2005

Earlier work this paper cites.

Brandão, Fernando G S L (2005), “Quantifying entanglement with witness operators,” Phys. Rev. A 72

2005

Earlier work this paper cites.

Coey, Chris, Lea Kapelevich, and Juan Pablo Vielma (2022), “Solving natural conic formulations with Hypatia.jl,” INFORMS J. Comput. 34

Original

2005

Earlier work this paper cites.

Cope, Thomas (2021), “The binary-outcome detection loophole,” New J. Phys. 23

Original

2005

Earlier work this paper cites.

D’Ariano, Giacomo Mauro, Paoloplacido Lo Presti, and Paolo Perinotti (2005), “Classical randomness in quantum measurements,” J. Phys. A: Math. Gen. 38

2005

Earlier work this paper cites.

Devetak, Igor (2005), “The private classical capacity and quantum capacity of a quantum channel,” IEEE Trans. Inf. Theory 51

2005

Earlier work this paper cites.

Doherty, Andrew C, Pablo A. Parrilo, and Federico M. Spedalieri (2005), “Detecting multipartite entanglement,” Phys. Rev. A 71

2005

Earlier work this paper cites.

Genovese, Marco (2005), “Research on hidden variable theories: A review of recent progresses,” Phys. Rep. 413

2005

Earlier work this paper cites.

Häffner, Hartmut, Wolfgang Hänsel, Christian F. Roos, Jan Benhelm, Dany Chek-al kar, Michael Chwalla, Timo Körber, Umakant D. Rapol, Mark Riebe, Piet O. Schmidt, Christof Becher, Otfried Gühne, Wolfgang Dür, and Ranier Blatt (2005), “Scalable multiparticle entanglement of trapped ions,” Nature 438

2005

Earlier work this paper cites.

Henrion, Didier, and Andrea Garulli, Eds. (2005), Positive polynomials in control , Lecture Notes in Control and Information Sciences, Vol. 312 (Springer Science & Business Media)

2005

Earlier work this paper cites.

Henrion, Didier, and Jean-Bernard Lasserre (2005), “Detecting global optimality and extracting solutions in GloptiPoly,” in Positive polynomials in control , Vol. 312, edited by Didier Henrion and Andrea Garulli, Chap. 15 (Springer Berlin) pp. 293–310

2005

Earlier work this paper cites.

Ishizaka, Satoshi, and Martin B. Plenio (2005), “Multiparticle entanglement manipulation under positive partial transpose preserving operations,” Phys. Rev. A 71

2005

Earlier work this paper cites.

Jee, Hyejung H, Carlo Sparaciari, Omar Fawzi, and Mario Berta (2021), “Quasi-polynomial time algorithms for free quantum games in bounded dimension,” in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 198, edited by Nikhil Bansal, Emanuela Merelli, and James Worrell (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany) pp. 82:1–82:20, arXiv:2005.08883

Original

2005

Earlier work this paper cites.

Leibfried, Didi, Emmanuel Knill, Seigne Seidelin, Josehp Britton, R. Bradley Blakestad, John Chiaverini, David B. Hume, Wayne M. Itano, John D. Jost, Christopher E. Langer, Roee Ozeri, Rainer Reichle, and David J. Wineland (2005), “Creation of a six-atom ‘Schrödinger cat’ state,” Nature 438

2005

Earlier work this paper cites.

Masanes, Lluís (2005), “Extremal quantum correlations for N N parties with two dichotomic observables per site,” arXiv:quant-ph/0512100

2005

Earlier work this paper cites.

Pironio, Stefano (2005), “Lifting Bell inequalities,” J. Math. Phys. 46

2005

Earlier work this paper cites.

Schwonnek, René, Koon Tong Goh, Ignatius William Primaatmaja, Ernest Y.-Z. Tan, Ramona Wolf, Valerio Scarani, and Charles C.-W. Lim (2021), “Device-independent quantum key distribution with random key basis,” Nat. Commun. 12

Original

2005

Earlier work this paper cites.

Sen(De), Aditi, Ujjwal Sen, Časlav Brukner, Vladimír Bužek, and Marek Żukowski (2005), “Entanglement swapping of noisy states: A kind of superadditivity in nonclassicality,” Phys. Rev. A 72

2005

Earlier work this paper cites.

Spekkens, Robert W (2005), “Contextuality for preparations, transformations, and unsharp measurements,” Phys. Rev. A 71

2005

Earlier work this paper cites.

Tóth, Géza, and Otfried Gühne (2005), “Detecting genuine multipartite entanglement with two local measurements,” Phys. Rev. Lett. 94

2005

Earlier work this paper cites.

Acín, Antonio, Nicolas Gisin, and Benjamin Toner (2006), “Grothendieck’s constant and local models for noisy entangled quantum states,” Phys. Rev. A 73

2006

Earlier work this paper cites.

Brassard, Gilles, Harry Buhrman, Noah Linden, André Allan Méthot, Alain Tapp, and Falk Unger (2006), “Limit on nonlocality in any world in which communication complexity is not trivial,” Phys. Rev. Lett. 96

2006

Earlier work this paper cites.

Hayashi, Masahito, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, and Shigeru Yamashita (2006), “(4,1)-Quantum random access coding does not exist—one qubit is not enough to recover one of four bits,” New J. Phys. 8

2006

Earlier work this paper cites.

Kempe, Julia, Alexei Kitaev, and Oded Regev (2006), “The complexity of the local hamiltonian problem,” SIAM J. Comput. 35

2006

Earlier work this paper cites.

Klep, Igor, Victor Magron, and Jurij Volčič (2022), “Optimization over trace polynomials,” Ann. Henri Poincaré 23

Original

2006

Earlier work this paper cites.

Built on

Similar

Then

Beyond the bibliography

Semidefinite programming relaxations for quantum correlations

Understand

Built on

Similar

Then

Beyond the bibliography