Search

Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm proposed with the goal of approximately solving combinatorial optimization problems such as the MAX-CUT problem. It has been considered a potential candidate for achieving quantum advantage in the Noisy Intermediate-Scale Quantum (NISQ) era and has been extensively studied. However, the performance limitations of low-level QAOA have also been demonstrated across various instances. In this work, we first analytically prove the performance limitations of level-1 QAOA in solving the MAX-CUT problem on bipartite graphs. We derive an upper bound for the approximation ratio based on the average degree of bipartite graphs. Second, we show through numerical results that solving the same problem using level-1 Recursive QAOA (RQAOA), which is one of the variants of QAOA that uses QAOA as a subroutine to reduce the graph size recursively, outperforms the original QAOA but still exhibits limitations as the graph size increases. To address these limitations, we propose a modified RQAOA that reduces the parameter regime optimized in the QAOA subroutine. While reducing the optimization space could generally make it more challenging to find the true optimal parameters, interestingly, we prove that this modified RQAOA can find the exact maximum cut for a parity partitioned graph which includes all weighted bipartite graphs., Comment: 15 pages, 3 figures

In classical information theory, channel capacity quantifies the maximum number of messages that can be reliably transmitted using shared information. An equivalent concept, termed uncommon information, represents the number of messages required to be exchanged to completely share all information in common. However, this equivalence does not extend to quantum information theory. Specifically, quantum uncommon information is operationally defined as the minimal amount of entanglement required for the quantum communication task of quantum state exchange, where two parties exchange quantum states to share all quantum messages in common. Currently, an analytical closed-form expression for the quantum uncommon information remains undetermined. In this work, by investigating underlying characterization of the quantum uncommon information, we derive improved bounds on it. To obtain these bounds, we develop a subspace exchange strategy that leverages a common subspace of two parties to identify the unnecessary qubits for exchange. We also consider a referee-assisted exchange, wherein a referee aids two parties in efficiently performing the quantum state exchange. Our bounds provide more precise estimations for the quantum uncommon information. Furthermore, we demonstrate that the subspace technique is a versatile tool for characterizing uncommon information not only in the bipartite scenario but also in various multi-partite ones., Comment: 24 pages, 7 figures, typos were corrected and readability was improved

Quantifying entanglement is vital to understand entanglement as a resource in quantum information processing, and many entanglement measures have been suggested for this purpose. When mathematically defining an entanglement measure, we should consider the distinguishability between entangled and separable states, the invariance under local transformation, the monotonicity under local operations and classical communication, and the convexity. These are reasonable requirements but may be insufficient, in particular when taking into account the usefulness of quantum states in multi-party quantum information processing. Therefore, if we want to investigate multipartite entanglement as a resource, then it can be necessary to consider the usefulness of quantum states in multi-party quantum information processing when we define a multipartite entanglement measure. In this paper, we define new multipartite entanglement measures for three-qubit systems based on the three-party teleportation capability, and show that these entanglement measures satisfy the requirements for being genuine multipartite entanglement measures. We also generalize our entanglement measures for $N$-qubit systems, where $N \ge 4$, and discuss that these quantities may be good candidates to measure genuine multipartite entanglement., Comment: 14 pages, 2 figures

Quantum approximate optimization algorithms are hybrid quantum-classical variational algorithms designed to approximately solve combinatorial optimization problems such as the MAX-CUT problem. In spite of its potential for near-term quantum applications, it has been known that quantum approximate optimization algorithms have limitations for certain instances to solve the MAX-CUT problem, at any constant level $p$. Recently, the recursive quantum approximate optimization algorithm, which is a non-local version of quantum approximate optimization algorithm, has been proposed to overcome these limitations. However, it has been shown by mostly numerical evidences that the recursive quantum approximate optimization algorithm outperforms the original quantum approximate optimization algorithm for specific instances. In this paper, we analytically prove that the recursive quantum approximate optimization algorithm is more competitive than the original one to solve the MAX-CUT problem for complete graphs with respect to the approximation ratio., Comment: 8 pages, 1 figure

Through the two specific problems, the 2D hidden linear function problem and the 1D magic square problem, Bravyi et al. have recently shown that there exists a separation between $\mathbf{QNC^0}$ and $\mathbf{NC^0}$, where $\mathbf{QNC^0}$ and $\mathbf{NC^0}$ are the classes of polynomial-size and constant-depth quantum and classical circuits with bounded fan-in gates, respectively. In this paper, we present another problem with the same property, the magic pentagram problem based on the magic pentagram game, which is a nonlocal game. In other words, we show that the problem can be solved with certainty by a $\mathbf{QNC^0}$ circuit but not by any $\mathbf{NC^0}$ circuits., Comment: 10 pages, 5 figures

Quantum measurement is a class of quantum channels that sends quantum states to classical states. We set up resource theories of quantum coherence and quantum entanglement for quantum measurements and find relations between them. For this, we conceive a relative entropy type quantity to account for the quantum resources of quantum measurements. The quantum coherence of a quantum measurement can be converted into the entanglement in a bipartite quantum measurement through coherence-non generating transformations. Conversely, a quantum entanglement monotone of quantum measurements induces a quantum coherence monotone of quantum measurement. Our results confirm that the understanding on the link between quantum coherence and quantum entanglement is valid even for quantum measurements which do not generate any quantum resource., Comment: 13 pages, 2 figures

We look into multipartite quantum states on which quantum cryptographic protocols including quantum key distribution and quantum secret sharing can be perfectly performed, and define the quantum cryptographic resource distillable rate as the asymptotic rate at which such multipartite state can be distilled from a given multipartite state. Investigating several relations between entanglement and the rate, we show that there exists a multipartite bound entangled state whose quantum cryptographic resource distillable rate is strictly positive, that is, there exists a multipartite entangled state which is not distillable, but can be useful for quantum cryptography such as quantum key distribution and quantum secret sharing., Comment: 9 pages, 2 figures

We first investigate the one-shot static entanglement cost to simulate a bipartite quantum channel under the set of non-entangling channels. The lower bound on the static entanglement cost is given by the generalized robustness of the target channel as well as the robust-generating power of the channel, which implies that the cost necessary to generate a bipartite quantum channel might not be retrievable in general. Next, we conceive a set of quantum channels that extends the set of non-entangling channels. We find out that the one-shot static entanglement cost under the extended set of channels is given by the channel's standard log-robustness. This gives the one-shot dynamic entanglement cost under a set of free superchannels that do not generate dynamic entanglement resource; the extended set is shown to be equivalent to the set of free superchannels., Comment: 8 pages, 3 figures; a refined version with additional references

We show that the dynamic resource theory of quantum entanglement can be formulated using the superchannel theory. In this formulation, we identify the separable channels and the class of free superchannels that preserve channel separability as free resources, and choose the swap channels as dynamic entanglement golden units. Our first result is that the one-shot dynamic entanglement cost of a bipartite quantum channel under the free superchannels is bounded by the standard log-robustness of channels. The one-shot distillable dynamic entanglement of a bipartite quantum channel under the free superchannels is found to be bounded by a resource monotone that we construct from the hypothesis-testing relative entropy of channels with minimization over separable channels. We also address the one-shot catalytic dynamic entanglement cost of a bipartite quantum channel under a larger class of free superchannels that could generate the dynamic entanglement which is asymptotically negligible; it is bounded by the generalized log-robustness of channels., Comment: 19 pages, 5 figures. See two independent related works by B. Regula and R. Takagi, and by X. Yuan et al

Quantum state exchange is a quantum communication task for two users in which the users faithfully exchange their respective parts of an initial state under the asymptotic scenario. In this work, we generalize the quantum state exchange task to a quantum communication task for $M$ users in which the users circularly transfer their respective parts of an initial state. We assume that every pair of users may share entanglement resources, and they use local operations and classical communication in order to perform the task. We call this generalized task the (asymptotic) quantum state rotation. First of all, we formally define the quantum state rotation task and its optimal entanglement cost, which means the least amount of total entanglement required to carry out the task. We then present lower and upper bounds on the optimal entanglement cost, and provide conditions for zero optimal entanglement cost. Based on these results, we find out a difference between the quantum state rotation task for three or more users and the quantum state exchange task., Comment: 26 pages, 10 figures

