Zobrazeno 1 - 10
of 288
pro vyhledávání: '"Nechita, Ion"'
Autor:
Botteron, Pierre, Broadbent, Anne, Culf, Eric, Nechita, Ion, Pellegrini, Clément, Rochette, Denis
Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and quantum side-
Externí odkaz:
http://arxiv.org/abs/2410.23064
We study the entanglement entropy of a random tensor network (RTN) using tools from free probability theory. Random tensor networks are simple toy models that help the understanding of the entanglement behavior of a boundary region in the ADS/CFT con
Externí odkaz:
http://arxiv.org/abs/2407.02559
Autor:
Jha, Ankit Kumar, Nechita, Ion
In this paper, we study random instances of the classical marginal problem. We encode the problem in a graph, where the vertices have assigned fixed binary probability distributions, and edges have assigned random bivariate distributions having the i
Externí odkaz:
http://arxiv.org/abs/2406.14153
Autor:
Nechita, Ion, Park, Sang-Jun
The group symmetries inherent in quantum channels often make them tractable and applicable to various problems in quantum information theory. In this paper, we introduce natural probability distributions for covariant quantum channels. Specifically,
Externí odkaz:
http://arxiv.org/abs/2403.03667
In the quest for robust and universal quantum devices, the notion of simulation plays a crucial role, both from a theoretical and from an applied perspective. In this work, we go beyond the simulation of quantum channels and quantum measurements, stu
Externí odkaz:
http://arxiv.org/abs/2402.18333
Publikováno v:
J. Math. Phys. 65, 082201 (2024)
We develop a method for the random sampling of (multimode) Gaussian states in terms of their covariance matrix, which we refer to as a random quantum covariance matrix (RQCM). We analyze the distribution of marginals and demonstrate that the eigenval
Externí odkaz:
http://arxiv.org/abs/2401.13435
Publikováno v:
Quantum 8, 1402 (2024)
Communication complexity quantifies how difficult it is for two distant computers to evaluate a function f(X,Y), where the strings X and Y are distributed to the first and second computer respectively, under the constraint of exchanging as few bits a
Externí odkaz:
http://arxiv.org/abs/2312.00725
We study a class of bistochastic matrices generalizing unistochastic matrices. Given a complex bipartite unitary operator, we construct a bistochastic matrix having as entries the normalized squares of Frobenius norm of the blocks. We show that the c
Externí odkaz:
http://arxiv.org/abs/2310.03436
Autor:
Allerstorfer, Rene, Christandl, Matthias, Grinko, Dmitry, Nechita, Ion, Ozols, Maris, Rochette, Denis, Lunel, Philip Verduyn
We investigate the extent to which two particles can be maximally entangled when they are also similarly entangled with other particles on a complete graph, focusing on Werner, isotropic, and Brauer states. To address this, we formulate and solve opt
Externí odkaz:
http://arxiv.org/abs/2309.16655
The tensor flattenings appear naturally in quantum information when one produces a density matrix by partially tracing the degrees of freedom of a pure quantum state. In this paper, we study the joint $^*$-distribution of the flattenings of large ran
Externí odkaz:
http://arxiv.org/abs/2307.11439