English
Related papers

Related papers: Qubit Channels Can Require More Than Two Inputs to…

200 papers

We examine the possible states of subsystems of a system of bits or qubits. In the classical case (bits), this means the possible marginal distributions of a probability distribution on a finite number of binary variables; we give necessary…

Quantum Physics · Physics 2015-06-26 Paul Butterley , Anthony Sudbery , Jason Szulc

It is easy to show coincidence of the entanglement-assisted classical capacity and the Holevo capacity for any c-q channel between finite dimensional quantum systems. In this paper we prove the converse assertion: coincidence of the…

Quantum Physics · Physics 2012-07-24 M. E. Shirokov

Three-dimensional integration technologies such as flip-chip bonding are a key prerequisite to realize large-scale superconducting quantum processors. Modular architectures, in which circuit elements are spread over multiple chips, can…

The necessary and sufficient condition of the channel capacity is rigorously formulated for the N-user discrete memoryless multiple-access channel (MAC). The essence of the formulation is to invoke an {\em elementary} MAC where sizes of…

Information Theory · Computer Science 2007-08-09 Yoichiro Watanabe , Koichi Kamoi

A general quantum noisy channel is analyzed, wherein the transmitted qubits may experience symmetry-breaking decoherence, along with memory effects. We find the optimal basis not to be fully entangled, but a combination of factorized and…

Quantum Physics · Physics 2015-05-13 Goren Gordon , Gershon Kurizki

The capacity of a Multiple-Input Multiple-Output (MIMO) channel in which the antenna outputs are processed by an analog linear combining network and quantized by a set of threshold quantizers is studied. The linear combining weights and…

Information Theory · Computer Science 2018-06-06 Abbas Khalili , Stefano Rini , Luca Barletta , Elza Erkip , Yonina C. Eldar

A Holevo measure is used to discuss how much information about a given POVM on system $a$ is present in another system $b$, and how this influences the presence or absence of information about a different POVM on $a$ in a third system $c$.…

Quantum Physics · Physics 2013-05-29 Patrick J. Coles , Li Yu , Vlad Gheorghiu , Robert B. Griffiths

Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…

Quantum Physics · Physics 2024-08-01 Joseph Peetz , Scott E. Smart , Prineha Narang

We discuss the capacity of quantum channels for information transmission and storage. Quantum channels have dual uses: they can be used to transmit known quantum states which code for classical information, and they can be used in a purely…

Quantum Physics · Physics 2008-12-18 C. Adami , N. J. Cerf

The well-known duality relating entangled states and noisy quantum channels is expressed in terms of a channel ket, a pure state on a suitable tripartite system, which functions as a pre-probability allowing the calculation of statistical…

Quantum Physics · Physics 2009-11-10 Robert B. Griffiths

Qubits based on the singlet (S) and the triplet (T0, T+) states in double quantum dots have been demonstrated in separate experiments. It has been recently proposed theoretically that under certain conditions a quantum interference could…

Mesoscale and Nanoscale Physics · Physics 2012-01-19 S. A. Studenikin , G. C. Aers , G. Granger , L. Gaudreau , A. Kam , P. Zawadzki , Z. R. Wasilewski , A. S. Sachrajda

In a multi-access channel, completion time refers to the number of channel uses required for users, each with some given fixed bit pool, to complete the transmission of all their data bits. In this paper, the characterization of the…

Information Theory · Computer Science 2011-09-27 Yuanpeng Liu , Elza Erkip

We pose a problem called ``broadcasting Holevo-information'': given an unknown state taken from an ensemble, the task is to generate a bipartite state transfering as much Holevo-information to each copy as possible. We argue that upper…

Quantum Physics · Physics 2013-05-29 Dominik Janzing , Bastian Steudel

We show that it is possible to achieve maximally entangled mixed states of two qubits from the singlet state via the action of local non-trace-preserving quantum channels. Moreover, we present a simple, feasible linear optical…

Quantum Physics · Physics 2007-05-23 A. Aiello , G. Puentes , D. Voigt , J. P. Woerdman

This paper is devoted to systematic study of properties of the quantum entropy and of the Holevo capacity considered as a function of a set of quantum states. The properties of restriction of the quantum entropy to arbitrary set of states…

Quantum Physics · Physics 2015-06-26 M. E. Shirokov

We introduce a class of quantum channels with correlations acting on pairs of qubits, where the correlation takes the form of a shift operator onto a maximally entangled state. We optimise the output purity and show that below a certain…

Quantum Physics · Physics 2008-05-19 Filippo Caruso , Vittorio Giovannetti , Chiara Macchiavello , Mary Beth Ruskai

We present an experimental method to detect lower bounds to the quantum capacity of two-qubit communication channels. We consider an implementation with polarisation degrees of freedom of two photons and report on the efficiency of such a…

We consider two kind of energy constraints when the output state is a coherent state. One is a constraint on the total energy during a fixed period; the other is a constraint on the total energy for a single code. The first setting can be…

Quantum Physics · Physics 2011-06-24 Masahito Hayashi

Qudits with a large Hilbert space to host quantum information are widely utilized in various applications, such as quantum simulation and quantum computation, but the manipulation and scalability of qudits still face challenges. Here, we…

Quantum Physics · Physics 2023-02-23 Si-Wu Li , Tianfeng Feng , Xiao-Long Hu , Ze-Liang Xiang , Xiaoqi Zhou

Every channel can be expressed as a convex combination of deterministic channels with each deterministic channel corresponding to one particular intrinsic state. Such convex combinations are in general not unique, each giving rise to a…

Information Theory · Computer Science 2020-04-28 Shengtian Yang , Rui Xu , Jun Chen , Jian-Kang Zhang