Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
From MaRDI portal
Publication:4832727
DOI10.1063/1.1498489zbMath1060.94005arXivquant-ph/0108066OpenAlexW2036635430WikidataQ57522550 ScholiaQ57522550MaRDI QIDQ4832727
Publication date: 14 December 2004
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0108066
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Optimal super dense coding over noisy quantum channels ⋮ Every entangled state provides an advantage in classical communication ⋮ DENSE CODING WITH MULTIPARTITE QUANTUM STATES
Cites Work
- Unnamed Item
- Unnamed Item
- Completely positive maps and entropy inequalities
- Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory
- Optimal dense coding with mixed state entanglement
- All teleportation and dense coding schemes
- Quantum computational networks
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum coding theorems
- Quantum Complexity Theory
- The capacity of the quantum channel with general signal states
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Programmable Quantum Gate Arrays
- Operator monotones, the reduction criterion and the relative entropy
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- The capacity of the quantum depolarizing channel
- Additivity of the classical capacity of entanglement-breaking quantum channels
- Additivity for unital qubit channels
- Universality in quantum computation
- A universal two-bit gate for quantum computation
This page was built for publication: Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
