Weighted Graph States Research Articles

Extracting perfect GHZ states from imperfect weighted graph states via entanglement concentration

Extracting perfect GHZ states from imperfect weighted graph states via entanglement concentration

Variational Ansatz for the Ground State of the Quantum Sherrington-Kirkpatrick Model.

We present an Ansatz for the ground states of the quantum Sherrington-Kirkpatrick model, a paradigmatic model for quantum spin glasses. Our Ansatz, based on the concept of generalized coherent states, very well captures the fundamental aspects of the model, including the ground state energy and the position of the spin glass phase transition. It further enables us to study some previously unexplored features, such as the nonvanishing longitudinal field regime and the entanglement structure of the ground states. We find that the ground state entanglement can be captured by a simple ensemble of weighted graph states with normally distributed phase gates, leading to a volume law entanglement, contrasting with predictions based on entanglement monogamy.

The XP Stabiliser Formalism: a Generalisation of the Pauli Stabiliser Formalism with Arbitrary Phases

We propose an extension to the Pauli stabiliser formalism that includes fractional 2π/N rotations around the Z axis for some integer N. The resulting generalised stabiliser formalism – denoted the XP stabiliser formalism – allows for a wider range of states and codespaces to be represented. We describe the states which arise in the formalism, and demonstrate an equivalence between XP stabiliser states and 'weighted hypergraph states' – a generalisation of both hypergraph and weighted graph states. Given an arbitrary set of XP operators, we present algorithms for determining the codespace and logical operators for an XP code. Finally, we consider whether measurements of XP operators on XP codes can be classically simulated.

Nonclassical correlations in subsystems of globally entangled quantum states

The relation between genuine multipartite entanglement in the pure state of a collection of N qubits and the nonclassical correlations in its two-qubit subsystems is studied. Quantum discord is used as the quantifier of nonclassical correlations in the subsystem while the generalised geometric measure (GGM) [Phys. Rev. A. 81, 012308 (2010)] is used to quantify global entanglement in the N-qubit state. While no definite discernible dependence between the two can be found for randomly generated global states, for those with additional structure like weighted graph states we find that local discord is indicative of global multipartite entanglement. Global states that admit efficient classical descriptions like stabilizer states furnish an exception in which despite multipartite entanglement, nonclassical correlation is absent in two qubit subsystems. We discuss these results in the context of mixed state quantum computation where nonclassical correlation is considered a candidate resource that enables exponential speedup over classical computers.

General framework for verifying pure quantum states in the adversarial scenario

Bipartite and multipartite entangled states are of central interest in quantum information processing and foundational studies. Efficient verification of these states, especially in the adversarial scenario, is a key to various applications, including quantum computation, quantum simulation, and quantum networks. However, little is known about this topic in the adversarial scenario. Here we initiate a systematic study of pure-state verification in the adversarial scenario. In particular, we introduce a general method for determining the minimal number of tests required by a given strategy to achieve a given precision. In the case of homogeneous strategies, we can even derive an analytical formula. Furthermore, we propose a general recipe to verifying pure quantum states in the adversarial scenario by virtue of protocols for the nonadversarial scenario. Thanks to this recipe, the resource cost for verifying an arbitrary pure state in the adversarial scenario is comparable to the counterpart for the nonadversarial scenario, and the overhead is at most three times for high-precision verification. Our recipe can readily be applied to efficiently verify bipartite pure states, stabilizer states, hypergraph states, weighted graph states, and Dicke states in the adversarial scenario, even if only local projective measurements are accessible. This paper is an extended version of the companion paper Zhu and Hayashi, Phys. Rev. Lett. 123, 260504 (2019).

Verifying commuting quantum computations via fidelity estimation of weighted graph states

The instantaneous quantum polynomial time (IQP) model is one of promising models to demonstrate a quantum computational advantage over classical computers. If the IQP model can be efficiently simulated by a classical computer, an unlikely consequence in computer science can be obtained (under some unproven conjectures). In order to experimentally demonstrate the advantage using medium or large-scale IQP circuits, it is inevitable to efficiently verify whether the constructed IQP circuits faithfully work. There exist two types of IQP models, each of which is the sampling on hypergraph states or weighted graph states. For the first-type IQP model, polynomial-time verification protocols have already been proposed. In this paper, we propose verification protocols for the second-type IQP model. To this end, we propose polynomial-time fidelity estimation protocols of weighted graph states for each of the following four situations where a verifier can (i) choose any measurement basis and perform adaptive measurements, (ii) only choose restricted measurement bases and perform adaptive measurements, (iii) choose any measurement basis and only perform non-adaptive measurements, and (iv) only choose restricted measurement bases and only perform non-adaptive measurements. In all of our verification protocols, the verifier’s quantum operations are only single-qubit measurements. Since we assume no independent and identically distributed property on quantum states, our protocols work in any situation.

