Fully Quantum Computational Entropies
- URL: http://arxiv.org/abs/2506.14068v1
- Date: Mon, 16 Jun 2025 23:56:19 GMT
- Title: Fully Quantum Computational Entropies
- Authors: Noam Avidan, Thomas A. Hahn, Joseph M. Renes, Rotem Arnon,
- Abstract summary: We introduce two innovative entropies: quantum computational min- and max-entropies.<n>We establish a series of essential properties for this new entropy, including data processing and a chain rule.<n>This work marks a critical step toward a quantum information theory that incorporates computational elements.
- Score: 1.8749305679160362
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum information theory, particularly its entropic formulations, has made remarkable strides in characterizing quantum systems and tasks. However, a critical dimension remains underexplored: computational efficiency. While classical computational entropies integrate complexity and feasibility into information measures, analogous concepts have yet to be rigorously developed in the quantum setting. In this work, we lay the basis for a new quantum computational information theory. Such a theory will allow studying efficient -- thus relevant in practice -- manipulation of quantum information. We introduce two innovative entropies: quantum computational min- and max-entropies (along with their smooth variants). Our quantum computational min-entropy is both the fully quantum counterpart of the classical unpredictability entropy, as well as the computational parallel to the quantum min-entropy. We establish a series of essential properties for this new entropy, including data processing and a chain rule. The quantum computational max-entropy is defined via a duality relation and gains operational meaning through an alternative formulation that we derive. Notably, it captures the efficiency of entanglement distillation with the environment, restricted to local quantum circuits of bounded size. With the introduction of our computational entropies and their study, this work marks a critical step toward a quantum information theory that incorporates computational elements.
Related papers
- Quantum Computational Unpredictability Entropy and Quantum Leakage Resilience [0.0]
Computational entropies provide a framework for quantifying uncertainty and randomness under computational constraints.<n>We define quantum computational unpredictability entropy, a natural generalization of classical unpredictability entropy to the quantum setting.<n>Our results lay a foundation for developing cryptographic tools that rely on min-entropy in the quantum computational setting.
arXiv Detail & Related papers (2025-05-19T20:20:30Z) - Efficient approximation of regularized relative entropies and applications [11.59751616011475]
We show that the regularized relative entropy can be efficiently approximated within an additive error by a quantum relative entropy program of size.<n>This applies to particular to the regularized relative entropy in adversarial quantum channel discrimination.<n>In particular, when the set of interest does not directly satisfy the required structural assumptions, it can be relaxed to one that does.
arXiv Detail & Related papers (2025-02-21T18:29:45Z) - Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
arXiv Detail & Related papers (2024-03-30T00:21:46Z) - Computable and noncomputable in the quantum domain: statements and conjectures [0.70224924046445]
We consider an approach to the question of describing a class of problems whose solution can be accelerated by a quantum computer.
The unitary operation that transforms the initial quantum state into the desired one must be decomposable into a sequence of one- and two-qubit gates.
arXiv Detail & Related papers (2024-03-25T15:47:35Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - Universality of critical dynamics with finite entanglement [68.8204255655161]
We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement.
Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
arXiv Detail & Related papers (2023-01-23T19:23:54Z) - An Introduction to Quantum Machine Learning for Engineers [36.18344598412261]
Quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers.
This book provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra.
arXiv Detail & Related papers (2022-05-11T12:10:52Z) - Kernel-Function Based Quantum Algorithms for Finite Temperature Quantum
Simulation [5.188498150496968]
We present a quantum kernel function (QKFE) algorithm for solving thermodynamic properties of quantum many-body systems.
As compared to its classical counterpart, namely the kernel method (KPM), QKFE has an exponential advantage in the cost of both time and memory.
We demonstrate its efficiency with applications to one and two-dimensional quantum spin models, and a fermionic lattice.
arXiv Detail & Related papers (2022-02-02T18:00:04Z) - Quantum Data Compression and Quantum Cross Entropy [0.0]
We show that quantum cross entropy acts as the compression rate for sub-optimal quantum source coding.
This reveals that quantum cross entropy can effectively serve as a loss function in quantum machine learning algorithms.
arXiv Detail & Related papers (2021-06-25T18:00:33Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Experimental Validation of Fully Quantum Fluctuation Theorems Using
Dynamic Bayesian Networks [48.7576911714538]
Fluctuation theorems are fundamental extensions of the second law of thermodynamics for small systems.
We experimentally verify detailed and integral fully quantum fluctuation theorems for heat exchange using two quantum-correlated thermal spins-1/2 in a nuclear magnetic resonance setup.
arXiv Detail & Related papers (2020-12-11T12:55:17Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.