Engineering topics
Publications and source records attributed to Benatti, Fabio.
We extend the notion of Gacs quantum algorithmic entropy, originally formulated for finitely many qubits, to infinite dimensional quantum spin chains and investigate the relation of this extension with two quantum dynamical entropies that have been proposed in recent years.
Subentropy is an entropy-like quantity that arises in quantum information theory; for example, it provides a tight lower bound on the accessible information for pure state ensembles, dual to the von Neumann entropy upper bound in Holevo's theorem. Here we establish a series of properties of subentropy, paralleling the well-developed analogous theory for von Neumann entropy. Further, we show that subentropy is a lower bound for min-entropy. We introduce a notion of conditional subentropy and show that it can be used to provide an upper bound for the guessing probability of any classical-quantum state of two qubits; we conjecture that the bound applies also in higher dimensions. Finally, we give an operational interpretation of subentropy within classical information theory.
We consider a model of non-commutative quantum mechanics given by two harmonic oscillators over a non-commutative two dimensional configuration space. We study possible ways of removing the non-commutativity based on the classical limit context known as anti-Wick quantization. We show that removal of non-commutativity from the configuration space and from the canonical operators is not commuting operation.
Quantum contextuality in systems of identical bosonic particles is explicitly exhibited via the maximum violation of a suitable inequality of Clauser-Horne-Shimony-Holt type. Unlike the approaches considered so far, which make use of single-particle observables, our analysis involves collective observables constructed using multiboson operators. An exemplifying scheme to test this violation with a quantum optical setup is also discussed.