English
Related papers

Related papers: On Random Unitary Channels

200 papers

We consider joint detection of co-channel signals---specifically, signals which do not possess a natural separability due to, for example, the multiple access technique or the use of multiple antennas. Iterative joint detection and decoding…

Information Theory · Computer Science 2015-08-17 Daniel J. Jakubisin , R. Michael Buehrer

We consider the problem of universal decoding for arbitrary unknown channels in the random coding regime. For a given random coding distribution and a given class of metric decoders, we propose a generic universal decoder whose average…

Information Theory · Computer Science 2016-11-17 Neri Merhav

Computed Tomography (CT) based precise prostate segmentation for treatment planning is challenging due to (1) the unclear boundary of the prostate derived from CT's poor soft tissue contrast and (2) the limitation of convolutional neural…

Image and Video Processing · Electrical Eng. & Systems 2023-07-20 Chengyin Li , Yao Qiang , Rafi Ibn Sultan , Hassan Bagher-Ebadian , Prashant Khanduri , Indrin J. Chetty , Dongxiao Zhu

Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc.…

Quantum Physics · Physics 2013-04-25 K. Audenaert , B. De Moor

We analyze convex combinations of non-unital qubit maps that are phase-covariant. In particular, we consider the behavior of maps that combine amplitude damping, inverse amplitude damping, and pure dephasing. We show that mixing non-unital…

Quantum Physics · Physics 2022-10-05 Katarzyna Siudzińska

Positive maps are useful for detecting entanglement in quantum information theory. Any entangled state can be detected by some positive map. In this paper, the relation between positive block matrices and completely positive…

Mathematical Physics · Physics 2013-06-14 Yu Guo , Heng Fan

In the classical context of robotic mapping and localization, map matching is typically defined as the task of finding a rigid transformation (i.e., 3DOF rotation/translation on the 2D moving plane) that aligns the query and reference maps…

Robotics · Computer Science 2016-09-09 Kanji Tanaka

We present a method to detect properties of quantum channels, assuming that some a priori information about the form of the channel is available. The method is based on a correspondence with entanglement detection methods for multipartite…

Quantum Physics · Physics 2013-11-13 C. Macchiavello , M. Rossi

A criterion and necessary conditions for convergence (local continuity) of the quantum relative entropy are obtained. Some applications of these results are considered. In particular, the preservation of local continuity of the quantum…

Quantum Physics · Physics 2023-07-14 M. E. Shirokov

In this paper, we revisit the computation of controlled invariant sets for linear discrete-time systems through a trajectory-based viewpoint. We begin by introducing the notion of convex feasible points, which provides a new…

Optimization and Control · Mathematics 2026-05-06 Emmanuel Junior Wafo Wembe , Adnane Saoud

The coherent control of wave absorption has important applications in areas such as energy harvesting, imaging, and sensing. However, most practical scenarios involve the absorption of partially coherent rather than fully coherent waves.…

Optics · Physics 2024-08-13 Cheng Guo , Shanhui Fan

Conformal Prediction (CP) is a principled framework for quantifying uncertainty in blackbox learning models, by constructing prediction sets with finite-sample coverage guarantees. Traditional approaches rely on scalar nonconformity scores,…

Machine Learning · Statistics 2025-05-07 Gauthier Thurin , Kimia Nadjahi , Claire Boyer

We investigate the set a) of positive, trace preserving maps acting on density matrices of size N, and a sequence of its nested subsets: the sets of maps which are b) decomposable, c) completely positive, d) extended by identity impose…

Quantum Physics · Physics 2009-11-13 Stanislaw J. Szarek , Elisabeth Werner , Karol Zyczkowski

It is shown that a trace invariant projection map, i.e. a positive unital idempotent map, of a finite dimensional C*-algebra into itself is non-decomposable if and only if it is atomic, or equivalently not the sum of a 2-positive and a…

Operator Algebras · Mathematics 2009-04-02 Erling Stormer

We show that in principle, $N$-partite unitary transformations can be perfectly discriminated under local measurement and classical communication (LOCC) despite of their nonlocal properties. Based on this result, some related topics,…

Quantum Physics · Physics 2009-11-13 Xiangfa Zhou , Yongsheng Zhang , Guangcan Guo

In this work we examine quantum states which have non-negative amplitudes (in a fixed basis) and the channels which preserve them. These states include the ground states of stoquastic Hamiltonians and they are of interest since they avoid…

Quantum Physics · Physics 2022-09-08 Nathaniel Johnston , Jamie Sikora

The convex set of quantum states of a composite $K \times K$ system with positive partial transpose is analysed. A version of the hit and run algorithm is used to generate a sequence of random points covering this set uniformly and an…

Quantum Physics · Physics 2019-02-27 Konrad Szymański , Benoît Collins , Tomasz Szarek , Karol Życzkowski

We introduce a general technique for proving estimates for certain random planar maps which belong to the $\gamma$-Liouville quantum gravity (LQG) universality class for $\gamma \in (0,2)$. The family of random planar maps we consider are…

Probability · Mathematics 2020-03-12 Ewain Gwynne , Nina Holden , Xin Sun

Transforms using random matrices have been found to have many applications. We are concerned with the projection of a signal onto Gaussian-distributed random orthogonal bases. We also would like to easily invert the process through…

Signal Processing · Electrical Eng. & Systems 2021-06-22 Ricardo L. de Queiroz

In this paper, we consider classic randomized low diameter decomposition procedures for planar graphs that obtain connected clusters which are cohesive in that close-by pairs of nodes are assigned to the same cluster with high probability.…

Data Structures and Algorithms · Computer Science 2024-06-04 Kamesh Munagala , Govind S. Sankar