Soojoon Lee

Soojoon Lee
Are you Soojoon Lee?

Claim your profile, edit publications, add additional information:

Contact Details

Name
Soojoon Lee
Affiliation
Location

Pubs By Year

Pub Categories

 
Quantum Physics (34)
 
Mathematics - Mathematical Physics (1)
 
Mathematics - Group Theory (1)
 
Mathematical Physics (1)
 
Physics - Statistical Mechanics (1)
 
Computer Science - Information Theory (1)
 
Mathematics - Information Theory (1)

Publications Authored By Soojoon Lee

We show that the stability theorem of the depolarizing channel holds for the output quantum $p$-R\'enyi entropy for $p \ge 2$ or $p=1$, which is an extension of the well known case $p=2$. As an application, we present a protocol in which Bob determines whether Alice prepares a pure quantum state close to a product state. In the protocol, Alice transmits to Bob multiple copies of a pure state through a depolarizing channel, and Bob estimates its output quantum $p$-R\'enyi entropy. Read More

In this paper, we explicitly evaluate the one-shot quantum non-signalling assisted zero-error classical capacities $\M_0^{\mathrm{QNS}}$ for qubit channels. In particular, we show that for nonunital qubit channels, $\M_0^{\mathrm{QNS}}=1$, which implies that in the one-shot setting, nonunital qubit channels cannot transmit any information with zero probability of error even when assisted by quantum non-signalling correlations. Furthermore, we show that for qubit channels, $\M_0^{\mathrm{QNS}}$ equals to the one-shot entanglement-assisted zero-error classical capacities. Read More

We generalize the control power of a perfect controlled teleportation of an entangled three-qubit pure state, suggested by Li and Ghose [Phys. Rev. A {\bf 90}, 052305 (2014)], to the control power of a general controlled teleportation of a multiqubit pure state. Read More

We introduce the concentrated information of tripartite quantum states. For three parties Alice, Bob, and Charlie, it is defined as the maximal mutual information achievable between Alice and Charlie via local operations and classical communication performed by Charlie and Bob. We derive upper and lower bounds to the concentrated information, and obtain a closed expression for it on several classes of states including arbitrary pure tripartite states in the asymptotic setting. Read More

Even though a method to perfectly sign quantum messages has not been known, the arbitrated quantum signature scheme has been considered as one of good candidates. However, its forgery problem has been an obstacle to the scheme being a successful method. In this paper, we consider one situation, which is slightly different from the forgery problem, that we check whether at least one quantum message with signature can be forged in a given scheme, although all the messages cannot be forged. Read More

We investigate the distribution of bipartite and multipartite entanglement in multiqubit states. In particular we define a set of monogamy inequalities sharpening the conventional Coffman-Kundu-Wootters constraints, and we provide analytical proofs of their validity for relevant classes of states. We present extensive numerical evidence validating the conjectured strong monogamy inequalities for arbitrary pure states of four qubits. Read More

We characterize the algebraic structure of semi-direct product of cyclic groups, $\Z_{N}\rtimes\Z_{p}$, where $p$ is an odd prime number which does not divide $q-1$ for any prime factor $q$ of $N$, and provide a polynomial-time quantum computational algorithm solving hidden symmetry subgroup problem of the groups. Read More

Using the negativity as an entanglement measure, we investigate the possible amount of remotely prepared entanglement. For two identical isotropic states on two-qudit systems 12 and 34, we calculate the average amount of entanglement remotely distributed on the system 13 by joint measurement on the system 24, and show that the remote preparation of entanglement by the generalized Bell-measurement is optimal among rank-one measurements if the isotropic states have a certain fidelity with a maximally entangled state in higher dimensional quantum systems, or if the fidelity of the isotropic states is greater than a certain value depending on the dimension. In addition, we construct a measurement better than the generalized Bell-measurement with respect to the remote preparation of entanglement when the isotropic states have small fidelity. Read More

