Searcharxiv⌕ Search

arXiv subjects

Debbie Leung

Publications and source records attributed to Debbie Leung.

62 records · Page 4Linked to original sources

Typical entanglement of stabilizer states

How entangled is a randomly chosen bipartite stabilizer state? We show that if the number of qubits each party holds is large the state will be close to maximally entangled with probability exponentially close to one. We provide a similar tight characterization of the entanglement present in the maximally mixed state of a randomly chosen stabilizer code. Finally, we show that typically very few GHZ states can be extracted from a random multipartite stabilizer state via local unitary operations. Our main tool is a new concentration inequality which bounds deviations from the mean of random variables which are naturally defined on the Clifford group.

quant-ph↗

Quantum key distribution based on arbitrarily-weak distillable entangled states

States with private correlations but little or no distillable entanglement were recently reported. Here, we consider the secure distribution of such states, i.e., the situation when an adversary gives two parties such states and they have to verify privacy. We present a protocol which enables the parties to extract from such untrusted states an arbitrarily long and secure key, even though the amount of distillable entanglement of the untrusted states can be arbitrarily small.

quant-ph↗

Multiparty data hiding of quantum information

We present protocols for multiparty data hiding of quantum information that implement all possible threshold access structures. Closely related to secret sharing, data hiding has a more demanding security requirement: that the data remain secure against unrestricted LOCC attacks. In the limit of hiding a large amount of data, our protocols achieve an asymptotic rate of one hidden qubit per local physical qubit. That is, each party holds a share that is the same size as the hidden state to leading order, with accuracy and security parameters incurring an overhead that is asymptotically negligible. The data hiding states have very unusual entanglement properties, which we briefly discuss.

quant-ph↗

Randomizing quantum states: Constructions and applications

The construction of a perfectly secure private quantum channel in dimension d is known to require 2 log d shared random key bits between the sender and receiver. We show that if only near-perfect security is required, the size of the key can be reduced by a factor of two. More specifically, we show that there exists a set of roughly d log d unitary operators whose average effect on every input pure state is almost perfectly randomizing, as compared to the d^2 operators required to randomize perfectly. Aside from the private quantum channel, variations of this construction can be applied to many other tasks in quantum information processing. We show, for instance, that it can be used to construct LOCC data hiding schemes for bits and qubits that are much more efficient than any others known, allowing roughly log d qubits to be hidden in 2 log d qubits. The method can also be used to exhibit the existence of quantum states with locked classical correlations, an arbitrarily large amplification of the correlation being accomplished by sending a negligibly small classical key. Our construction also provides the basic building block for a method of remotely preparing arbitrary d-dimensional pure quantum states using approximately log d bits of communication and log d ebits of entanglement.

quant-ph↗

Superdense coding of quantum states

We describe a method to non-obliviously communicate a 2l-qubit quantum state by physically transmitting l+o(l) qubits of communication, and by consuming l ebits of entanglement and some shared random bits. In the non-oblivious scenario, the sender has a classical description of the state to be communicated. Our method can be used to communicate states that are pure or entangled with the sender's system; l+o(l) and 3l+o(l) shared random bits are sufficient respectively.

quant-ph↗

Locking classical correlation in quantum states

We show that there exist bipartite quantum states which contain large hidden classical correlation that can be unlocked by a disproportionately small amount of classical communication. In particular, there are $(2n+1)$-qubit states for which a one bit message doubles the optimal classical mutual information between measurement results on the subsystems, from $n/2$ bits to $n$ bits. States exhibiting this behavior need not be entangled. We study the range of states exhibiting this phenomenon and bound its magnitude.

quant-ph↗

Classical capacity of a noiseless quantum channel assisted by noisy entanglement

We derive the general formula for the capacity of a noiseless quantum channel assisted by an arbitrary amount of noisy entanglement. In this capacity formula, the ratio of the quantum mutual information and the von Neumann entropy of the sender's share of the noisy entanglement plays the role of mutual information in the completely classical case. A consequence of our results is that bound entangled states cannot increase the capacity of a noiseless quantum channel.

quant-ph↗

Experimental Realization of A Two Bit Phase Damping Quantum Code

Using nuclear magnetic resonance techniques, we experimentally investigated the effects of applying a two bit phase error detection code to preserve quantum information in nuclear spin systems. Input states were stored with and without coding, and the resulting output states were compared with the originals and with each other. The theoretically expected result, net reduction of distortion and conditional error probabilities to second order, was indeed observed, despite imperfect coding operations which increased the error probabilities by approximately 5%. Systematic study of the deviations from the ideal behavior provided quantitative measures of different sources of error, and good agreement was found with a numerical model. Theoretical questions in quantum error correction in bulk nuclear spin systems including fidelity measures, signal strength and syndrome measurements are discussed.

quant-ph↗