Mio Murao

Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication

We show that entanglement guarantees difficulty in the discrimination of orthogonal multipartite states locally. The number of pure states that can be discriminated by local operations and classical communication is bounded by the total dimension over the average entanglement. A similar, general condition is also shown for pure and mixed states. These results offer a rare operational interpretation for three abstractly defined distancelike measures of multipartite entanglement.

Remote Information Concentration Using a Bound Entangled State

Remote information concentration, the reverse process of quantum telecloning, is presented. In this scheme, quantum information originally from a single qubit, but now distributed into three spatially separated qubits, is remotely concentrated back to a single qubit via an initially shared entangled state without performing any global operations. This entangled state is a single unlockable bound entangled state and we analyze its properties.

The maximally entangled symmetric state in terms of the geometric measure

The geometric measure of entanglement is investigated for permutation symmetric pure states of multipartite qubit systems, in particular the question of maximum entanglement. This is done with the help of the Majorana representation, which maps an n qubit symmetric state to n points on the unit sphere. It is shown how symmetries of the point distribution can be exploited to simplify the calculation of entanglement and also help find the maximally entangled symmetric state. Using a combination of analytical and numerical results, the most entangled symmetric states for up to 12 qubits are explored and discussed. The optimization problem on the sphere presented here is then compared with two classical optimization problems on the S2 sphere, namely Toths problem and Thomsons problem, and it is observed that, in general, they are different problems.

A framework for phase and interference in generalized probabilistic theories

Andrew J. P. Garner1∗, Oscar C. O. Dahlsten † , Yoshifumi Nakata3‡, Mio Murao and Vlatko Vedral Atomic and Laser Physics, Clarendon Laboratory, University of Oxford, Parks Road, Oxford, OX13PU, United Kingdom Center for Quantum Technologies, National University of Singapore, Republic of Singapore Department of Physics, Graduate School of Science, University of Tokyo, Tokyo 113-0033, Japan Institute for Nano Quantum Information Electronics, University of Tokyo, Tokyo 153-8505, Japan (Dated: May 11, 2014)

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.

Entanglement cost of implementing controlled-unitary operations.

We investigate the minimum entanglement cost of the deterministic implementation of two-qubit controlled-unitary operations using local operations and classical communication (LOCC). We show that any such operation can be implemented by a three-turn LOCC protocol, which requires at least 1 ebit of entanglement when the resource is given by a bipartite entangled state with Schmidt number 2. Our result implies that there is a gap between the minimum entanglement cost and the entangling power of controlled-unitary operations. This gap arises due to the requirement of implementing the operations while oblivious to the identity of the inputs.

Generating a state t-design by diagonal quantum circuits

We investigate protocols for generating a state t-design by using a fixed separable initial state and a diagonal-unitary t-design in the computational basis, which is a t-design of an ensemble of diagonal unitary matrices with random phases as their eigenvalues. We first show that a diagonal-unitary t-design generates a -approximate state t-design, where N is the number of qubits. We then discuss a way of improving the degree of approximation by exploiting non-diagonal gates after applying a diagonal-unitary t-design. We also show that it is necessary and sufficient to use -qubit gates with random phases to generate a diagonal-unitary t-design by diagonal quantum circuits, and that each multi-qubit diagonal gate can be replaced by a sequence of multi-qubit controlled-phase-type gates with discrete-valued random phases. Finally, we analyze the number of gates for implementing a diagonal-unitary t-design by non-diagonal two- and one-qubit gates. Our results provide a concrete application of diagonal quantum circuits in quantum informational tasks.

Which Graph States are Useful for Quantum Information Processing

Graph statesa[ 5 ] are an elegant and powerful quantum resource for measurement based quantum computation (MBQC). They are also used for many quantum protocols (error correction, secret sharing, etc.). The main focus of this paper is to provide a structural characterisation of the graph states that can be used for quantum information processing. The existence of a gflow (generalized flow) [ 8 ] is known to be a requirement for open graphs (graph, input set and output set) to perform uniformly and strongly deterministic computations. We weaken the gflow conditions to define two new more general kinds of MBQC: uniform equiprobability and constant probability. These classes can be useful from a cryptographic and information point of view because even though we cannot do a deterministic computation in general we can preserve the information and transfer it perfectly from the inputs to the outputs. We derive simple graph characterisations for these classes and prove that the deterministic and uniform equiprobability classes collapse when the cardinalities of inputs and outputs are the same. We also prove the reversibility of gflow in that case. The new graphical characterisations allow us to go from open graphs to graphs in general and to consider this question: given a graph with no inputs or outputs fixed, which vertices can be chosen as input and output for quantum information processing? We present a characterisation of the sets of possible inputs and ouputs for the equiprobability class, which is also valid for deterministic computations with inputs and ouputs of the same cardinality.

Measurement-based quantum computation on symmetry breaking thermal States.

We consider measurement-based quantum computation (MBQC) on thermal states of the interacting cluster Hamiltonian containing interactions between the cluster stabilizers that undergoes thermal phase transitions. We show that the long-range order of the symmetry breaking thermal states below a critical temperature drastically enhances the robustness of MBQC against thermal excitations. Specifically, we show the enhancement in two-dimensional cases and prove that MBQC is topologically protected below the critical temperature in three-dimensional cases. The interacting cluster Hamiltonian allows us to perform MBQC even at a temperature 1 order of magnitude higher than that of the free cluster Hamiltonian.

Quantum computation over the butterfly network

In order to investigate distributed quantum computation under restricted network resources, we introduce a quantum computation task over the butterfly network where both quantum and classical communications are limited. We consider deterministically performing a two-qubit global unitary operation on two unknown inputs given at different nodes, with outputs at two distinct nodes. By using a particular resource setting introduced by M. Hayashi [Phys. Rev. A 76, 040301(R) (2007)], which is capable of performing a swap operation by adding two maximally entangled qubits (ebits) between the two input nodes, we show that unitary operations can be performed without adding any entanglement resource, if and only if the unitary operations are locally unitary equivalent to controlled unitary operations. Our protocol is optimal in the sense that the unitary operations cannot be implemented if we relax the specifications of any of the channels. We also construct protocols for performing controlled traceless unitary operations with a 1-ebit resource and for performing global Clifford operations with a 2-ebit resource.