Results 101 to 110 of about 30,531 (141)

MolGramTreeNet: A multimodal molecular property prediction model via grammar tree-constrained molecular representation. [PDF]

iScience
Zhang Y, Liu W, Zhao H, Shao J, Pandiyan S, Yao M, Ni K, Wang L.   +7 more
europepmc   +1 more source

Beyond Fiber: Toward Terahertz Bandwidth in Free-Space Optical Communication. [PDF]

Sensors (Basel)
Ullah R, Ullah S, Ren J, Alwageed HS, Mao Y, Qi Z, Wang F, Khan SA, Farooq U.   +8 more
europepmc   +1 more source

Optical fibre-based quantum random number generator: stochastic modelling and measurements. [PDF]

Sci Rep
Dudek M, Siudem G, Kwaśnik G, Żołnowski W, Życzkowski MT.   +4 more
europepmc   +1 more source

Myelin-Proteinoids Interactions in Neural Signaling. [PDF]

Langmuir
Mougkogiannis P, Adamatzky A.
europepmc   +1 more source

Dimensionality and dynamics for next-generation artificial neural networks. [PDF]

Patterns (N Y)
Wang G, Fan FL.
europepmc   +1 more source

Next-generation protocol design for blockchain rewards with web-tool. [PDF]

Sci Rep
Arshad MZ, Algarni A.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY

International Journal of Quantum Information, 2011
We show that the optimal rate of lossless quantum data compression is closely related to Berthiaume, van Dam and Laplante's quantum Kolmogorov complexity. We show that:• The expected quantum Kolmogorov complexity of a mixture is close to the optimal rate of lossless data compression of that mixture.• If quantum Kolmogorov complexity obeys some ...
Rogers, Caroline, Nagarajan, Rajagopal
openaire   +3 more sources

Quantum Observer, Information Theory and Kolmogorov Complexity

2013
The theory itself does not tell us which properties are sufficient for a system to count as a quantum mechanical observer. Thus, it remains an open problem to find a suitable language for characterizing observation. We propose an information-theoretic definition of observer, leading to a mathematical criterion of objectivity using the formalism of ...
A. Grinbaum
openaire   +2 more sources

Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement

IEEE Annual Symposium on Foundations of Computer Science, 2023
Only a handful candidates for computational assumptions that imply secure key-agreement protocols (KA) are known, and even fewer are believed to be quantum safe.
Marshall Ball, Yanyi Liu, N. Mazor, Rafael Pass   +3 more
semanticscholar   +1 more source