REVIEW 1 cited by
The Quantum Esscher Transform
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
abstract
The Esscher Transform is a tool of broad utility in various domains of applied probability. It provides the solution to a constrained minimum relative entropy optimization problem. In this work, we study the generalization of the Esscher Transform to the quantum setting. We examine a relative entropy minimization problem for a quantum density operator, potentially of wide relevance in quantum information theory. The resulting solution form motivates us to define the \textit{quantum} Esscher Transform, which subsumes the classical Esscher Transform as a special case. Envisioning potential applications of the quantum Esscher Transform, we also discuss its implementation on fault-tolerant quantum computers. Our algorithm is based on the modern techniques of block-encoding and quantum singular value transformation (QSVT). We show that given block-encoded inputs, our algorithm outputs a subnormalized block-encoding of the quantum Esscher transform within accuracy $\epsilon$ in $\tilde O(\kappa d \log^2 1/\epsilon)$ queries to the inputs, where $\kappa$ is the condition number of the input density operator and $d$ is the number of constraints.
Forward citations
Cited by 1 Pith paper
-
Quantum Learning with Tunable Loss Functions
Proposes QTERM for quantum process learning, but the proof rests on an incorrect equality E[e^{γY}] = e^{γE[Y]} for measurement bits, invalidating the sample complexity and PAC claims.
Discussion (0). Sign in to comment.