Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

LDI Universality

John Taylor

Published Mar 15, 2026• 0 citations
Publisher

Abstract

We prove that the Local Divergence Intensity (LDI) framework detects structure in any or-dered symbolic sequence, independent of physical substrate. The universality follows from a sin-gle observation: the algorithm operates on flattened sequences, where all domain-specific tensorstructure is erased. Two examples—quantum many-body scars and protein sequences—illustratethat identical code, differing only in tensor shape, detects fundamentally different physical phe-nomena through the same geometric signature. We then establish that the Tree of ContinuaC = {0, 1}A serves as the universal receiver for all physical measurement: every quantum exper-iment terminates in bit strings, and bit strings live in C.

DOI
10.5281/zenodo.19034271

Related papers

Computational Detection of Quantum Many-Body Scars: Local Divergence Intensity Analysis of the Semeghini 51-Atom Experiment II

John Taylor

We present a computational replication of quantum many-body scars observed by Semeghini et al. (2021) using Local Divergence Intensity (LDI) analysis—a measure based on information as distinguishability. Quantum scars violate the Eigenstate Thermalization Hypothesis, representing special eigenstates that support persistent periodic revivals in quantum many-body systems. Using information coordination on uncountable symbolic spaces, we demonstrate that scar states exhibit arithmetic divisor structure with revival period $\pi$ microseconds. Cross-LDI analysis reveals scale-dependent coordination minima at integer multiples of the fundamental period, confirming quantum periodicity over 15+ revival cycles with minimal damping. This confirms that quantum periodic systems display measurable arithmetic structure distinguishable from both thermalizing systems and scale-invariant quantum entanglement, detectable through information-theoretic measures on classical measurement outcomes.

•Nov 21, 2025•0 citations

Information Coordination Analysis of Quantum Measurement Outcomes: A Simulation Study

Taylor, John

We explore whether quantum entanglement might be detectable through information-theoretic coordination patterns in measurement outcomes alone, without requiringquantum states, density matrices, or Hilbert space structure. Using Local DivergenceIntensity (LDI), a universal measure of symbolic sequence decorrelation [6], we ana-lyze three types of simulated quantum measurements: (1) Bell states (simulated per-fect correlation), (2) product states (simulated independence), and (3) quantum walks(simulated structured dynamics).In simplified probabilistic simulations that approximate expected quantum mea-surement statistics, we observe 95% separation between correlated and independentbitstrings (∆Φ = 0.953) with 2% added noise. The framework operates on discrete bi-nary sequences and reveals different scale-dependence patterns for different correlationtypes.This conceptual study suggests LDI analysis of measurement sequences could po-tentially complement traditional quantum information measures, but experimental val-idation on real quantum hardware is required before any claims about detecting actualquantum entanglement can be made.

•Nov 6, 2025•0 citations

Information Coordination Analysis of Quantum Measurement Outcomes: A Simulation Study

Taylor, John

We explore whether quantum entanglement might be detectable through information-theoretic coordination patterns in measurement outcomes alone, without requiring quantum states, density matrices, or Hilbert space structure. Using Local Divergence Intensity (LDI), a universal measure of symbolic sequence decorrelation we analyze three types of simulated quantum measurements: (1) Bell states (simulated perfect correlation), (2) product states (simulated independence), and (3) quantum walks (simulated structured dynamics).

•Nov 6, 2025•0 citations

Quantum Collapse and Computation in an Everett Multiverse

Fabrizio Tamburini, Ignazio Francesco Licata

The mathematical representation of the universe consists of sequences of symbols, rules and operators containing Gödel's undecidable propositions: information and its manipulation, also with Turing Machines. Classical information theory and mathematics, ideally independent from the medium used, can be interpreted realistically and objectively from their correspondence with quantum information, which is physical. Each representation of the universe and its evolution are, in any case, physical subsets of the universe, structured sets of observers and their complements in the universe made with spacetime events generated by local quantum measurements. Their description becomes a semantically closed structure without a global object-environment loss of decoherence as a von Neumann's universal constructor with a semantical abstract whose structure cannot be decided deterministically a priori from an internal observer. In a semantically closed structure, the realization of a specific event that writes the semantical abstract of the constructor is a problem of finding "which way" for the evolution of the universe as a choice of the constructor's state in a metastructure, like the many-world Everett scenario, from a specific result of any quantum measurement, corresponding to a Gödel undecidable proposition for an internal observer.

arXiv:2401.13336•Entropy•Dec 9, 2024•1 citation

