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.
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.
This paper explores the application of information theory to analyze the computational complexity of quantum algorithms. Traditional approaches to complexity analysis often rely on circuit models and gate complexity, which can be insufficient for fully characterizing the resource requirements of quantum computation. We propose utilizing information-theoretic concepts, specifically quantum entropy and mutual information, to provide a more nuanced understanding of how quantum circuits process information. This approach allows us to quantify the information-theoretic limits of quantum algorithms, providing insights into the number of qubits and gates necessary for efficient execution. We examine several key aspects, including the role of entanglement, the impact of measurement, and the relationship between quantum entropy and algorithmic complexity. The goal is to establish a framework for assessing quantum algorithms based on their fundamental information-processing capabilities, moving beyond purely circuit-based evaluations. This work contributes to a deeper theoretical understanding of quantum computation and its potential limitations.
Run-times of quantum algorithms are often studied via an asymptotic, worst-case analysis. Whilst useful, such a comparison can often fall short: it is not uncommon for algorithms with a large worst-case run-time to end up performing well on instances of practical interest. To remedy this it is necessary to resort to run-time analyses of a more empirical nature, which for sufficiently small input sizes can be performed on a quantum device or a simulation thereof. For larger input sizes, alternative approaches are required.In this paper we consider an approach that combines classical emulation with detailed complexity bounds that include all constants. We simulate quantum algorithms by running classical versions of the sub-routines, whilst simultaneously collecting information about what the run-time of the quantum routine would have been if it were run instead. To do this accurately and efficiently for very large input sizes, we describe an estimation procedure and prove that it obtains upper bounds on the true expected complexity of the quantum algorithms.We apply our method to some simple quantum speedups of classical heuristic algorithms for solving the well-studied MAX- k -SAT optimization problem. This requires rigorous bounds (including all constants) on the expected- and worst-case complexities of two important quantum sub-routines: Grover search with an unknown number of marked items, and quantum maximum-finding. These improve upon existing results and might be of broader interest.Amongst other results, we found that the classical heuristic algorithms we studied did not offer significant quantum speedups despite the existence of a theoretical per-step speedup. This suggests that an empirical analysis such as the one we implement in this paper already yields insights beyond those that can be seen by an asymptotic analysis alone.
Entanglement is generally accepted as the resource that allows quantum systems to be more efficient in performing classical computation, but the practical utility of entanglement in a variety of quantum information-processing processes is inadequately comprehended. The following paper examines the operational importance, constraints, and trade-offs of entanglement in quantum algorithms, communication protocols, error-correction frameworks and complexity-theoretic settings. Though entanglement (between two or more systems) is a requirement of uniquely quantum behaviours: teleportation, superdense coding, and non-classical correlations, we have found that a larger entanglement does not necessarily improve algorithmic performance. We find through analytical modelling, small-circuit entropy analysis, and comparative analysis of representative use-cases, an optimum entanglement zone, at which performance gains cease to improve with noise, gate infidelity, circuit-depth and hardware decoherence. It has also been found that moderate, noise-resilient entanglement is most useful in algorithmic tasks, structural connectivity is essential in communication tasks, and that quantum error-correction needs highly stable, topology-optimised entangled states rather than maximally entangled states. In addition, resource-theory views indicate conflicts between entanglement entropy, gate cost and classical stimulability thresholds and point to the importance of designing entanglement-efficiently. The paper identifies multiparty entanglement as the bottleneck to scalable quantum advantage, especially with the constraints in NISQ era. Comprehensively, this paper has provided a single analytical framework explaining when, where and how entanglement has real computational benefit. The analysis argues the development of algorithms and hardware in a so-called just-enough entanglement paradigm, to optimise fidelity, limit the effects of noise, and have scalable quantum architectures.
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.
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.
Quantum information theory has provided the formal framework for describing how information is stored, transmitted, and transformed in physical quantum systems [6, 7, 9]. Its entropic formulations underpin our understanding of quantum computation, communication, and cryptography. Yet this theory traditionally treats all quantum operations as freely available, ignoring computational restrictions. In practice, however, any manipulation of quantum information must be performed by devices of bounded complexity and runtime. Capturing such realistic constraints requires extending quantum information theory to include computational efficiency as a fundamental component.This work takes a first step toward building a computational version of quantum information theory, one that treats efficiency as part of the theory itself. The goal is to understand how the behavior of quantum information changes when the parties involved can only perform computationally efficient operations. This approach bridges the abstract, ideal setting of quantum information theory with the practical limitations of real quantum devices, offering a means to study information processing under realistic resource constraints.At the center of this work are two new quantities: the quantum computational min-entropy and the quantum computational max-entropy. These entropies extend standard quantum entropies by explicitly limiting the computational power of the observer or adversary. The quantum computational min-entropy captures how unpredictable a quantum system A remains to an observer holding system B, when that observer is restricted to quantum circuits of bounded size. Formally, for a bipartite state rho AB, we define(c) H-s (min)(A|B)rho := - log d(A) max (epsilon s) B > A' F ((parallel to(A)circle times epsilon(s))(rho(AB)),|Phi (AA')> Quantum information theory; Theory of computation -> Quantum complexity theory