arXiv:2506.14068 · Leibniz international proceedings in informatics

Fully Quantum Computational Entropies

Avidan, Noam, Thomas A. Hahn, Joseph M. Renes, Rotem Arnon-Friedman

Published Jun 16, 2025• 0 citations

Abstract

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

DOI: 10.3929/ethz-c-000800619

Related papers

Accessible Quantum Correlations Under Complexity Constraints

Álvaro Yángüez, Noam Avidan, Jan Kochanowski +1 more

Quantum systems may contain underlying correlations which are inaccessible to computationally bounded observers. We capture this distinction through a framework that analyses bipartite states only using efficiently implementable quantum channels. This leads to a complexity-constrained max-divergence and a corresponding computational min-entropy. The latter quantity recovers the standard operational meaning of the conditional min-entropy: in the fully quantum case, it quantifies the largest overlap with a maximally entangled state attainable via efficient operations on the conditional subsystem. For classical-quantum states, it further reduces to the optimal guessing probability of a computationally bounded observer with access to side information. Lastly, in the absence of side information, the computational min-entropy simplifies to a computational notion of the operator norm. We then establish strong separations between the information-theoretic and complexity-constrained notions of min-entropy. For pure states, there exist highly entangled families of states with extremal min-entropy whose efficiently accessible entanglement in terms of computational min-entropy is exponentially suppressed. For mixed states, the separation is even sharper: the information-theoretic conditional min-entropy can be highly negative while the complexity-constrained quantity remains nearly maximal. Under the cryptographic Learning with Errors hardness assumption, we construct efficiently preparable states exhibiting both separations, even when their preparation circuits are fully known. Overall, our results demonstrate that computational constraints can fundamentally limit the quantum correlations that are observable in practice.

quant-pharXiv:2604.15540Apr 20, 20260 citations

Quantum Computational Unpredictability Entropy and Quantum Leakage Resilience

Noam Avidan, Rotem Arnon-Friedman

Computational entropies provide a framework for quantifying uncertainty and randomness under computational constraints. They play a central role in classical cryptography, underpinning the analysis and construction of primitives such as pseudo-random generators, leakage-resilient cryptography, and randomness extractors. However, in the quantum setting, computational analogs of entropy remain largely unexplored. In this work, we initiate the study of quantum computational entropy by definingquantum computational unpredictability entropy, a natural generalization of classical unpredictability entropy to the quantum setting. Our definition builds on the operational interpretation of quantum min-entropy as the optimal guessing probability, while restricting the adversary to efficient guessing strategies. We prove that this entropy satisfies several fundamental properties, including a leakage chain rule that holds even in the presence of unbounded prior quantum side-information. We also show that unpredictability entropy enables pseudo-randomness extraction against quantum adversaries with bounded computational power. Together, these results lay a foundation for developing cryptographic tools that rely on min-entropy in the quantum computational setting.

arXiv:2505.13710IEEE Transactions on Information TheoryJan 28, 20261 citation

Accessible Quantum Correlations Under Complexity Constraints

Álvaro Yángüez, Noam Avidan, Jan Kochanowski +1 more

Quantum systems may contain underlying correlations which are inaccessible to computationally bounded observers. We capture this distinction through a framework that analyses bipartite states only using efficiently implementable quantum channels. This leads to a complexity-constrained max-divergence and a corresponding computational min-entropy. The latter quantity recovers the standard operational meaning of the conditional min-entropy: in the fully quantum case, it quantifies the largest overlap with a maximally entangled state attainable via efficient operations on the conditional subsystem. For classical-quantum states, it further reduces to the optimal guessing probability of a computationally bounded observer with access to side information. Lastly, in the absence of side information, the computational min-entropy simplifies to a computational notion of the operator norm. We then establish strong separations between the information-theoretic and complexity-constrained notions of min-entropy. For pure states, there exist highly entangled families of states with extremal min-entropy whose efficiently accessible entanglement in terms of computational min-entropy is exponentially suppressed. For mixed states, the separation is even sharper: the information-theoretic conditional min-entropy can be highly negative while the complexity-constrained quantity remains nearly maximal. Overall, our results demonstrate that computational constraints can fundamentally limit the quantum correlations that are observable in practice.

