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

CRC Press eBooks

Characterization of Quantum Information

Published Jul 21, 2015• 0 citations
Publisher
DOI
10.1201/b18767-16

Related papers

Characterization of Quantum Information

Radhika Vathsan

CRC Press eBooks•Aug 24, 2015•0 citations

Improved characterization of quantum states for quantum information

Miller Eaton

•Mar 4, 2020•0 citations

Capacity theorems for quantum multiple access channels

Jon Yard, I. Devetak, Patrick M. Hayden

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is possible for one sender to send classical information while the other sends quantum information. The second region gives the rates at which each sender can send quantum information. We give an example of a channel for which each region has a single-letter description, concluding with a characterization of the rates at which each user can simultaneously send classical and quantum information

arXiv:cs/0508031•IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•17 citations

Modeling Quantum Information

Marco Tomamichel

SpringerBriefs in mathematical physics•Oct 8, 2015•3 citations

Towards Scalable Characterization of Noisy, Intermediate-Scale Quantum Information Processors

Travis L. Scholten

In recent years, quantum information processors (QIPs) have grown from one or two qubits to tens of qubits. As a result, characterizing QIPs – measuring how well they work, and how they fail – has become much more challenging. The obstacles to characterizing today’s QIPs will grow even more difficult as QIPs grow from tens of qubits to hundreds, and enter what has been called the “noisy, intermediate-scale quantum” (NISQ) era. This thesis develops methods based on advanced statistics and machine learning algorithms to address the difficulties of “quantum character- ization, validation, and verification” (QCVV) of NISQ processors. In the first part of this thesis, I use statistical model selection to develop techniques for choosing between several models for a QIPs behavior. In the second part, I deploy machine learning algorithms to develop a new QCVV technique and to do experiment design. These investigations help lay a foundation for extending QCVV to characterize the next generation of NISQ processors.

•Jan 1, 2018•0 citations

Spread quantum information in one-shot quantum state merging

Hayata Yamasaki, Mio Murao

We prove the difference between the minimal entanglement costs in quantum state merging under one-way and two-way communication in a one-shot scenario, whereas they have been known to coincide asymptotically. While the minimal entanglement cost in state merging under one-way communication is conventionally interpreted to characterize partial quantum information conditioned by quantum side information, we introduce a notion of spread quantum information evaluated by the corresponding cost under two-way communication. Spread quantum information quantitatively characterizes how nonlocally one-shot quantum information is spread, and it cannot be interpreted as partial quantum information.

arXiv:1903.03619•Mar 8, 2019•3 citations
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is possible for one sender to send classical information while the other sends quantum information. The second region gives the rates at which each sender can send quantum information. We give an example of a channel for which each region has a single-letter description, concluding with a characterization of the rates at which each user can simultaneously send classical and quantum information
In recent years, quantum information processors (QIPs) have grown from one or two qubits to tens of qubits. As a result, characterizing QIPs – measuring how well they work, and how they fail – has become much more challenging. The obstacles to characterizing today’s QIPs will grow even more difficult as QIPs grow from tens of qubits to hundreds, and enter what has been called the “noisy, intermediate-scale quantum” (NISQ) era. This thesis develops methods based on advanced statistics and machine learning algorithms to address the difficulties of “quantum character- ization, validation, and verification” (QCVV) of NISQ processors. In the first part of this thesis, I use statistical model selection to develop techniques for choosing between several models for a QIPs behavior. In the second part, I deploy machine learning algorithms to develop a new QCVV technique and to do experiment design. These investigations help lay a foundation for extending QCVV to characterize the next generation of NISQ processors.
We prove the difference between the minimal entanglement costs in quantum state merging under one-way and two-way communication in a one-shot scenario, whereas they have been known to coincide asymptotically. While the minimal entanglement cost in state merging under one-way communication is conventionally interpreted to characterize partial quantum information conditioned by quantum side information, we introduce a notion of spread quantum information evaluated by the corresponding cost under two-way communication. Spread quantum information quantitatively characterizes how nonlocally one-shot quantum information is spread, and it cannot be interpreted as partial quantum information.