Decoding Protein Sequences as a 'Quantum Language'… Demonstration of a QNLP-Based Classification Pipeline

inquantio

A study published on bioRxiv demonstrates for the first time the technique of treating protein sequences like sentences in natural language processing (NLP) and parsing them into parameterized quantum circuits using the Quantum Natural Language (QNLP) framework. It establishes a scheme that converts protein sequences into tensor networks represented by wires and boxes, and maps them onto actual quantum circuits through semantic functors. By generating protein syntax trees with a neural network-based parser and converting them into string diagrams optimized for quantum processor execution, the study proves that 'Quantum Tensor Networks (QTN)' achieve overwhelming computational accuracy in classifying vast protein sequences. [Quantum Biology Society] An innovative approach has been proposed to decode protein sequences—the most fundamental and complex codes of living organisms—by converting them into a natural language that quantum computers can comprehend. The paper titled "Application of Quantum Tensor Networks for Protein Classification", published in the preprint repository bioRxiv, introduces a groundbreaking pipeline that applies Quantum Natural Language Processing (QNLP) technology to protein sequence classification, opening a new horizon for next-generation bioinformatics. A research team from Pennsylvania State University, including Debarshi Kundu, Jian Wang, Archisman Ghosh, and Nikolay Dokholyan, led this innovative study. ■ QNLP: Reading Protein Sequences as Sentences The researchers introduced a unique perspective of treating protein sequences, which are arrays of amino acids, as if they were sentences composed in human language. To achieve this, they adopted the 'Quantum Natural Language (QNLP)' framework, which combines state-of-the-art computational natural language processing (NLP) techniques with quantum computing. Within this framework, protein sequences are parsed into syntax trees with grammatical structures through a neural network-based parser, laying the foundation for their direct conversion into parameterized quantum circuits. ■ Transformation into Tensor Networks and String Diagrams In this process, protein sequences are converted into a tensor network scheme, geometrically represented by wires and boxes. The researchers defined a sophisticated semantic function (functor) that perfectly maps this abstract network to the operational structure of actual quantum circuits. The generated syntax trees are ultimately transformed into string diagrams, a format optimized for execution on quantum processors. Consequently, the constructed Quantum Tensor Networks (QTN) demonstrated overwhelming computational accuracy in machine learning tasks that involve extracting features and functionally classifying highly diverse and complex protein sequences, even in environments with a limited number of available qubits. This demonstration is highly significant as it establishes a powerful workflow in drug discovery and biotechnology, enabling rapid and accurate analysis of massive genomic data and protein interaction structures through quantum algorithms, transcending the limits of conventional classical computers. #QuantumTensorNetworks #QNLP #ProteinClassification #QuantumMachineLearning #QuantumLanguageModel #ProteinSequenceAnalysis #QuantumBiology #Biophysics #ArtificialIntelligence #KoreanQuantumBiologySociety https://www.biorxiv.org/content/10.1101/2024.03.11.584501v1

•Jul 10, 2026•0 citations

Probing universality with entanglement entropy via quantum Monte Carlo

Bohdan Kulchytskyy

Our understanding of physical phenomena hinges on finding universal core mechanisms that unite them. The concept of universality is deeply ingrained in the study of quantum many-body systems. At zero temperature, microscopically different systems with long-range order collapse into their universal state described by a handful of universal parameters. Establishing those parameters implies identification of the universal theory that is effectively describing the system and ultimately providing the desired understanding. We take up this task with the help of Renyi entanglement entropy. Defined with respect to a system bipartition, this measure quantifies information shared between the subsystems. Understanding what insights into universality are encoded within this information-theoretic quantity as well as developing numerical tools to efficiently estimate the Renyi entanglement entropy are the subjects of this thesis. \n \nOn the computational end of this far-reaching goal, we develop a novel theoretical framework for constructing improved Renyi entanglement entropy estimators in the context of d+1 quantum Monte Carlo methods. The discovery of a connection of this methodology to the well-established Kandel-Domany formalism provides a clear path towards generalization. Additionally, we embrace a data-driven approach towards learning the ground state wavefunction. We demonstrate how a restricted Boltzmann machine can be used to reconstruct the Renyi entanglement entropy from projective measurements of a quantum ground state. Furthermore, we extend this classical generative architecture to a quantum analogue that we call the quantum Boltzmann machine. \n \nOn the theoretical side of this endeavour, we study the Renyi entanglement entropy scaling terms for two quantum lattice models embedded in two dimensional space via extensive quantum Monte Carlo simulations. For the ground state of the XY model, we provide conclusive numerical evidence for a logarithmic contribution that uniquely characterizes the continuous symmetry of the emerging order parameter. Moreover, we confirm the form of the subleading universal geometric contribution arising due to the bosonic nature of low-energy degrees of freedom in this model. For the critical ground state of the transverse field Ising model, we develop a novel scaling procedure to extract a universal number κ revealed via a cylindrical entangling bipartition in the thin-slice limit. The combined product of our work sheds new light on the entanglement-based classification of universality and brings a suite of new powerful numerical tools to continue illuminating this theoretical program in the future.