Sep 28, 20260 citations

Entanglement theory with limited computational resources

Lorenzo Leone, J. Douglas Rizzo, Jens Eisert +1 more

Abstract The precise quantification of the limits to manipulating quantum resources lies at the core of quantum information theory. However, standard information-theoretic analyses do not consider the actual computational complexity involved in performing certain tasks. Here we address this issue within the realm of entanglement theory, finding that accounting for computational efficiency substantially changes what can be achieved using entangled resources. We consider two key figures of merit: the computational distillable entanglement and the computational entanglement cost. These measures quantify the optimal rates of entangled bits that can be extracted from or used to dilute many identical copies of n -qubit bipartite pure states, using computationally efficient local operations and classical communication. We demonstrate that computational entanglement measures diverge considerably from their information-theoretic counterparts. Whereas the information-theoretic distillable entanglement is determined by the von Neumann entropy of the reduced state, we show that the min-entropy governs the computationally efficient setting. On the other hand, computationally efficient entanglement dilution requires maximal consumption of entangled bits, even for nearly unentangled states. Furthermore, in the worst-case scenario, even when an efficient description of the state exists and is fully known, one gains no advantage over state-agnostic protocols. Our findings establish sample-complexity bounds for measuring and testing the von Neumann entropy, fundamental limitations on efficient state compression and efficient local tomography protocols.

arXiv:2502.12284Nature PhysicsOct 22, 20256 citations

Entropic Resilience: Information-Theoretic Limits of Post-Quantum Cryptography

PAULO SÉRGIO DE ANDRADE

The looming threat of large-scale quantum computers necessitates a paradigm shift in cryptographic design, giving rise to the field of Post-Quantum Cryptography (PQC). While the computational hardness assumptions underpinning PQC schemes are well-studied, their fundamental security limits from an information-theoretic perspective remain an area requiring deeper exploration. This paper introduces and systematically investigates the concept of "entropic resilience," defined as the inherent ability of a cryptographic system to maintain its security guarantees even under an adversary possessing unbounded computational power, provided only limited information about the secret components is revealed. We present a comprehensive framework for analyzing the information-theoretic security of prominent PQC families, including lattice-based, code-based, and hash-based schemes. Our methodology leverages various entropy measures, such as min-entropy and conditional entropy, to quantify the information leakage and the irreducible uncertainty preserved in cryptographic secrets. We derive theoretical bounds on the information-theoretic security for representative PQC constructions and discuss the implications of these bounds for parameter selection, key generation, and resistance against information-theoretic attacks and side channels. The findings highlight critical trade-offs between entropy requirements, efficiency, and the achievable level of provable security in a post-quantum world. Ultimately, this work provides a foundational understanding of the ultimate security boundaries for PQC, guiding the design of more robust and provably secure schemes against both classical and quantum adversaries.

Nov 23, 20250 citations

Entropic Bounds on the Security of Post-Quantum Cryptosystems

PAULO SÉRGIO DE ANDRADE

The advent of quantum computing poses a significant threat to the security of currently deployed public-key cryptosystems. In response, the field of post-quantum cryptography (PQC) has emerged, proposing new algorithms based on mathematical problems believed to be hard for both classical and quantum computers. While the security of these systems is typically analyzed using computational complexity theory, this paper explores an alternative and complementary approach rooted in information theory. We investigate the security of PQC schemes by establishing entropic bounds on the information available to a quantum adversary. By leveraging concepts such as conditional min-entropy and Rényi divergence, we formulate a framework to quantify the uncertainty of secret keys and plaintexts from an adversary's perspective. This paper derives explicit entropic security bounds for several major families of post-quantum cryptosystems, including lattice-based, code-based, and hash-based schemes. We demonstrate that the security of these systems can be directly related to the entropy of the underlying hard problems' solutions. The results provide a new lens through which to assess and compare the security of PQC candidates, offering insights that are independent of specific computational models and algorithmic assumptions. This information-theoretic perspective not only strengthens the security foundations of PQC but also offers practical guidance for parameter selection to ensure long-term resilience against future cryptanalytic advances.

Nov 22, 20250 citations