Search

In quantum information processing it may be possible to have efficient computation and secure communication beyond the limitations of classical systems. In a fundamental point of view, however, evolution of quantum systems by the laws of quantum mechanics is more restrictive than classical systems, identified to a specific form of dynamics, that is, unitary transformations and, consequently, positive and completely positive maps to subsystems. This also characterizes classes of disallowed transformations on quantum systems, among which positive but not completely maps are of particular interest as they characterize entangled states, a general resource in quantum information processing. Structural physical approximation offers a systematic way of approximating those non-physical maps, positive but not completely positive maps, with quantum channels. Since it has been proposed as a method of detecting entangled states, it has stimulated fundamental problems on classifications of positive maps and the structure of Hermitian operators and quantum states, as well as on quantum measurement such as quantum design in quantum information theory. It has developed efficient and feasible methods of directly detecting entangled states in practice, for which proof-of-principle experimental demonstrations have also been performed with photonic qubit states. Here, we present a comprehensive review on quantum information processing with structural physical approximations and the related progress. The review mainly focuses on properties of structural physical approximations and their applications toward practical information applications., Comment: 53 pages, To appear in Reports on Progress in Physics as a review on structural physical approximation, see also related one, F. Shultz F Journal of Mathematical Physics 57 015218 (2016)

Entanglement distillation is a fundamental task in quantum information processing. It not only extracts entanglement out of corrupted systems but also leads to protecting systems of interest against intervention with environment. In this work, we consider a realistic scenario of entanglement distillation where noisy quantum operations are applied. In particular, the two-way distillation protocol that tolerates the highest error rate is considered. We show that among all types of noise there are only four equivalence classes according to the distillability condition. Since the four classes are connected by local unitary transformations, our results can be used to improve entanglement distillability in practice when entanglement distillation is performed in a realistic setting., Comment: 19 pages

We report the first experimental implementation of an approximate partial transpose operation for photonic two-qubit systems. Direct detection of entanglement using the partial transpose operation is also demonstrated without performing quantum state tomography.

We show a geometric formulation for minimum-error discrimination of qubit states that can be applied to arbitrary sets of qubit states given with arbitrary a priori probabilities. In particular, when qubit states are given with equal a priori probabilities, we provide a systematic way of finding optimal discrimination and the complete solution in a closed form. This generally gives a bound to cases when prior probabilities are unequal. Then it is shown that the guessing probability does not depend on detailed relations among the given states, such as the angles between them, but on a property that can be assigned by the set of given states itself. This also shows how a set of quantum states can be modified such that the guessing probability remains the same. Optimal measurements are also characterized accordingly, and a general method of finding them is provided.

In 2008, the conjecture that structural physical approximations to optimal entanglement witnesses are separable states (in general unnormalized) was posed. In an attempt to disprove it, in [K.-C. Ha and S.-H. Kye, Separable states with unique decompositions, arXiv:1210.1088v3], Ha and Kye proposed a decomposable entanglement witness whose SPA is entangled and argued that it is optimal. In this note, which is based on a comment to the latter work [R. Augusiak et al., Comment on "Separable states with unique decompositions", arXiv:1304.2040v1], we show, both analytically and numerically, that this entanglement witness is not optimal, and as such it is not a counterexample to the conjecture. To this end, we make use of a method for checking optimality of entanglement witnesses developed already in [M. Lewenstein et al., Phys. Rev. A 62, 052310 (2000)], however, hardly exploited so far in the literature., Comment: 10 pages, one figure, paper based on the comment arXiv:1304.2040v1

We show that quantum designs characterize the general structure of the optimal approximation of the transpose map on quantum states. Based on this characterization, we propose an implementation of the approximate transpose map by a measurement-and-preparation scheme. The results show that state-manipulation in quantum two-designs suffices for transpose-based quantu3 information applications. In particular, we present how these results can be applied to the framework of detecting multipartite entangled states, for instance, when local measurements or interferometry-based experimental approaches are applied., Comment: 5 pages, 3 figures

Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential to examine the minimum energy gap between the ground level and the next one through the evolution. In this letter, we show a way of speedup in quantum adiabatic evolution algorithm, using the extended Hamiltonian. We present the exact relation between the energy gap and the elements of the extended Hamiltonian, which provides the new point of view to reduce the running time., 5 pages, Latex

