Information Potential: A Variational Approach to Quantum Information Complexity

arXiv:2609.39328 · quant-ph, cs.CC · Submitted 2026-09-30 · Read on arXiv

quant-ph, cs.CC

Submitted: 2026-09-30

Updated: 2026-10-03

Terminology

• Trace — 16× in this paper · explained in 2 episodes
• Fidelity — 5× in this paper · explained in 2 episodes
• Hilbert Space — 5× in this paper · explained in 2 episodes
• IEEE Symposium on Foundations of Computer Science — 4× in this paper
• Trace Distance — 3× in this paper · explained in 3 episodes
• ACM Symposium on Theory of Computing — 2× in this paper
• Entanglement — 2× in this paper · explained in 4 episodes
• Additivity — 1× in this paper · explained in 1 episode
• Alignment — 1× in this paper · explained in 1 episode
• Generalization — 1× in this paper · explained in 13 episodes
• Query Complexity — 1× in this paper · explained in 2 episodes

Sources

• Near-optimal bounds on bounded-round quantum communication complexity of disjointness
• On quantum Renyi entropies: a new generalization and some properties
• Quantum communication complexity of symmetric predicates

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity