Learn More
The impossibility of perfect cloning and state estimation are two fundamental results in quantum mechanics. It has been conjectured that quantum cloning becomes equivalent to state estimation in the asymptotic regime where the number of clones tends to infinity. We prove this conjecture using two known results of quantum information theory: the monogamy of(More)
We study the secrecy properties of Gaussian states under Gaussian operations. Although such operations are useless for quantum distillation, we prove that it is possible to distill a secret key secure against any attack from sufficiently entangled Gaussian states with nonpositive partial transposition. Moreover, all such states allow for key distillation,(More)
We provide a general framework of utilizing the no-signaling principle in derivation of the guessing probability in the minimum-error quantum state discrimination. We show that, remarkably, the guessing probability can be determined by the no-signaling principle. This is shown by proving that, in the semidefinite programing for the discrimination, the(More)
We report the first experimental realization of an approximate partial transpose for photonic two-qubit systems. The proposed scheme is based on the local operation on single copies of quantum states and classical communication, and therefore can be easily applied for other quantum information tasks within current technologies. Direct detection of(More)
Distinguishability is a fundamental and operational measure generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and also characterises capabilities of related information tasks. In this work, we consider discrimination between(More)
There are hamiltonians that solve a search problem of finding one of N items in O(√ N) steps. They are hamiltonians to describe an oscillation between two states. In this paper we propose a generalized search hamil-tonian, Hg. Then the known search hamiltonians become special cases of Hg. From the generalized search hamiltonian, we present remarkable(More)
In this work, we show the operational characterization to the divisibility of dynamical maps in terms of the distinguishability of quantum channels. It is proven that the distinguishability of any pair of quantum channels does not increase under divisible maps, in which the full hierarchy of divisibility is isomorphic to the structure of entanglement(More)
We consider optimal state discrimination in a general convex operational framework, so-called generalized probabilistic theories (GPTs), and present a general method of optimal discrimination by applying the complementarity problem from convex optimization. The method exploits the convex geometry of states but not other detailed conditions or relations of(More)
Farhi et al. suggested the analogue quantum search Hamiltonian and Fenner also proposed the intuitive quantum search Hamiltonian. Recently the generalized quantum search Hamiltonian containning hamiltonians of Farhi et al. and Fenner was presented in quant-ph/0110020. In this letter, we analyze the running time of the generalized quantum search Hamiltonian.(More)