Semi-device-independent channel identification with communication matrices

Understand this faster with AI
AbstractWe look into the task of differentiating between any two quantum channels and reconstructing them from the obtained measurement statistics with possibly limited information about the experimental set-up. We employ the communication matrix formalism where the measurement statistics of a prepare-and-measure scenario is represented as a stochastic communication matrix. In order to differentiate between any two quantum channels, the informational completeness of the set-up is both necessary and sufficient. On the other hand, if we want to uniquely characterize any quantum channel, in addition we also need to have a complete description of the set-up. We show that in many important cases we can deduce this information directly from the communication matrix of the set-up before applying the channel. Given that we trust the dimension of the system, we show that we can deduce the information completeness of the set-up directly from the rank of the communication matrix. Furthermore, we show that another quantity of the communication matrix, called the information storability, can be used to self-test the set-up (up to an orthogonal transformation) for an important class of states and measurements. This provides us a semi-device-independent way to identify quantum channels from the prepare-and-measure statistics. Lastly, we consider scenarios where we might have some additional information about the channels or additional resources at our disposal which could help us relax some of the assumptions of the proposed scenario.Featured image: A schematic diagram for the prepare-and-measure scenario in the presence of a channel.Popular summaryAny task that involves communication between two parties involves a medium, or channel, to transmit the information. Characterizing the noise in the channel is crucial in ensuring that the receiver can retrieve the message with a reasonable success rate. This also applies to quantum channels, used in quantum computing, quantum networks, and a multitude of other avenues that use quantum systems to communicate. The communication channel can be identified in two different ways: i) Differentiation, where we are able to tell apart any two distinct channels, but are not able to completely identify the channel, and ii) Tomography, where we are able to characterize any given quantum channel. Both tasks require a setup that is informationally complete, i.e., it captures all the available degrees of freedom, and the latter requires the setup to be known to be able to reliably identify the channel. With an untrustworthy setup, possibly giving the same statistics for two distinct channels, both tasks become difficult. We employ the recently introduced communication matrix framework to introduce a semi-device-independent method to certify the setup to be useful for channel identification. We also show that with weaker conditions on the setup but access to some other resources, while unable to identify the channel completely, one can still comment on certain properties of the channel. Our results provide a simple, self-consistent, and operationally intuitive way to characterize noise in quantum communication tasks based on the resources available.► BibTeX data@article{Puliyil2026semidevice, doi = {10.22331/q-2026-11-18-2274}, url = {https://doi.org/10.22331/q-2026-11-18-2274}, title = {Semi-device-independent channel identification with communication matrices}, author = {Puliyil, Samgeeth and Lepp{\"{a}}j{\"{a}}rvi, Leevi and Ziman, M{\'{a}}rio}, journal = {{Quantum}}, issn = {2521-327X}, publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}}, volume = {10}, pages = {2274}, month = nov, year = {2026} }► References [1] E. Nielsen, J. K. Gamble, K. Rudinger, T. Scholten, K. Young, and R. Blume-Kohout. ``Gate Set Tomography''. Quantum 5, 557 (2021). https://doi.org/10.22331/q-2021-10-05-557 [2] S. Endo, S. C. Benjamin, and Y. Li. ``Practical quantum error mitigation for near-future applications''. Phys. Rev. X 8, 031027 (2018). https://doi.org/10.1103/PhysRevX.8.031027 [3] S. Mangini, L. Maccone, and C. Macchiavello. ``Qubit noise deconvolution''. EPJ Quantum Technology 9, 29 (2022). https://doi.org/10.1140/epjqt/s40507-022-00151-0 [4] J. M. Chow, J. M. Gambetta, L. Tornberg, J. Koch, L. S. Bishop, A. A. Houck, B. R. Johnson, L. Frunzio, S. M. Girvin, and R. J. Schoelkopf. ``Randomized benchmarking and process tomography for gate errors in a solid-state qubit''. Phys. Rev. Lett. 102, 090502 (2009). https://doi.org/10.1103/PhysRevLett.102.090502 [5] S. Mangini, M. Cattaneo, D. Cavalcanti, S. Filippov, M. A. C. Rossi, and G. García-Pérez. ``Tensor network noise characterization for near-term quantum computers''. Phys. Rev. Res. 6, 033217 (2024). https://doi.org/10.1103/PhysRevResearch.6.033217 [6] R. Blume-Kohout, K. Rudinger, and T. Proctor. ``Easy better quantum process tomography'' (2025). arXiv:2412.16293. arXiv:2412.16293 [7] S. Pirandola, R. Laurenza, C. Lupo, and J. L. Pereira. ``Fundamental limits to quantum channel discrimination''.
Npj Quantum Inf. 5 (2019). https://doi.org/10.1038/s41534-019-0162-y [8] I. L. Chuang and M. A. Nielsen. ``Prescription for experimental determination of the dynamics of a quantum black box''. J. Mod. Opt. 44, 2455–2467 (1997). https://doi.org/10.1080/09500349708231894 [9] P. E. Frenkel and M. Weiner. ``Classical information storage in an n-level quantum system''. Commun. Math. Phys. 340, 563–574 (2015). https://doi.org/10.1007/s00220-015-2463-0 [10] T. Heinosaari, O. Kerppo, and L. Leppäjärvi. ``Communication tasks in operational theories''. J. Phys. A: Math. Theor. 53, 435302 (2020). https://doi.org/10.1088/1751-8121/abb5dc [11] T. Heinosaari and O. Kerppo. ``Maximal Elements of Quantum Communication''. Quantum 8, 1515 (2024). https://doi.org/10.22331/q-2024-11-07-1515 [12] T. Heinosaari, O. Kerppo, L. Leppäjärvi, and M. Plávala. ``Simple information-processing tasks with unbounded quantum advantage''. Phys. Rev. A 109, 032627 (2024). https://doi.org/10.1103/PhysRevA.109.032627 [13] L. Leppäjärvi. ``Measurement simulability and incompatibility in quantum theory and other operational theories'' (2021). arXiv:2106.03588. arXiv:2106.03588 [14] A. Tavakoli, J. Kaniewski, T. Vértesi, D. Rosset, and N. Brunner. ``Self-testing quantum states and measurements in the prepare-and-measure scenario''. Phys. Rev. A 98, 062307 (2018). https://doi.org/10.1103/PhysRevA.98.062307 [15] M. Farkas and J. Kaniewski. ``Self-testing mutually unbiased bases in the prepare-and-measure scenario''. Phys. Rev. A 99, 032316 (2019). https://doi.org/10.1103/PhysRevA.99.032316 [16] M. Navascués, K. F. Pál, T. Vértesi, and M. Araújo. ``Self-testing in prepare-and-measure scenarios and a robust version of wigner's theorem''. Phys. Rev. Lett. 131, 250802 (2023). https://doi.org/10.1103/PhysRevLett.131.250802 [17] Nikolai Miklin and Michał Oszmaniec. ``A universal scheme for robust self-testing in the prepare-and-measure scenario''. Quantum 5, 424 (2021). https://doi.org/10.22331/q-2021-04-06-424 [18] S. T. Merkel, J. M. Gambetta, J. A. Smolin, S. Poletto, A. D. Córcoles, B. R. Johnson, C. A. Ryan, and M. Steffen. ``Self-consistent quantum process tomography''. Phys. Rev. A 87, 062119 (2013). https://doi.org/10.1103/PhysRevA.87.062119 [19] D. Greenbaum. ``Introduction to quantum gate set tomography'' (2015). arXiv:1509.02921. arXiv:1509.02921 [20] J. Kunjummen, M. C. Tran, D. Carney, and J. M. Taylor. ``Shadow process tomography of quantum channels''. Phys. Rev. A 107, 042403 (2023). https://doi.org/10.1103/PhysRevA.107.042403 [21] Jan Nöller, Nikolai Miklin, Martin Kliesch, and Mariami Gachechiladze. ``Classical certification of quantum gates under the dimension assumption''. Quantum 9, 1825 (2025). https://doi.org/10.22331/q-2025-08-08-1825 [22] Anna Schroeder, Lucas B. Vieira, Jan Nöller, Nikolai Miklin, and Mariami Gachechiladze. ``Certifying quantum gates via automata advantage'' (2025). arXiv:2510.09575. arXiv:2510.09575 [23] S. M. Barnett and S. Croke. ``Quantum state discrimination''. Adv. Opt. Photon. 1, 238–278 (2009). https://doi.org/10.1364/AOP.1.000238 [24] J. Bae and L. C. Kwek. ``Quantum state discrimination and its applications''. J. Phys. A: Math. Theor. 48, 083001 (2015). https://doi.org/10.1088/1751-8113/48/8/083001 [25] C. M. Caves, C. A. Fuchs, and R. Schack. ``Conditions for compatibility of quantum-state assignments''. Phys. Rev. A 66, 062111 (2002). https://doi.org/10.1103/PhysRevA.66.062111 [26] M. F. Pusey, J. Barrett, and T. Rudolph. ``On the reality of the quantum state''. Nat. Phys. 8, 475 (2012). https://doi.org/10.1038/nphys2309 [27] S. Bandyopadhyay, R. Jain, J. Oppenheim, and C. Perry. ``Conclusive exclusion of quantum states''. Phys. Rev. A 89, 022336 (2014). https://doi.org/10.1103/PhysRevA.89.022336 [28] T. Heinosaari and O. Kerppo. ``Antidistinguishability of pure quantum states''. J. Phys. A: Math. Theor. 51, 365303 (2018). https://doi.org/10.1088/1751-8121/aad1fc [29] M. S. Leifer and C. Duarte. ``Noncontextuality inequalities from antidistinguishability''. Phys. Rev. A 101, 062113 (2020). https://doi.org/10.1103/PhysRevA.101.062113 [30] V. Havlíček and J. Barrett. ``Simple communication complexity separation from quantum state antidistinguishability''. Phys. Rev. Res. 2, 013326 (2020). https://doi.org/10.1103/PhysRevResearch.2.013326 [31] V. Russo and J. Sikora. ``Inner products of pure states and their antidistinguishability''. Phys. Rev. A 107, L030202 (2023). https://doi.org/10.1103/PhysRevA.107.L030202 [32] B. Schumacher and M. Westmoreland. ``Quantum processes systems, and information''.
Cambridge University Press. (2010). https://doi.org/10.1017/CBO9780511814006 [33] I. Bengtsson and K. Zyczkowski. ``Geometry of quantum states: An introduction to quantum entanglement''.
Cambridge University Press. (2006). https://doi.org/10.1017/CBO9780511535048 [34] R. A. Bertlmann and P. Krammer. ``Bloch vectors for qudits''. Journal of Physics A: Mathematical and Theoretical 41, 235303 (2008). https://doi.org/10.1088/1751-8113/41/23/235303 [35] T. Heinosaari and M. Ziman. ``The mathematical language of quantum theory: From uncertainty to entanglement''.
Cambridge University Press. (2011). https://doi.org/10.1017/CBO9781139031103 [36] T. Heinosaari, L. Leppäjärvi, and M. Plávala. ``Encoding and decoding of information in general probabilistic theories''. Int. J. Quantum Inf. 22, 2440007 (2024). https://doi.org/10.1142/S0219749924400070 [37] D. Braun, O. Giraud, I. Nechita, C. Pellegrini, and M. Žnidarič. ``A universal set of qubit quantum channels''. J. Phys. A: Math. Theor. 47, 135302 (2014). https://doi.org/10.1088/1751-8113/47/13/135302 [38] R. Blume-Kohout, H. K. Ng, D. Poulin, and L. Viola. ``Information-preserving structures: A general framework for quantum zero-error information''. Phys. Rev. A 82, 062306 (2010). https://doi.org/10.1103/PhysRevA.82.062306 [39] M. Horodecki, P. W. Shor, and M. B. Ruskai. ``Entanglement breaking channels''. Rev. Math. Phys 15, 629–641 (2003). https://doi.org/10.1142/S0129055X03001709 [40] J. E. Cohen and U. G. Rothblum. ``Nonnegative ranks, decompositions, and factorizations of nonnegative matrices''.
Linear Algebra Appl. 190, 149 (1993). https://doi.org/10.1016/0024-3795(93)90224-C [41] H. Fawzi, J. Gouveia, P. A. Parrilo, R. Z. Robinson, and R. R. Thomas. ``Positive semidefinite rank''. Math. Program. 153, 133–177 (2015). https://doi.org/10.1007/s10107-015-0922-1 [42] J. Gouveia, P. A. Parrilo, and R. R. Thomas. ``Lifts of convex sets and cone factorizations''. Math. Oper. Res. 38, 248–264 (2013). https://doi.org/10.1287/moor.1120.0575 [43] S. Fiorini, S. Massar, S. Pokutta, H. R. Tiwary, and R. de Wolf. ``Linear vs. semidefinite extended formulations: Exponential separation and strong lower bounds''. In Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing. Page 95–106. STOC '12 (2012). https://doi.org/10.1145/2213977.2213988 [44] T. Lee, Z. Wei, and R. de Wolf. ``Some upper and lower bounds on psd-rank''. Math. Program. 162, 495–521 (2017). https://doi.org/10.1007/s10107-016-1052-0 [45] S. Vavasis. ``On the complexity of nonnegative matrix factorization''. SIAM J. Optim. 20, 1364 (2009). https://doi.org/10.1137/070709967 [46] Y. Shitov. ``The complexity of positive semidefinite matrix factorization''. SIAM J. Optim. 27, 18981909 (2016). https://doi.org/10.1137/16M1080616 [47] J. Watrous. ``The theory of quantum information''.
Cambridge University Press. (2018). https://doi.org/10.1017/9781316848142Cited byCould not fetch Crossref cited-by data during last attempt 2026-11-18 12:23:27: Could not fetch cited-by data for 10.22331/q-2026-11-18-2274 from Crossref. This is normal if the DOI was registered recently. Could not fetch ADS cited-by data during last attempt 2026-11-18 12:23:27: Cannot retrieve data from ADS due to rate limitations.This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions. AbstractWe look into the task of differentiating between any two quantum channels and reconstructing them from the obtained measurement statistics with possibly limited information about the experimental set-up. We employ the communication matrix formalism where the measurement statistics of a prepare-and-measure scenario is represented as a stochastic communication matrix. In order to differentiate between any two quantum channels, the informational completeness of the set-up is both necessary and sufficient. On the other hand, if we want to uniquely characterize any quantum channel, in addition we also need to have a complete description of the set-up. We show that in many important cases we can deduce this information directly from the communication matrix of the set-up before applying the channel. Given that we trust the dimension of the system, we show that we can deduce the information completeness of the set-up directly from the rank of the communication matrix. Furthermore, we show that another quantity of the communication matrix, called the information storability, can be used to self-test the set-up (up to an orthogonal transformation) for an important class of states and measurements. This provides us a semi-device-independent way to identify quantum channels from the prepare-and-measure statistics. Lastly, we consider scenarios where we might have some additional information about the channels or additional resources at our disposal which could help us relax some of the assumptions of the proposed scenario.Featured image: A schematic diagram for the prepare-and-measure scenario in the presence of a channel.Popular summaryAny task that involves communication between two parties involves a medium, or channel, to transmit the information. Characterizing the noise in the channel is crucial in ensuring that the receiver can retrieve the message with a reasonable success rate. This also applies to quantum channels, used in quantum computing, quantum networks, and a multitude of other avenues that use quantum systems to communicate. The communication channel can be identified in two different ways: i) Differentiation, where we are able to tell apart any two distinct channels, but are not able to completely identify the channel, and ii) Tomography, where we are able to characterize any given quantum channel. Both tasks require a setup that is informationally complete, i.e., it captures all the available degrees of freedom, and the latter requires the setup to be known to be able to reliably identify the channel. With an untrustworthy setup, possibly giving the same statistics for two distinct channels, both tasks become difficult. We employ the recently introduced communication matrix framework to introduce a semi-device-independent method to certify the setup to be useful for channel identification. We also show that with weaker conditions on the setup but access to some other resources, while unable to identify the channel completely, one can still comment on certain properties of the channel. Our results provide a simple, self-consistent, and operationally intuitive way to characterize noise in quantum communication tasks based on the resources available.► BibTeX data@article{Puliyil2026semidevice, doi = {10.22331/q-2026-11-18-2274}, url = {https://doi.org/10.22331/q-2026-11-18-2274}, title = {Semi-device-independent channel identification with communication matrices}, author = {Puliyil, Samgeeth and Lepp{\"{a}}j{\"{a}}rvi, Leevi and Ziman, M{\'{a}}rio}, journal = {{Quantum}}, issn = {2521-327X}, publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}}, volume = {10}, pages = {2274}, month = nov, year = {2026} }► References [1] E. Nielsen, J. K. Gamble, K. Rudinger, T. Scholten, K. Young, and R. Blume-Kohout. ``Gate Set Tomography''. Quantum 5, 557 (2021). https://doi.org/10.22331/q-2021-10-05-557 [2] S. Endo, S. C. Benjamin, and Y. Li. ``Practical quantum error mitigation for near-future applications''. Phys. Rev. X 8, 031027 (2018). https://doi.org/10.1103/PhysRevX.8.031027 [3] S. Mangini, L. Maccone, and C. Macchiavello. ``Qubit noise deconvolution''. EPJ Quantum Technology 9, 29 (2022). https://doi.org/10.1140/epjqt/s40507-022-00151-0 [4] J. M. Chow, J. M. Gambetta, L. Tornberg, J. Koch, L. S. Bishop, A. A. Houck, B. R. Johnson, L. Frunzio, S. M. Girvin, and R. J. Schoelkopf. ``Randomized benchmarking and process tomography for gate errors in a solid-state qubit''. Phys. Rev. Lett. 102, 090502 (2009). https://doi.org/10.1103/PhysRevLett.102.090502 [5] S. Mangini, M. Cattaneo, D. Cavalcanti, S. Filippov, M. A. C. Rossi, and G. García-Pérez. ``Tensor network noise characterization for near-term quantum computers''. Phys. Rev. Res. 6, 033217 (2024). https://doi.org/10.1103/PhysRevResearch.6.033217 [6] R. Blume-Kohout, K. Rudinger, and T. Proctor. ``Easy better quantum process tomography'' (2025). arXiv:2412.16293. arXiv:2412.16293 [7] S. Pirandola, R. Laurenza, C. Lupo, and J. L. Pereira. ``Fundamental limits to quantum channel discrimination''.
Npj Quantum Inf. 5 (2019). https://doi.org/10.1038/s41534-019-0162-y [8] I. L. Chuang and M. A. Nielsen. ``Prescription for experimental determination of the dynamics of a quantum black box''. J. Mod. Opt. 44, 2455–2467 (1997). https://doi.org/10.1080/09500349708231894 [9] P. E. Frenkel and M. Weiner. ``Classical information storage in an n-level quantum system''. Commun. Math. Phys. 340, 563–574 (2015). https://doi.org/10.1007/s00220-015-2463-0 [10] T. Heinosaari, O. Kerppo, and L. Leppäjärvi. ``Communication tasks in operational theories''. J. Phys. A: Math. Theor. 53, 435302 (2020). https://doi.org/10.1088/1751-8121/abb5dc [11] T. Heinosaari and O. Kerppo. ``Maximal Elements of Quantum Communication''. Quantum 8, 1515 (2024). https://doi.org/10.22331/q-2024-11-07-1515 [12] T. Heinosaari, O. Kerppo, L. Leppäjärvi, and M. Plávala. ``Simple information-processing tasks with unbounded quantum advantage''. Phys. Rev. A 109, 032627 (2024). https://doi.org/10.1103/PhysRevA.109.032627 [13] L. Leppäjärvi. ``Measurement simulability and incompatibility in quantum theory and other operational theories'' (2021). arXiv:2106.03588. arXiv:2106.03588 [14] A. Tavakoli, J. Kaniewski, T. Vértesi, D. Rosset, and N. Brunner. ``Self-testing quantum states and measurements in the prepare-and-measure scenario''. Phys. Rev. A 98, 062307 (2018). https://doi.org/10.1103/PhysRevA.98.062307 [15] M. Farkas and J. Kaniewski. ``Self-testing mutually unbiased bases in the prepare-and-measure scenario''. Phys. Rev. A 99, 032316 (2019). https://doi.org/10.1103/PhysRevA.99.032316 [16] M. Navascués, K. F. Pál, T. Vértesi, and M. Araújo. ``Self-testing in prepare-and-measure scenarios and a robust version of wigner's theorem''. Phys. Rev. Lett. 131, 250802 (2023). https://doi.org/10.1103/PhysRevLett.131.250802 [17] Nikolai Miklin and Michał Oszmaniec. ``A universal scheme for robust self-testing in the prepare-and-measure scenario''. Quantum 5, 424 (2021). https://doi.org/10.22331/q-2021-04-06-424 [18] S. T. Merkel, J. M. Gambetta, J. A. Smolin, S. Poletto, A. D. Córcoles, B. R. Johnson, C. A. Ryan, and M. Steffen. ``Self-consistent quantum process tomography''. Phys. Rev. A 87, 062119 (2013). https://doi.org/10.1103/PhysRevA.87.062119 [19] D. Greenbaum. ``Introduction to quantum gate set tomography'' (2015). arXiv:1509.02921. arXiv:1509.02921 [20] J. Kunjummen, M. C. Tran, D. Carney, and J. M. Taylor. ``Shadow process tomography of quantum channels''. Phys. Rev. A 107, 042403 (2023). https://doi.org/10.1103/PhysRevA.107.042403 [21] Jan Nöller, Nikolai Miklin, Martin Kliesch, and Mariami Gachechiladze. ``Classical certification of quantum gates under the dimension assumption''. Quantum 9, 1825 (2025). https://doi.org/10.22331/q-2025-08-08-1825 [22] Anna Schroeder, Lucas B. Vieira, Jan Nöller, Nikolai Miklin, and Mariami Gachechiladze. ``Certifying quantum gates via automata advantage'' (2025). arXiv:2510.09575. arXiv:2510.09575 [23] S. M. Barnett and S. Croke. ``Quantum state discrimination''. Adv. Opt. Photon. 1, 238–278 (2009). https://doi.org/10.1364/AOP.1.000238 [24] J. Bae and L. C. Kwek. ``Quantum state discrimination and its applications''. J. Phys. A: Math. Theor. 48, 083001 (2015). https://doi.org/10.1088/1751-8113/48/8/083001 [25] C. M. Caves, C. A. Fuchs, and R. Schack. ``Conditions for compatibility of quantum-state assignments''. Phys. Rev. A 66, 062111 (2002). https://doi.org/10.1103/PhysRevA.66.062111 [26] M. F. Pusey, J. Barrett, and T. Rudolph. ``On the reality of the quantum state''. Nat. Phys. 8, 475 (2012). https://doi.org/10.1038/nphys2309 [27] S. Bandyopadhyay, R. Jain, J. Oppenheim, and C. Perry. ``Conclusive exclusion of quantum states''. Phys. Rev. A 89, 022336 (2014). https://doi.org/10.1103/PhysRevA.89.022336 [28] T. Heinosaari and O. Kerppo. ``Antidistinguishability of pure quantum states''. J. Phys. A: Math. Theor. 51, 365303 (2018). https://doi.org/10.1088/1751-8121/aad1fc [29] M. S. Leifer and C. Duarte. ``Noncontextuality inequalities from antidistinguishability''. Phys. Rev. A 101, 062113 (2020). https://doi.org/10.1103/PhysRevA.101.062113 [30] V. Havlíček and J. Barrett. ``Simple communication complexity separation from quantum state antidistinguishability''. Phys. Rev. Res. 2, 013326 (2020). https://doi.org/10.1103/PhysRevResearch.2.013326 [31] V. Russo and J. Sikora. ``Inner products of pure states and their antidistinguishability''. Phys. Rev. A 107, L030202 (2023). https://doi.org/10.1103/PhysRevA.107.L030202 [32] B. Schumacher and M. Westmoreland. ``Quantum processes systems, and information''.
Cambridge University Press. (2010). https://doi.org/10.1017/CBO9780511814006 [33] I. Bengtsson and K. Zyczkowski. ``Geometry of quantum states: An introduction to quantum entanglement''.
Cambridge University Press. (2006). https://doi.org/10.1017/CBO9780511535048 [34] R. A. Bertlmann and P. Krammer. ``Bloch vectors for qudits''. Journal of Physics A: Mathematical and Theoretical 41, 235303 (2008). https://doi.org/10.1088/1751-8113/41/23/235303 [35] T. Heinosaari and M. Ziman. ``The mathematical language of quantum theory: From uncertainty to entanglement''.
Cambridge University Press. (2011). https://doi.org/10.1017/CBO9781139031103 [36] T. Heinosaari, L. Leppäjärvi, and M. Plávala. ``Encoding and decoding of information in general probabilistic theories''. Int. J. Quantum Inf. 22, 2440007 (2024). https://doi.org/10.1142/S0219749924400070 [37] D. Braun, O. Giraud, I. Nechita, C. Pellegrini, and M. Žnidarič. ``A universal set of qubit quantum channels''. J. Phys. A: Math. Theor. 47, 135302 (2014). https://doi.org/10.1088/1751-8113/47/13/135302 [38] R. Blume-Kohout, H. K. Ng, D. Poulin, and L. Viola. ``Information-preserving structures: A general framework for quantum zero-error information''. Phys. Rev. A 82, 062306 (2010). https://doi.org/10.1103/PhysRevA.82.062306 [39] M. Horodecki, P. W. Shor, and M. B. Ruskai. ``Entanglement breaking channels''. Rev. Math. Phys 15, 629–641 (2003). https://doi.org/10.1142/S0129055X03001709 [40] J. E. Cohen and U. G. Rothblum. ``Nonnegative ranks, decompositions, and factorizations of nonnegative matrices''.
Linear Algebra Appl. 190, 149 (1993). https://doi.org/10.1016/0024-3795(93)90224-C [41] H. Fawzi, J. Gouveia, P. A. Parrilo, R. Z. Robinson, and R. R. Thomas. ``Positive semidefinite rank''. Math. Program. 153, 133–177 (2015). https://doi.org/10.1007/s10107-015-0922-1 [42] J. Gouveia, P. A. Parrilo, and R. R. Thomas. ``Lifts of convex sets and cone factorizations''. Math. Oper. Res. 38, 248–264 (2013). https://doi.org/10.1287/moor.1120.0575 [43] S. Fiorini, S. Massar, S. Pokutta, H. R. Tiwary, and R. de Wolf. ``Linear vs. semidefinite extended formulations: Exponential separation and strong lower bounds''. In Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing. Page 95–106. STOC '12 (2012). https://doi.org/10.1145/2213977.2213988 [44] T. Lee, Z. Wei, and R. de Wolf. ``Some upper and lower bounds on psd-rank''. Math. Program. 162, 495–521 (2017). https://doi.org/10.1007/s10107-016-1052-0 [45] S. Vavasis. ``On the complexity of nonnegative matrix factorization''. SIAM J. Optim. 20, 1364 (2009). https://doi.org/10.1137/070709967 [46] Y. Shitov. ``The complexity of positive semidefinite matrix factorization''. SIAM J. Optim. 27, 18981909 (2016). https://doi.org/10.1137/16M1080616 [47] J. Watrous. ``The theory of quantum information''.
Cambridge University Press. (2018). https://doi.org/10.1017/9781316848142Cited byCould not fetch Crossref cited-by data during last attempt 2026-11-18 12:23:27: Could not fetch cited-by data for 10.22331/q-2026-11-18-2274 from Crossref. This is normal if the DOI was registered recently. Could not fetch ADS cited-by data during last attempt 2026-11-18 12:23:27: Cannot retrieve data from ADS due to rate limitations.This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
