REVIEW 4 cited by
Simpler semidefinite programs for completely bounded norms
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
read the original abstract
The completely bounded trace and spectral norms, for finite-dimensional spaces, are known to be efficiently expressible by semidefinite programs (J. Watrous, Theory of Computing 5: 11, 2009). This paper presents two new, and arguably much simpler, semidefinite programming formulations of these norms.
Forward citations
Cited by 4 Pith papers
-
Quantum memory advantage for quantum process tomography
Learning a channel with d_in input and d_out output dimensions without quantum memory requires Θ((d_in d_out)^3/ε²) queries even with classical adaptivity, while quantum memory gives Θ((d_in d_out)^2/ε²).
-
Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements
Coherent errors plus syndrome measurement on a surface code create emergent unitary designs on the logical qubit above a finite threshold that also marks the optimal error-correction and entanglement transitions.
-
A Unified Blockwise Measurement Design for Learning Quantum Channels and Lindbladians via Low-Rank Matrix Sensing
A blockwise matrix-sensing measurement design recovers low-rank quantum channels and Lindbladians with near-optimal sample counts and large computational speedups.
-
Quantum Entanglement with Geometric Measures
The thesis introduces k-GME monotones for pure states, subspaces, and mixed states, and uses manifold-trivialized gradient descent to compute them, enabling certification of entanglement dimensionality.
Discussion (0). Continue with ORCID to comment.