REVIEW 4 cited by
Direct estimations of linear and non-linear functionals of a quantum state
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
We present a simple quantum network, based on the controlled-SWAP gate, that can extract certain properties of quantum states without recourse to quantum tomography. It can be used used as a basic building block for direct quantum estimations of both linear and non-linear functionals of any density operator. The network has many potential applications ranging from purity tests and eigenvalue estimations to direct characterization of some properties of quantum channels. Experimental realizations of the proposed network are within the reach of quantum technology that is currently being developed.
Forward citations
Cited by 4 Pith papers
-
An Optimal Analysis of the Product Test
For every n >= 2, the product test's worst-case acceptance probability equals (1 + mω^2 + (1−mω)^2)/2 with m = floor(1/ω), where ω is the maximum squared overlap with a product state.
-
On estimating operator norm distance, with optimal trace distance estimation when one state is pure
Rank-independent quantum estimators achieve Θ(1/ε) queries for operator-norm (and trace) distance when one state is pure, and Õ(1/ε^{3/2}) queries for general states, proving BQP-completeness.
-
Imaginary pseudo entropy encodes temporal orientation
The calibrated pseudo-Rényi phase and replica visibility exactly equal the Helstrom trace distance between forward and backward ancilla states, giving a bounded operational meaning to imaginary pseudo entropy.
-
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 ...
Discussion (0). Continue with ORCID to comment.