Although important for detecting entanglement, the transpose operation cannot be directly realized in laboratory because it is a nonphysical operation. It is, however, possible to find an approximate transpose operation using the method known as the structural physical approximation (SPA); recently, SPA-based implementations of the transpose and partial transpose have been demonstrated for a single-qubit [Phys. Rev. A 83, 020301(R) (2011)] and an entangled two-qubit system [Phys. Rev. Lett. 107, 160401 (2011)]. In this work, we expand SPA-transpose to a three-dimensional quantum system: a qutrit. The photonic qutrit state is encoded in the polarization, and path degrees of freedom of a single-photon and the SPA-transpose operation, which is based on measurement and preparation of quantum states, is implemented with linear optics. Our work paves the way toward entanglement detection for higher-dimensional quantum systems.

The partial transpose by which a subsystem's quantum state is solely transposed is of unique importance in quantum information processing from both fundamental and practical point of view. In this work, we present a practical scheme to realize a physical approximation to the partial transpose using local measurements on individual quantum systems and classical communication. We then report its linear optical realization and show that the scheme works with no dependence on local basis of given quantum states. A proof-of-principle demonstration of entanglement detection using the physical approximation of the partial transpose is also reported.

The partial transpose by which a subsystem's quantum state is solely transposed is of unique importance in quantum information processing from both fundamental and practical point of view. In this work, we present a practical scheme to realize a physical approximation to the partial transpose using local measurements on individual quantum systems and classical communication. We then report its linear optical realization and show that the scheme works with no dependence on local basis of given quantum states. A proof-of-principle demonstration of entanglement detection using the physical approximation of the partial transpose is also reported., Comment: 5 pages with appendix, 3 figures

We report the first experimental realization of an approximate partial transpose for photonic two-qubit systems. Direct detection of entanglement, i.e., without performing quantum state tomography, using the partial transpose operation, is also demonstrated.

Distinguishing different quantum states is a fundamental task having practical applications for information processing. Despite the efforts devoted so far, however, strategies for optimal discrimination are known only for specific examples. We here consider the problem of minimum-error quantum state discrimination where the average error is attempted to be minimized. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalence class share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained., Comment: 35 pages

The universal transpose of quantum states is an anti-unitary transformation that is not allowed in quantum theory. In this work, we investigate approximating the universal transpose of quantum states of two-level systems (qubits) using the method known as structural physical approximation. We also report its experimental implementation in linear optics. The scheme is optimal in that the maximal fidelity is attained, and also practical as measurement and preparation of quantum states that are experimentally feasible within current technologies are solely applied.

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 programming for the discrimination, the optimality condition corresponds to the constraint that quantum theory cannot be used for a superluminal communication. Finally, a general bound to the guessing probability is presented in a closed form., 4 pages

The universal transpose of quantum states is an antiunitary transformation that is not allowed in quantum theory. In this work, we investigate approximating the universal transpose of quantum states of two-level systems (qubits) using the method known as the structural physical approximation to positive maps. We also report its experimental implementation in linear optics. The scheme is optimal in that the maximal fidelity is attained and also practical as measurement and preparation of quantum states that are experimentally feasible within current technologies are solely applied.

We investigate approximating the universal transpose of quantum states of two-level systems (qubits) using the method known as the structural physical approximation to positive maps. We also report its experimental implementation in linear optics.

A simple derivation of the optimal state estimation of a quantum bit was obtained by using the no-signaling principle. In particular, the no-signaling principle determines a unique form of the guessing probability independently of figures of merit, such as the fidelity or information gain. This proves that the optimal estimation for a quantum bit can be achieved by the same measurement for almost all figures of merit., 3 pages, 1 figure

Very recently a conjecture saying that the so-called structural physical approximations (SPAa) to optimal positive maps (optimal entanglement witnesses) give entanglement breaking (EB) maps (separable states) has been posed [J. K. Korbicz {\it et al.}, Phys. Rev. A {\bf 78}, 062105 (2008)]. The main purpose of this contribution is to explore this subject. First, we extend the set of entanglement witnesses (EWs) supporting the conjecture. Then, we ask if SPAs constructed from other than the depolarizing channel maps also lead to EB maps and show that in general this is not the case. On the other hand, we prove an interesting fact that for any positive map $\Lambda$ there exists an EB channel $\Phi$ such that the SPA of $\Lambda$ constructed with the aid of $\Phi$ is again an EB channel. Finally, we ask similar questions in the case of continuous variable systems. We provide a simple way of construction of SPA and prove that in the case of the transposition map it gives EB channel., Comment: 22 pages, improved version, accepted by Journal of Physics A

Bound information, a cryptographic classical analogue of bound entanglement, is defined as classical secret correlations from which no secret key can be extracted. Its existence was conjectured and shown in a multipartite case. In this work, we provide a new example of bound information in a four-partite scenario. Later, using this example, we prove that bound information can be superactivated in a finite-copy scenario and unlockable. We also show that bound entangled states (bound information) can be used to distribute multipartite pure-state entanglement (secret key)., Comment: 7 pages, 2 figures

