1,223 research outputs found

    The mixability of elliptical distributions with supermodular functions

    Full text link
    The concept of Ï•\phi-complete mixability and Ï•\phi-joint mixability was first introduced in Bignozzi and Puccetti (2015), which is a direct extension of complete and joint mixability. Following Bignozzi and Puccetti (2015), we consider two cases of Ï•\phi and investigate the Ï•\phi-joint mixability for elliptical distributions and logarithmic elliptical distributions. We obtain a necessary and sufficient condition for the Ï•\phi-joint mixability of some distributions and a sufficient condition for uniqueness of the center of Ï•\phi-joint mixability for some elliptical distributions.Comment: 12 page

    Blind quantum computation for quantum Fourier transform on Bell states

    Full text link
    It is called blind quantum computation(BQC) that a client who has limited quantum technologies can delegate her quantum computing to a server who has fully-advanced quantum computers. But the privacy of the client's quantum inputs, algorithms and outputs is still a challenge. To realize a secure BQC, we mainly study how to hide quantum fourier transform (QFT) performed on Bell states. In this paper, three cases are considered as follows. For the first case, we design primary BQC protocols of QFT performed on qubits 12 of belonging to {∣ϕ±⟩12,\{|\phi^\pm\rangle_{12}, ∣ψ±⟩12}|\psi^\pm\rangle_{12}\} with relevant circuits. To strengthen security, we construct enhanced BQC protocols of QFT performed on qubits 13 of any two Bell states ∣ξ⟩12⊗∣θ⟩34|\xi\rangle_{12}\otimes|\theta\rangle_{34} with relevant quantum circuits. Featured the property of stronger security, we give generalized BQC protocols of QFT performed on qubits 13 and 24 of any two Bell states with relevant quantum circuits respectively. At last, we analyze and prove the blindness and correctness.Comment: This paper has been withdrawn by the author since the conclusions need to be studied and modified in dept

    Local distinguishability of quantum states in multipartite System

    Full text link
    In this paper, we mainly study the local distinguishable multipartite quantum states by local operations and classical communication (LOCC) in m1⊗m2⊗…⊗mnm_1\otimes m_2\otimes\ldots\otimes m_n , where the quantum system m1m_1 belongs to Alice, m2m_2 belongs to Bob, \ldots and mnm_n belongs to Susan. We first present the pure tripartite distinguishable orthogonal quantum states by LOCC in m1⊗m2⊗m3m_1\otimes m_2\otimes m_3. With the conclusion in m1⊗m2⊗m3m_1\otimes m_2\otimes m_3, we prove distinguishability or indistinguishability of some quantum states. At last, we give the nn-party distinguishable quantum states in m1⊗m2⊗⋯⊗mnm_1\otimes m_2\otimes\cdots\otimes m_n. Our study further reveals quantum nonlocality in multipartite high-dimensional.Comment: This paper has been withdrawn by the author since these examples are not generalize

    Gate Teleportation-based Universal Blind Quantum Computation

    Full text link
    Blind quantum computation (BQC) allows that a client who has limited quantum abilities can delegate quantum computation to a server who has advanced quantum technologies but learns nothing about the client's private information. For example, measurement-based model can guarantee privacy of client's inputs, quantum algorithms and outputs. However, it still remains a challenge to directly encrypt quantum algorithms in circuits model. To solve the problem, we propose GTUBQC, the first gate teleportation-based universal BQC protocol. Specifically, in this paper we consider a scenario where there are a trusted center responsible for preparing initial states, a client with the ability to perform X, Z, and two non-communicating servers conducting UBQC (universal BQC) and Bell measurements. GTUBQC ensures that all quantum outputs are at the client's side and the client only needs to detect whether servers honestly return correct measurement outcomes or not. In particular, GTUBQC can hide the universal quantum gates by encrypting the rotation angles, because arbitrary unitary operation can be decomposed into a combination of arbitrary rotation operators. Also, GTUBQC protocol can facilitate realizing UBQC in circuits, since GTUBQC uses one-time-pad to guarantee blindness. We prove the blindness and correctness of GTUBQC, and apply our approach to other types of computational tasks, such as quantum Fourier transform.Comment: 8 pages, 6 figure

    Local distinguishability of quantum states in bipartite systems

    Full text link
    In this article, we show a sufficient and necessary condition for locally distinguishable bipartite states via one-way local operations and classical communication (LOCC). With this condition, we present some minimal structures of one-way LOCC indistinguishable quantum state sets. As long as an indistinguishable subset exists in a state set, the set is not distinguishable. We also list several distinguishable sets as instances

    Spin Squeezing, Negative Correlations, and Concurrence in the Quantum Kicked Top Model

    Full text link
    We study spin squeezing, negative correlations, and concurrence in the quantum kicked top model. We prove that the spin squeezing and negative correlations are equivalent for spin systems with only symmetric Dicke states populated. We numerically analyze spin squeezing parameters and concurrence in this model, and find that the maximal spin squeezing direction, which refers to the minimal pairwise correlation direction, is strongly influenced by quantum chaos. Entanglement (spin squeezing) sudden death and sudden birth occur alternatively for the periodic and quasi-periodic cases, while only entanglement (spin squeezing) sudden death is found for the chaotic case.Comment: 8 pages, 6 figure

    Band structure and spin texture of Bi2_2Se3_3/3d ferromagnetic metal interface

    Full text link
    The spin-helical surface states in three-dimensional topological insulator (TI), such as Bi2Se3, are predicted to have superior efficiency in converting charge current into spin polarization. This property is said to be responsible for the giant spin-orbit torques observed in ferromagnetic metal/TI structures. In this work, using first-principles and model tight-binding calculations, we investigate the interface between the topological insulator Bi2Se3 and 3d-transition ferromagnetic metals Ni and Co. We find that the difference in the work functions of the topological insulator and the ferromagnetic metals shift the topological surface states down about 0.5 eV below the Fermi energy where the hybridization of these surface states with the metal bands destroys their helical spin structure. The band alignment of Bi2Se3 and Ni (Co) places the Fermi energy far in the conduction band of bulk Bi2Se3, where the spin of the carriers is aligned with the magnetization in the metal. Our results indicate that the topological surface states are unlikely to be responsible for the huge spin-orbit torque effect observed experimentally in these systems.Comment: 4 figure

    Combining Representation Learning with Tensor Factorization for Risk Factor Analysis - an application to Epilepsy and Alzheimer's disease

    Full text link
    Existing studies consider Alzheimer's disease (AD) a comorbidity of epilepsy, but also recognize epilepsy to occur more frequently in patients with AD than those without. The goal of this paper is to understand the relationship between epilepsy and AD by studying causal relations among subgroups of epilepsy patients. We develop an approach combining representation learning with tensor factorization to provide an in-depth analysis of the risk factors among epilepsy patients for AD. An epilepsy-AD cohort of ~600,000 patients were extracted from Cerner Health Facts data (50M patients). Our experimental results not only suggested a causal relationship between epilepsy and later onset of AD ( p = 1.92e-51), but also identified five epilepsy subgroups with distinct phenotypic patterns leading to AD. While such findings are preliminary, the proposed method combining representation learning with tensor factorization seems to be an effective approach for risk factor analysis

    Anomalous excitation enhancement with Rydberg-dressed atoms

    Full text link
    We develop the research achievement of recent work [M. G\"arttner, et.al., Phys. Rev. Letts. 113, 233002 (2014)], in which an anomalous excitation enhancement is observed in a three-level Rydberg-atom ensemble with many-body coherence. In our novel theoretical analysis, this effect is ascribed to the existence of a quasi-dark state as well as its avoided crossings to nearby Rydberg-dressed states. Moreover, we show that with an appropriate control of the optical detuning to the intermediate state, the enhancement can evoke a direct facilitation to atom-light coupling that even breaks through the conventional N\sqrt{N} limit of strong-blockaded ensembles. As a consequence, the intensity of the probe laser for intermediate transition can be reduced considerably, increasing the feasibility of experiments with Rydberg-dressed atoms.Comment: 8 pages, 6 figures, PRA in pres

    Model-Protected Multi-Task Learning

    Full text link
    Multi-task learning (MTL) refers to the paradigm of learning multiple related tasks together. In contrast, in single-task learning (STL) each individual task is learned independently. MTL often leads to better trained models because they can leverage the commonalities among related tasks. However, because MTL algorithms can ``leak" information from different models across different tasks, MTL poses a potential security risk. Specifically, an adversary may participate in the MTL process through one task and thereby acquire the model information for another task. The previously proposed privacy-preserving MTL methods protect data instances rather than models, and some of them may underperform in comparison with STL methods. In this paper, we propose a privacy-preserving MTL framework to prevent information from each model leaking to other models based on a perturbation of the covariance matrix of the model matrix. We study two popular MTL approaches for instantiation, namely, learning the low-rank and group-sparse patterns of the model matrix. Our algorithms can be guaranteed not to underperform compared with STL methods. We build our methods based upon tools for differential privacy, and privacy guarantees, utility bounds are provided, and heterogeneous privacy budgets are considered. The experiments demonstrate that our algorithms outperform the baseline methods constructed by existing privacy-preserving MTL methods on the proposed model-protection problem.Comment: Supplemental materials are attached at the end of the main pape
    • …
    corecore