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

Quantum Information Processing

Projection methods for quantum channel construction

Dmitriy Drusvyatskiy, Chi-Kwong Li, Diane Christine Pelejo, Yuen-Lam Voronin, Henry Wolkowicz

Published May 22, 2015• 9 citations
Publisher
DOI
10.1007/s11128-015-1024-y

Related papers

Construction of quantum states with special properties by projection methods

Xuefeng Duan, Chi-Kwong Li, Diane Christine Pelejo

arXiv:1604.08289•Quantum Information Processing•Nov 1, 2020•1 citation

Methods of Constructing Quantum Channels for Teleporting a General Two-qubit State

Xiu-Lao Tian, Ming‐Liang Hu, Xiao-Qiang Xi

International Journal of Theoretical Physics•May 27, 2009•5 citations

A construction method of quantum low density parity check code based on projective geometry

Shengmei Zhao, Xiu-Li Zhu, Guo-Jun Sun

With the development of quantum error correction techniques, many counterparts of classical error correction coding techniques have been found in quantum area. As the quantum counterpart of a good error correction code in classical communications, quantum low density parity check code becomes a promising coding technique in quantum error correction area. In this paper, a construction method of quantum low density parity check code (quantum LDPC) based on Projective Geometry is proposed, and the quantum code QLDPC [21,6] is selected as an example to illustrate the whole construction procedures. By numerical simulation, the error correction performance of QLDPC [21,6] is discussed over the bit-flipping channel. It is shown that this method is available and has some advantages.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2009•1 citation

A Decoupling Approach to the Quantum Capacity

Patrick M. Hayden, Michał Horodecki, Andreas Winter +1 more

We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective measurement on a typical subspace of a tensor power state. We show that, provided the rank of each measurement operator is sufficiently small, the transmitted data will, with high probability, be decoupled from the channel environment. We also show that our construction leads to random codes whose average input is close to a product state and outline a modification yielding unitarily invariant ensembles of maximally entangled codes.

arXiv:quant-ph/0702005•Open Systems & Information Dynamics•Mar 1, 2008•169 citations

Optimal Representation of Quantum Channels

Paulina Lewandowska, Ryszard Kukulski, Łukasz Pawela

arXiv:2002.05507•Lecture notes in computer science•Jan 1, 2020•2 citations

Numerical Methods in Quantum Propagation

Robert Hammerling, J. Kamleitner, Othmar Koch

•Jan 1, 2010•1 citation
With the development of quantum error correction techniques, many counterparts of classical error correction coding techniques have been found in quantum area. As the quantum counterpart of a good error correction code in classical communications, quantum low density parity check code becomes a promising coding technique in quantum error correction area. In this paper, a construction method of quantum low density parity check code (quantum LDPC) based on Projective Geometry is proposed, and the quantum code QLDPC [21,6] is selected as an example to illustrate the whole construction procedures. By numerical simulation, the error correction performance of QLDPC [21,6] is discussed over the bit-flipping channel. It is shown that this method is available and has some advantages.
We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective measurement on a typical subspace of a tensor power state. We show that, provided the rank of each measurement operator is sufficiently small, the transmitted data will, with high probability, be decoupled from the channel environment. We also show that our construction leads to random codes whose average input is close to a product state and outline a modification yielding unitarily invariant ensembles of maximally entangled codes.