Coherent Quantum Channel Discrimination
- URL: http://arxiv.org/abs/2001.02668v1
- Date: Wed, 8 Jan 2020 18:47:08 GMT
- Title: Coherent Quantum Channel Discrimination
- Authors: Mark M. Wilde
- Abstract summary: Coherent quantum channel discrimination is a quantum interactive proof system between a verifier and a prover.
I prove that this success probability does not increase under the action of a quantum superchannel.
I provide an explicit semi-definite program that can compute the success probability.
- Score: 6.345523830122166
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper introduces coherent quantum channel discrimination as a coherent
version of conventional quantum channel discrimination. Coherent channel
discrimination is phrased here as a quantum interactive proof system between a
verifier and a prover, wherein the goal of the prover is to distinguish two
channels called in superposition in order to distill a Bell state at the end.
The key measure considered here is the success probability of distilling a Bell
state, and I prove that this success probability does not increase under the
action of a quantum superchannel, thus establishing this measure as a
fundamental measure of channel distinguishability. Also, I establish some
bounds on this success probability in terms of the success probability of
conventional channel discrimination. Finally, I provide an explicit
semi-definite program that can compute the success probability.
Related papers
- Adversarial Hypothesis Testing for Quantum Channels [57.214837874007856]
We study adversarial hypothesis testing for quantum-quantum (QQ) and classical-quantum (CQ) channels.<n>For QQ channels with i.i.d. inputs, Bob's knowledge of the input significantly enhances distinguishability.<n>For CQ channels, Bob being informed provides a consistent advantage over the corresponding entanglement-breaking channels for both i.i.d. and general inputs.
arXiv Detail & Related papers (2026-01-15T10:04:10Z) - Query complexities of quantum channel discrimination and estimation: A unified approach [16.916040234975796]
We establish lower bounds on the query complexities of channel discrimination and estimation.<n>We give conceptually simple proofs for both novel and known bounds.<n>We present a consistent and unified framework for quantum channel discrimination and estimation.
arXiv Detail & Related papers (2025-11-13T22:25:41Z) - Unambiguous discrimination of the change point for quantum channels [0.5439020425818999]
Identifying the precise moment when a quantum channel undergoes a change is a fundamental problem in quantum information theory.<n>We study how accurately one can determine the time at which a channel transitions to another.
arXiv Detail & Related papers (2025-08-09T02:26:58Z) - Bounds for Revised Unambiguous Discrimination Tasks of Quantum Resources [0.9790236766474201]
Quantum state discrimination is a fundamental task that is meaningful in quantum information theory.
We show an upper bound of the success probability for a revised discrimination task in the unasymptotic and unambiguous scenarios.
We also show the advantage of the quantum by considering a quantifier on a set of semidefinite positive operators.
arXiv Detail & Related papers (2024-10-06T14:52:17Z) - Upper bounds on probabilities in channel measurements on qubit channels and their applications [0.0]
We derive the upper bounds of the probability in a channel measurement for specific classes of quantum channels.
These applications demonstrate the significance of the obtained upper bounds.
arXiv Detail & Related papers (2024-06-21T14:25:12Z) - Normal quantum channels and Markovian correlated two-qubit quantum
errors [77.34726150561087]
We study general normally'' distributed random unitary transformations.
On the one hand, a normal distribution induces a unital quantum channel.
On the other hand, the diffusive random walk defines a unital quantum process.
arXiv Detail & Related papers (2023-07-25T15:33:28Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Quantum machine learning channel discrimination [0.0]
In the problem of quantum channel discrimination, one distinguishes between a given number of quantum channels.
This work studies applications of variational quantum circuits and machine learning techniques for discriminating such channels.
arXiv Detail & Related papers (2022-06-20T18:00:05Z) - Commitment capacity of classical-quantum channels [70.51146080031752]
We define various notions of commitment capacity for classical-quantum channels.
We prove matching upper and lower bound on it in terms of the conditional entropy.
arXiv Detail & Related papers (2022-01-17T10:41:50Z) - Towards the ultimate limits of quantum channel discrimination [18.836836815159764]
We make a conjecture on the exponentially strong converse of quantum channel hypothesis testing under coherent strategies.
We develop a framework to show the interplay between the strategies of channel discrimination, the operational regimes, and variants of channel divergences.
arXiv Detail & Related papers (2021-10-28T01:48:13Z) - Excluding false negative error in certification of quantum channels [68.8204255655161]
This work focuses on the scenario when the false negative error cannot occur, even if it leads to the growth of the probability of false positive error.
We establish a condition when it is possible to exclude false negative error after a finite number of queries to the quantum channel in parallel.
arXiv Detail & Related papers (2021-06-04T09:41:11Z) - Creating and destroying coherence with quantum channels [62.997667081978825]
We study optimal ways to create a large amount of quantum coherence via quantum channels.
correlations in multipartite systems do not enhance the ability of a quantum channel to create coherence.
We show that a channel can destroy more coherence when acting on a subsystem of a bipartite state.
arXiv Detail & Related papers (2021-05-25T16:44:13Z) - Simple upper and lower bounds on the ultimate success probability for
discriminating arbitrary finite-dimensional quantum processes [2.538209532048866]
We present a simple upper bound on the ultimate success probability for discriminating arbitrary quantum processes.
In the special case of multi-shot channel discrimination, it can be shown that the ultimate success probability increases by at most a constant factor determined by the given channels.
We also present a lower bound based on Bayesian updating, which has a low computational cost.
arXiv Detail & Related papers (2020-12-27T01:14:23Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Ultimate limits for multiple quantum channel discrimination [0.966840768820136]
This paper studies the problem of hypothesis testing with quantum channels.
We establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels.
We also show that this lower bound is achievable when the channels have certain symmetries.
arXiv Detail & Related papers (2020-07-29T03:08:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.