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

Navigating the Quantum Resource Landscape of Entropy Vector Space Using Machine Learning and Optimization

William Munizzi, Aman Mehta, Nothando Khumalo, Prineha Narang

Published Apr 3, 2026• 0 citations
Publisher

Abstract

Abstract We present a machine learning framework to study the dynamics of entropy vectors and quantum resources, including entanglement and magic, with a focus on violations of entropy inequalities. In particular, we investigate Ingleton’s inequality, which is satisfied by all stabilizer and holographic quantum states. We first prove that violation is impossible for pure states of five qubits or fewer, establishing six qubits as the minimal system size required to cross the Ingleton boundary. Using a reinforcement learning agent formulated as a Markov decision process, we identify quantum circuits that navigate entropy vector space to generate Ingleton-violating states. Complementing this approach with classical optimization, we construct large families of violating states with tunable degrees of violation and empirically determine the maximal attainable violation. Our analysis reveals a sharp resource transition: violation requires substantial total quantum magic but only modest non-local magic, and occurs in statistically rare, sharply-defined regions of Hilbert space. Together, these results establish a unified computational toolkit for probing entropy cone boundaries, tracking quantum resource evolution, and engineering circuits with controlled information-theoretic features.

DOI
10.21203/rs.3.rs-8971516/v1

Related papers

Navigating the Quantum Resource Landscape of Entropy Vector Space Using Machine Learning and Optimization

Nothando Khumalo, Aman Mehta, William Munizzi +1 more

We present a machine learning framework to study the dynamics of entropy vectors and quantum resources, including entanglement and magic, focusing on violations of entropy inequalities. Using a reinforcement learning agent formulated as a Markov decision process, we identify quantum circuits that optimally navigate the entropy vector space to generate violations of Ingleton's inequality. We complement this approach with a classical optimization algorithm to produce arbitrary numbers of Ingleton-violating states, with tunable degrees of violation, and empirically determine the maximal attainable violation for Ingleton's inequality. Our analysis reveals characteristic patterns of quantum resources that accompany Ingleton violation. A comprehensive statistical analysis shows that Ingleton-violating states occupy sharply-defined, isolated regions of the Hilbert space, and are extremely rare. Together, these results establish a unified computational toolkit for studying entropy vector dynamics, tracking quantum resource evolution, and engineering circuits with controlled information-theoretic features.

quant-pharXiv:2511.16724•Nov 24, 2025•3 citations

Learnable yet not simulable: a quantum resource theory of learning models

Xinbiao Wang, Yuxuan Du, Dacheng Tao

Quantum resource theory has sharpened our understanding of the intrinsic complexity of quantum systems, particularly their classical simulability. However, it remains unclear which quantum resource governs the classical learnability of quantum circuits, especially beyond the regime of efficient classical simulation. Here we close this knowledge gap by studying the expectation-value functions of families of tunable quantum circuits, with many applications in digital quantum simulation, quantum metrology, and quantum-system characterization. Specifically, we introduce a new resource measure, the dynamical stabilizer entropy (\DSE), which quantifies how broadly an expectation-value function is distributed across its frequency modes. By relating \DSE to operator stabilizer entropy, we establish a computational phase diagram that compares classical simulators with quantum-data-assisted classical surrogates. We first determine the \DSE-dependent learnability boundary of this diagram by deriving bounds on the sample complexity and runtime of classical surrogates, and by developing a \DSE-guided surrogate. We then complete the diagram by proving, under standard complexity-theoretic assumptions, the existence of circuit families that can be efficiently learned by this surrogate but cannot be efficiently emulated from their circuit descriptions alone. Numerical experiments on random and structured circuits with up to 80 qubits support the predicted \DSE-dependent computational landscape. These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning, motivate resource measures linking quantum resources to learnability, and guide the design of learning-based algorithms for scalable quantum systems beyond the reach of direct classical simulation.

quant-pharXiv:2608.02325•Aug 4, 2026•1 citation

Towards Entropic Constraints on Quantum Speedups

Jason Pollack, Dylan VanAllen

