Image de couverture de livre

Computational aspects of the trace norm contraction coefficient

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Delsol, Idris, Fawzi, Omar, Kochanowski, Jan, Ramachandran, Akshay
Format:	Preprint
Publié:	2025
Sujets:	Quantum Physics Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Complexity of mixed Schatten norms of quantum maps
par: Kochanowski, Jan, et autres
Publié: (2025)

Accessible Quantum Correlations Under Complexity Constraints
par: Yángüez, Álvaro, et autres
Publié: (2026)

Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
par: Martinez, Victor, et autres
Publié: (2025)

Emulation Capacity between Idempotent Channels
par: Delsol, Idris, et autres
Publié: (2025)

Additivity and chain rules for quantum entropies via multi-index Schatten norms
par: Fawzi, Omar, et autres
Publié: (2025)

Quantum Statistical Witness Indistinguishability
par: Nassar, Shafik, et autres
Publié: (2025)

PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements
par: Aaronson, Scott, et autres
Publié: (2024)

Quantum complexity of the Kronecker coefficients
par: Bravyi, Sergey, et autres
Publié: (2023)

DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians
par: Ji, Zhengfeng, et autres
Publié: (2026)

Two-Indexed Schatten Quasi-Norms with Applications to Quantum Information Theory
par: Kochanowski, Jan, et autres
Publié: (2026)

The Power of Lorentz Quantum Computer
par: Zhang, Qi, et autres
Publié: (2024)

Bosonic Quantum Computational Complexity
par: Chabaud, Ulysse, et autres
Publié: (2024)

Quantum Search with In-Place Queries
par: Holman, Blake, et autres
Publié: (2025)

Positive bias makes tensor-network contraction tractable
par: Jiang, Jiaqing, et autres
Publié: (2024)

Modifications of Quantum Computation and Adaptive Queries to PP
par: Miloschewsky, David, et autres
Publié: (2025)

Computational complexity of isometric tensor network states
par: Malz, Daniel, et autres
Publié: (2024)

The Computational Advantage of MIP* Vanishes in the Presence of Noise
par: Dong, Yangjing, et autres
Publié: (2023)

The Space-Time Cost of Purifying Quantum Computations
par: Zhandry, Mark
Publié: (2024)

Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
par: Barch, Brian, et autres
Publié: (2025)

Why Philosophers Should Care About Computational Complexity
par: Aaronson, Scott
Publié: (2011)

New Quantum Algorithms for Computing Quantum Entropies and Distances
par: Wang, Qisheng, et autres
Publié: (2022)

Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection
par: Hiromasa, Ryo, et autres
Publié: (2022)

New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
par: Miloschewsky, David, et autres
Publié: (2024)

Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
par: Guseynov, Nikita, et autres
Publié: (2026)

A Critical Comment on 'Entropy Computing: A Paradigm for Optimization in Open Photonic Systems'
par: Moosavian, Ali Hamed, et autres
Publié: (2026)

Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
par: Yamakami, Tomoyuki
Publié: (2023)

On the Computational Complexity of Schrödinger Operators
par: Zheng, Yufan, et autres
Publié: (2024)

On estimating the trace of quantum state powers
par: Liu, Yupan, et autres
Publié: (2024)

A Schematic Definition of Quantum Polynomial Time Computability
par: Yamakami, Tomoyuki
Publié: (2018)

Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
par: Schleich, Philipp, et autres
Publié: (2024)

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem
par: Li, Zhengyu, et autres
Publié: (2023)

Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance
par: Fawzi, Omar, et autres
Publié: (2023)

On the Computational Hardness of Quantum One-Wayness
par: Cavalar, Bruno, et autres
Publié: (2023)

A Computational Separation Between Quantum No-cloning and No-telegraphing
par: Nehoran, Barak, et autres
Publié: (2023)

Computational complexity of the homology problem with orientable filtration: MA-completeness
par: Hayakawa, Ryu, et autres
Publié: (2025)

Computational hardness of estimating quantum entropies via binary entropy bounds
par: Liu, Yupan
Publié: (2026)

Quantum-Computable One-Way Functions without One-Way Functions
par: Kretschmer, William, et autres
Publié: (2024)

Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability
par: Yamakami, Tomoyuki
Publié: (2025)

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
par: Cardoso, Ricardo Rivera, et autres
Publié: (2025)

More-efficient Quantum Multivariate Mean Value Estimator from Generalized Grover Operator
par: Tang, Letian
Publié: (2025)