It was shown that two distant particles can be entangled by sending a third particle never entangled with the other two [T. S. Cubitt et al. Read More

We first define a quantity exhibiting the usefulness of bipartite quantum states for teleportation, called the quantum teleportation capability, and then investigate its restricted shareability in multi-party quantum systems. In this work, we verify that the quantum teleportation capability has a monogamous property in its shareability for arbitrary three-qutrit pure states by employing the monogamy inequality in terms of the negativity. Read More

We develop theories of entanglement distribution and of entanglement dynamics for qudit systems, which incorporate previous qubit formulations. Using convex-roof extended negativity, we generalize previous qubit results for entanglement distribution with isotropic states and for entanglement dynamics with the depolarizing channel, and we establish a relation between these two types of entanglement networks. Read More

Using the convex-roof extended negativity and the negativity of assistance as quantifications of bipartite entanglement, we consider the possible remotely-distributed entanglement. For two pure states $\ket{\phi}_{AB}$ and $\ket{\psi}_{CD}$ on bipartite systems $AB$ and $CD$, we first show that the possible amount of entanglement remotely distributed on the system $AC$ by joint measurement on the system $BD$ is not less than the product of two amounts of entanglement for the states $\ket{\phi}_{AB}$ and $\ket{\psi}_{CD}$ in two-qubit and two-qutrit systems. We also provide some sufficient conditions, for which the result can be generalized into higher-dimensional quantum systems. Read More

We study a relation between the concurrence of assistance and the Mermin inequality on three-qubit pure states. We find that if a given three-qubit pure state has the minimal concurrence of assistance greater than 1/2 then the state violates some Mermin inequality. Read More

The monogamy inequality in terms of the concurrence, called the Coffman-Kundu-Wootters inequality [Phys. Rev. A {\bf 61}, 052306 (2000)], and its generalization [T. Read More

Quantum bit commitment has been known to be impossible by the independent proofs of Mayers, and Lo and Chau, under the assumption that the whole quantum states right before the unveiling phase are static to users. We here provide an unconditionally secure non-static quantum bit commitment protocol with a trusted third party, which is not directly involved in any communications between users and can be limited not to get any information of commitment without being detected by users. We also prove that our quantum bit commitment protocol is not secure without the help of the trusted third party. Read More

We study the explicit relation between violation of Bell inequalities and bipartite distillability of multi-qubit states. It has been shown that even though for $N\ge 8$ there exist $N$-qubit bound entangled states which violates a Bell inequality [Phys. Rev. Read More

In this work, we investigate what kinds of quantum states are feasible to perform perfectly secure secret sharing, and present its necessary and sufficient conditions. We also show that the states are bipartite distillable for all bipartite splits, and hence the states could be distillable into the Greenberger-Horne-Zeilinger state. We finally exhibit a class of secret-sharing states, which have an arbitrarily small amount of bipartite distillable entanglement for a certain split. Read More

There is an interesting property about multipartite entanglement, called the monogamy of entanglement. The property can be shown by the monogamy inequality, called the Coffman-Kundu-Wootters inequality [Phys. Rev. Read More

We develop a three-party quantum secret sharing protocol based on arbitrary dimensional quantum states. In contrast to the previous quantum secret sharing protocols, the sender can always control the state, just using local operations, for adjusting the correlation of measurement directions of three parties and thus there is no waste of resource due to the discord between the directions. Moreover, our protocol contains the hidden value which enables the sender to leak no information of secret key to the dishonest receiver until the last steps of the procedure. Read More

In this paper, we consider teleportation capability, distillability, and nonlocality on three-qubit states. In order to investigate some relations among them, we first find the explicit formulas of the quantities about the maximal teleportation fidelity on three-qubit states. We show that if any three-qubit state is useful for three-qubit teleportation then the three-qubit state is distillable into a Greenberger-Horne-Zeilinger state, and that if any three-qubit state violates a specific form of Mermin inequality then the three-qubit state is useful for three-qubit teleportation. Read More

In this paper, we present sufficient conditions for states to have positive distillable key rate. Exploiting the conditions, we show that the bound entangled states given by Horodecki et al. [Phys. Read More

We consider the hidden subgroup problem on the semi-direct product of cyclic groups $\Z_{N}\rtimes\Z_{p}$ with some restriction on $N$ and $p$. By using the homomorphic properties, we present a class of semi-direct product groups in which the structures of subgroups can be easily classified. Furthermore, we show that there exists an efficient quantum algorithm for the hidden subgroup problem on the class. Read More

In this Letter, we construct the quantum algorithms for the Simon problem and the period-finding problem, which do not require initializing the auxiliary qubits involved in the process of functional evaluation but are as efficient as the original algorithms. In these quantum algorithms, one can use any arbitrarily mixed state as the auxiliary qubits, and furthermore can recover the state of the auxiliary qubits to the original one after completing the computations. Since the recovered state can be employed in any other computations, we obtain that a single preparation of the auxiliary qubits in an arbitrarily mixed state is sufficient to implement the iterative procedure in the Simon algorithm or the period-finding algorithm. Read More

We define an entanglement measure, called the partial tangle, which represents the residual two-qubit entanglement of a three-qubit pure state. By its explicit calculations for three-qubit pure states, we show that the partial tangle is closely related to the faithfulness of a teleportation scheme over a three-qubit pure state. Read More

We present a protocol for quantum cryptographic network consisting of a quantum network center and many users, in which any pair of parties with members chosen from the whole users on request can secure a quantum key distribution by help of the center. The protocol is based on the quantum authentication scheme given by Barnum et al. [Proc. Read More

We present a protocol in which two or more parties can share multipartite entanglement over noisy quantum channels. The protocol is based on the entanglement purification presented by Shor and Preskill [Phys. Rev. Read More

We extend the concept of the negativity, a good measure of entanglement for bipartite pure states, to mixed states by means of the convex-roof extension. We show that the measure does not increase under local quantum operations and classical communication, and derive explicit formulae for the entanglement measure of isotropic states and Werner states, applying the formalism presented by Vollbrecht and Werner [Phys. Rev. Read More

Extending the eavesdropping strategy devised by Zhang, Li and Guo [Phys. Rev. A 63, 036301 (2001)], we show that the multiparty quantum communication protocol based on entanglement swapping, which was proposed by Cabello [quant-ph/0009025], is not secure. Read More

We exhibit a two-parameter class of states $\rho_{(\alpha,\gamma)}$, in $2\otimes n$ quantum system for $n\ge 3$, which can be obtained from an arbitrary state by means of local quantum operations and classical communication, and which are invariant under all bilateral %unitary operations %of the form $U\otimes U$ on $2\otimes n$ quantum system. We calculate the negativity of $\rho_{(\alpha,\gamma)}$, and a lower bound and a tight upper bound on its entanglement of formation. It follows from this calculation that the entanglement of formation of $\rho_{(\alpha,\gamma)}$ cannot exceed its negativity. Read More

We construct a quantum algorithm that performs function-dependent phase transform and requires no initialization of an ancillary register. The algorithm recovers the initial state of an ancillary register regardless of whether its state is pure or mixed. Thus we can use any qubits as an ancillary register even though they are entangled with others and are occupied by other computational process. Read More

We generalize the Deutsch-Jozsa problem and present a quantum algorithm that can solve the generalized Deutsch-Jozsa problem by a single evaluation of a given function. We discuss the initialization of an auxiliary register and present a generalized Deutsch-Jozsa algorithm that requires no initialization of an auxiliary register. Read More

We present a quantum algorithm for the f-conditioned phase transform which does not require any initialization of ancillary register. We also develop a quantum algorithm that can solve the generalized Deutsch-Jozsa problem by a single evaluation of a function. Read More