activity
20182026
most citedAddendum to: Kolmogorov complexity of sequences of random numbers generated in Bell's experiments (series of outcomes)

2 citations · 3 across the 8 of their papers we have counts for

collaborators
Showing 2019Show all

2 papers · 1 filter

quant-ph2019

Randomness of imperfectly entangled states

Myriam Nonaka, Mónica Agüero, Marcelo Kovalsky +1

The generation of series of random numbers is an important and difficult problem. Appropriate measurements on entangled states have been proposed as the definitive solution, based…

physics.optics2019

Measuring algorithmic complexity in chaotic lasers

Marcelo G. Kovalsky, Monica B. Agüero, Carlos Bonazzola +1

Thanks to the simplicity and robustness of its calculation methods, algorithmic (or Kolmogorov) complexity appears as a useful tool to reveal chaotic dynamics when experimental tim…