REVIEW 9 cited by
An inequality for the trace of matrix products, using absolute values
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The absolute value of matrices is used in order to give inequalities for the trace of products. An application gives a very short proof of the tracial matrix Hoelder inequality
Forward citations
Cited by 9 Pith papers
-
Towards Minimax Estimation of High-Order Functionals by Quantum Arguments
Quantum-inspired estimators for F_alpha(P) and F_alpha(rho) achieve optimal sample complexity n ~ alpha and minimax MSE rate alpha/n, improving prior O(alpha^2) bounds.
-
Efficient and SPAM-Robust Ansatz-Free Lindbladian Learning
An ansatz-free Lindbladian learning algorithm via Bell sampling with a SPAM-robust extension for gauge-independent parts of sparse Lindbladians under constant noise.
-
Spectral gap of Lee-Yang Hamiltonians
Any Lee-Yang Hamiltonian plus uniform Z-field h has nondegenerate ground state with spectral gap at least h/4, independent of system size.
-
Information-Theoretic Lower Bounds for Approximating Monomials via Optimal Quantum Tsallis Entropy Estimation
A quantum estimator achieves near-optimal query complexity for integer-order Tsallis entropy, and the same technique yields a new information-theoretic proof that approximating x^n needs polynomials of degree Ω(√n).
-
Quantum simulation with sum-of-squares spectral amplification
SOSSA writes a shifted Hamiltonian as a sum of squares, block-encodes its square root, and proves O(sqrt(Delta*lambda)/epsilon) query algorithms for low-energy expectation and phase estimation, with a sqrt(N) speedup ...
-
On estimating Schatten norm and power distances between quantum states
For constant alpha > 1, the quantum Schatten alpha-norm distance between states given by preparation circuits can be estimated in polynomial time, and the corresponding decision problem QSD_alpha is BQP-complete; for ...
-
Fullqubit alchemist: Quantum algorithm for alchemical free energy calculations
A quantum algorithm for alchemical free energy calculations that block-encodes the Liouvillian to simulate molecular dynamics with polylogarithmic precision scaling, avoiding entropy estimation.
-
Quantum speed limit for observables from quantum asymmetry
A quantum speed limit for observables is formulated from the trace-norm asymmetry of the time-dependent state, observable through weak measurements and bounding the quantum Fisher information for the conjugate parameter.
-
Statistics and Complexity of Wavefunction Spreading in Quantum Dynamical Systems
The moments of the spreading-operator measurement distribution are generalized spread complexities, which for GUE Hamiltonians peak more sharply at higher order and obey a norm bound.
Discussion (0). Continue with ORCID to comment.