Some quantum algorithms have "quantum speedups": improved time complexity as compared with the best-known classical algorithms for solving the same tasks. Can we understand what fuels these speedups from an entropic perspective? Information theory gives us a multitude of metrics we might choose from to measure how fundamentally 'quantum' is the behavior of a quantum computer running an algorithm. The entanglement entropies for subsystems of a quantum state can be analyzed for subsystems of qubits in a quantum computer throughout the running of an algorithm. Here, a framework for making this entropic analysis is constructed, and performed on a selection of quantum circuits implementing known fast quantum algorithms and subroutines: Grover search, the quantum Fourier transform, and phase estimation. Our results are largely unsatisfactory: known entropy inequalities do not suffice to identify the presence or absence of quantum speedups. Although we know our algorithms must have quantum "magic", the Ingleton inequality, which holds for all entropies of subsystems of stabilizer states, is not violated in any of our examples. In some cases, however, monogamy of mutual information, which is obeyed for product states but violated for highly entangled bipartite states such as the $GHZ$ states, fails at some point in the course of our quantum circuits.

arXiv:2411.03439•Nov 5, 2024•1 citation

Learning to Build Quantum Kernels: A Reinforcement Learning Framework for Quantum SVC Optimization

Luigi , Giuseppe Buonaiuto, Lidia Marassi +4 more

Abstract This work introduces a novel hybrid quantum-classical machine learning framework in which a Reinforcement Learning (RL) agent autonomously constructs quantum circuits to optimize kernels for a Quantum Support Vector Classifier (QSVC). Unlike traditional approaches that rely on fixed or manually designed quantum feature maps, the proposed method employs a Deep Q-Network (DQN) agent to dynamically select quantum gates and their parameters. These configurations define a parameterized quantum circuit whose fidelity-based kernel is used to perform classification tasks. The RL agent is trained to maximize classification accuracy by interacting with an environment that evaluates circuit performance. Experiments conducted on a realistic and potentially biased educational dataset demonstrate that the RL-optimized QSVC outperforms both classical SVC and standard QSVC baselines in terms of accuracy and fairness. Furthermore, SHAP-based explainability analysis reveals a reduction in model bias, suggesting improved interpretability and robustness. This study highlights the potential of reinforcement learning for automated quantum circuit design and kernel optimization in quantum machine learning.

•Mar 4, 2026•0 citations

Exploring the holographic entropy cone via reinforcement learning

Temple He, Jaeha Lee, Hirosi Ooguri

We develop a reinforcement learning algorithm to study the holographic entropy cone. Given a target entropy vector, our algorithm searches for a graph realization whose min-cut entropies match the target vector. If the target vector does not admit such a graph realization, it must lie outside the cone, in which case the algorithm finds a graph whose corresponding entropy vector most nearly approximates the target and allows us to probe the location of the facets. For the $\sf N=3$ cone, we confirm that our algorithm successfully rediscovers monogamy of mutual information beginning with a target vector outside the holographic entropy cone. We then apply the algorithm to the $\sf N=6$ cone, analyzing the 6 "mystery" extreme rays of the subadditivity cone from arXiv:2412.15364 that satisfy all known holographic entropy inequalities yet lacked graph realizations. We found realizations for 3 of them, proving they are genuine extreme rays of the holographic entropy cone, while providing evidence that the remaining 3 are not realizable, implying unknown holographic inequalities exist for $\sf N=6$.

hep-thCross-listedarXiv:2601.19979•Journal of High Energy Physics•Jan 29, 2026•1 citation

Quantifying magic resource via quantum Jensen–Shannon divergence

Peihua Tian, Yuan Sun

Abstract Magic is a precious resource necessary for achieving universal fault-tolerant quantum computation. Therefore, it is of vital importance to study the detection and quantification of the magic resource encompassed in quantum states and quantum gates both theoretically and experimentally. In this work, we adopt the quantum Jensen–Shannon divergence to quantify the magic resource of quantum states and quantum gates. On the one hand, we determine the magic resource of a pure state as the minimal and average distance between this state and the set of pure stabilizer states via the quantum Jensen–Shannon divergence, respectively, and extend them to the general mixed states through the method of convex roof construction. We investigate the basic properties of these two magic quantifiers and utilize them to evaluate the magic resource for some typical qubit and qutrit states. By comparing the magic quantifier via the quantum Jensen–Shannon divergence with the min-relative entropy of magic and the stabilizer α-Rényi entropies, we find that the min-relative entropy of magic provides both an upper bound and a lower bound for the magic quantifier via the quantum Jensen-Shannon divergence, and the stabilizer α-Rényi entropies provide a series of lower bounds for the magic quantifier via the quantum Jensen–Shannon divergence. On the other hand, based on the magic quantifier via the quantum Jensen–Shannon divergence for quantum states, we further propose two quantifiers for the magic-resource-generating power of quantum gates and demonstrate that the T-gate is the optimal diagonal unitary gate in creating magic resource for both qubit and qutrit systems in the sense of Clifford equivalence.

