arXiv subjects

Akimasa Miyake

Publications and source records attributed to Akimasa Miyake.

47 records · Page 3Linked to original sources

arXiv2008

Survival of entanglement in thermal states

We present a general sufficiency condition for the presence of multipartite entanglement in thermal states stemming from the ground state entanglement. The condition is written in terms of the ground state entanglement and the partition function and it gives transition temperatures below which entanglement is guaranteed to survive. It is flexible and can be easily adapted to consider entanglement for different splittings, as well as be weakened to allow easier calculations by approximations. Examples where the condition is calculated are given. These examples allow us to characterize a minimum gapping behavior for the survival of entanglement in the thermodynamic limit. Further, the same technique can be used to find noise thresholds in the generation of useful resource states for one-way quantum computing.

quant-ph↗

arXiv2008

Phase transition of computational power in the resource states for one-way quantum computation

We study how heralded qubit losses during the preparation of a two-dimensional cluster state, a universal resource state for one-way quantum computation, affect its computational power. Above the percolation threshold we present a polynomial-time algorithm that concentrates a universal cluster state, using resources that scale optimally in the size of the original lattice. On the other hand, below the percolation threshold, we show that single qubit measurements on the faulty lattice can be efficiently simulated classically. We observe a phase transition at the threshold when the amount of entanglement in the faulty lattice directly relevant to the computational power changes exponentially.

quant-ph↗

arXiv2007

Entanglement and local information access for graph states

We exactly evaluate a number of multipartite entanglement measures for a class of graph states, including d-dimensional cluster states (d = 1,2,3), the Greenberger-Horne-Zeilinger states, and some related mixed states. The entanglement measures that we consider are continuous, `distance from separable states' measures, including the relative entropy, the so-called geometric measure, and robustness of entanglement. We also show that for our class of graph states these entanglement values give an operational interpretation as the maximal number of graph states distinguishable by local operations and classical communication (LOCC), as well as supplying a tight bound on the fixed letter classical capacity under LOCC decoding.

quant-ph↗

arXiv2006

Entanglement purification protocols for all graph states

We present multiparty entanglement purification protocols that are capable of purifying arbitrary graph states directly. We develop recurrence and breeding protocols and compare our methods with strategies based on bipartite entanglement purification in static and communication scenarios. We find that direct multiparty purification is of advantage with respect to achievable yields and minimal required fidelity in static scenarios, and with respect to obtainable fidelity in the case of noisy operations in both scenarios.

quant-ph↗

arXiv2006

Universal resources for measurement-based quantum computation

We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other universal resource. We obtain a powerful criterion to assess universality of graph states, by introducing an entanglement measure which necessarily grows unboundedly with the system size for all universal resource states. Furthermore, we prove that graph states associated with 2D lattices such as the hexagonal and triangular lattice are universal, and obtain the first example of a universal non-graph state.

quant-ph↗

arXiv2005

Distillation of multipartite entanglement by complementary stabilizer measurements

We propose a scheme of multipartite entanglement distillation driven by a complementary pair of stabilizer measurements, to distill directly a wider range of states beyond the stabilizer code states (such as the Greenberger-Horne-Zeilinger states). We make our idea explicit by constructing a recurrence protocol for the 3-qubit W state. Noisy W states resulting from typical decoherence can be directly purified in a few steps, if their initial fidelity is larger than a threshold. For general input mixed states, we observe distillations to hierarchical fixed points, i.e., not only to the W state but also to the 2-qubit Bell pair, depending on their initial entanglement.

quant-ph↗

arXiv2004

Multipartite Entanglement under Stochastic Local Operations and Classical Communication

Stochastic local operations and classical communication (SLOCC), also called local filtering operations, are a convenient, useful set of quantum operations in grasping essential properties of entanglement. We give a quick overview about the characteristics of multipartite entanglement in terms of SLOCC, illustrating the 2-qubit and the rest (2 x 2 x n) quantum system. This not only includes celebrated results of 3-qubit pure states, but also has implications to 2-qubit mixed states.

quant-ph↗

arXiv2004

Multipartite entanglement in 2 x 2 x n quantum systems

We classify multipartite entangled states in the 2 x 2 x n (n >= 4) quantum system, for example the 4-qubit system distributed over 3 parties, under local filtering operations. We show that there exist nine essentially different classes of states, and they give rise to a five-graded partially ordered structure, including the celebrated Greenberger-Horne-Zeilinger (GHZ) and W classes of 3 qubits. In particular, all 2 x 2 x n-states can be deterministically prepared from one maximally entangled state, and some applications like entanglement swapping are discussed.

quant-ph↗

arXiv2003

Classification of multipartite entangled states by multidimensional determinants

We find that multidimensional determinants "hyperdeterminants", related to entanglement measures (the so-called concurrence or 3-tangle for the 2 or 3 qubits, respectively), are derived from a duality between entangled states and separable states. By means of the hyperdeterminant and its singularities, the single copy of multipartite pure entangled states is classified into an onion structure of every closed subset, similar to that by the local rank in the bipartite case. This reveals how inequivalent multipartite entangled classes are partially ordered under local actions. In particular, the generic entangled class of the maximal dimension, distinguished as the nonzero hyperdeterminant, does not include the maximally entangled states in Bell's inequalities in general (e.g., in the $n \geq 4$ qubits), contrary to the widely known bipartite or 3-qubit cases. It suggests that not only are they never locally interconvertible with the majority of multipartite entangled states, but they would have no grounds for the canonical n-partite entangled states. Our classification is also useful for the mixed states.

quant-ph↗

arXiv2002

Multipartite Entanglement and Hyperdeterminants

We classify multipartite entanglement in a unified manner, focusing on a duality between the set of separable states and that of entangled states. Hyperdeterminants, derived from the duality, are natural generalizations of entanglement measures, the concurrence, 3-tangle for 2, 3 qubits respectively. Our approach reveals how inequivalent multipartite entangled classes of pure states constitute a partially ordered structure under local actions, significantly different from a totally ordered one in the bipartite case. Moreover, the generic entangled class of the maximal dimension, given by the nonzero hyperdeterminant, does not include the maximally entangled states in Bell's inequalities in general (e.g., in the 4 or more qubits), contrary to the widely known bipartite or 3-qubit cases. It suggests that not only are they never locally interconvertible with the majority of multipartite entangled states, but they would have no grounds for the canonical n-partite entangled states. Our classification is also useful for that of mixed states.

quant-ph↗

arXiv2001

Geometric Strategy for the Optimal Quantum Search

We explore quantum search from the geometric viewpoint of a complex projective space $CP$, a space of rays. First, we show that the optimal quantum search can be geometrically identified with the shortest path along the geodesic joining a target state, an element of the computational basis, and such an initial state as overlaps equally, up to phases, with all the elements of the computational basis. Second, we calculate the entanglement through the algorithm for any number of qubits $n$ as the minimum Fubini-Study distance to the submanifold formed by separable states in Segre embedding, and find that entanglement is used almost maximally for large $n$. The computational time seems to be optimized by the dynamics as the geodesic, running across entangled states away from the submanifold of separable states, rather than the amount of entanglement itself.

quant-ph↗