Idler-Free Multi-Channel Discrimination via Multipartite Probe States
- URL: http://arxiv.org/abs/2010.12354v4
- Date: Mon, 6 Sep 2021 11:09:31 GMT
- Title: Idler-Free Multi-Channel Discrimination via Multipartite Probe States
- Authors: Cillian Harney, Stefano Pirandola
- Abstract summary: Multi-channel discrimination creates a scenario in which the discrimination of multiple quantum channels can be equated to the idea of pattern recognition.
We develop general classes of unassisted multi-channel discrimination protocols which are not assisted by idler modes.
Our findings uncover the existence of strongly quantum advantageous, idler-free protocols for the discrimination of bosonic loss and environmental noise.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The characterisation of Quantum Channel Discrimination (QCD) offers critical
insight for future quantum technologies in quantum metrology, sensing and
communications. The task of multi-channel discrimination creates a scenario in
which the discrimination of multiple quantum channels can be equated to the
idea of pattern recognition, highly relevant to the tasks of quantum reading,
illumination and more. Whilst the optimal quantum strategy for many scenarios
is an entangled idler-assisted protocol, the extension to a multi-hypothesis
setting invites the exploration of discrimination strategies based on
unassisted, multipartite probe states. In this work, we expand the space of
possible quantum enhanced protocols by formulating general classes of
unassisted multi-channel discrimination protocols which are not assisted by
idler modes. Developing a general framework for idler-free protocols, we
perform an explicit investigation in the bosonic setting, studying prominent
Gaussian channel discrimination problems for real world applications. Our
findings uncover the existence of strongly quantum advantageous, idler-free
protocols for the discrimination of bosonic loss and environmental noise. This
circumvents the necessity for idler assistance to achieve quantum advantage in
some of the most relevant discrimination settings, significantly loosening
practical requirements for prominent quantum sensing applications.
Related papers
- Characterising memory in quantum channel discrimination via constrained separability problems [4.007882727805384]
Quantum memories are a crucial precondition in many protocols for processing quantum information.
We characterise the quality of channel discrimination protocols when the quantum memory is limited.
This insight allows to systematically characterise quantum and classical memories in adaptive channel discrimination protocols.
arXiv Detail & Related papers (2024-11-12T19:00:02Z) - The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.
Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
arXiv Detail & Related papers (2024-10-18T13:59:50Z) - Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process.
We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable.
Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs.
We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
arXiv Detail & Related papers (2024-05-12T09:05:13Z) - Multi-User Entanglement Distribution in Quantum Networks Using Multipath
Routing [55.2480439325792]
We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing.
The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
arXiv Detail & Related papers (2023-03-06T18:06:00Z) - Experimental Multi-state Quantum Discrimination in the Frequency Domain
with Quantum Dot Light [40.96261204117952]
In this work, we present the experimental realization of a protocol employing a time-multiplexing strategy to optimally discriminate among eight non-orthogonal states.
The experiment was built on a custom-designed bulk optics analyser setup and single photons generated by a nearly deterministic solid-state source.
Our work paves the way for more complex applications and delivers a novel approach towards high-dimensional quantum encoding and decoding operations.
arXiv Detail & Related papers (2022-09-17T12:59:09Z) - Experimental multi-state quantum discrimination through a Quantum
network [63.1241529629348]
We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information.
The first protocol achieves binary optimal discrimination, while the second one provides a novel approach to multi-state quantum discrimination, relying on the dynamical features of the network-like receiver.
arXiv Detail & Related papers (2021-07-21T09:26:48Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - Analytical Bounds for Dynamic Multi-Channel Discrimination [0.0]
Optimal discrimination protocols often rely on entanglement shared between an incident probe and a protected idler-mode.
In this work, we investigate idler-free block protocols based on the use of multipartite entangled probe states.
We derive new, analytical bounds for the average error probability of such protocols in a bosonic Gaussian channel setting.
arXiv Detail & Related papers (2021-01-26T10:39:26Z) - 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) - 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) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z)
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.