Quantum algorithms for Uhlmann transformation
quant-ph
Submitted: 2025-09-03
Updated: 2026-11-12
Terminology
Sources
- Computational Entanglement Theory
- Unitary Complexity and the Uhlmann Transformation Problem
- Single-shot Quantum State Merging
- High-dimensional quantum Schur transforms
- Local transformations of bipartite entanglement are rigid
- Complexity Theory for Quantum Promise Problems
- Finding Angles for Quantum Signal Processing with Machine Precision
- Local Test for Unitarily Invariant Properties of Bipartite Quantum States
- Uhlmann's theorem for measured divergences
- Query-Optimal and Sample-Optimal Quantum Algorithms for Estimating Fidelity to a Pure State
- Variational Quantum State Eigensolver
- Improved Quantum Algorithms for Fidelity Estimation
- Sample Optimal and Memory Efficient Quantum State Tomography
- Quantum measurements and the Abelian Stabilizer Problem
- Principles of Quantum Communication Theory: A Modern Approach
- Quantum polar decomposition algorithm
- No Universal Purification in Quantum Mechanics
- Exponential Separations between Quantum Learning with and without Purification
- Hamiltonian singular value transformation and inverse block encoding
- Universal Quantum Emulator
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements