Wasserstein complexity of quantum circuits
From MaRDI portal
Cites work
- A geometric approach to quantum circuit lower bounds
- An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy
- Classical simulation of quantum circuits by half Gauss sums
- Complexity of quantum circuits via sensitivity, magic, and coherence
- Computational complexity and black hole horizons
- Computational optimal transport. With applications to data sciences
- Concentration of quantum states from quantum functional and transportation cost inequalities
- Fisher information and logarithmic Sobolev inequality for matrix-valued functions
- Geometric quantum speed limits: a case for Wigner phase space
- Gradient flow and entropy inequalities for quantum Markov semigroups with detailed balance
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- scientific article; zbMATH DE number 7250161 (Why is no real title available?)
- scientific article; zbMATH DE number 3429908 (Why is no real title available?)
- Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems
- Optimal Transport
- Quantifying magic for multi-qubit operations
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Quantum computation and quantum information. 10th anniversary edition
- Quantum computation as geometry
- Quantum concentration inequalities
- Quantum differential privacy: an information theory perspective
- Relating relative entropy, optimal transport and Fisher information: a quantum HWI inequality
- T-Count Optimization and Reed–Muller Codes
- The earth mover's distance as a metric for image retrieval
- The geometry of quantum computation
- The Heisenberg representation of quantum computers
- The Quantum Wasserstein Distance of Order 1
- Vector and matrix optimal mass transport: theory, algorithm, and applications
This page was built for publication: Wasserstein complexity of quantum circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941640)