Einstein-Podolsky-Rosen steering in Gaussian weighted graph states

Einstein-Podolsky-Rosen (EPR) steering, as one of the most intriguing phenomenon of quantum mechanics, is a useful quantum resource for quantum communication. Understanding the type of EPR steering in a graph state is the basis for application of it in a quantum network. In this paper, we present EPR steering in a Gaussian weighted graph state, including a linear tripartite and a four-mode square weighted graph state. The dependence of EPR steering on weight factor in the weighted graph state is analyzed. Gaussian EPR steering between two modes of a weighted graph state is presented, which does not exist in the Gaussian cluster state (where the weight factor is unit). For the four-mode square Gaussian weighted graph state, EPR steering between one and its two nearest modes is also presented, which is absent in the four-mode square Gaussian cluster state. We also show that Gaussian EPR steering in a weighted graph state is also bounded by the Coffman-Kundu-Wootters monogamy relation. The presented results are useful for exploiting EPR steering in a Gaussian weighted graph state as a valuable resource in multiparty quantum communication tasks.

Implementation security of quantum key distribution due to polarization-dependent efficiency mismatch

Einstein-Podolsky-Rosen (EPR) steering, as one of the most intriguing phenomenon of quantum mechanics, is a useful quantum resource for quantum communication. Understanding the type of EPR steering in a graph state is the basis for application of it in a quantum network. In this paper, we present EPR steering in a Gaussian weighted graph state, including a linear tripartite and a four-mode square weighted graph state. The dependence of EPR steering on weight factor in the weighted graph state is analyzed. Gaussian EPR steering between two modes of a weighted graph state is presented, which does not exist in the Gaussian cluster state (where the weight factor is unit). For the four-mode square Gaussian weighted graph state, EPR steering between one and its two nearest modes is also presented, which is absent in the four-mode square Gaussian cluster state. We also show that Gaussian EPR steering in a weighted graph state is also bounded by the Coffman-Kundu-Wootters monogamy relation. The presented results are useful for exploiting EPR steering in a Gaussian weighted graph state as a valuable resource in multiparty quantum communication tasks.

Computational quantum-classical boundary of noisy commuting quantum circuits.

It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region.

Universal weighted graph state generation with the cross phase modulation

We introduce an architecture of cascade C Z θ operation for conveniently generating universal weighted graph state. The entanglement bonds between dependent or independent single photons can be created efficiently with only one ancilla single photon. The generation is scalable for universal weighted graph states, including arbitrary two-dimensional or three-dimensional weighted graph states. Moreover, the generation is flexible, including that the controlled phase shift θ between each pair of single photons can be different, the traces of the ancilla single photon walking is not fixed, and the prior entangled states are not required.

Robustness of Genuine Tripartite Entanglement under Collective Dephasing

We study the robustness of genuine multipartite entanglement for a system of three qubits under collective dephasing. Using a computable entanglement monotone for multipartite systems, we find that almost every state is quite robust under this type of decoherence. We analyze random states and weighted graph states at infinity and find all of them to be genuinely entangled.

Evolution of Genuine Multipartite Entanglement of Specific and Random States Under non-Markovian Noise

We study the dynamics of genuine multipartite entanglement under non-Markovian noise. Using a computable entanglement monotone for multipartite systems, we investigate a system of three qubits each of which is individually exposed to classical Ornstein–Uhlenbeck noise. We found that the W state mixed with the maximally mixed state is the most fragile state, whereas a similar mixture of GHZ state exhibits robust behaviour. We compare dynamics of these states with dynamics of similar mixtures of random states and weighted graph states. We also discuss the limiting cases.

Quantum random state generation with predefined entanglement constraint