The universal transpose of quantum states is an anti-unitary transformation that is not allowed in quantum theory. In this work, we investigate approximating the universal transpose of quantum states of two-level systems (qubits) using the method known as the structural physical approximation to positive maps. We also report its experimental implementation in linear optics. The scheme is optimal in that the maximal fidelity is attained and also practical as measurement and preparation of quantum states that are experimentally feasible within current technologies are solely applied., Comment: 4 pages, 4 figures

We derive an explicit analytic estimate for the entanglement of a large class of bipartite quantum states which extends into bound entanglement regions. This is done by using an efficiently computable concurrence lower bound, which is further employed to numerically construct a volume of $3 \times 3$ bound entangled states., Comment: 5 pages, 4 figures. Published version

Non-classical states that are characterized by their non-positive quasi-probabilities in phase space are known to be the basis for various quantum effects. In this work, we investigate the interrelation between the non-classicality and entanglement, and then characterize the non-classicality that precisely corresponds to entanglement. The results naturally follow from two findings: one is the general structure among non-classical, entangled, separable, and classical states over Hermitian operators, and the other a general scheme to detect non-classical states., Comment: 5 pages, 3 figures

The quantum states corresponding to a secret key are characterized using the so-called private states, where the key part consisting of a secret key is shielded by the additional systems. Based on the construction, it was shown that a secret key can be distilled from bound entangled states. In this work, I consider the shielded two-qubit states in a key-distillation scenario and derive the conditions under which a secret key can be distilled using the recurrence protocol or the two-way classical distillation, advantage distillation together with one-way postprocessing. From the security conditions, it is shown that a secret key can be distilled from bound entangled states in a much wider range. In addition, I consider the case that in which white noise is added to quantum states and show that the classical distillation protocol still works despite a certain amount of noise although the recurrence protocol does not., 5 pages

Structural approximations to positive, but not completely positive maps are approximate physical realizations of these non-physical maps. They find applications in the design of direct entanglement detection methods. We show that many of these approximations, in the relevant case of optimal positive maps, define an entanglement breaking channel and, consequently, can be implemented via a measurement and state-preparation protocol. We also show how our findings can be useful for the design of better and simpler direct entanglement detection methods., Comment: 18 pages, 3 figures

We provide a general formalism to characterize the cryptographic properties of quantum channels in the realistic scenario where the two honest parties employ prepare and measure protocols and the known two-way communication reconciliation techniques. We obtain a necessary and sufficient condition to distill a secret key using this type of schemes for Pauli qubit channels and generalized Pauli channels in higher dimension. Our results can be applied to standard protocols such as BB84 or six-state, giving a critical error rate of 20% and 27.6%, respectively. We explore several possibilities to enlarge these bounds, without any improvement. These results suggest that there may exist weakly entangling channels useless for key distribution using prepare and measure schemes., 21 pages

In this work we relate the well-known no-go theorem that two non-orthogonal (mixed) quantum states cannot be perfectly discriminated, to the general principle in physics, the no-signalling condition. In fact, we derive the minimum error in discrimination between two quantum states, using the no-signalling condition., Comment: 4 pages, 1 figure

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 quantum correlations and the properties of entanglement breaking channels., Comment: 4 pages, REVTEX

It is questionable that Grover algorithm may be more valuable than a classical one, when a partial information is given in a unstructured database. In this letter, to consider quantum search when a partial information is given, we replace the Fourier transform in the Grover algorithm with the Haar wavelet transform. We then, given a partial information $L$ to a unstructured database of size $N$, show that there is the improved speedup, $O(\sqrt{N/L})$., 7 pages, 2 figures, Plain latex; some typos corrected

There are hamiltonians that solve a search problem of finding one of $N$ items in $O(\sqrt{N})$ steps. They are hamiltonians to describe an oscillation between two states. In this paper we propose a generalized search hamiltonian, $H_{g}$. Then the known search hamiltonians become special cases of $H_{g}$. From the generalized search hamiltonian, we present remarkable results that searching with 100% is subject only to the phase factor in $H_{g}$ and independent to the number of states or initialization., 5 pages, Latex

We provide a bound on the minimum error when discriminating among quantum states, using the no-signaling principle. The bound is general in that it depends on neither dimensions nor specific structures of given quantum states to be discriminated among. We show that the bound is tight for the minimum-error state discrimination between symmetric (both pure and mixed) qubit states. Moreover, the bound can be applied to a set of quantum states for which the minimum-error state discrimination is not known yet. Finally, our results strengthen the quantitative connection between two no-go theorems, the no-signaling principle and the no perfect state estimation.