Montserrat Casas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Montserrat Casas has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Angelo Plastino
Universidad Nacional de La Plata, Argentina
12 shared publications - Antoni Borràs
Environmental Radioactivity Laboratory (LaboRA), University of the Balearic Islands, Cra. Valldemossa Km 7.5, 07122, Palma, Spain
6 shared publications - A. P. Majtey
Departament de Física and IFISC, Universitat de les Illes Balears, 07122 Palma de Mallorca, Spain
5 shared publications - Andres Mauricio Kowalski
Instituto de Física (IFLP-CCT-Conicet), Fac. de Ciencias Exactas, Universidad Nacional de La Plata, C.C. 727, 1900 La Plata, Argentina
2 shared publications - Angel R. Plastino
Instituto Carlos I de Física Teórica y Computacional Universidad de Granada Granada Spain
2 shared publications J. Batle
Departament de Física and IMEDEA-CSIC, Universitat de les Illes Balears, 07122 Palma de Mallorca, Spain
2 shared publications
Latest Publications
- Open Access
Distances in Probability Space and the Statistical Complexity Setup
Statistical complexity measures (SCM) are the composition of two ingredients: (i) entropies and (ii) distances in probability-space. In consequence, SCMs provide a simultaneous quantification of the randomness and the correlational structures present in the system under study. We address in this review important topics underlying the SCM structure, viz., (a) a good choice of probability metric space and (b) how to assess the best distance-choice, which in this context is called a “disequilibrium” and is denoted with the letter Q. Q, indeed the crucial SCM ingredient, is cast in terms of an associated distance D. Since out input data consists of time-series, we also discuss the best way of extracting from the time series a probability distribution P. As an illustration, we show just how these issues affect the description of the classical limit of quantum mechanics.
Open AccessDistances in Probability Space and the Statistical Complexity Setup
Statistical complexity measures (SCM) are the composition of two ingredients: (i) entropies and (ii) distances in probability-space. In consequence, SCMs provide a simultaneous quantification of the randomness and the correlational structures present in the system under study. We address in this review important topics underlying the SCM structure, viz., (a) a good choice of probability metric space and (b) how to assess the best distance-choice, which in this context is called a “disequilibrium” and is denoted with the letter Q. Q, indeed the crucial SCM ingredient, is cast in terms of an associated distance D. Since out input data consists of time-series, we also discuss the best way of extracting from the time series a probability distribution P. As an illustration, we show just how these issues affect the description of the classical limit of quantum mechanics.
- Open Access
Extreme Fisher Information, Non-Equilibrium Thermodynamics and Reciprocity Relations
In employing MaxEnt, a crucial role is assigned to the reciprocity relations that relate the quantifier to be extremized (Shannon’s entropy S), the Lagrange multipliers that arise during the variational process, and the expectation values that constitute the a priori input information. We review here just how these ingredients relate to each other when the information quantifier S is replaced by Fisher’s information measure I. The connection of these proceedings with thermodynamics constitute our physical background.
Open AccessExtreme Fisher Information, Non-Equilibrium Thermodynamics and Reciprocity Relations
In employing MaxEnt, a crucial role is assigned to the reciprocity relations that relate the quantifier to be extremized (Shannon’s entropy S), the Lagrange multipliers that arise during the variational process, and the expectation values that constitute the a priori input information. We review here just how these ingredients relate to each other when the information quantifier S is replaced by Fisher’s information measure I. The connection of these proceedings with thermodynamics constitute our physical background.
- Open Access
Landauer’s Principle and Divergenceless Dynamical Systems
Landauer’s principle is one of the pillars of the physics of information. It constitutes one of the foundations behind the idea that “information is physical”. Landauer’s principle establishes the smallest amount of energy that has to be dissipated when one bit of information is erased from a computing device. Here we explore an extended Landauerlike principle valid for general dynamical systems (not necessarily Hamiltonian) governed by divergenceless phase space flows.
Open AccessLandauer’s Principle and Divergenceless Dynamical Systems
Landauer’s principle is one of the pillars of the physics of information. It constitutes one of the foundations behind the idea that “information is physical”. Landauer’s principle establishes the smallest amount of energy that has to be dissipated when one bit of information is erased from a computing device. Here we explore an extended Landauerlike principle valid for general dynamical systems (not necessarily Hamiltonian) governed by divergenceless phase space flows.
- Open Access
Generalized Complexity and Classical-Quantum Transition
We investigate the classical limit of the dynamics of a semiclassical system that represents the interaction between matter and a given field. On using as a quantifier the q- Complexity, we find that it describes appropriately the quantum-classical transition, detecting the most salient details of the changeover. Additionally the q-Complexity results a better quantifier of the problem than the q-entropy, in the sense that the q-range is enlarged, describing the q-Complexity, the most important characteristics of the transition for all q-value.
Open AccessGeneralized Complexity and Classical-Quantum Transition
We investigate the classical limit of the dynamics of a semiclassical system that represents the interaction between matter and a given field. On using as a quantifier the q- Complexity, we find that it describes appropriately the quantum-classical transition, detecting the most salient details of the changeover. Additionally the q-Complexity results a better quantifier of the problem than the q-entropy, in the sense that the q-range is enlarged, describing the q-Complexity, the most important characteristics of the transition for all q-value.
- 9 February 2009
- Published by American Physical Society (APS) in Physical Review A
- Vol. 79 (2) , 022108
Robustness of highly entangled multiqubit states under decoherence
We investigate the decay of entanglement, due to decoherence, of multiqubit systems that are initially prepared in highly (in some cases maximally) entangled states. We assume that during the decoherence processes each qubit of the system interacts with its own independent environment. We determine, for systems with a small number of qubits and for various decoherence channels, the initial states exhibiting the most robust entanglement. We also consider a restricted version of this robustness-optimization problem that only involves states equivalent, under local unitary transformations, to the Greenberger-Horne-Zeilinger state.- 9 February 2009
- Published by American Physical Society (APS) in Physical Review A
- Vol. 79 (2) , 022108
Robustness of highly entangled multiqubit states under decoherence
We investigate the decay of entanglement, due to decoherence, of multiqubit systems that are initially prepared in highly (in some cases maximally) entangled states. We assume that during the decoherence processes each qubit of the system interacts with its own independent environment. We determine, for systems with a small number of qubits and for various decoherence channels, the initial states exhibiting the most robust entanglement. We also consider a restricted version of this robustness-optimization problem that only involves states equivalent, under local unitary transformations, to the Greenberger-Horne-Zeilinger state.- Open Access
Robustness of Highly Entangled Multi-Qubit States Under Decoherence
We investigate the decay of entanglement, due to decoherence, of multi-qubit systems that are initially prepared in highly (in some cases maximally) entangled states. We assume that during the decoherence processes each qubit of the system interacts with its own, independent environment. We determine, for systems with a small number of qubits and for various decoherence channels, the initial states exhibiting the most robust entanglement. We also consider a restricted version of this robustness optimization problem, only involving states equivalent under local unitary transformations to the |GHZ> state.
Open AccessRobustness of Highly Entangled Multi-Qubit States Under Decoherence
We investigate the decay of entanglement, due to decoherence, of multi-qubit systems that are initially prepared in highly (in some cases maximally) entangled states. We assume that during the decoherence processes each qubit of the system interacts with its own, independent environment. We determine, for systems with a small number of qubits and for various decoherence channels, the initial states exhibiting the most robust entanglement. We also consider a restricted version of this robustness optimization problem, only involving states equivalent under local unitary transformations to the |GHZ> state.
- 19 August 2008
- Published by American Physical Society (APS) in Physical Review A
- Vol. 78 (2) , 022328
Efficient generation of random multipartite entangled states using time-optimal unitary operations
We review the generation of random pure states using a protocol of repeated two-qubit gates. We study the dependence of the convergence to states with Haar multipartite entanglement distribution. We investigate the optimal generation of such states in terms of the physical (real) time needed to apply the protocol, instead of the gate complexity point of view used in other works. This physical time can be obtained, for a given Hamiltonian, within the theoretical framework offered by the quantum brachistochrone formalism, the quantum analogue to the brachistochrone problem in classical mechanics [Carlini et al., Phys. Rev. Lett. 96, 060503 (2006)]. Using an anisotropic Heisenberg Hamiltonian as an example, we find that different optimal quantum gates arise according to the optimality point of view used in each case. We also study how the convergence to random entangled states depends on different entanglement measures.
- 19 August 2008
- Published by American Physical Society (APS) in Physical Review A
- Vol. 78 (2) , 022328
Efficient generation of random multipartite entangled states using time-optimal unitary operations
We review the generation of random pure states using a protocol of repeated two-qubit gates. We study the dependence of the convergence to states with Haar multipartite entanglement distribution. We investigate the optimal generation of such states in terms of the physical (real) time needed to apply the protocol, instead of the gate complexity point of view used in other works. This physical time can be obtained, for a given Hamiltonian, within the theoretical framework offered by the quantum brachistochrone formalism, the quantum analogue to the brachistochrone problem in classical mechanics [Carlini et al., Phys. Rev. Lett. 96, 060503 (2006)]. Using an anisotropic Heisenberg Hamiltonian as an example, we find that different optimal quantum gates arise according to the optimality point of view used in each case. We also study how the convergence to random entangled states depends on different entanglement measures.
- Open Access
Efficient generation of random multipartite entangled states using time optimal unitary operations
We review the generation of random pure states using a protocol of repeated two qubit gates. We study the dependence of the convergence to states with Haar multipartite entanglement distribution. We investigate the optimal generation of such states in terms of the physical (real) time needed to apply the protocol, instead of the gate complexity point of view used in other works. This physical time can be obtained, for a given Hamiltonian, within the theoretical framework offered by the quantum brachistochrone formalism. Using an anisotropic Heisenberg Hamiltonian as an example, we find that different optimal quantum gates arise according to the optimality point of view used in each case. We also study how the convergence to random entangled states depends on different entanglement measures.
Open AccessEfficient generation of random multipartite entangled states using time optimal unitary operations
We review the generation of random pure states using a protocol of repeated two qubit gates. We study the dependence of the convergence to states with Haar multipartite entanglement distribution. We investigate the optimal generation of such states in terms of the physical (real) time needed to apply the protocol, instead of the gate complexity point of view used in other works. This physical time can be obtained, for a given Hamiltonian, within the theoretical framework offered by the quantum brachistochrone formalism. Using an anisotropic Heisenberg Hamiltonian as an example, we find that different optimal quantum gates arise according to the optimality point of view used in each case. We also study how the convergence to random entangled states depends on different entanglement measures.
- Open Access
Incremental Entropy Relation as an Alternative to MaxEnt
We show that, to generate the statistical operator appropriate for a given system, and as an alternative to Jaynes’ MaxEnt approach, that refers to the entropy S, one can use instead the increments ±S in S. To such an effect, one uses the macroscopic thermodynamic relation that links ±S to changes in i) the internal energy E and ii) the remaining M relevant extensive quantities Ai, i = 1; : : : ;M; that characterize the context one is working with.
Open AccessIncremental Entropy Relation as an Alternative to MaxEnt
We show that, to generate the statistical operator appropriate for a given system, and as an alternative to Jaynes’ MaxEnt approach, that refers to the entropy S, one can use instead the increments ±S in S. To such an effect, one uses the macroscopic thermodynamic relation that links ±S to changes in i) the internal energy E and ii) the remaining M relevant extensive quantities Ai, i = 1; : : : ;M; that characterize the context one is working with.