Results 61 to 70 of about 96,137 (178)
, 2011 We introduce a general odd qubit entangled system composed of GHZ and Bell pairs and explicate its usefulness for quantum teleportation, information splitting and superdense coding.
Panigrahi, Prasanta K., Saha, Debashis
core +1 more source
Approximate quantum error correction, random codes, and quantum channel capacity [PDF]
, 2007 We work out a theory of approximate quantum error correction that allows us to derive a general lower bound for the entanglement fidelity of a quantum code. The lower bound is given in terms of Kraus operators of the quantum noise.
C. E. Shannon +7 more
core +2 more sources
Quantum Network Coding for General Graphs
, 2006 Network coding is often explained by using a small network model called Butterfly. In this network, there are two flow paths, s_1 to t_1 and s_2 to t_2, which share a single bottleneck channel of capacity one. So, if we consider conventional flow (of liquid, for instance), then the total amount of flow must be at most one in total, say 1/2 for each ...
Iwama, Kazuo +3 more
openaire +2 more sources
Optimality in Quantum Data Compression using Dynamical Entropy
, 2019 In this article we study lossless compression of strings of pure quantum states of indeterminate-length quantum codes which were introduced by Schumacher and Westmoreland.
Androulakis, George, Wright, Duncan
core +1 more source
, 2005 We present a general model for quantum channels with memory, and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time t do not depend on inputs at times t' > t can be decomposed into ...
A. S. Holevo +15 more
core +1 more source
Physical Review Physics Education Research[This paper is part of the Focused Collection in Investigating and Improving Quantum Education through Research.] The teaching and learning of quantum physics has recently become a topic of increasing interest in physics education research. In particular,
Philipp Bitzenbauer +4 more
doaj +1 more source
Computing quantum discord is NP-complete
, 2014 We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete.
Huang, Yichen
core +1 more source
Explaining Robust Quantum Metrology by Counting Codewords
IEEE Transactions on Quantum EngineeringQuantum sensing holds great promise for high-precision magnetic field measurements. However, its performance is significantly limited by noise. The investigation of active quantum error correction to address this noise led to the Hamiltonian-not-in ...
Oskar Novak, Narayanan Rengaswamy
doaj +1 more source
Coding theorems for hybrid channels. II [PDF]
, 2014 The present work continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in~\cite{HCT}.
Holevo, A. S., Kuznetsova, A. A.
core
Quantum Codes from Generalized Reed-Solomon Codes and Matrix-Product Codes
, 2015 One of the central tasks in quantum error-correction is to construct quantum codes that have good parameters. In this paper, we construct three new classes of quantum MDS codes from classical Hermitian self-orthogonal generalized Reed-Solomon codes. We also present some classes of quantum codes from matrix-product codes.
Zhang, Tao, Ge, Gennian
openaire +2 more sources