Limitations on separable measurements by convex optimization

Autor: Bandyopadhyay, Somshubhro, Cosentino, Alessandro, Johnston, Nathaniel, Russo, Vincent, Watrous, John, Yu, Nengkun

Publikováno v: IEEE Transactions on Information Theory, vol. 61, no. 6, pp. 3593-3604, June 2015

We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include: an exact formula for the optimal probability of correctly discrimina

Externí odkaz: http://arxiv.org/abs/1408.6981

Dequantizing read-once quantum formulas

Autor: Cosentino, Alessandro, Kothari, Robin, Paetznick, Adam

Publikováno v: 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013), Leibniz International Proceedings in Informatics (LIPIcs) 22, pp. 80-92 (2013)

Quantum formulas, defined by Yao [FOCS '93], are the quantum analogs of classical formulas, i.e., classical circuits in which all gates have fanout one. We show that any read-once quantum formula over a gate set that contains all single-qubit gates i

Externí odkaz: http://arxiv.org/abs/1304.5164

Weight of quadratic forms and graph states

Autor: Cosentino, Alessandro, Severini, Simone

Publikováno v: Phys. Rev. A 80, 052309 (2009)

We prove a connection between Schmidt-rank and weight of quadratic forms. This provides a new tool for the classification of graph states based on entanglement. Our main tool arises from a reformulation of previously known results concerning the weig

Externí odkaz: http://arxiv.org/abs/0906.2488

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.