Zobrazeno 1 - 10
of 23
pro vyhledávání: '"David E. Roberson"'
Autor:
David E. Roberson, Masahiro Takeoka, Ulrik L. Andersen, Shuro Izumi, Wojciech Roga, Jonas S. Neergaard-Nielsen
Publikováno v:
Roberson, D E, Izumi, S, Roga, W, Neergaard-Nielsen, J S, Takeoka, M & Andersen, U L 2021, ' Limit of Gaussian operations and measurements for Gaussian state discrimination and its application to state comparison ', Physical Review A, vol. 103, no. 2, 022423 . https://doi.org/10.1103/PhysRevA.103.022423
Physical Review A
Physical Review A
We determine the optimal method of discriminating and comparing quantum states from a certain class of multimode Gaussian states and their mixtures when arbitrary global Gaussian operations and general Gaussian measurements are allowed. We consider t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9bdd6dba42fdf6e4dc72d5cdd928646c
http://arxiv.org/abs/2009.00108
http://arxiv.org/abs/2009.00108
Autor:
Ivan G. Todorov, Laura Mančinska, Martino Lupini, Vern I. Paulsen, David E. Roberson, Andreas Winter, Simone Severini, Giannicola Scarpa
Publikováno v:
Lupini, M, Mančinska, L, Paulsen, V I, Roberson, D E, Scarpa, G, Severini, S, Todorov, I G & Winter, A 2020, ' Perfect Strategies for Non-Local Games ', Mathematical Physics, Analysis and Geometry, vol. 23, no. 1, 7 . https://doi.org/10.1007/s11040-020-9331-7
We describe the main classes of non-signalling bipartite correlations in terms of states on operator system tensor products. This leads to the introduction of another new class of games, called reflexive games, which are characterised as the hardest
Autor:
Laura Mančinska, David E. Roberson
Publikováno v:
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
Mancinska, L & Roberson, D E 2020, Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs . in 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) . IEEE, pp. 661-672, 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020 IEEE, Durham, NC, United States, 16/11/2020 . https://doi.org/10.1109/FOCS46700.2020.00067
FOCS
Mancinska, L & Roberson, D E 2020, Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs . in Proceedings of IEEE 61 st Annual Symposium on Foundations of Computer Science ., 9317964, IEEE Computer Society Press, Proceedings-Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 2020-November, pp. 661-672, 61 st IEEE Annual Symposium on Foundations of Computer Science, Durham, New York, United States, 16/11/2020 . https://doi.org/10.1109/FOCS46700.2020.00067
Mancinska, L & Roberson, D E 2020, Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs . in 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) . IEEE, pp. 661-672, 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020 IEEE, Durham, NC, United States, 16/11/2020 . https://doi.org/10.1109/FOCS46700.2020.00067
FOCS
Mancinska, L & Roberson, D E 2020, Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs . in Proceedings of IEEE 61 st Annual Symposium on Foundations of Computer Science ., 9317964, IEEE Computer Society Press, Proceedings-Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 2020-November, pp. 661-672, 61 st IEEE Annual Symposium on Foundations of Computer Science, Durham, New York, United States, 16/11/2020 . https://doi.org/10.1109/FOCS46700.2020.00067
Over 50 years ago, Lovasz proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph. Other equivalence relations on graphs, such as cospectrality or fractional isomorphism, can be characterized by
Autor:
Michael Young, Leslie Hogben, Michael Dairyko, Simone Severini, Jephian C.-H. Lin, David E. Roberson, Joshua Lockhart
Publikováno v:
Linear Algebra and its Applications. 521:240-253
We conjecture that all connected graphs of order n have von Neumann entropy at least as great as the star K 1 , n − 1 and prove this for almost all graphs of order n. We show that connected graphs of order n have Renyi 2-entropy at least as great a
Publikováno v:
The Electronic Journal of Linear Algebra. 32:98-115
Fractional minimum positive semidefinite rank is defined from $r$-fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fractional minimum positive semidefinite rank of its complement. An $r$-fold v
Publikováno v:
Godsil, C, Roberson, D E, Rooney, B, Šámal, R & Varvitsiotis, A 2019, ' Graph homomorphisms via vector colorings ', European Journal of Combinatorics, vol. 79, pp. 244-261 . https://doi.org/10.1016/j.ejc.2019.04.001
In this paper we study the existence of homomorphisms G → H using semidefinite programming. Specifically, we use the vector chromatic number of a graph, defined as the smallest real number t ≥ 2 for which there exists an assignment of unit vector
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4352fac4c4b5e680a73485253828f01f
https://orbit.dtu.dk/en/publications/792078bc-ef2e-4edf-992c-a4ad096d72d8
https://orbit.dtu.dk/en/publications/792078bc-ef2e-4edf-992c-a4ad096d72d8
Autor:
Laura Mančinska, David E. Roberson, Robert Šámal, Simone Severini, Albert Atserias, Antonios Varvitsiotis
Publikováno v:
Journal of Combinatorial Theory, Series B
Atserias, A, Mančinska, L, Roberson, D E, Šámal, R, Severini, S & Varvitsiotis, A 2019, ' Quantum and non-signalling graph isomorphisms ', Journal of Combinatorial Theory. Series B, vol. 136, pp. 289-328 . https://doi.org/10.1016/j.jctb.2018.11.002
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Atserias, A, Mančinska, L, Roberson, D E, Šámal, R, Severini, S & Varvitsiotis, A 2019, ' Quantum and non-signalling graph isomorphisms ', Journal of Combinatorial Theory. Series B, vol. 136, pp. 289-328 . https://doi.org/10.1016/j.jctb.2018.11.002
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
We introduce the (G,H)-isomorphism game, a new two-player non-local game that classical players can win with certainty iff the graphs G and H are isomorphic. We then define quantum and non-signalling isomorphisms by considering perfect quantum and no
Publikováno v:
LAGOS
We extend the clique-coclique inequality, previously known to hold for graphs in association schemes and vertex-transitive graphs, to graphs in homogeneous coherent configurations and 1-walk regular graphs. We further generalize it to a stronger ineq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b49fe61922b9c077630660278f1f75c
Publikováno v:
Godsil, C, Roberson, D E, Rooney, B, Šámal, R & Varvitsiotis, A 2019, ' Vector coloring the categorical product of graphs ', Mathematical Programming . https://doi.org/10.1007/s10107-019-01393-0
A vector $t$-coloring of a graph is an assignment of real vectors $p_1, \ldots, p_n$ to its vertices such that $p_i^Tp_i = t-1$ for all $i=1, \ldots, n$ and $p_i^Tp_j \le -1$ whenever $i$ and $j$ are adjacent. The vector chromatic number of $G$ is th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76bb88c784ecb3efe21e24e579151fa8
https://hdl.handle.net/10356/142847
https://hdl.handle.net/10356/142847
Autor:
David E. Roberson
Publikováno v:
Roberson, D E 2019, ' Homomorphisms of Strongly Regular Graphs ', Journal of Algebraic Combinatorics, vol. 2, no. 4, pp. 481-497 . https://doi.org/10.5802/alco.50
We prove that if $G$ and $H$ are primitive strongly regular graphs with the same parameters and $\varphi$ is a homomorphism from $G$ to $H$, then $\varphi$ is either an isomorphism or a coloring (homomorphism to a complete subgraph). Therefore, the o