Filters








5 Hits in 7.6 sec

Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants

Toby Cubitt, Laura Mancinska, David E. Roberson, Simone Severini, Dan Stahlke, Andreas Winter
2014 IEEE Transactions on Information Theory  
We study zero-error entanglement assisted source-channel coding (communication in the presence of side information).  ...  Therefore, we are able to disprove the conjecture that the one-shot entanglement-assisted zero-error capacity is equal to the integer part of the Lovász number.  ...  This ends up exactly characterizing monotonicity of ϑ, and shows that ϑ can be used to provide a lower bound on the cost rate for entanglement assisted source-channel coding.  ... 
doi:10.1109/tit.2014.2349502 fatcat:nxd7nehamfe7tlos6zse6g3vpu

Zero-Error Capacity of Quantum Channels [chapter]

Elloá B. Guedes, Francisco Marcos de Assis, Rex A. C Medeiros
2016 Quantum Zero-Error Information Theory  
If the conjecture holds, it is possible to give an exact solution for the capacity, and construct an error-free quantum block code reaching the capacity.  ...  Finally, we demonstrate that the QZEC is upper bounded by the Holevo-Schumacher-Westmoreland capacity. xiii xiv  ...  Then, I acc ≤ χ. (4.25) The real number χ is known as Holevo quantity, and it is an upper bound on the accessible information.  ... 
doi:10.1007/978-3-319-42794-2_5 fatcat:44z4df4l4fci7pipjfqiqctkw4

9th Conference on the Theory of Quantum Computation, Communication and Cryptography

Steven Flammia, Aram Harrow
2014 unpublished
The 9th Conference on the Theory of Quantum Computation, Communication and Cryptography was held at the National University of Singapore, from the 21st to the 23rd May 2014.  ...  The TQC conference series focuses on theoretical aspects of these subfields.  ...  We also thank Mariano Suárez-Alvarez and Gjergji Zaimi for leading us to reference [12] via math.stackexchange and mathoverflow.  ... 
fatcat:xhlblcfn4zc3rinfgan4hfls7u

LIPIcs-Leibniz International Proceedings in Informatics Contents Oracles with Costs

Salman Beigi, Robert König, Salman Beigi, Robert König, Pascal Weil, Reinhard Wilhelm, Shelby Kimmel, Cedric, Yen-Yu Lin, Han-Hsuan Lin
unpublished
The 10th Conference on the Theory of Quantum Computation, Communication and Cryptography was held at the Université libre de Bruxelles from the 20th to the 22nd of May 2015.  ...  The TQC conference series focuses on theoretical aspects of these subfields.  ...  We thank one of the referees for pointing out that the original proof of Theorem 22 could be simplified to the elementary proof given above. S. B. and T. P. were funded by the SIQS European project.  ... 
fatcat:jolb2hfxbjfsnjm5tqbsiz5szq

Analysis of Dynamic Social and Technological Networks (Dagstuhl Seminar 11452) Coding Theory (Dagstuhl Seminar 11461)

Holger Giese, Bernhard Rumpe, Bernhard Schätz, Janos Sztipanovits, Lars Elden, Andreas, Vito Latora, Cecilia Mascolo, Mirco, Joachim Rosenthal, M Shokrollahi, Judy
2011 Science and Engineering of Cyber-Physical Systems   unpublished
We recently proposed a formulation for the Requirements Problem of SAS (revisiting foundational work by Zave et. al., TOSEM'97, and a more recent one by Jureta et al., RE'08), as a dynamic problem (Qureshi  ...  This motivates our interest in M@RT, and especially in continuous re-appraisal of requirements at run-time, which calls for effective and light-way methods for model representation and reasoning at run-time  ...  size polynomial in n, obtained by the symmetrization of a general program, which itself can be viewed as the Lovász theta number of a certain graph [3] .  ... 
fatcat:bwnjnbq2bjbolk52twaysozyxu