Entanglement plays an important role in quantum communication, algorithms, and error correction. Schmidt coefficients are correlated to the eigenvalues of the reduced density matrix. These eigenvalues are used in von Neumann entropy to quantify the amount of the bipartite entanglement. In this paper, we map the Schmidt basis and the associated coefficients to quantum circuits to generate random quantum states. We also show that it is possible to adjust the entanglement between subsystems by changing the quantum gates corresponding to the Schmidt coefficients. In this manner, random quantum states with predefined bipartite entanglement amounts can be generated using random Schmidt basis. This provides a technique for generating equivalent quantum states for given weighted graph states, which are very useful in the study of entanglement, quantum computing, and quantum error correction.

Dynamics of genuine multipartite entanglement under local non-Markovian dephasing

We study dynamics of genuine entanglement for quantum states of three and four qubits under non-Markovian dephasing. Using a computable entanglement monotone for multipartite systems, we find that GHZ state is quite resilient state whereas the W state is the most fragile. We compare dynamics of chosen quantum states with dynamics of random pure states and weighted graph states.

Improved frequency standard via weighted graph states

We study the spin squeezing property of weighted graph states, which can be used to improve sensitivity in interferometry. We study the time evolution of spin squeezing under local decoherence acting independently on each qubit. Based on the analysis, the spin squeezing of the weighted graph states is somehow robust in the presence of decoherence and the decoherence limit in the improvement of the interferometric sensitivity is still achievable. Furthermore, one can obtain the optimal improvement of sensitivity by tuning the weighted of each edges of the weighted graph state.

Spin-squeezing property of weighted graph states

We study the spin squeezing property of weighted graph states, which can be used to improve the sensitivity in interferometry. Decoherence reduces the spin squeezing property but the result remains superior over other reference schemes with GHZ-type maximally entangled states and product states. We study the time evolution of spin squeezing of weighted graph states coupled to different decoherence channels. Based on the analysis, the spin squeezing of the weighted graph states is robust in the presence of decoherence and the decoherence limit in the improvement of the interferometric sensitivity is still achievable.

Generation of atomic momentum cluster and graph states via cavity QED

We present an experimentally feasible method, based on currently available cavity QED technology, to generate n-partite linear cluster and graph states in external degree of freedom of atoms. The scheme is based on first tagging n two-level atoms with the respective cavity fields in momentum space. Later on an effective Ising interaction between such tagged atoms, realized through consecutive resonant and dispersive interactions of auxiliary atoms with the remanent cavity fields, can generate the desired atomic momenta states. The procedure is completed when the auxiliary atoms after passing through Ramsey zones are detected in either of their internal states. We also briefly explain the generation of weighted graph states in the atomic external degree of freedom.

Tensor network methods with graph enhancement

We present applications of the renormalization algorithm with graph enhancement (RAGE). This analysis extends the algorithms and applications given for approaches based on matrix product states introduced in [Phys. Rev. A 79, 022317 (2009)] to other tensor-network states such as the tensor tree states (TTS) and projected entangled pair states. We investigate the suitability of the bare TTS to describe ground states, showing that the description of certain graph states and condensed-matter models improves. We investigate graph-enhanced tensor-network states, demonstrating that in some cases (disturbed graph states and for certain quantum circuits) the combination of weighted graph states with TTS can greatly improve the accuracy of the description of ground states and time-evolved states. We comment on delineating the boundary of the classically efficiently simulatable states of quantum many-body systems.

Graphical rule of transforming continuous-variable graph states by local homodyne detection

Graphical rule, describing that any single-mode homodyne detection turns a given continuous-variable (CV) graph state into a new one, is presented. Employing two simple graphical rules---local complement operation and vertex deletion (single quadrature-amplitude $\mathrm{x\ifmmode \hat{}\else \^{}\fi{}}$ measurement)---the graphical rule for any single-mode quadrature component measurement can be obtained. The shape of CV weighted graph state may be designed and constructed easily from a given larger graph state by applying this graphical rule.

Quantum Teamwork for Unconditional Multiparty Communication with Gaussian States

We demonstrate the capability of continuous variable Gaussian states to communicate multipartite quantum information. A quantum teamwork protocol is presented according to which an arbitrary possibly entangled multimode state can be faithfully teleported between two teams each comprising many cooperative users. We prove that N-mode Gaussian weighted graph states exist for arbitrary N that enable unconditional quantum teamwork implementations for any arrangement of the teams. These perfect continuous variable maximally multipartite entangled resources are typical among pure Gaussian states and are unaffected by the entanglement frustration occurring in multiqubit states.