Share This Author
Methodology for quantum logic gate construction
We present a general method to construct fault-tolerant quantum logic gates with a simple primitive, which is an analog of quantum teleportation. The technique extends previous results based on…
Randomizing Quantum States: Constructions and Applications
It is shown 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 d2 operators required to randomize perfectly.
Aspects of Generic Entanglement
We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the ``concentration…
The entanglement of purification
We introduce a measure of both quantum as well as classical correlations in a quantum state, the entanglement of purification. We show that the (regularized) entanglement of purification is equal to…
Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
This paper provides a precise description of LOCC and related operational classes in terms of quantum instruments that captures both finite round protocols as well as those that utilize an unbounded number of communication rounds.
The Universal Composable Security of Quantum Key Distribution
- M. Ben-Or, M. Horodecki, D. Leung, D. Mayers, J. Oppenheim
- Computer Science, MathematicsTCC
- 14 September 2004
A universal composability theorem for the quantum setting is derived that shows that keys generated by repeated runs of QKD degrade slowly and can indeed be safely used, a property ofQKD that is hitherto unproven.
Quantum data hiding
It is proved that the information that Alice and Bob can gain about a hidden bit is exponentially small in n, the number of qubits in each share, and can be made arbitrarily small for hiding multiple bits.
On the capacities of bipartite Hamiltonians and unitary gates
This work investigates the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information and shows that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities.
Approximate quantum error correction can lead to better codes
We present relaxed criteria for quantum error correction that are useful when the specific dominant quantum noise process is known. As an example, we provide a four-bit code that corrects for a…
On the Power of PPT-Preserving and Non-Signalling Codes
It is found that codes that are non-signalling and PPT-preserving can be strictly less powerful than codes satisfying either one of the constraints, and therefore provide a tighter bound for unassisted codes.