Results 21 to 30 of about 30,531 (141)
Estimating Algorithmic Information Using Quantum Computing for Genomics Applications
Applied Sciences, 2021 Inferring algorithmic structure in data is essential for discovering causal generative models. In this research, we present a quantum computing framework using the circuit model, for estimating algorithmic information metrics.
Aritra Sarkar, Zaid Al-Ars, Koen Bertels
doaj +1 more source
Biophotons and Emergence of Quantum Coherence—A Diffusion Entropy Analysis
Entropy, 2021 We study the emission of photons from germinating seeds using an experimental technique designed to detect light of extremely small intensity. We analyze the dark count signal without germinating seeds as well as the photon emission during the ...
Maurizio Benfatto +11 more
doaj +1 more source
Probing chaos in the spherical p-spin glass model
SciPost Physics, 2023 We study the dynamics of a quantum $p$-spin glass model starting from initial states defined in microcanonical shells, in a classical regime. We compute different chaos estimators, such as the Lyapunov exponent and the Kolmogorov-Sinai entropy, and find ...
Lorenzo Correale, Anatoli Polkovnikov, Marco Schirò, Alessandro Silva
doaj +1 more source
Unpredictability and entanglement in open quantum systems
New Journal of Physics, 2023 We investigate dynamical many-body systems capable of universal computation, which leads to their properties being unpredictable unless the dynamics is simulated from the beginning to the end.
Javad Kazemi, Hendrik Weimer
doaj +1 more source
Quantum complexity and the virial theorem
Journal of High Energy Physics, 2018 It is conjectured that in the geometric formulation of quantum computing, one can study quantum complexity through classical entropy of statistical ensembles established non-relativistically in the group manifold of unitary operators.
Ning Bao, Junyu Liu
doaj +1 more source
Quantum Dynamical Entropies and Gács Algorithmic Entropy
Entropy, 2012 Several quantum dynamical entropies have been proposed that extend the classical Kolmogorov–Sinai (dynamical) entropy. The same scenario appears in relation to the extension of algorithmic complexity theory to the quantum realm.
Fabio Benatti
doaj +1 more source
Kolmogorov complexity of sequences of random numbers generated in Bell's experiments [PDF]
Physical Review A, 2018 Quantum systems are the ultimate touchstone for the production of random sequences of numbers. Spatially spread entangled systems allow the generation of identical random sequences in remote locations.
M. Kovalsky, A. Hnilo, M'onica B. Aguero
semanticscholar +1 more source
On Kolmogorov Complexity of Unitary Transformations in Quantum Computing
i-manager’s Journal on Mathematics, 2022 We introduce a notion of Kolmogorov complexity of unitary transformation, which can (roughly) be understood as the least possible amount of information required to fully describe and reconstruct a given finite unitary transformation. In the context of quantum computing, it corresponds to the least possible amount of data to define and describe a ...
openaire +2 more sources
Probing the quantum–classical boundary with compression software
New Journal of Physics, 2016 We adapt an algorithmic approach to the problem of local realism in a bipartite scenario. We assume that local outcomes are simulated by spatially separated universal Turing machines.
Hou Shun Poh +5 more
doaj +1 more source
Area laws and efficient descriptions of quantum many-body states
New Journal of Physics, 2016 It is commonly believed that area laws for entanglement entropies imply that a quantum many-body state can be faithfully represented by efficient tensor network states—a conjecture frequently stated in the context of numerical simulations and analytical ...
Yimin Ge, Jens Eisert
doaj +1 more source