Strategies for single-shot discrimination of process matrices
arXiv:2210.14575 · doi:10.1038/s41598-023-30191-0
Abstract
The topic of causality has recently gained traction quantum information research. This work examines the problem of single-shot discrimination between process matrices which are an universal method defining a causal structure. We provide an exact expression for the optimal probability of correct distinction. In addition, we present an alternative way to achieve this expression by using the convex cone structure theory. We also express the discrimination task as semidefinite programming. Due to that, we have created the SDP calculating the distance between process matrices and we quantify it in terms of the trace norm. As a valuable by-product, the program finds an optimal realization of the discrimination task. We also find two classes of process matrices which can be distinguished perfectly. Our main result, however, is a consideration of the discrimination task for process matrices corresponding to quantum combs. We study which strategy, adaptive or non-signalling, should be used during the discrimination task. We proved that no matter which strategy you choose, the probability of distinguishing two process matrices being a quantum comb is the same.
arXiv comment23 pages, 8 figures
References in corpus (28)
- Quantum correlations with no causal order
- Quantum computations without definite causal structure
- Theoretical framework for quantum networks
- Quantum Circuits Architecture
- Post-selection technique for quantum channels with applications to quantum cryptography
- Using entanglement improves precision of quantum measurements
- Causal and localizable quantum operations
- Witnessing causal nonseparability
- Causal and causally separable processes
- Comparison of Quantum Channels by Superchannels
- Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
- Unambiguous discrimination among quantum operations
- Coherence in quantum error-correcting codes
- On quantum non-signalling boxes
- Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination
- Optimal quantum networks and one-shot entropies
- Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
- Generalized channels: channels for convex subsets of the state space
- Strategies for optimal single-shot discrimination of quantum measurements
- Quantum Networks: general theory and applications
- Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality
- Base norms and discrimination of generalized quantum channels
- Resource theory of causal connection
- QuantumInformation.jl---a Julia package for numerical computation in quantum information theory
- Discrimination of POVMs with rank-one effects
- Multiple-shot and unambiguous discrimination of von Neumann measurements
- Extremality conditions for generalized channels
- Optimal representation of quantum channels