PH
Patrick M. Hayden
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
2 records found
1
Journal article
(2003)
-
David P. DiVincenzo, Patrick Hayden, Barbara M. Terhal
Recent work has shown how to use the laws of quantum mechanics to keep classical and quantum bits secret in a number of different circumstances. Among the examples are private quantum channels, quantum secret sharing and quantum data hiding. In this paper we show that a method for keeping two classical bits hidden in any such scenario can be used to construct a method for keeping one quantum bit hidden, and vice-versa. In the realm of quantum data hiding, this allows us to construct bipartite and multipartite hiding schemes for qubits from the previously known constructions for hiding bits.
...
Recent work has shown how to use the laws of quantum mechanics to keep classical and quantum bits secret in a number of different circumstances. Among the examples are private quantum channels, quantum secret sharing and quantum data hiding. In this paper we show that a method for keeping two classical bits hidden in any such scenario can be used to construct a method for keeping one quantum bit hidden, and vice-versa. In the realm of quantum data hiding, this allows us to construct bipartite and multipartite hiding schemes for qubits from the previously known constructions for hiding bits.
Journal article
(2001)
-
Patrick M. Hayden, Michał Horodecki, Barbara M. Terhal
We give a detailed proof of the conjecture that the asymptotic entanglement cost of preparing a state ρ is equal to limn→∞ E f (ρ⊗n)/n where E f is the entanglement of formation.
...
We give a detailed proof of the conjecture that the asymptotic entanglement cost of preparing a state ρ is equal to limn→∞ E f (ρ⊗n)/n where E f is the entanglement of formation.