index - Information et Chaos Quantiques

Derniers dépôts, tout type de documents

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, studying what it means to simulate a collection of measurements, which we call a multimeter. To this end, we first explicitly characterize the completely positive transformations between multimeters. However, not all of these transformations correspond to valid simulations, as evidenced by the existence of maps that always prepare the same multimeter regardless of the input, which we call trash-and-prepare. We give a new definition of multimeter simulations as transformations that are triviality-preserving, i.e., when given a multimeter consisting of trivial measurements they can only produce another trivial multimeter. In the absence of a quantum ancilla, we then characterize the transformations that are triviality-preserving and the transformations that are trash-and-prepare. Finally, we use these characterizations to compare our new definition of multimeter simulation to three existing ones: classical simulations, compression of multimeters, and compatibility-preserving simulations.

Continuer la lecture Partager

We introduce the Ising Network Opinion Formation (INOF) model and apply it for the analysis of networks of 6 Wikipedia language editions. In the model, Ising spins are placed at network nodes/articles and the steady-state opinion polarization of spins is determined from the Monte Carlo iterations in which a given spin orientation is determined by in-going links from other spins. The main consideration is done for opinion confrontation between {\it capitalism, imperialism} (blue opinion) and {\it socialism, communism} (red opinion). These nodes have fixed spin/opinion orientation while other nodes achieve their steady-state opinions in the process of Monte Carlo iterations. We find that the global network opinion favors {\it socialism, communism} for all 6 editions. The model also determines the opinion preferences for world countries and political leaders, showing good agreement with heuristic expectations. We also present results for opinion competition between {\it Christianity} and {\it Islam}, and USA Democratic and Republican parties. We argue that the INOF approach can find numerous applications for directed complex networks.

Continuer la lecture Partager

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 as possible. Surprisingly, some nonlocal boxes, which are resources shared by the two computers, are so powerful that they allow to collapse communication complexity, in the sense that any Boolean function f can be correctly estimated with the exchange of only one bit of communication. The Popescu-Rohrlich (PR) box is an example of such a collapsing resource, but a comprehensive description of the set of collapsing nonlocal boxes remains elusive. In this work, we carry out an algebraic study of the structure of wirings connecting nonlocal boxes, thus defining the notion of the "product of boxes" P⊠Q, and we show related associativity and commutativity results. This gives rise to the notion of the "orbit of a box", unveiling surprising geometrical properties about the alignment and parallelism of distilled boxes. The power of this new framework is that it allows us to prove previously-reported numerical observations concerning the best way to wire consecutive boxes, and to numerically and analytically recover recently-identified noisy PR boxes that collapse communication complexity for different types of noise models.

Continuer la lecture Partager

One of the most fundamental questions in quantum information theory is PPT-entanglement of quantum states, which is an NP-hard problem in general. In this paper, however, we prove that all PPT (π¯¯¯A⊗πB)-invariant quantum states are separable if and only if all extremal unital positive (πB,πA)-covariant maps are decomposable where πA,πB are unitary representations of a compact group and πA is irreducible. Moreover, an extremal unital positive (πB,πA)-covariant map L is decomposable if and only if L is completely positive or completely copositive. We then apply these results to prove that all PPT quantum channels of the form Φ(ρ)=aTr(ρ)dIdd+bρ+cρT+(1−a−b−c)diag(ρ) are entanglement-breaking, and that all A-BC PPT (U⊗U¯¯¯¯⊗U)-invariant tripartite quantum states are A-BC separable. The former strengthens some conclusions in [VW01,KMS20], and the latter provides a strong contrast to the fact that there exist PPT-entangled (U⊗U⊗U)-invariant tripartite Werner states [EW01] and resolves some open questions raised in [COS18].

Continuer la lecture Partager

We study the random transverse field Ising model on a finite Cayley tree. This enables us to probe key questions arising in other important disordered quantum systems, in particular the Anderson transition and the problem of dirty bosons on the Cayley tree, or the emergence of non-ergodic properties in such systems. We numerically investigate this problem building on the cavity mean-field method complemented by state-of-the art finite-size scaling analysis. Our numerics agree very well with analytical results based on an analogy with the traveling wave problem of a branching random walk in the presence of an absorbing wall. Critical properties and finite-size corrections for the zero-temperature paramagnetic-ferromagnetic transition are studied both for constant and algebraically vanishing boundary conditions. In the later case, we reveal a regime which is reminiscent of the non-ergodic delocalized phase observed in other systems, thus shedding some light on critical issues in the context of disordered quantum systems, such as Anderson transitions, the many-body localization or disordered bosons in infinite dimensions.

Continuer la lecture Partager

Sujets

0375-b Opinion formation Networks 2DRank Quantum denoiser CheiRank Unfolding Quantum computation Atom laser International trade Aubry transition Directed networks Anderson localization Calcul quantique Entanglement 2DEAG Quantum information Social networks 2DRank algorithm Entropy Quantum mechanics Matrix model Google matrix Semiclassical Deep learning Algebra 7215Rn Correlation Disordered Systems and Neural Networks cond-matdis-nn Toy model Adaptive transformation Adaptive signal and image representation Wigner crystal Community structure Solar System Interférence FOS Physical sciences World trade network PageRank algorithm Chaos quantique Random matrix theory Complex networks Duality Harper model Cloning Nonlinearity Chaos Numerical calculations Structure Critical phenomena Qubit PageRank Semi-classique Information quantique ANDREAS BLUHM Quantum many-body interaction Amplification Unitarity Markov chains Super-Resolution Wikipedia Quantum image processing Hilbert space Information theory Decoherence Denoising Fidelity Mécanique quantique Wikipedia networks Chaotic dynamics 6470qj Asymmetry Random graphs Adaptive transform Random Husimi function 0545Mt Model Many-body problem Spin Statistical description Adaptative denoiser World trade 2DEG Poincare recurrences Adaptive filters Plug-and-Play Quantum denoising Chaotic systems Localization Ordinateur quantique Quantum chaos ADMM Covariance CheiRank algorithm Dark matter Dynamical chaos Clonage Wikipedia network Quantum Physics quant-ph

Statistiques

Nombre de fichiers déposés

86

Nombre de notices déposées

322