The ability to precisely discriminate multiple quantum channels is fundamental to achieving quantum enhancements in data-readout, target detection, pattern recognition, and more. Optimal discrimination protocols often rely on entanglement shared between an incident probe and a protected idler-mode. While these protocols can be highly advantageous over classical ones, the storage of idler-modes is extremely challenging in practice. In this work, we investigate idler-free block protocols based on the use of multipartite entangled probe states. In particular, we focus on a class of idler-free protocol which uses nondisjoint distributions of multipartite probe states irradiated over multichannels, known as dynamic discrimination protocols. We derive analytical bounds for the average error probability of such protocols in a bosonic Gaussian channel setting, revealing idler-free strategies that display performance close to idler-assistance for powerful, near-term quantum sensing applications.
The ability to precisely discriminate multiple quantum channels is fundamental to achieving quantum enhancements in data-readout, target detection, pattern recognition, and more. Optimal discrimination protocols often rely on entanglement shared between an incident probe and a protected idler-mode. While these protocols can be highly advantageous over classical ones, the storage of idler-modes is extremely challenging in practice. In this work, we investigate idler-free block protocols based on the use of multipartite entangled probe states. In particular, we focus on a class of idler-free protocol which uses nondisjoint distributions of multipartite probe states irradiated over multichannels, known as dynamic discrimination protocols. We derive analytical bounds for the average error probability of such protocols in a bosonic Gaussian channel setting, revealing idler-free strategies that display performance close to idler-assistance for powerful, near-term quantum sensing applications.
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. Although 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.
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.
From the perspective of quantum information theory, the effect of Unruh radiation on a two-level accelerated detector can be modeled as a quantum channel. In this work we employ the tools of channel-position finding to locate Unruh channels. The signal-idler and idler-free protocols are explored to determine the position of the target Unruh channel within a sequence of background channels. We derive the fidelity-based bounds for the ultimate error probability of each strategy and obtain the conditions where the signal-idler protocol is superior to the protocol involving idler-free states. It is found that the lower bound of the error probability for the signal-idler scheme exhibits clear advantages in all cases, while the idler-free scheme can only be implemented when the temperatures of the two channels are very close and the number of initial states is insufficient. Interestingly, it is shown that the optimal detection protocol relies on the residual correlations shared between the emitted probe state and the retained idler modes.
Discriminating between noisy quantum processes is a central primitive for quantum communication, metrology, and computing. While discrimination limits for finite-dimensional channels are well understood, the continuous-variable setting, particularly under experimentally relevant energy constraints, remains significantly less developed. In this work, we establish an energy-constrained chain rule for the Belavkin-Staszewski channel divergence, which yields a fundamental upper bound on the error exponents achievable by fully adaptive, energy-constrained quantum channel discrimination protocols. We then derive efficiently computable bounds on asymmetric error exponents for energy-constrained discrimination of bosonic dephasing and loss-dephasing channels. Specifically, we show that three operationally relevant quantities -- the measured relative entropy, the Umegaki relative entropy, and the geometric Renyi divergence -- admit semidefinite program (SDP) formulations when the input energy is bounded and the Hilbert space is suitably truncated. Applying these tools, we demonstrate that optimal probes for these channels under energy constraints are Fock-diagonal, and we also enable numerically precise evaluation of bounds on achievable error exponents across discrimination strategies ranging from separable to fully adaptive. The resulting SDPs provide practical benchmarks for quantum-limited sensing in low-energy bosonic platforms.
Entanglement is a powerful tool for quantum sensing, and entangled states can greatly boost the discriminative power of protocols for quantum illumination, quantum metrology, or quantum reading. However, entangled state protocols generally require the retention of an idler state, to which the probes are entangled. Storing a quantum state is difficult and so technological limitations can make protocols requiring quantum memories impracticable. One alternative is idler-free protocols that utilize nonclassical sources but do not require any idler states to be stored. Here we apply such a protocol to the task of channel position finding. This involves finding a target channel in a sequence of background channels, and has many applications, including quantum sensing, quantum spectroscopy, and quantum reading.
Quantum channel discrimination is a fundamental task in quantum information processing. In the one-shot regime, discrimination between two candidate channels is characterized by the diamond norm. Beyond this basic setting, however, many scenarios in distributed quantum information processing remain unresolved, motivating notions of distinguishability that capture the power of the available resources. In this work, we formulate a theory of testers for bipartite channel discrimination, leading to the concept of the entanglement cost of bipartite channel discrimination: the minimum Schmidt rank k of a shared maximally entangled state required for local protocols to achieve the globally optimal success probability. We introduce k-injectable testers as a tester-based description of entanglement-assisted local discrimination and, in particular, study the class of k-injectable positive-partial-transpose (PPT) testers, which constitutes a numerically tractable relaxation of the practically relevant class of LOCC testers.
For every k, we derive a semidefinite program (SDP) for the optimal success probability, which in turn yields an efficiently computable one-shot PPT entanglement cost. To render these optimization problems numerically feasible, we prove a symmetry-reduction principle for covariant channel pairs, thereby reducing the effective dimension of the associated SDPs. Finally, by dualizing the SDP, we derive bounds on the composite channel-discrimination problem and illustrate our framework with proof-of-principle examples based on the depolarizing channel, the depolarized SWAP channel, and the Werner--Holevo channels.