REVIEW 2 cited by
Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination
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
We present an instance of a task of minimum-error discrimination of two qubit-qubit quantum channels for which a sequential strategy outperforms any parallel strategy. We then establish two new classes of strategies for channel discrimination that involve indefinite causal order and show that there exists a strict hierarchy among the performance of all four strategies. Our proof technique employs a general method of computer-assisted proofs. We also provide a systematic method for finding pairs of channels that showcase this phenomenon, demonstrating that the hierarchy between the strategies is not exclusive to our main example.
Forward citations
Cited by 2 Pith papers
-
Strict hierarchy between $n$-wise measurement simulability, compatibility structures, and multi-copy compatibility
The paper orders all known generalizations of measurement incompatibility in a strict chain of inclusions, with n-wise compatible assemblages as the convex hull of n-simulable ones, strictly inside n-copy jointly meas...
-
Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order
Causally indefinite classical processes can compute a constructed Boolean function family with D^0.792 queries instead of D, and indefinite causal order gives an exact three-query quantum algorithm where sequential qu...
Discussion (0). Sign in to comment.