Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Kluwer Academic Publishers eBooks

On Quantum Channel Capacity for Squeezed States

Masaki Sohma, Alexander Semenovich Holevo, Osamu Hirota

Published Dec 19, 2005• 2 citations
Publisher

Abstract

This paper presents the classical capacities of quantum Gaussian channels using squeezed states. The calculation is based on a general formula for the entropy of quantum Gaussian state. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

DOI
10.1007/0-306-47097-7_12

Related papers

Capacity of quantum Gaussian channels

Alexander Semenovich Holevo, Masaki Sohma, Osamu Hirota

The aim of this paper is to give explicit calculation of the classical capacity of quantum Gaussian channels, in particular, involving squeezed states. The calculation is based on a general formula for the entropy of a quantum Gaussian state, which is of independent interest, and on the recently proved coding theorem for quantum communication channels.

Physical Review A•Mar 1, 1999•313 citations

Quantum Gaussian channels

Alexander Semenovich Holevo, Osamu Hirota

The aim of this paper is explicit calculation of the classical capacity of quantum Gaussian channels, in particular, of those using squeezed states. The calculation is based on a general formula for the entropy of quantum Gaussian state, which is of independent interest, and on the recently proved coding theorem for quantum communication channels.

IEEE International Symposium on Information Theory (ISIT)•Nov 7, 2002•0 citations

Additivity/Multiplicativity Communication Channels

Grigori Gennadievich Amosov, Alexander Semenovich Holevo, Reinhard F. Werner

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the “classical capacity”, and the “maximal output purity”. All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Feb 24, 2006•0 citations

Gaussian Quantum Channels

Jens Eisert, Michael M. Wolf

This article provides an elementary introduction to Gaussian channels and their capacities. We review results on the classical, quantum, and entanglement assisted capacities and discuss related entropic quantities as well as additivity issues. Some of the known results are extended. In particular, it is shown that the quantum conditional entropy is maximized by Gaussian states and that some implications for additivity problems can be extended to the Gaussian setting.

arXiv:quant-ph/0505151•IMPERIAL COLLEGE PRESS eBooks•Feb 1, 2007•115 citations

Soliton Photon Number Squeezing: An Overview

Stephen R. Friberg, Michael J. Werner

Soliton photon number squeezing of more than 6 dB has recently been reported and reliable theoretical estimates suggest that squeezing of more than 10 dB is to be expected. Squeezing can be obtained either by spectral filtering or by using an unbalanced nonlinear optical loop mirror. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Dec 19, 2005•1 citation

On the classical capacity of quantum Gaussian channels

Cosmo Lupo, Stefano Pirandola, Paolo Aniello +1 more

The set of quantum Gaussian channels acting on one bosonic mode can be classified according to the action of the group of Gaussian unitaries. We look for bounds on the classical capacity for channels belonging to such a classification. Lower bounds can be efficiently calculated by restricting to Gaussian encodings, for which we provide analytical expressions.

arXiv:1012.5965•Physica Scripta•Feb 1, 2011•21 citations
This paper presents the classical capacities of quantum Gaussian channels using squeezed states. The calculation is based on a general formula for the entropy of quantum Gaussian state. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the “classical capacity”, and the “maximal output purity”. All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.