Quantum dynamical entropy, chaotic unitaries and complex Hadamard matrices

December 11, 2016 Β· Declared Dead Β· πŸ› IEEE Transactions on Information Theory

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Wojciech SΕ‚omczyΕ„ski, Anna Szczepanek arXiv ID 1612.03363 Category quant-ph: Quantum Computing Cross-listed cs.IT, math-ph Citations 11 Venue IEEE Transactions on Information Theory Last Checked 5 months ago
Abstract
We introduce two information-theoretical invariants for the projective unitary group acting on a finite-dimensional complex Hilbert space: PVM- and POVM-dynamical (quantum) entropies. They quantify the randomness of the successive quantum measurement results in the case where the evolution of the system between each two consecutive measurements is described by a given unitary operator. We study the class of chaotic unitaries, i.e., the ones of maximal entropy or, equivalently, such that they can be represented by suitably rescaled complex Hadamard matrices in some orthonormal bases. We provide necessary conditions for a unitary operator to be chaotic, which become also sufficient for qubits and qutrits. These conditions are expressed in terms of the relation between the trace and the determinant of the operator. We also compute the volume of the set of chaotic unitaries in dimensions two and three, and the average PVM-dynamical entropy over the unitary group in dimension two. We prove that this mean value behaves as the logarithm of the dimension of the Hilbert space, which implies that the probability that the dynamical entropy of a unitary is almost as large as possible approaches unity as the dimension tends to infinity.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted