arXiv subjects

Satoshi Ishizaka

Publications and source records attributed to Satoshi Ishizaka.

At least 19 recordsLinked to original sources

arXiv2025

NPA Hierarchy and Extremal Criterion in the Simplest Bell Scenario

It is difficult to establish an analytical criterion to identify the boundaries of quantum correlations, even for the simplest Bell scenario. Here, we briefly reviewed the plausible analytical criterion, and we found a way to confirm the extremal conditions from another direction. For that purpose, we analyzed the Navascués-Pironio-Ac\'ın (NPA) hierarchy to study the algebraic structure and found that the problem could not be simplified using $1\!+\!AB$ level. However, considering the plausible criterion, the $1\!+\!AB$ and second levels for correlations were equal, and the extremal condition in the simplest Bell scenario was replaced by that in the $1\!+\!AB$ level. Thus, the correctness of the plausible criterion was verified, and the results demonstrated that the plausible criterion held, thereby explaining its simplicity. It seemed plausible, but now it becomes more certain.

quant-ph↗

arXiv2020

Geometrical self-testing of partially entangled two-qubit states

Quantum nonlocality has recently been intensively studied in connection to device-independent quantum information processing, where the extremal points of the set of quantum correlations play a crucial role through self-testing. In most protocols, the proofs for self-testing rely on the maximal violation of the Bell inequalities, but there is another known proof based on the geometry of state vectors to self-test a maximally entangled state. We present a geometrical proof in the case of partially entangled states. We show that, when a set of correlators in the simplest Bell scenario satisfies a condition, the geometry of the state vectors is uniquely determined. The realization becomes self-testable when another unitary observable exists on the geometry. Applying this proven fact, we propose self-testing protocols by intentionally adding one more measurement. This geometrical scheme for self-testing is superior in that, by using this as a building block and repeatedly adding measurements, a realization with an arbitrary number of measurements can be self-tested. Besides the application, we also attempt to describe nonlocal correlations by guessing probabilities of distant measurement outcomes. In this description, the quantum set is also convex, and a large class of extremal points is identified by the uniqueness of the geometry.

quant-ph↗

arXiv2018

Necessary and sufficient criterion for extremal quantum correlations in the simplest Bell scenario

In the study of quantum nonlocality, one obstacle is that the analytical criterion for identifying the boundaries between quantum and postquantum correlations has not yet been given, even in the simplest Bell scenario. We propose a plausible, analytical, necessary and sufficient condition ensuring that a nonlocal quantum correlation in the simplest scenario is an extremal boundary point. Our extremality condition amounts to certifying an information-theoretical quantity; the probability of guessing a measurement outcome of a distant party optimized using any quantum instrument. We show that this quantity can be upper and lower bounded from any correlation in a device-independent way, and we use numerical calculations to confirm that coincidence of the upper and lower bounds appears to be necessary and sufficient for the extremality.

quant-ph↗

arXiv2017

Cryptographic Quantum Bound on Nonlocality

Information causality states that the information obtainable by a receiver cannot be greater than the communication bits from a sender, even if they utilize no-signaling resources. This physical principle successfully explains some boundaries between quantum and post-quantum nonlocal correlations, where the obtainable information reaches the maximum limit. We show that no-signaling resources of pure partially entangled states produce randomness (or noise) in the communication bits, and achievement of the maximum limit is impossible, i.e., the information causality principle is insufficient for the full identification of the quantum boundaries already for bipartite settings. The nonlocality inequalities such as so-called the Tsirelson inequality are extended to show how such randomness affects the strength of nonlocal correlations. As a result, a relation followed by most of quantum correlations in the simplest Bell scenario is revealed. The extended inequalities reflect the cryptographic principle such that a completely scrambled message cannot carry information.

quant-ph↗

arXiv2015

Entanglement and swap of quantum states in two qubits

Suppose that two distant parties Alice and Bob share an entangled state $ρ_{AB}$, and they want to exchange the subsystems of $ρ_{AB}$ by local operations and classical communication (LOCC). In general, this LOCC task (i.e. the LOCC transformation of $ρ_{AB} \to Vρ_{AB} V$ with $V$ being a swap operator) is impossible deterministically, but becomes possible probabilistically. In this paper, we study how the optimal probability is related to the amount of entanglement in the framework of positive partial transposed (PPT) operations, and numerically show a remarkable class of states whose probability is the smallest among every state in two quantum bits.

quant-ph↗

arXiv2015

Some remarks on port-based teleportation

Port-based teleportation (PBT) is a teleportation scheme such that the teleported state appears in one of receiver's multiple output ports without any correcting operation on the output port. In this paper, we make some remarks on PBT. Those include the possibility of recoverable PBT (a hybrid protocol between PBT and the standard teleportation scheme), the possibility of port-based superdense coding (a dual protocol to PBT), and the fidelily upper bound expected from the entanglement monogamy relation in asymmetric universal cloning.

quant-ph↗

arXiv2014

Quantum-information Division and an Optimal Uncorrelated Channel

We consider quantum-information division, which is characterized by a channel whose outputs have no correlation and are not completely randomized. We show that the quantum-information division is possible in a probabilistic manner by optimizing the average fidelity in the channel with $M$ outputs in both deterministic and probabilistic cases. Moreover, we show that the optimal fidelities drastically change depending on the condition imposed on the outputs (symmetric and asymmetric), which is quite in contrast to the case of imperfect cloning.

quant-ph↗

arXiv2011

Experimental Activation of Bound Entanglement

Entanglement is one of the essential resources in quantum information and communication technology (QICT). The entanglement thus far explored and applied to QICT has been pure and distillable entanglement. Yet there is another type of entanglement, called 'bound entanglement', which is not distillable by local operations and classical communication (LOCC). We demonstrate the experimental 'activation' of the bound entanglement held in the four-qubit Smolin state, unleashing its immanent entanglement in distillable form, with the help of auxiliary two-qubit entanglement and LOCC. We anticipate that it opens the way to a new class of QICT applications that utilize more general classes of entanglement than ever, including bound entanglement.

quant-ph↗

arXiv2009

Deterministic photon-photon (SWAP)^{1/2} gate using a lambda system

We theoretically present a method to realize a deterministic photon-photon (SWAP)^{1/2} gate using a three-level lambda system interacting with single photons in reflection geometry. The lambda system is used completely passively as a temporary memory for a photonic qubit; the initial state of the lambda system may be arbitrary, and active control by auxiliary fields is unnecessary throughout the gate operations. These distinct merits make this entangling gate suitable for deterministic and scalable quantum computation.

quant-ph↗

arXiv2009

Entanglement purification protocol for a mixture of a pure entangled state and a pure product state

We present an entanglement purification protocol for a mixture of a pure entangled state and a pure product state, which are orthogonal to each other. The protocol is combination of bisection method and one-way hashing protocol. We give recursive formula for the rate of the protocol for different states, i.e. the number of maximally entangled two-qubit pairs obtained with the protocol per a single copy of the initial state. We also calculate numerically the rate for some states.

quant-ph↗

arXiv2009

Quantum teleportation scheme by selecting one of multiple output ports

The scheme of quantum teleportation, where Bob has multiple (N) output ports and obtains the teleported state by simply selecting one of the N ports, is thoroughly studied. We consider both deterministic version and probabilistic version of the teleportation scheme aiming to teleport an unknown state of a qubit. Moreover, we consider two cases for each version: (i) the state employed for the teleportation is fixed to a maximally entangled state, and (ii) the state is also optimized as well as Alice's measurement. We analytically determine the optimal protocols for all the four cases, and show the corresponding optimal fidelity or optimal success probability. All these protocols can achieve the perfect teleportation in the asymptotic limit of $N\to\infty$. The entanglement properties of the teleportation scheme are also discussed.

quant-ph↗

arXiv2008

Asymptotic teleportation scheme as a universal programmable quantum processor

We consider a scheme of quantum teleportation where a receiver has multiple (N) output ports and obtains the teleported state by merely selecting one of the N ports according to the outcome of the sender's measurement. We demonstrate that such teleportation is possible by showing an explicit protocol where N pairs of maximally entangled qubits are employed. The optimal measurement performed by a sender is the square-root measurement, and a perfect teleportation fidelity is asymptotically achieved for a large N limit. Such asymptotic teleportation can be utilized as a universal programmable processor.

quant-ph↗

arXiv2008

Comparison of the relative entropy of entanglement and negativity

