Cover Image

Computational relative entropy

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Meyer, Johannes Jakob, Raza, Asad, Rizzo, Jacopo, Leone, Lorenzo, Jerbi, Sofiene, Eisert, Jens
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity Cryptography and Security Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The computational two-way quantum capacity
by: Meyer, Johannes Jakob, et al.
Published: (2026)

Generalized one-way function and its application
by: Yin, Hua-Lei
Published: (2024)

Entanglement theory with limited computational resources
by: Leone, Lorenzo, et al.
Published: (2025)

Quantum interactive proofs using quantum energy teleportation
by: Ikeda, Kazuki, et al.
Published: (2023)

Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem
by: Conrad, Jonathan, et al.
Published: (2023)

On the Computational Hardness of Quantum One-Wayness
by: Cavalar, Bruno, et al.
Published: (2023)

A Computational Separation Between Quantum No-cloning and No-telegraphing
by: Nehoran, Barak, et al.
Published: (2023)

Quantum-Computable One-Way Functions without One-Way Functions
by: Kretschmer, William, et al.
Published: (2024)

Nearly-Linear Time Seeded Extractors with Short Seeds
by: Doron, Dean, et al.
Published: (2024)

Secret Sharing on Superconcentrator
by: Li, Yuan
Published: (2023)

Computational hardness of estimating quantum entropies via binary entropy bounds
by: Liu, Yupan
Published: (2026)

Quantum Cryptography and Hardness of Non-Collapsing Measurements
by: Morimae, Tomoyuki, et al.
Published: (2025)

Hardness of Quantum Distribution Learning and Quantum Cryptography
by: Hiroka, Taiga, et al.
Published: (2025)

Experimental relativistic zero-knowledge proofs with unconditional security
by: Weng, Chen-Xun, et al.
Published: (2025)

From Worst-Case Hardness of $\mathsf{NP}$ to Quantum Cryptography via Quantum Indistinguishability Obfuscation
by: Morimae, Tomoyuki, et al.
Published: (2025)

Parallel Kac's Walk Generates PRU
by: Lu, Chuhan, et al.
Published: (2025)

Improved Quantum Lifting by Coherent Measure-and-Reprogram
by: Cojocaru, Alexandru, et al.
Published: (2025)

Quantum Statistical Witness Indistinguishability
by: Nassar, Shafik, et al.
Published: (2025)

Proofs of quantum memory
by: Hhan, Minki, et al.
Published: (2025)

NISQ Security and Complexity via Simple Classical Reasoning
by: Cojocaru, Alexandru, et al.
Published: (2025)

Quantum Lifting for Invertible Permutations and Ideal Ciphers
by: Cojocaru, Alexandru, et al.
Published: (2025)

An efficient construction of Raz's two-source randomness extractor with improved parameters
by: Foreman, Cameron, et al.
Published: (2025)

Pseudorandom quantum authentication
by: Haug, Tobias, et al.
Published: (2025)

Cryptographic Conditions for Efficient Testing of Distributions and Quantum States
by: Cavalar, Bruno, et al.
Published: (2025)

Pseudorandom density matrices
by: Bansal, Nikhil, et al.
Published: (2024)

Clifford Strategies in Interactive Protocols are Classically Simulatable
by: Shalit, Itay
Published: (2024)

Quantum Cryptography in Algorithmica
by: Kretschmer, William, et al.
Published: (2022)

Finding dense sub-lattices as low-energy states of a Hamiltonian
by: Barberà-Rodríguez, Júlia, et al.
Published: (2023)

A Note on Output Length of One-Way State Generators and EFIs
by: Hhan, Minki, et al.
Published: (2023)

Quantum Automating $\mathbf{TC}^0$-Frege Is LWE-Hard
by: Arteche, Noel, et al.
Published: (2024)

Pseudorandomness in the (Inverseless) Haar Random Oracle Model
by: Ananth, Prabhanjan, et al.
Published: (2024)

Verifiable Quantum Advantage without Structure
by: Yamakawa, Takashi, et al.
Published: (2022)

Quantum delegation with an off-the-shelf device
by: Broadbent, Anne, et al.
Published: (2023)

On the success probability of quantum order finding
by: Ekerå, Martin
Published: (2022)

Quantum Advantage from One-Way Functions
by: Morimae, Tomoyuki, et al.
Published: (2023)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
by: Li, Xingjian, et al.
Published: (2023)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
by: Grilo, Alex B., et al.
Published: (2024)

An efficient quantum parallel repetition theorem and applications
by: Bostanci, John, et al.
Published: (2023)

A Meta-Complexity Characterization of Quantum Cryptography
by: Cavalar, Bruno P., et al.
Published: (2024)

Quantum Pseudorandom Scramblers
by: Lu, Chuhan, et al.
Published: (2023)