Journal of Physics A Mathematical and Theoretical•Dec 3, 2024•7 citations
Abstract We present a machine learning framework to study the dynamics of entropy vectors and quantum resources, including entanglement and magic, with a focus on violations of entropy inequalities. In particular, we investigate Ingleton’s inequality, which is satisfied by all stabilizer and holographic quantum states. We first prove that violation is impossible for pure states of five qubits or fewer, establishing six qubits as the minimal system size required to cross the Ingleton boundary. Using a reinforcement learning agent formulated as a Markov decision process, we identify quantum circuits that navigate entropy vector space to generate Ingleton-violating states. Complementing this approach with classical optimization, we construct large families of violating states with tunable degrees of violation and empirically determine the maximal attainable violation. Our analysis reveals a sharp resource transition: violation requires substantial total quantum magic but only modest non-local magic, and occurs in statistically rare, sharply-defined regions of Hilbert space. Together, these results establish a unified computational toolkit for probing entropy cone boundaries, tracking quantum resource evolution, and engineering circuits with controlled information-theoretic features.
We present a machine learning framework to study the dynamics of entropy vectors and quantum resources, including entanglement and magic, focusing on violations of entropy inequalities. Using a reinforcement learning agent formulated as a Markov decision process, we identify quantum circuits that optimally navigate the entropy vector space to generate violations of Ingleton's inequality. We complement this approach with a classical optimization algorithm to produce arbitrary numbers of Ingleton-violating states, with tunable degrees of violation, and empirically determine the maximal attainable violation for Ingleton's inequality. Our analysis reveals characteristic patterns of quantum resources that accompany Ingleton violation. A comprehensive statistical analysis shows that Ingleton-violating states occupy sharply-defined, isolated regions of the Hilbert space, and are extremely rare. Together, these results establish a unified computational toolkit for studying entropy vector dynamics, tracking quantum resource evolution, and engineering circuits with controlled information-theoretic features.
Quantum resource theory has sharpened our understanding of the intrinsic complexity of quantum systems, particularly their classical simulability. However, it remains unclear which quantum resource governs the classical learnability of quantum circuits, especially beyond the regime of efficient classical simulation. Here we close this knowledge gap by studying the expectation-value functions of families of tunable quantum circuits, with many applications in digital quantum simulation, quantum metrology, and quantum-system characterization. Specifically, we introduce a new resource measure, the dynamical stabilizer entropy (\DSE), which quantifies how broadly an expectation-value function is distributed across its frequency modes. By relating \DSE to operator stabilizer entropy, we establish a computational phase diagram that compares classical simulators with quantum-data-assisted classical surrogates. We first determine the \DSE-dependent learnability boundary of this diagram by deriving bounds on the sample complexity and runtime of classical surrogates, and by developing a \DSE-guided surrogate. We then complete the diagram by proving, under standard complexity-theoretic assumptions, the existence of circuit families that can be efficiently learned by this surrogate but cannot be efficiently emulated from their circuit descriptions alone. Numerical experiments on random and structured circuits with up to 80 qubits support the predicted \DSE-dependent computational landscape. These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning, motivate resource measures linking quantum resources to learnability, and guide the design of learning-based algorithms for scalable quantum systems beyond the reach of direct classical simulation.
Some quantum algorithms have "quantum speedups": improved time complexity as compared with the best-known classical algorithms for solving the same tasks. Can we understand what fuels these speedups from an entropic perspective? Information theory gives us a multitude of metrics we might choose from to measure how fundamentally 'quantum' is the behavior of a quantum computer running an algorithm. The entanglement entropies for subsystems of a quantum state can be analyzed for subsystems of qubits in a quantum computer throughout the running of an algorithm. Here, a framework for making this entropic analysis is constructed, and performed on a selection of quantum circuits implementing known fast quantum algorithms and subroutines: Grover search, the quantum Fourier transform, and phase estimation. Our results are largely unsatisfactory: known entropy inequalities do not suffice to identify the presence or absence of quantum speedups. Although we know our algorithms must have quantum "magic", the Ingleton inequality, which holds for all entropies of subsystems of stabilizer states, is not violated in any of our examples. In some cases, however, monogamy of mutual information, which is obeyed for product states but violated for highly entangled bipartite states such as the GHZGHZGHZ states, fails at some point in the course of our quantum circuits.
Abstract This work introduces a novel hybrid quantum-classical machine learning framework in which a Reinforcement Learning (RL) agent autonomously constructs quantum circuits to optimize kernels for a Quantum Support Vector Classifier (QSVC). Unlike traditional approaches that rely on fixed or manually designed quantum feature maps, the proposed method employs a Deep Q-Network (DQN) agent to dynamically select quantum gates and their parameters. These configurations define a parameterized quantum circuit whose fidelity-based kernel is used to perform classification tasks. The RL agent is trained to maximize classification accuracy by interacting with an environment that evaluates circuit performance. Experiments conducted on a realistic and potentially biased educational dataset demonstrate that the RL-optimized QSVC outperforms both classical SVC and standard QSVC baselines in terms of accuracy and fairness. Furthermore, SHAP-based explainability analysis reveals a reduction in model bias, suggesting improved interpretability and robustness. This study highlights the potential of reinforcement learning for automated quantum circuit design and kernel optimization in quantum machine learning.
We develop a reinforcement learning algorithm to study the holographic entropy cone. Given a target entropy vector, our algorithm searches for a graph realization whose min-cut entropies match the target vector. If the target vector does not admit such a graph realization, it must lie outside the cone, in which case the algorithm finds a graph whose corresponding entropy vector most nearly approximates the target and allows us to probe the location of the facets. For the N=3\sf N=3N=3 cone, we confirm that our algorithm successfully rediscovers monogamy of mutual information beginning with a target vector outside the holographic entropy cone. We then apply the algorithm to the N=6\sf N=6N=6 cone, analyzing the 6 "mystery" extreme rays of the subadditivity cone from arXiv:2412.15364 that satisfy all known holographic entropy inequalities yet lacked graph realizations. We found realizations for 3 of them, proving they are genuine extreme rays of the holographic entropy cone, while providing evidence that the remaining 3 are not realizable, implying unknown holographic inequalities exist for N=6\sf N=6N=6.
Abstract Magic is a precious resource necessary for achieving universal fault-tolerant quantum computation. Therefore, it is of vital importance to study the detection and quantification of the magic resource encompassed in quantum states and quantum gates both theoretically and experimentally. In this work, we adopt the quantum Jensen–Shannon divergence to quantify the magic resource of quantum states and quantum gates. On the one hand, we determine the magic resource of a pure state as the minimal and average distance between this state and the set of pure stabilizer states via the quantum Jensen–Shannon divergence, respectively, and extend them to the general mixed states through the method of convex roof construction. We investigate the basic properties of these two magic quantifiers and utilize them to evaluate the magic resource for some typical qubit and qutrit states. By comparing the magic quantifier via the quantum Jensen–Shannon divergence with the min-relative entropy of magic and the stabilizer α-Rényi entropies, we find that the min-relative entropy of magic provides both an upper bound and a lower bound for the magic quantifier via the quantum Jensen-Shannon divergence, and the stabilizer α-Rényi entropies provide a series of lower bounds for the magic quantifier via the quantum Jensen–Shannon divergence. On the other hand, based on the magic quantifier via the quantum Jensen–Shannon divergence for quantum states, we further propose two quantifiers for the magic-resource-generating power of quantum gates and demonstrate that the T-gate is the optimal diagonal unitary gate in creating magic resource for both qubit and qutrit systems in the sense of Clifford equivalence.