Quantum secret sharing allows each player to have classical information for secret sharing in quantum mechanical ways. In this work, we construct a class of quantum states on which players can quantumly perform secret sharing secure against dishonest players as well as eavesdropper. We here call them the genuine secret-sharing states. In addition, we show that if $N$ players share an $N$-party genuine secret-sharing state, then arbitrary $M$ players out of the total players can share an $M$-party genuine secret-sharing state by means of local operations and classical communication on the state. We also define the distillable rate with respect to the genuine secret-sharing state, and explain the connection between the distillable rate and the relative entropy of entanglement., Comment: 8 pages

As a variant of the original quantum teleportation, the port-based teleportation has been proposed, and its various kinds of useful applications in quantum information processing have been explored. Two users in the port-based teleportation initially share an arbitrary pure state, which can be represented by applying one user's local operation to a bipartite maximally entangled state. If the maximally entangled state is a $2M$-qudit state, then it can be expressed as $M$ copies of a two-qudit maximally entangled state, where $M$ is the number of the ports. We here consider a generalization of the original port-based teleportation obtained from employing copies of an arbitrary bipartite (mixed) resource instead of copies of a pure maximally entangled one. By means of the generalization, we construct a concept of the controlled port-based teleportation by combining the controlled teleportation with the port-based teleportation, and analyze its performance in terms of several meaningful quantities such as the teleportation fidelity, the entanglement fidelity, and the fully entangled fraction. In addition, we present new quantities called the control power and the minimal control power for the new controlled version on a given tripartite quantum state., Comment: 6 pages, 1 figure; Close to published version

The quantum state exchange is a quantum communication task in which two users exchange their respective quantum information in the asymptotic setting. In this work, we consider a one-shot version of the quantum state exchange task, in which the users hold a single copy of the initial state, and they exchange their parts of the initial state by means of entanglement-assisted local operations and classical communication. We first derive lower bounds on the least amount of entanglement required for carrying out this task, and provide conditions on the initial state such that the protocol succeeds with zero entanglement cost. Based on these results, we reveal two counter-intuitive phenomena in this task, which make it different from a conventional SWAP operation. One tells how the users deal with their symmetric information in order to reduce the entanglement cost. The other shows that it is possible for the users to gain extra shared entanglement after this task., Comment: 7 pages, 3 figures

There have been several research works on the hidden shift problem, quantum algorithms for the problem, and their applications. However, all the results have focused on discrete groups with discrete oracle functions. In this paper, we define the continuous hidden shift problem on $\mathbb{R}^n$ with a continuous oracle function as an extension of the hidden shift problem, and also define the $\varepsilon$-random linear disequations which is a generalization of the random linear disequations. By employing the newly defined concepts, we show that there exists a quantum computational algorithm which solves this problem in time polynomial in $n$., Comment: 15 pages, no figure

There have been several upper bounds on the quantum capacity of the single-mode Gaussian channels with thermal noise, such as thermal attenuator and amplifier. We consider a class of attenuator and amplifier with more general noises, including squeezing or even non-Gaussian one. We derive new upper bounds on the energy-constrained quantum capacity of those channels by using the quantum conditional entropy power inequality. Also, we obtain lower bounds for the same channels by means of Gaussian optimizer with fixed input entropy. They give narrow bounds when the transmissivity is near unity and the energy of input state is low., Comment: 6 pages, 5 figures; 1 figure added and references are updated

Activation of quantum capacity is a surprising phenomenon according to which the quantum capacity of a certain channel may increase by combining it with another channel with zero quantum capacity. Superactivation describes an even more particular occurrence, in which both channels have zero quantum capacity, but their composition has a nonvanishing one. We investigate these effects for all single-mode phase-insensitive Gaussian channels, which include thermal attenuators and amplifiers, assisted by a two-mode positive-partial-transpose channel. Our result shows that activation phenomena are special but not uncommon. We can reveal superactivation in a broad range of thermal attenuator channels, even when the transmissivity is quite low. This means that we can transmit quantum information reliably through very noisy Gaussian channels having zero quantum capacity. We further show that no superactivation is possible for entanglement-breaking Gaussian channels in physically relevant circumstances by proving the non-activation property of the coherent information of bosonic entanglement-breaking channels with finite input energy., Comment: 11 pages, 2 figures; minor changes, references are added

We consider a quantum communication task between two users Alice and Bob, in which Alice and Bob exchange their respective quantum information by means of local operations and classical communication assisted by shared entanglement. Here, we assume that Alice and Bob may have quantum side information, not transferred, and classical communication is free. In this work, we derive general upper and lower bounds for the least amount of entanglement which is necessary to perfectly perform this task, called the state exchange with quantum side information. Moreover, we show that the optimal entanglement cost can be negative when Alice and Bob make use of their quantum side information. We finally provide conditions on the initial state for the state exchange with quantum side information which give the exact optimal entanglement cost., Comment: 9 pages, 2 figures

We propose a hybrid quantum algorithm based on the Harrow-Hassidim-Lloyd (HHL) algorithm for solving a system of linear equations. In our hybrid scheme, a classical information feed-forward is required from the quantum phase estimation algorithm to reduce a circuit depth from the original HHL algorithm. In this paper, we show that this hybrid algorithm is functionally identical to the HHL algorithm under the assumption that the number of qubits used in algorithms is large enough. In addition, it is experimentally examined with four qubits in the IBM Quantum Experience setups, and the experimental results of our algorithm show higher accurate performance on specific systems of linear equations than that of the HHL algorithm., Comment: 12 pages, 6 figures

Quantum channels can be activated by a kind of channels whose quantum capacity is zero. This activation effect might be useful to overcome noise of channels by attaching other channels which can enhance the capacity of a given channel. In this work, we show that such an activation is possible by specific positive-partial-transpose channels for Gaussian lossy channels whose quantum capacities are known. We also test more general case involving Gaussian thermal attenuator whose the exact value of quantum capacity has been unknown so far. For a recently suggested narrow upper bound on quantum capacity of the thermal attenuator, we confirm the fact that an activation of quantum capacity occurs as well. This result is applicable for realistic situations in which Gaussian channels describe the noises of communication systems., Comment: 5 pages, 4 figures

We study a general corresponding principle between discrete-variable quantum states and continuous-variable (especially, restricted on Gaussian) states via quantum purification method. In the previous work, we have already investigated an information-theoretic correspondence between the Gaussian maximally mixed states (GMMSs) and their purifications known as Gaussian maximally entangled states (GMESs) in [Phys. Lett. A {\bf 380}, 3607 (2016)]. We here compare an $N\times N$-dimensional maximally entangled state to the GMES we proposed previously, through an explicit calculation of quantum fidelity between those entangled states. By exploiting the results, we naturally conclude that our GMES is more suitable to the concept of \emph{maximally entangled} state in Gaussian quantum information, and thus it might be useful or applicable for quantum information tasks than the two-mode squeezed vacuum (TMSV) state in the Gaussian regime., Comment: 5 pages, 2 figures; Minor changed and references updated

Quantum secret sharing is well known as a method for players to share a classical secret for secret sharing in quantum mechanical ways. Most of the results associated with quantum secret sharing are based on pure multipartite entangled states. In reality, however, it is difficult for players to share a pure entangled state, although they can share a state close to the state. Thus, it is necessary to study how to perform the quantum secret sharing based on a general multipartite state. We here present a quantum secret sharing protocol on an $N$-qubit state close to a pure $N$-qubit Greenberger-Horne-Zeilinger state. In our protocol, $N$ players use an inequality derived from the Mermin inequality to check secure correlation of classical key bits for secret sharing. We show that if our inequality holds then every legitimate player can have key bits with positive key rate. Therefore, for sufficiently many copies of the state, the players can securely share a classical secret with high probability by means of our protocol., Comment: 11 pages, 1 figures

Recently, the concept on `forgeable quantum messages' in arbitrated quantum signature schemes was introduced by T. Kim et al. [Phys. Scr., 90, 025101 (2015)], and it has been shown that there always exists such a forgeable quantum message for every known arbitrated quantum signature scheme with four quantum encryption operators and the specific two rotation operators. We first extend the result to the case of any two unitary rotation operators, and then consider the forgeable quantum messages in the schemes with four quantum encryption operators and three or more rotation operators. We here present a necessary and sufficient condition for existence of a forgeable quantum message, and moreover, by employing the condition, show that there exists an arbitrated quantum signature scheme which contains no forgeable quantum message-signature pairs., Comment: 10 pages; Proposition 2 has been modified because of errors in the original version, but the errors have no effect on our results

We first consider quantum communication protocols between a sender Alice and a receiver Bob, which transfer Alice's quantum information to Bob by means of non-local resources, such as classical communication, quantum communication, and entanglement. In these protocols, we assume that Alice and Bob may have quantum side information, not transferred. In this work, these protocols are called the state transfer with quantum side information. We determine the optimal costs for non-local resources in the protocols, and study what the effects of the use of quantum side information are. Our results can give new operational meanings to the quantum mutual information and the quantum conditional mutual information, which directly provide us with an operational interpretation of the chain rule for the quantum mutual information., Comment: 16 pages, 2 figures, new section added where the effects of quantum side information are described

We propose an extension of the quantum entropy power inequality for finite dimensional quantum systems, and prove a conditional quantum entropy power inequality by using the majorization relation as well as the concavity of entropic functions also given by Audenaert, Datta, and Ozols [J. Math. Phys. 57, 052202 (2016)]. Here, we make particular use of the fact that a specific local measurement after a partial swap operation (or partial swap quantum channel) acting only on finite dimensional bipartite subsystems does not affect the majorization relation for the conditional output states when a separable ancillary subsystem is involved. We expect our conditional quantum entropy power inequality to be useful, and applicable in bounding and analyzing several capacity problems for quantum channels., Comment: 6 pages, 1 figure, and 1 table; Close to published version

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. By using our stability theorem, we show that Bob can determine whether her preparation is appropriate., Comment: 9 pages, no figure

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. This means that for a single use of a qubit channel, quantum non-signalling correlations are not more powerful than shared entanglement., Comment: 6 pages, no figure

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. Thus, we define the minimal control power, and calculate the values of the minimal control power for a class of general three-qubit Greenberger-Horne-Zeilinger (GHZ) states and the three-qubit W class whose states have zero three-tangles. Moreover, we show that the standard three-qubit GHZ state and the standard three-qubit W state have the maximal values of the minimal control power for the two classes, respectively. This means that the minimal control power can be interpreted as not only an operational quantity of a three-qubit quantum communication but also a degree of three-qubit entanglement. In addition, we calculate the values of the minimal control power for general n-qubit GHZ states and the n-qubit W-type states., Comment: 5 pages, No figures; Close to published version

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. We show that distillable entanglement, entanglement of assistance, and quantum discord can all be expressed in terms of the concentrated information, thus revealing its role as a unifying informational primitive. We finally investigate quantum state merging of mixed states with and without additional entanglement. The gap between classical and quantum concentrated information is proven to be an operational figure of merit for mixed state merging in absence of additional entanglement. Contrary to pure state merging, our analysis shows that classical communication in both directions can provide advantage for merging of mixed states., Comment: 5+4 pages, 1 figure. Presentation significantly improved, new results added. Theorem 3 contains an application of recent results by Fawzi and Renner in arXiv:1410.0664. To be published in PRL

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. If there exist only a finite number of forgeable quantum messages in the scheme then the scheme can be secure against the forgery attack by not sending the forgeable quantum messages, and so our situation does not directly imply that we check whether the scheme is secure against the attack. But, if users run a given scheme without any consideration of forgeable quantum messages then a sender might transmit such forgeable messages to a receiver, and an attacker can forge the messages if the attacker knows them in such a case. Thus it is important and necessary to look into forgeable quantum messages. We here show that there always exists such a forgeable quantum message-signature pair for every known scheme with quantum encryption and rotation, and numerically show that any forgeable quantum message-signature pairs do not exist in an arbitrated quantum signature scheme., Comment: 11 pages, 1 figure, 1 table, Close to published version

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., Comment: 5 pages, 2 figures; v3: Errors in class-2 and class-7 states in Table I and Figure 2(a) are corrected with respect to the published version. All conclusions are unaffected

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., Comment: 12 pages, No figures. arXiv admin note: text overlap with arXiv:1107.2189 by other authors

It was shown [T.S. Cubitt et al., IEEE Trans. Inform. Theory 57, 8114 (2011)] that there exist quantum channels where a single use cannot transmit classical information perfectly yet two uses can. This phenomenon is called the superactivation of the zero-error classical capacity which does not occur in classical channels. In this paper, it is shown that qubit channels cannot generate the superactivation., Comment: 4 pages

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.

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., Phys. Rev. Lett. 91, 037902 (2003)]. In this paper, we investigate a class of three-qubit separable states to distribute entanglement by the same way, and calculate the maximal amount of entanglement which two particles of separable states in the class can have after applying the way., Comment: 4 pages, no figures, Revised argument

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., Comment: 4 pages, 1 figure

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., Comment: 4 pages

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., Comment: 5 pages

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., Comment: 4 pages, 1 figure

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.J. Osborne and F. Verstraete, Phys. Rev. Lett. {\bf 96}, 220503 (2006)] hold on general $n$-qubit states including mixed ones. In this paper, we consider the monogamy inequalities in terms of the fully entangled fraction and the teleportation fidelity. We show that the monogamy inequalities do not hold on general mixed states, while the inequalities hold on $n$-qubit pure states., Comment: 4 pages, accepted for publication as a Brief Report in Physical Review A

D\"{u}r [Phys. Rev. Lett. {\bf 87}, 230402 (2001)] constructed $N$-qubit bound entangled states which violate a Bell inequality for $N\ge 8$, and his result was recently improved by showing that there exists an $N$-qubit bound entangled state violating the Bell inequality if and only if $N\ge 6$ [Phys. Rev. A {\bf 79}, 032309 (2009)]. On the other hand, it has been also shown that the states which D\"{u}r considered violate Bell inequalities different from the inequality for $N\ge 6$. In this paper, by employing different forms of Bell inequalities, in particular, a specific form of Bell inequalities with $M$ settings of the measuring apparatus for sufficiently large $M$, we prove that there exists an $N$-qubit bound entangled state violating the $M$-setting Bell inequality if and only if $N\ge 4$., Comment: 4 pages, 2 figures

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. The proof is basically different from the Mayers-Lo-Chau's no-go theorem, because we do not assume the staticity of the finally shared quantum states between users., Comment: 5 pages

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. Lett. {\bf 87}, 230402 (2001)], for all the states violating the inequality there exists at least one splitting of the parties into two groups such that pure-state entanglement can be distilled [Phys. Rev. Lett. {\bf 88}, 027901 (2002)]. We here prove that for all $N$-qubit states violating the inequality the number of distillable bipartite splits increases exponentially with $N$, and hence the probability that a randomly chosen bipartite split is distillable approaches one exponentially with $N$, as $N$ tends to infinity. We also show that there exists at least one $N$-qubit bound entangled state violating the inequality if and only if $N\ge 6$., Comment: 4 pages, 2 figures

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., Comment: 4 pages

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. A {\bf 61}, 052306 (2000); Phys. Rev. Lett. {\bf 96}, 220503 (2006)], and more explicitly by the monogamy equality in terms of the concurrence and the concurrence of assistance, $\mathcal{C}_{A(BC)}^2=\mathcal{C}_{AB}^2+(\mathcal{C}_{AC}^a)^2$, in the three-qubit system. In this paper, we consider the monogamy equality in $2\otimes 2 \otimes d$ quantum systems. We show that $\mathcal{C}_{A(BC)}=\mathcal{C}_{AB}$ if and only if $\mathcal{C}_{AC}^a=0$, and also show that if $\mathcal{C}_{A(BC)}=\mathcal{C}_{AC}^a$ then $\mathcal{C}_{AB}=0$, while there exists a state in a $2\otimes 2 \otimes d$ system such that $\mathcal{C}_{AB}=0$ but $\mathcal{C}_{A(BC)}>\mathcal{C}_{AC}^a$., Comment: 4 pages, no figure

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., Comment: 4 pages

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., Comment: 5 pages, 2 figures; The old version has been generalized into the results on general 3-qubit states

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. Rev. Lett. 94, 160502 (2005), quant-ph/0506203] have nonzero distillable key rate, and finally exhibit a new class of bound entangled states with positive distillable key rate, but with negative Devetak-Winter lower bound of distillable key rate for the ccq states of their privacy squeezed versions., Comment: 7 pages, 1 figure, typos corrected, accepted for publication in PRA