It is well known that for two qubits the upper bounds of the relative entropy of entanglement (REE) for a given concurrence as well as the negativity for a given concurrence are reached by pure states. We show that, by contrast, there are two-qubit mixed states for which the REE for some range of a fixed negativity is higher than that for pure states. Moreover, we demonstrate that a mixture of a pure entangled state and pure separable state orthogonal to it is likely to give the maximal REE. By noting that the negativity is a measure of entanglement cost under operations preserving positivity of partial transpose, our results provide an explicit example of operations such that, even though the entanglement cost for an exact preparation is the same, the entanglement of distillation of a mixed state can exceed that of pure states. This means that the entanglement manipulation via a pure state can result in a larger entanglement loss than that via a mixed state.

quant-ph↗

arXiv2008

Closed formula for the relative entropy of entanglement

The long-standing problem of finding a closed formula for the relative entropy of entanglement (REE) for two qubits is addressed. A compact-form solution to the inverse problem, which characterizes an entangled state for a given closest separable state, is obtained. Analysis of the formula for a large class of entangled states strongly suggests that a compact analytical solution of the original problem, which corresponds to finding the closest separable state for a given entangled state, can be given only in some special cases. A few applications of the compact-form formula are given to show additivity of the REE, to relate the REE with the Rains upper bound for distillable entanglement, and to show that a Bell state does not have a unique closest separable state.

quant-ph↗

arXiv2008

Dilemma that cannot be resolved by biased quantum coin flipping

We show that a biased quantum coin flip (QCF) cannot provide the performance of a black-boxed biased coin flip, if it satisfies some fidelity conditions. Although such a QCF satisfies the security conditions of a biased coin flip, it does not realize the ideal functionality, and therefore, does not fulfill the demands for universally composable security. Moreover, through a comparison within a small restricted bias range, we show that an arbitrary QCF is distinguishable from a black-boxed coin flip unless it is unbiased on both sides of parties against insensitive cheating. We also point out the difficulty in developing cheat-sensitive quantum bit commitment in terms of the uncomposability of a QCF.

quant-ph↗

arXiv2006

Strong monotonicity in mixed-state entanglement manipulation

A strong entanglement monotone, which never increases under local operations and classical communications (LOCC), restricts quantum entanglement manipulation more strongly than the usual monotone since the usual one does not increase on average under LOCC. We propose new strong monotones in mixed-state entanglement manipulation under LOCC. These are related to the decomposability and 1-positivity of an operator constructed from a quantum state, and reveal geometrical characteristics of entangled states. These are lower bounded by the negativity or generalized robustness of entanglement.

quant-ph↗

arXiv2005

Multi-particle entanglement manipulation under positive partial transpose preserving operations

We consider the transformation of multi-partite states in the single copy setting under positive-partial-transpose-preserving operations (PPT-operations) and obtain both qualitative and quantitative results. Firstly, for some pure state transformations that are impossible under local operations and classical communication (LOCC), we demonstrate that they become possible with a surprisingly large success probability under PPT-operations. Furthermore, we clarify the convertibility of arbitrary multipartite pure states under PPT-operations, and show that a drastic simplification in the classification of pure state entanglement occurs when the set of operations is switched from LOCC to PPT-operations. Indeed, the infinitely many types of LOCC-incomparable entanglement are reduced to only one type under the action of PPT-operations. This is a clear manifestation of the increased power afforded by the use of PPT-bound entanglement. In addition, we further enlarge the set of operations to clarify the effect of another type of bound entanglement, multipartite unlockable bound entanglement, and show that a further simplification occurs. As compared to pure states a more complicated situation emerges in the mixed state settings. While single copy distillation becomes possible under PPT-operations for some mixed states it remains impossible for other mixed states.

quant-ph↗

arXiv2004

Bound entanglement provides convertibility of pure entangled states

I show that two distant parties can transform pure entangled states to arbitrary pure states by stochastic local operations and classical communication (SLOCC) at the single copy level, if they share bound entangled states. This is the effect of bound entanglement since this entanglement processing is impossible by SLOCC alone. Similar effect of bound entanglement occurs in three qubits where two incomparable entangled states of GHZ and W can be inter-converted. In general multipartite settings composed by $N$ distant parties, all $N$-partite pure entangled states are inter-convertible by SLOCC with the assistance of bound entangled states with positive partial transpose.

quant-ph↗