•Aug 30, 2019•9 citations
We prove that the Local Divergence Intensity (LDI) framework detects structure in any or-dered symbolic sequence, independent of physical substrate. The universality follows from a sin-gle observation: the algorithm operates on flattened sequences, where all domain-specific tensorstructure is erased. Two examples—quantum many-body scars and protein sequences—illustratethat identical code, differing only in tensor shape, detects fundamentally different physical phe-nomena through the same geometric signature. We then establish that the Tree of ContinuaC = {0, 1}A serves as the universal receiver for all physical measurement: every quantum exper-iment terminates in bit strings, and bit strings live in C.
We present a computational replication of quantum many-body scars observed by Semeghini et al. (2021) using Local Divergence Intensity (LDI) analysis—a measure based on information as distinguishability. Quantum scars violate the Eigenstate Thermalization Hypothesis, representing special eigenstates that support persistent periodic revivals in quantum many-body systems. Using information coordination on uncountable symbolic spaces, we demonstrate that scar states exhibit arithmetic divisor structure with revival period π\piπ microseconds. Cross-LDI analysis reveals scale-dependent coordination minima at integer multiples of the fundamental period, confirming quantum periodicity over 15+ revival cycles with minimal damping. This confirms that quantum periodic systems display measurable arithmetic structure distinguishable from both thermalizing systems and scale-invariant quantum entanglement, detectable through information-theoretic measures on classical measurement outcomes.
We explore whether quantum entanglement might be detectable through information-theoretic coordination patterns in measurement outcomes alone, without requiringquantum states, density matrices, or Hilbert space structure. Using Local DivergenceIntensity (LDI), a universal measure of symbolic sequence decorrelation [6], we ana-lyze three types of simulated quantum measurements: (1) Bell states (simulated per-fect correlation), (2) product states (simulated independence), and (3) quantum walks(simulated structured dynamics).In simplified probabilistic simulations that approximate expected quantum mea-surement statistics, we observe 95% separation between correlated and independentbitstrings (∆Φ = 0.953) with 2% added noise. The framework operates on discrete bi-nary sequences and reveals different scale-dependence patterns for different correlationtypes.This conceptual study suggests LDI analysis of measurement sequences could po-tentially complement traditional quantum information measures, but experimental val-idation on real quantum hardware is required before any claims about detecting actualquantum entanglement can be made.
We explore whether quantum entanglement might be detectable through information-theoretic coordination patterns in measurement outcomes alone, without requiring quantum states, density matrices, or Hilbert space structure. Using Local Divergence Intensity (LDI), a universal measure of symbolic sequence decorrelation we analyze three types of simulated quantum measurements: (1) Bell states (simulated perfect correlation), (2) product states (simulated independence), and (3) quantum walks (simulated structured dynamics).
The mathematical representation of the universe consists of sequences of symbols, rules and operators containing Gödel's undecidable propositions: information and its manipulation, also with Turing Machines. Classical information theory and mathematics, ideally independent from the medium used, can be interpreted realistically and objectively from their correspondence with quantum information, which is physical. Each representation of the universe and its evolution are, in any case, physical subsets of the universe, structured sets of observers and their complements in the universe made with spacetime events generated by local quantum measurements. Their description becomes a semantically closed structure without a global object-environment loss of decoherence as a von Neumann's universal constructor with a semantical abstract whose structure cannot be decided deterministically a priori from an internal observer. In a semantically closed structure, the realization of a specific event that writes the semantical abstract of the constructor is a problem of finding "which way" for the evolution of the universe as a choice of the constructor's state in a metastructure, like the many-world Everett scenario, from a specific result of any quantum measurement, corresponding to a Gödel undecidable proposition for an internal observer.
A study published on bioRxiv demonstrates for the first time the technique of treating protein sequences like sentences in natural language processing (NLP) and parsing them into parameterized quantum circuits using the Quantum Natural Language (QNLP) framework. It establishes a scheme that converts protein sequences into tensor networks represented by wires and boxes, and maps them onto actual quantum circuits through semantic functors. By generating protein syntax trees with a neural network-based parser and converting them into string diagrams optimized for quantum processor execution, the study proves that 'Quantum Tensor Networks (QTN)' achieve overwhelming computational accuracy in classifying vast protein sequences. [Quantum Biology Society] An innovative approach has been proposed to decode protein sequences—the most fundamental and complex codes of living organisms—by converting them into a natural language that quantum computers can comprehend. The paper titled "Application of Quantum Tensor Networks for Protein Classification", published in the preprint repository bioRxiv, introduces a groundbreaking pipeline that applies Quantum Natural Language Processing (QNLP) technology to protein sequence classification, opening a new horizon for next-generation bioinformatics. A research team from Pennsylvania State University, including Debarshi Kundu, Jian Wang, Archisman Ghosh, and Nikolay Dokholyan, led this innovative study. ■ QNLP: Reading Protein Sequences as Sentences The researchers introduced a unique perspective of treating protein sequences, which are arrays of amino acids, as if they were sentences composed in human language. To achieve this, they adopted the 'Quantum Natural Language (QNLP)' framework, which combines state-of-the-art computational natural language processing (NLP) techniques with quantum computing. Within this framework, protein sequences are parsed into syntax trees with grammatical structures through a neural network-based parser, laying the foundation for their direct conversion into parameterized quantum circuits. ■ Transformation into Tensor Networks and String Diagrams In this process, protein sequences are converted into a tensor network scheme, geometrically represented by wires and boxes. The researchers defined a sophisticated semantic function (functor) that perfectly maps this abstract network to the operational structure of actual quantum circuits. The generated syntax trees are ultimately transformed into string diagrams, a format optimized for execution on quantum processors. Consequently, the constructed Quantum Tensor Networks (QTN) demonstrated overwhelming computational accuracy in machine learning tasks that involve extracting features and functionally classifying highly diverse and complex protein sequences, even in environments with a limited number of available qubits. This demonstration is highly significant as it establishes a powerful workflow in drug discovery and biotechnology, enabling rapid and accurate analysis of massive genomic data and protein interaction structures through quantum algorithms, transcending the limits of conventional classical computers. #QuantumTensorNetworks #QNLP #ProteinClassification #QuantumMachineLearning #QuantumLanguageModel #ProteinSequenceAnalysis #QuantumBiology #Biophysics #ArtificialIntelligence #KoreanQuantumBiologySociety https://www.biorxiv.org/content/10.1101/2024.03.11.584501v1
Our understanding of physical phenomena hinges on finding universal core mechanisms that unite them. The concept of universality is deeply ingrained in the study of quantum many-body systems. At zero temperature, microscopically different systems with long-range order collapse into their universal state described by a handful of universal parameters. Establishing those parameters implies identification of the universal theory that is effectively describing the system and ultimately providing the desired understanding. We take up this task with the help of Renyi entanglement entropy. Defined with respect to a system bipartition, this measure quantifies information shared between the subsystems. Understanding what insights into universality are encoded within this information-theoretic quantity as well as developing numerical tools to efficiently estimate the Renyi entanglement entropy are the subjects of this thesis. \n \nOn the computational end of this far-reaching goal, we develop a novel theoretical framework for constructing improved Renyi entanglement entropy estimators in the context of d+1 quantum Monte Carlo methods. The discovery of a connection of this methodology to the well-established Kandel-Domany formalism provides a clear path towards generalization. Additionally, we embrace a data-driven approach towards learning the ground state wavefunction. We demonstrate how a restricted Boltzmann machine can be used to reconstruct the Renyi entanglement entropy from projective measurements of a quantum ground state. Furthermore, we extend this classical generative architecture to a quantum analogue that we call the quantum Boltzmann machine. \n \nOn the theoretical side of this endeavour, we study the Renyi entanglement entropy scaling terms for two quantum lattice models embedded in two dimensional space via extensive quantum Monte Carlo simulations. For the ground state of the XY model, we provide conclusive numerical evidence for a logarithmic contribution that uniquely characterizes the continuous symmetry of the emerging order parameter. Moreover, we confirm the form of the subleading universal geometric contribution arising due to the bosonic nature of low-energy degrees of freedom in this model. For the critical ground state of the transverse field Ising model, we develop a novel scaling procedure to extract a universal number κ revealed via a cylindrical entangling bipartition in the thin-slice limit. The combined product of our work sheds new light on the entanglement-based classification of universality and brings a suite of new powerful numerical tools to continue illuminating this theoretical program in the future.