WorldWideScience

Sample records for bipartite quantum error

  1. Quantum open system theory: bipartite aspects.

    Science.gov (United States)

    Yu, T; Eberly, J H

    2006-10-06

    We demonstrate in straightforward calculations that even under ideally weak noise the relaxation of bipartite open quantum systems contains elements not previously encountered in quantum noise physics. While additivity of decay rates is known to be generic for decoherence of a single system, we demonstrate that it breaks down for bipartite coherence of even the simplest composite systems.

  2. Relativistic quantum correlations in bipartite fermionic states

    Indian Academy of Sciences (India)

    The influences of relative motion, the size of the wave packet and the average momentum of the particles on different types of correlations present in bipartite quantum states are investigated. In particular, the dynamics of the quantum mutual information, the classical correlation and the quantum discord on the ...

  3. Relativistic quantum correlations in bipartite fermionic states

    Indian Academy of Sciences (India)

    2016-09-21

    Sep 21, 2016 ... particles on different types of correlations present in bipartite quantum states are investigated. In particular, the ... the focus of research for the last few years. Many re- ..... figures, the qualitative behaviour of all the three types ...

  4. Detecting quantum critical points using bipartite fluctuations.

    Science.gov (United States)

    Rachel, Stephan; Laflorencie, Nicolas; Song, H Francis; Le Hur, Karyn

    2012-03-16

    We show that the concept of bipartite fluctuations F provides a very efficient tool to detect quantum phase transitions in strongly correlated systems. Using state-of-the-art numerical techniques complemented with analytical arguments, we investigate paradigmatic examples for both quantum spins and bosons. As compared to the von Neumann entanglement entropy, we observe that F allows us to find quantum critical points with much better accuracy in one dimension. We further demonstrate that F can be successfully applied to the detection of quantum criticality in higher dimensions with no prior knowledge of the universality class of the transition. Promising approaches to experimentally access fluctuations are discussed for quantum antiferromagnets and cold gases.

  5. Building versatile bipartite probes for quantum metrology

    Science.gov (United States)

    Farace, Alessandro; De Pasquale, Antonella; Adesso, Gerardo; Giovannetti, Vittorio

    2016-01-01

    We consider bipartite systems as versatile probes for the estimation of transformations acting locally on one of the subsystems. We investigate what resources are required for the probes to offer a guaranteed level of metrological performance, when the latter is averaged over specific sets of local transformations. We quantify such a performance via the average skew information (AvSk), a convex quantity which we compute in closed form for bipartite states of arbitrary dimensions, and which is shown to be strongly dependent on the degree of local purity of the probes. Our analysis contrasts and complements the recent series of studies focused on the minimum, rather than the average, performance of bipartite probes in local estimation tasks, which was instead determined by quantum correlations other than entanglement. We provide explicit prescriptions to characterize the most reliable states maximizing the AvSk, and elucidate the role of state purity, separability and correlations in the classification of optimal probes. Our results can help in the identification of useful resources for sensing, estimation and discrimination applications when complete knowledge of the interaction mechanism realizing the local transformation is unavailable, and access to pure entangled probes is technologically limited.

  6. Building versatile bipartite probes for quantum metrology

    International Nuclear Information System (INIS)

    Farace, Alessandro; Pasquale, Antonella De; Giovannetti, Vittorio; Adesso, Gerardo

    2016-01-01

    We consider bipartite systems as versatile probes for the estimation of transformations acting locally on one of the subsystems. We investigate what resources are required for the probes to offer a guaranteed level of metrological performance, when the latter is averaged over specific sets of local transformations. We quantify such a performance via the average skew information (AvSk), a convex quantity which we compute in closed form for bipartite states of arbitrary dimensions, and which is shown to be strongly dependent on the degree of local purity of the probes. Our analysis contrasts and complements the recent series of studies focused on the minimum, rather than the average, performance of bipartite probes in local estimation tasks, which was instead determined by quantum correlations other than entanglement. We provide explicit prescriptions to characterize the most reliable states maximizing the AvSk, and elucidate the role of state purity, separability and correlations in the classification of optimal probes. Our results can help in the identification of useful resources for sensing, estimation and discrimination applications when complete knowledge of the interaction mechanism realizing the local transformation is unavailable, and access to pure entangled probes is technologically limited. (paper)

  7. Quantum trajectory approach to the geometric phase: open bipartite systems

    International Nuclear Information System (INIS)

    Yi, X X; Liu, D P; Wang, W

    2005-01-01

    Through the quantum trajectory approach, we calculate the geometric phase acquired by a bipartite system subjected to decoherence. The subsystems that compose the bipartite system interact with each other and then are entangled in the evolution. The geometric phase due to the quantum jump for both the bipartite system and its subsystems is calculated and analysed. As an example, we present two coupled spin-1/2 particles to detail the calculations

  8. Bipartite quantum states and random complex networks

    International Nuclear Information System (INIS)

    Garnerone, Silvano; Zanardi, Paolo; Giorda, Paolo

    2012-01-01

    We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of random graphs known as complex networks. In the case of classical random graphs, we derive an analytic expression for the averaged entanglement entropy S-bar while for general complex networks we rely on numerics. For a large number of nodes n we find a scaling S-bar ∼c log n +g e where both the prefactor c and the sub-leading O(1) term g e are characteristic of the different classes of complex networks. In particular, g e encodes topological features of the graphs and is named network topological entropy. Our results suggest that quantum entanglement may provide a powerful tool for the analysis of large complex networks with non-trivial topological properties. (paper)

  9. Controlled teleportation of a 3-dimensional bipartite quantum state

    International Nuclear Information System (INIS)

    Cao Haijing; Chen Zhonghua; Song Heshan

    2008-01-01

    A controlled teleportation scheme of an unknown 3-dimensional (3D) two-particle quantum state is proposed, where a 3D Bell state and 3D GHZ state function as the quantum channel. This teleportation scheme can be directly generalized to teleport an unknown d-dimensional bipartite quantum state

  10. Quantumness of bipartite states in terms of conditional entropies

    International Nuclear Information System (INIS)

    Li, Nan; Luo, Shunlong; Zhang, Zhengmin

    2007-01-01

    Quantum discord, as defined by Olliver and Zurek (2002 Phys. Rev. Lett. 88 017901) as the difference of two natural quantum extensions of the classical mutual information, plays an interesting role in characterizing quantumness of correlations. Inspired by this idea, we will study quantumness of bipartite states arising from different quantum analogs of the classical conditional entropy. Our approach is intrinsic, in contrast to the Olliver-Zurek method that involves extrinsic local measurements. For this purpose, we introduce two alternative variants of quantum conditional entropies via conditional density operators, which in turn are intuitive quantum extensions of equivalent classical expressions for the conditional probability. The significance of these quantum conditional entropies in characterizing quantumness of bipartite states is illustrated through several examples

  11. Discord as a quantum resource for bi-partite communication

    International Nuclear Information System (INIS)

    Chrzanowski, Helen M.; Assad, Syed M.; Symul, Thomas; Lam, Ping Koy; Gu, Mile; Modi, Kavan; Vedral, Vlatko; Ralph, Timothy C.

    2014-01-01

    Coherent interactions that generate negligible entanglement can still exhibit unique quantum behaviour. This observation has motivated a search beyond entanglement for a complete description of all quantum correlations. Quantum discord is a promising candidate. Here, we experimentally demonstrate that under certain measurement constraints, discord between bipartite systems can be consumed to encode information that can only be accessed by coherent quantum interactions. The inability to access this information by any other means allows us to use discord to directly quantify this ‘quantum advantage’

  12. Induced bipartite entanglement from three qubit states and quantum teleportation

    Energy Technology Data Exchange (ETDEWEB)

    Park, Dae-Kil; Son, Jin-Woo; Cha, Seong-Keuck [Kyungnam University, Masan (Korea, Republic of)

    2010-06-15

    Only Greenberger-Horne-Zeilinger and W states are well known to have genuine tripartite entanglement in all three qubit states. The entanglement of quantum state is also well known to play an important role in various quantum information processes. Then, the following question naturally arises: which one is better between the Greenberger-Horne-Zeilinger and the W states in real quantum information processing? We try to give an answer to this question from two aspects. First, we compute the induced bipartite entanglement for a mixture consisting of Greenberger-Horne-Zeilinger and W states. If the entanglement is the only physical resource for information processing, the induced bipartite entanglement suggests that Greenberger-Horne-Zeilinger and W states are equally good. Second, we choose the bipartite teleportation scheme as an example of quantum information processing using the mixture as a quantum channel and compute the average fidelities. Our calculation shows that the W state is slightly more robust than the Greenberger-Horne-Zeilinger state when a small perturbation disturbs the teleportation process. This slight discrepancy seems to imply that entanglement is not the only resource for quantum information processing.

  13. Induced bipartite entanglement from three qubit states and quantum teleportation

    International Nuclear Information System (INIS)

    Park, Dae-Kil; Son, Jin-Woo; Cha, Seong-Keuck

    2010-01-01

    Only Greenberger-Horne-Zeilinger and W states are well known to have genuine tripartite entanglement in all three qubit states. The entanglement of quantum state is also well known to play an important role in various quantum information processes. Then, the following question naturally arises: which one is better between the Greenberger-Horne-Zeilinger and the W states in real quantum information processing? We try to give an answer to this question from two aspects. First, we compute the induced bipartite entanglement for a mixture consisting of Greenberger-Horne-Zeilinger and W states. If the entanglement is the only physical resource for information processing, the induced bipartite entanglement suggests that Greenberger-Horne-Zeilinger and W states are equally good. Second, we choose the bipartite teleportation scheme as an example of quantum information processing using the mixture as a quantum channel and compute the average fidelities. Our calculation shows that the W state is slightly more robust than the Greenberger-Horne-Zeilinger state when a small perturbation disturbs the teleportation process. This slight discrepancy seems to imply that entanglement is not the only resource for quantum information processing.

  14. Quantum control on entangled bipartite qubits

    International Nuclear Information System (INIS)

    Delgado, Francisco

    2010-01-01

    Ising interactions between qubits can produce distortion on entangled pairs generated for engineering purposes (e.g., for quantum computation or quantum cryptography). The presence of parasite magnetic fields destroys or alters the expected behavior for which it was intended. In addition, these pairs are generated with some dispersion in their original configuration, so their discrimination is necessary for applications. Nevertheless, discrimination should be made after Ising distortion. Quantum control helps in both problems; making some projective measurements upon the pair to decide the original state to replace it, or just trying to reconstruct it using some procedures which do not alter their quantum nature. Results about the performance of these procedures are reported. First, we will work with pure systems studying restrictions and advantages. Then, we will extend these operations for mixed states generated with uncertainty in the time of distortion, correcting them by assuming the control prescriptions for the most probable one.

  15. Quantum correlations for bipartite continuous-variable systems

    Science.gov (United States)

    Ma, Ruifen; Hou, Jinchuan; Qi, Xiaofei; Wang, Yangyang

    2018-04-01

    Two quantum correlations Q and Q_P for (m+n)-mode continuous-variable systems are introduced in terms of average distance between the reduced states under the local Gaussian positive operator-valued measurements, and analytical formulas of these quantum correlations for bipartite Gaussian states are provided. It is shown that the product states do not contain these quantum correlations, and conversely, all (m+n)-mode Gaussian states with zero quantum correlations are product states. Generally, Q≥ Q_{P}, but for the symmetric two-mode squeezed thermal states, these quantum correlations are the same and a computable formula is given. In addition, Q is compared with Gaussian geometric discord for symmetric squeezed thermal states.

  16. Bipartite separability and nonlocal quantum operations on graphs

    Science.gov (United States)

    Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.

    2016-07-01

    In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

  17. Comment on "Protecting bipartite entanglement by quantum interferences"

    Science.gov (United States)

    Nair, Anjali N.; Arun, R.

    2018-03-01

    In an interesting article [Phys. Rev. A 81, 052341 (2010), 10.1103/PhysRevA.81.052341], Das and Agarwal have discussed the preservation of bipartite entanglement in three-level atoms employing the coherences induced by spontaneous emission. The authors considered various initially entangled qubits prepared from two V -type three-level atoms and showed that more than 50 % of the initial (bipartite) entanglement can be preserved in steady state due to vacuum-induced coherence. In this Comment, we point out that their analytical formulas for the entanglement measure contain errors affecting all the numerical results of that article. We substantiate our claim by giving correct analytical results for the time evolution of the two-atom system.

  18. Coupling-Induced Bipartite Pointer States in Arrays of Electron Billiards: Quantum Darwinism in Action?

    Science.gov (United States)

    Brunner, R.; Akis, R.; Ferry, D. K.; Kuchar, F.; Meisels, R.

    2008-07-01

    We discuss a quantum system coupled to the environment, composed of an open array of billiards (dots) in series. Beside pointer states occurring in individual dots, we observe sets of robust states which arise only in the array. We define these new states as bipartite pointer states, since they cannot be described in terms of simple linear combinations of robust single-dot states. The classical existence of bipartite pointer states is confirmed by comparing the quantum-mechanical and classical results. The ability of the robust states to create “offspring” indicates that quantum Darwinism is in action.

  19. Quantum teleportation via noisy bipartite and tripartite accelerating quantum states: beyond the single mode approximation

    Science.gov (United States)

    Zounia, M.; Shamirzaie, M.; Ashouri, A.

    2017-09-01

    In this paper quantum teleportation of an unknown quantum state via noisy maximally bipartite (Bell) and maximally tripartite (Greenberger-Horne-Zeilinger (GHZ)) entangled states are investigated. We suppose that one of the observers who would receive the sent state accelerates uniformly with respect to the sender. The interactions of the quantum system with its environment during the teleportation process impose noises. These (unital and nonunital) noises are: phase damping, phase flip, amplitude damping and bit flip. In expressing the modes of the Dirac field used as qubits, in the accelerating frame, the so-called single mode approximation is not imposed. We calculate the fidelities of teleportation, and discuss their behaviors using suitable plots. The effects of noise, acceleration and going beyond the single mode approximation are discussed. Although the Bell states bring higher fidelities than GHZ states, the global behaviors of the two quantum systems with respect to some noise types, and therefore their fidelities, are different.

  20. Application of Bipartite Entangled States to Quantum Mechanical Version of Complex Wavelet Transforms

    International Nuclear Information System (INIS)

    Fan Hongyi; Lu Hailiang; Xu Xuefen

    2006-01-01

    We introduce the bipartite entangled states to present a quantum mechanical version of complex wavelet transform. Using the technique of integral within an ordered product of operators we show that the complex wavelet transform can be studied in terms of various quantum state vectors in two-mode Fock space. In this way the creterion for mother wavelet can be examined quantum-mechanically and therefore more deeply.

  1. The minimal entanglement of bipartite decompositions as a witness of strong entanglement in a quantum system

    OpenAIRE

    Zenchuk, A. I.

    2010-01-01

    We {characterize the multipartite entanglement in a quantum system by the quantity} which vanishes if only the quantum system may be decomposed into two weakly entangled subsystems, unlike measures of multipartite entanglement introduced before. We refer to this {quantity} as the minimal entanglement of bipartite decompositions (MEBD). Big MEBD means that the system may not be decomposed into two weakly entangled subsystems. MEBD allows one to define, for instance, whether the given quantum s...

  2. Forbidden regimes in the distribution of bipartite quantum correlations due to multiparty entanglement

    Energy Technology Data Exchange (ETDEWEB)

    Kumar, Asutosh [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Homi Bhabha National Institute, Anushaktinagar, Mumbai 400094 (India); Dhar, Himadri Shekhar [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Institute for Theoretical Physics, Vienna University of Technology, Wiedner Hauptstraße 8-10/136, A-1040 Vienna (Austria); Prabhu, R. [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Department of Physics, Indian Institute of Technology Patna, Patna 800013 (India); Sen, Aditi [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Homi Bhabha National Institute, Anushaktinagar, Mumbai 400094 (India); Sen, Ujjwal, E-mail: ujjwal@hri.res.in [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Homi Bhabha National Institute, Anushaktinagar, Mumbai 400094 (India)

    2017-05-25

    Monogamy is a nonclassical property that limits the distribution of quantum correlation among subparts of a multiparty system. We show that monogamy scores for different quantum correlation measures are bounded above by functions of genuine multipartite entanglement for a large majority of pure multiqubit states. The bound is universal for all three-qubit pure states. We derive necessary conditions to characterize the states that violate the bound, which can also be observed by numerical simulation for a small set of states, generated Haar uniformly. The results indicate that genuine multipartite entanglement restricts the distribution of bipartite quantum correlations in a multiparty system. - Highlights: • Monogamy is an intrinsic property of several quantum characteristics including entanglement. • It is possible to quantify monogamy by using the so-called monogamy scores. • Genuine multisite entanglement can be used to bound monogamy scores. • Distribution of bipartite entanglement in a system is, therefore, restricted by its multisite entanglement content.

  3. Application of Bipartite and Tripartite Entangled State Representations in Quantum Teleportation of Continuous Variables

    Institute of Scientific and Technical Information of China (English)

    YUAN Hong-Chun; QI Kai-Guo

    2005-01-01

    We mostly investigate two schemes. One is to teleport a multi-mode W-type entangled coherent state using a peculiar bipartite entangled state as the quantum channel different from other proposals. Based on our formalism,teleporting multi-mode coherent state or squeezed state is also possible. Another is that the tripartite entangled state is used as the quantum channel of controlled teleportation of an arbitrary and unknown continuous variable in the case of three participators.

  4. Forbidden regimes in the distribution of bipartite quantum correlations due to multiparty entanglement

    Science.gov (United States)

    Kumar, Asutosh; Dhar, Himadri Shekhar; Prabhu, R.; Sen(De), Aditi; Sen, Ujjwal

    2017-05-01

    Monogamy is a nonclassical property that limits the distribution of quantum correlation among subparts of a multiparty system. We show that monogamy scores for different quantum correlation measures are bounded above by functions of genuine multipartite entanglement for a large majority of pure multiqubit states. The bound is universal for all three-qubit pure states. We derive necessary conditions to characterize the states that violate the bound, which can also be observed by numerical simulation for a small set of states, generated Haar uniformly. The results indicate that genuine multipartite entanglement restricts the distribution of bipartite quantum correlations in a multiparty system.

  5. Quantum correlations in a bipartite multiqubit spin ring system

    International Nuclear Information System (INIS)

    Doronin, S I; Fel’dman, E B; Kuznetsova, E I

    2015-01-01

    We consider a spin ring with an arbitrary number of spins on the ring and one spin in its center in a strong external magnetic field. The spins on the ring are connected by the secular dipole–dipole interactions and interact with the central spin through the Heisenberg zz-interaction. We show that the quantum discord, describing quantum correlations between the ring and the central spin, can be obtained analytically for an arbitrary number of the spins in the high-temperature approximation. We demonstrate the evolution of quantum correlations at different numbers of the spins. The contributions of longitudinal and transversal spin interactions to the quantum discord are discussed. (paper)

  6. Quantum error correction for beginners

    International Nuclear Information System (INIS)

    Devitt, Simon J; Nemoto, Kae; Munro, William J

    2013-01-01

    Quantum error correction (QEC) and fault-tolerant quantum computation represent one of the most vital theoretical aspects of quantum information processing. It was well known from the early developments of this exciting field that the fragility of coherent quantum systems would be a catastrophic obstacle to the development of large-scale quantum computers. The introduction of quantum error correction in 1995 showed that active techniques could be employed to mitigate this fatal problem. However, quantum error correction and fault-tolerant computation is now a much larger field and many new codes, techniques, and methodologies have been developed to implement error correction for large-scale quantum algorithms. In response, we have attempted to summarize the basic aspects of quantum error correction and fault-tolerance, not as a detailed guide, but rather as a basic introduction. The development in this area has been so pronounced that many in the field of quantum information, specifically researchers who are new to quantum information or people focused on the many other important issues in quantum computation, have found it difficult to keep up with the general formalisms and methodologies employed in this area. Rather than introducing these concepts from a rigorous mathematical and computer science framework, we instead examine error correction and fault-tolerance largely through detailed examples, which are more relevant to experimentalists today and in the near future. (review article)

  7. Correcting quantum errors with entanglement.

    Science.gov (United States)

    Brun, Todd; Devetak, Igor; Hsieh, Min-Hsiu

    2006-10-20

    We show how entanglement shared between encoder and decoder can simplify the theory of quantum error correction. The entanglement-assisted quantum codes we describe do not require the dual-containing constraint necessary for standard quantum error-correcting codes, thus allowing us to "quantize" all of classical linear coding theory. In particular, efficient modern classical codes that attain the Shannon capacity can be made into entanglement-assisted quantum codes attaining the hashing bound (closely related to the quantum capacity). For systems without large amounts of shared entanglement, these codes can also be used as catalytic codes, in which a small amount of initial entanglement enables quantum communication.

  8. Modeling coherent errors in quantum error correction

    Science.gov (United States)

    Greenbaum, Daniel; Dutton, Zachary

    2018-01-01

    Analysis of quantum error correcting codes is typically done using a stochastic, Pauli channel error model for describing the noise on physical qubits. However, it was recently found that coherent errors (systematic rotations) on physical data qubits result in both physical and logical error rates that differ significantly from those predicted by a Pauli model. Here we examine the accuracy of the Pauli approximation for noise containing coherent errors (characterized by a rotation angle ɛ) under the repetition code. We derive an analytic expression for the logical error channel as a function of arbitrary code distance d and concatenation level n, in the small error limit. We find that coherent physical errors result in logical errors that are partially coherent and therefore non-Pauli. However, the coherent part of the logical error is negligible at fewer than {ε }-({dn-1)} error correction cycles when the decoder is optimized for independent Pauli errors, thus providing a regime of validity for the Pauli approximation. Above this number of correction cycles, the persistent coherent logical error will cause logical failure more quickly than the Pauli model would predict, and this may need to be combated with coherent suppression methods at the physical level or larger codes.

  9. Direct measurement of nonlinear properties of bipartite quantum states.

    Science.gov (United States)

    Bovino, Fabio Antonio; Castagnoli, Giuseppe; Ekert, Artur; Horodecki, Paweł; Alves, Carolina Moura; Sergienko, Alexander Vladimir

    2005-12-09

    Nonlinear properties of quantum states, such as entropy or entanglement, quantify important physical resources and are frequently used in quantum-information science. They are usually calculated from a full description of a quantum state, even though they depend only on a small number of parameters that specify the state. Here we extract a nonlocal and a nonlinear quantity, namely, the Renyi entropy, from local measurements on two pairs of polarization-entangled photons. We also introduce a "phase marking" technique which allows the selection of uncorrupted outcomes even with nondeterministic sources of entangled photons. We use our experimental data to demonstrate the violation of entropic inequalities. They are examples of nonlinear entanglement witnesses and their power exceeds all linear tests for quantum entanglement based on all possible Bell-Clauser-Horne-Shimony-Holt inequalities.

  10. Response to defects in multipartite and bipartite entanglement of isotropic quantum spin networks

    Science.gov (United States)

    Roy, Sudipto Singha; Dhar, Himadri Shekhar; Rakshit, Debraj; SenDe, Aditi; Sen, Ujjwal

    2018-05-01

    Quantum networks are an integral component in performing efficient computation and communication tasks that are not accessible using classical systems. A key aspect in designing an effective and scalable quantum network is generating entanglement between its nodes, which is robust against defects in the network. We consider an isotropic quantum network of spin-1/2 particles with a finite fraction of defects, where the corresponding wave function of the network is rotationally invariant under the action of local unitaries. By using quantum information-theoretic concepts like strong subadditivity of von Neumann entropy and approximate quantum telecloning, we prove analytically that in the presence of defects, caused by loss of a finite fraction of spins, the network, composed of a fixed numbers of lattice sites, sustains genuine multisite entanglement and at the same time may exhibit finite moderate-range bipartite entanglement, in contrast to the network with no defects.

  11. Symmetric extension of bipartite quantum states and its use in quantum key distribution with two-way postprocessing

    International Nuclear Information System (INIS)

    Myhr, Geir Ove

    2010-01-01

    Just like we can divide the set of bipartite quantum states into separable states and entangled states, we can divide it into states with and without a symmetric extension. The states with a symmetric extension - which includes all the separable states - behave classically in many ways, while the states without a symmetric extension - which are all entangled - have the potential to exhibit quantum effects. The set of states with a symmetric extension is closed under local quantum operations assisted by one-way classical communication (1-LOCC) just like the set of separable states is closed under local operations assisted by two-way classical communication (LOCC). Because of this, states with a symmetric extension often play the same role in a one-way communication setting as the separable states play in a two-way communication setting. We show that any state with a symmetric extension can be decomposed into a convex combination of states that have a pure symmetric extension. A necessary condition for a state to have a pure symmetric extension is that the spectra of the local and global density matrices are equal. This condition is also sufficient for two qubits, but not for any larger systems. We present a conjectured necessary and sufficient condition for two-qubit states with a symmetric extension. Proofs are provided for some classes of states: rank-two states, states on the symmetric subspace, Bell-diagonal states and states that are invariant under S x S, where S is a phase gate. We also show how the symmetric extension problem for multi-qubit Bell-diagonal states can be simplified and the simplified problem implemented as a semidefinite program. Quantum key distribution protocols such as the six-state protocol and the BB84 protocol effectively gives Alice and Bob Bell-diagonal states that they measure in the standard basis to obtain a raw key which they may then process further to obtain a secret error-free key. When the raw key has a high error rate, the

  12. Symmetric extension of bipartite quantum states and its use in quantum key distribution with two-way postprocessing

    Energy Technology Data Exchange (ETDEWEB)

    Myhr, Geir Ove

    2010-11-08

    Just like we can divide the set of bipartite quantum states into separable states and entangled states, we can divide it into states with and without a symmetric extension. The states with a symmetric extension - which includes all the separable states - behave classically in many ways, while the states without a symmetric extension - which are all entangled - have the potential to exhibit quantum effects. The set of states with a symmetric extension is closed under local quantum operations assisted by one-way classical communication (1-LOCC) just like the set of separable states is closed under local operations assisted by two-way classical communication (LOCC). Because of this, states with a symmetric extension often play the same role in a one-way communication setting as the separable states play in a two-way communication setting. We show that any state with a symmetric extension can be decomposed into a convex combination of states that have a pure symmetric extension. A necessary condition for a state to have a pure symmetric extension is that the spectra of the local and global density matrices are equal. This condition is also sufficient for two qubits, but not for any larger systems. We present a conjectured necessary and sufficient condition for two-qubit states with a symmetric extension. Proofs are provided for some classes of states: rank-two states, states on the symmetric subspace, Bell-diagonal states and states that are invariant under S x S, where S is a phase gate. We also show how the symmetric extension problem for multi-qubit Bell-diagonal states can be simplified and the simplified problem implemented as a semidefinite program. Quantum key distribution protocols such as the six-state protocol and the BB84 protocol effectively gives Alice and Bob Bell-diagonal states that they measure in the standard basis to obtain a raw key which they may then process further to obtain a secret error-free key. When the raw key has a high error rate, the

  13. Reply to "Comment on `Protecting bipartite entanglement by quantum interferences' "

    Science.gov (United States)

    Das, Sumanta; Agarwal, G. S.

    2018-03-01

    In a recent Comment Nair and Arun, Phys. Rev. A 97, 036301 (2018), 10.1103/PhysRevA.97.036301, it was concluded that the two-qubit entanglement protection reported in our work [Das and Agarwal, Phys. Rev. A 81, 052341 (2010), 10.1103/PhysRevA.81.052341] is erroneous. While we acknowledge the error in analytical results on concurrence when dipole matrix elements were unequal, the essential conclusions on entanglement protection are not affected.

  14. Controlling transfer of quantum correlations among bi-partitions of a composite quantum system by combining different noisy environments

    International Nuclear Information System (INIS)

    Zhang Xiu-Xing; Li Fu-Li

    2011-01-01

    The correlation dynamics are investigated for various bi-partitions of a composite quantum system consisting of two qubits and two independent and non-identical noisy environments. The two qubits have no direct interaction with each other and locally interact with their environments. Classical and quantum correlations including the entanglement are initially prepared only between the two qubits. We find that contrary to the identical noisy environment case, the quantum correlation transfer direction can be controlled by combining different noisy environments. The amplitude-damping environment determines whether there exists the entanglement transfer among bi-partitions of the system. When one qubit is coupled to an amplitude-damping environment and the other one to a bit-flip one, we find a very interesting result that all the quantum and the classical correlations, and even the entanglement, originally existing between the qubits, can be completely transferred without any loss to the qubit coupled to the bit-flit environment and the amplitude-damping environment. We also notice that it is possible to distinguish the quantum correlation from the classical correlation and the entanglement by combining different noisy environments. (general)

  15. Optimal quantum error correcting codes from absolutely maximally entangled states

    Science.gov (United States)

    Raissi, Zahra; Gogolin, Christian; Riera, Arnau; Acín, Antonio

    2018-02-01

    Absolutely maximally entangled (AME) states are pure multi-partite generalizations of the bipartite maximally entangled states with the property that all reduced states of at most half the system size are in the maximally mixed state. AME states are of interest for multipartite teleportation and quantum secret sharing and have recently found new applications in the context of high-energy physics in toy models realizing the AdS/CFT-correspondence. We work out in detail the connection between AME states of minimal support and classical maximum distance separable (MDS) error correcting codes and, in particular, provide explicit closed form expressions for AME states of n parties with local dimension \

  16. Bipartite discrimination of independently prepared quantum states as a counterexample to a parallel repetition conjecture

    Science.gov (United States)

    Akibue, Seiseki; Kato, Go

    2018-04-01

    For distinguishing quantum states sampled from a fixed ensemble, the gap in bipartite and single-party distinguishability can be interpreted as a nonlocality of the ensemble. In this paper, we consider bipartite state discrimination in a composite system consisting of N subsystems, where each subsystem is shared between two parties and the state of each subsystem is randomly sampled from a particular ensemble comprising the Bell states. We show that the success probability of perfectly identifying the state converges to 1 as N →∞ if the entropy of the probability distribution associated with the ensemble is less than 1, even if the success probability is less than 1 for any finite N . In other words, the nonlocality of the N -fold ensemble asymptotically disappears if the probability distribution associated with each ensemble is concentrated. Furthermore, we show that the disappearance of the nonlocality can be regarded as a remarkable counterexample of a fundamental open question in theoretical computer science, called a parallel repetition conjecture of interactive games with two classically communicating players. Measurements for the discrimination task include a projective measurement of one party represented by stabilizer states, which enable the other party to perfectly distinguish states that are sampled with high probability.

  17. Detected-jump-error-correcting quantum codes, quantum error designs, and quantum computation

    International Nuclear Information System (INIS)

    Alber, G.; Mussinger, M.; Beth, Th.; Charnes, Ch.; Delgado, A.; Grassl, M.

    2003-01-01

    The recently introduced detected-jump-correcting quantum codes are capable of stabilizing qubit systems against spontaneous decay processes arising from couplings to statistically independent reservoirs. These embedded quantum codes exploit classical information about which qubit has emitted spontaneously and correspond to an active error-correcting code embedded in a passive error-correcting code. The construction of a family of one-detected-jump-error-correcting quantum codes is shown and the optimal redundancy, encoding, and recovery as well as general properties of detected-jump-error-correcting quantum codes are discussed. By the use of design theory, multiple-jump-error-correcting quantum codes can be constructed. The performance of one-jump-error-correcting quantum codes under nonideal conditions is studied numerically by simulating a quantum memory and Grover's algorithm

  18. Maximal violation of a bipartite three-setting, two-outcome Bell inequality using infinite-dimensional quantum systems

    International Nuclear Information System (INIS)

    Pal, Karoly F.; Vertesi, Tamas

    2010-01-01

    The I 3322 inequality is the simplest bipartite two-outcome Bell inequality beyond the Clauser-Horne-Shimony-Holt (CHSH) inequality, consisting of three two-outcome measurements per party. In the case of the CHSH inequality the maximal quantum violation can already be attained with local two-dimensional quantum systems; however, there is no such evidence for the I 3322 inequality. In this paper a family of measurement operators and states is given which enables us to attain the maximum quantum value in an infinite-dimensional Hilbert space. Further, it is conjectured that our construction is optimal in the sense that measuring finite-dimensional quantum systems is not enough to achieve the true quantum maximum. We also describe an efficient iterative algorithm for computing quantum maximum of an arbitrary two-outcome Bell inequality in any given Hilbert space dimension. This algorithm played a key role in obtaining our results for the I 3322 inequality, and we also applied it to improve on our previous results concerning the maximum quantum violation of several bipartite two-outcome Bell inequalities with up to five settings per party.

  19. Additional Quantum Properties of Entangled Bipartite Qubit Systems Coupled to Photon Baths

    International Nuclear Information System (INIS)

    Quintana, C

    2016-01-01

    The time evolution of an entangled bi-partite qubit interacting with two independent photon baths in isolated cavities is not unitary. It is shown that the bi-partite qubit oscillates between pure and mixed states, and that the initial entanglement is lost and recovered in time by time as a consequence of its interaction with the baths. (paper)

  20. A quantum logic network for implementing optimal symmetric universal and phase-covariant telecloning of a bipartite entangled state

    International Nuclear Information System (INIS)

    Meng Fanyu; Zhu Aidong

    2008-01-01

    A quantum logic network to implement quantum telecloning is presented in this paper. The network includes two parts: the first part is used to create the telecloning channel and the second part to teleport the state. It can be used not only to implement universal telecloning for a bipartite entangled state which is completely unknown, but also to implement the phase-covariant telecloning for one that is partially known. Furthermore, the network can also be used to construct a tele-triplicator. It can easily be implemented in experiment because only single- and two-qubit operations are used in the network.

  1. Quantum Information Processing and Quantum Error Correction An Engineering Approach

    CERN Document Server

    Djordjevic, Ivan

    2012-01-01

    Quantum Information Processing and Quantum Error Correction is a self-contained, tutorial-based introduction to quantum information, quantum computation, and quantum error-correction. Assuming no knowledge of quantum mechanics and written at an intuitive level suitable for the engineer, the book gives all the essential principles needed to design and implement quantum electronic and photonic circuits. Numerous examples from a wide area of application are given to show how the principles can be implemented in practice. This book is ideal for the electronics, photonics and computer engineer

  2. Quantum error correction with spins in diamond

    NARCIS (Netherlands)

    Cramer, J.

    2016-01-01

    Digital information based on the laws of quantum mechanics promisses powerful new ways of computation and communication. However, quantum information is very fragile; inevitable errors continuously build up and eventually all information is lost. Therefore, realistic large-scale quantum information

  3. Detecting phase boundaries of quantum spin-1/2 XXZ ladder via bipartite and multipartite entanglement transitions

    Science.gov (United States)

    Singha Roy, Sudipto; Dhar, Himadri Shekhar; Rakshit, Debraj; Sen(De), Aditi; Sen, Ujjwal

    2017-12-01

    Phase transition in quantum many-body systems inevitably causes changes in certain physical properties which then serve as potential indicators of critical phenomena. Besides the traditional order parameters, characterization of quantum entanglement has proven to be a computationally efficient and successful method for detection of phase boundaries, especially in one-dimensional models. Here we determine the rich phase diagram of the ground states of a quantum spin-1/2 XXZ ladder by analyzing the variation of bipartite and multipartite entanglements. Our study characterizes the different ground state phases and notes the correspondence with known results, while highlighting the finer details that emerge from the behavior of ground state entanglement. Analysis of entanglement in the ground state provides a clearer picture of the complex ground state phase diagram of the system using only a moderate-size model.

  4. Practical, Reliable Error Bars in Quantum Tomography

    OpenAIRE

    Faist, Philippe; Renner, Renato

    2015-01-01

    Precise characterization of quantum devices is usually achieved with quantum tomography. However, most methods which are currently widely used in experiments, such as maximum likelihood estimation, lack a well-justified error analysis. Promising recent methods based on confidence regions are difficult to apply in practice or yield error bars which are unnecessarily large. Here, we propose a practical yet robust method for obtaining error bars. We do so by introducing a novel representation of...

  5. Tensor Networks and Quantum Error Correction

    Science.gov (United States)

    Ferris, Andrew J.; Poulin, David

    2014-07-01

    We establish several relations between quantum error correction (QEC) and tensor network (TN) methods of quantum many-body physics. We exhibit correspondences between well-known families of QEC codes and TNs, and demonstrate a formal equivalence between decoding a QEC code and contracting a TN. We build on this equivalence to propose a new family of quantum codes and decoding algorithms that generalize and improve upon quantum polar codes and successive cancellation decoding in a natural way.

  6. Open quantum systems and error correction

    Science.gov (United States)

    Shabani Barzegar, Alireza

    Quantum effects can be harnessed to manipulate information in a desired way. Quantum systems which are designed for this purpose are suffering from harming interaction with their surrounding environment or inaccuracy in control forces. Engineering different methods to combat errors in quantum devices are highly demanding. In this thesis, I focus on realistic formulations of quantum error correction methods. A realistic formulation is the one that incorporates experimental challenges. This thesis is presented in two sections of open quantum system and quantum error correction. Chapters 2 and 3 cover the material on open quantum system theory. It is essential to first study a noise process then to contemplate methods to cancel its effect. In the second chapter, I present the non-completely positive formulation of quantum maps. Most of these results are published in [Shabani and Lidar, 2009b,a], except a subsection on geometric characterization of positivity domain of a quantum map. The real-time formulation of the dynamics is the topic of the third chapter. After introducing the concept of Markovian regime, A new post-Markovian quantum master equation is derived, published in [Shabani and Lidar, 2005a]. The section of quantum error correction is presented in three chapters of 4, 5, 6 and 7. In chapter 4, we introduce a generalized theory of decoherence-free subspaces and subsystems (DFSs), which do not require accurate initialization (published in [Shabani and Lidar, 2005b]). In Chapter 5, we present a semidefinite program optimization approach to quantum error correction that yields codes and recovery procedures that are robust against significant variations in the noise channel. Our approach allows us to optimize the encoding, recovery, or both, and is amenable to approximations that significantly improve computational cost while retaining fidelity (see [Kosut et al., 2008] for a published version). Chapter 6 is devoted to a theory of quantum error correction (QEC

  7. Quantum Error Correction and Fault Tolerant Quantum Computing

    CERN Document Server

    Gaitan, Frank

    2008-01-01

    It was once widely believed that quantum computation would never become a reality. However, the discovery of quantum error correction and the proof of the accuracy threshold theorem nearly ten years ago gave rise to extensive development and research aimed at creating a working, scalable quantum computer. Over a decade has passed since this monumental accomplishment yet no book-length pedagogical presentation of this important theory exists. Quantum Error Correction and Fault Tolerant Quantum Computing offers the first full-length exposition on the realization of a theory once thought impo

  8. Quantum secret sharing based on quantum error-correcting codes

    International Nuclear Information System (INIS)

    Zhang Zu-Rong; Liu Wei-Tao; Li Cheng-Zu

    2011-01-01

    Quantum secret sharing(QSS) is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k − 1, 1, k] quantum error-correcting code (QECC) to implement a quantum (k, 2k − 1) threshold scheme. It also takes advantage of classical enhancement of the [2k − 1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels. (general)

  9. Iterative optimization of quantum error correcting codes

    International Nuclear Information System (INIS)

    Reimpell, M.; Werner, R.F.

    2005-01-01

    We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds codes outside the usual Knill-Laflamme definition of error correcting codes. The iteration is shown to improve the figure of merit 'channel fidelity' in every step

  10. Group representations, error bases and quantum codes

    Energy Technology Data Exchange (ETDEWEB)

    Knill, E

    1996-01-01

    This report continues the discussion of unitary error bases and quantum codes. Nice error bases are characterized in terms of the existence of certain characters in a group. A general construction for error bases which are non-abelian over the center is given. The method for obtaining codes due to Calderbank et al. is generalized and expressed purely in representation theoretic terms. The significance of the inertia subgroup both for constructing codes and obtaining the set of transversally implementable operations is demonstrated.

  11. Singularity of classical and quantum correlations at critical points of the Lipkin-Meshkov-Glick model in bipartition and tripartition of spins

    OpenAIRE

    Xiu-Xing, Zhang; Fu-Li, Li

    2012-01-01

    We study the classical correlation (CC) and quantum discord (QD) between two spin subgroups of the Lipkin-Meshkov-Glick (LMG) model in both binary and trinary decompositions of spins. In the case of bipartition, we find that the classical correlations and all the quantum correlations including the QD, the entanglement of formation (EoF) and the logarithmic negativity (LN) are divergent in the same singular behavior at the critical point of the LMG model. In the case of tripartition, however, ...

  12. Bipartite Bell Inequality and Maximal Violation

    International Nuclear Information System (INIS)

    Li Ming; Fei Shaoming; Li-Jost Xian-Qing

    2011-01-01

    We present new bell inequalities for arbitrary dimensional bipartite quantum systems. The maximal violation of the inequalities is computed. The Bell inequality is capable of detecting quantum entanglement of both pure and mixed quantum states more effectively. (general)

  13. Effect of two-qutrit entanglement on quantum speed limit time of a bipartite V-type open system

    Energy Technology Data Exchange (ETDEWEB)

    Behzadi, N., E-mail: n.behzadi@tabrizu.ac.ir [Research Institute for Fundamental Sciences, University of Tabriz (Iran, Islamic Republic of); Ahansaz, B.; Ektesabi, A.; Faizi, E. [Physics Department, Azarbaijan Shahid Madani University, Tabriz (Iran, Islamic Republic of)

    2017-03-15

    In the present paper, quantum speed limit (QSL) time of a bipartite V-type three-level atomic system under the effect of two-qutrit entanglement is investigated. Each party interacts with own independent reservoir. By considering two local unitarily equivalent Werner states and the Horodecki PPT state, as initial states, the QSL time is evaluated for each of them in the respective entangled regions. It is counterintuitively observed that the effect of entanglement on the QSL time driven from each of the initial Werner states are completely different when the degree of non-Markovianity is considerable. In addition, it is interesting that the effect of entanglement of the non-equivalent Horodecki state on the calculated QSL time displays an intermediate behavior relative to the cases obtained for the Werner states.

  14. Role of memory errors in quantum repeaters

    International Nuclear Information System (INIS)

    Hartmann, L.; Kraus, B.; Briegel, H.-J.; Duer, W.

    2007-01-01

    We investigate the influence of memory errors in the quantum repeater scheme for long-range quantum communication. We show that the communication distance is limited in standard operation mode due to memory errors resulting from unavoidable waiting times for classical signals. We show how to overcome these limitations by (i) improving local memory and (ii) introducing two operational modes of the quantum repeater. In both operational modes, the repeater is run blindly, i.e., without waiting for classical signals to arrive. In the first scheme, entanglement purification protocols based on one-way classical communication are used allowing to communicate over arbitrary distances. However, the error thresholds for noise in local control operations are very stringent. The second scheme makes use of entanglement purification protocols with two-way classical communication and inherits the favorable error thresholds of the repeater run in standard mode. One can increase the possible communication distance by an order of magnitude with reasonable overhead in physical resources. We outline the architecture of a quantum repeater that can possibly ensure intercontinental quantum communication

  15. Initialization Errors in Quantum Data Base Recall

    OpenAIRE

    Natu, Kalyani

    2016-01-01

    This paper analyzes the relationship between initialization error and recall of a specific memory in the Grover algorithm for quantum database search. It is shown that the correct memory is obtained with high probability even when the initial state is far removed from the correct one. The analysis is done by relating the variance of error in the initial state to the recovery of the correct memory and the surprising result is obtained that the relationship between the two is essentially linear.

  16. Quantum algorithms and quantum maps - implementation and error correction

    International Nuclear Information System (INIS)

    Alber, G.; Shepelyansky, D.

    2005-01-01

    Full text: We investigate the dynamics of the quantum tent map under the influence of errors and explore the possibilities of quantum error correcting methods for the purpose of stabilizing this quantum algorithm. It is known that static but uncontrollable inter-qubit couplings between the qubits of a quantum information processor lead to a rapid Gaussian decay of the fidelity of the quantum state. We present a new error correcting method which slows down this fidelity decay to a linear-in-time exponential one. One of its advantages is that it does not require redundancy so that all physical qubits involved can be used for logical purposes. We also study the influence of decoherence due to spontaneous decay processes which can be corrected by quantum jump-codes. It is demonstrated how universal encoding can be performed in these code spaces. For this purpose we discuss a new entanglement gate which can be used for lowest level encoding in concatenated error-correcting architectures. (author)

  17. Learning time-dependent noise to reduce logical errors: real time error rate estimation in quantum error correction

    Science.gov (United States)

    Huo, Ming-Xia; Li, Ying

    2017-12-01

    Quantum error correction is important to quantum information processing, which allows us to reliably process information encoded in quantum error correction codes. Efficient quantum error correction benefits from the knowledge of error rates. We propose a protocol for monitoring error rates in real time without interrupting the quantum error correction. Any adaptation of the quantum error correction code or its implementation circuit is not required. The protocol can be directly applied to the most advanced quantum error correction techniques, e.g. surface code. A Gaussian processes algorithm is used to estimate and predict error rates based on error correction data in the past. We find that using these estimated error rates, the probability of error correction failures can be significantly reduced by a factor increasing with the code distance.

  18. Black Holes, Holography, and Quantum Error Correction

    CERN Multimedia

    CERN. Geneva

    2017-01-01

    How can it be that a local quantum field theory in some number of spacetime dimensions can "fake" a local gravitational theory in a higher number of dimensions?  How can the Ryu-Takayanagi Formula say that an entropy is equal to the expectation value of a local operator?  Why do such things happen only in gravitational theories?  In this talk I will explain how a new interpretation of the AdS/CFT correspondence as a quantum error correcting code provides satisfying answers to these questions, and more generally gives a natural way of generating simple models of the correspondence.  No familiarity with AdS/CFT or quantum error correction is assumed, but the former would still be helpful.  

  19. Fast, efficient error reconciliation for quantum cryptography

    International Nuclear Information System (INIS)

    Buttler, W.T.; Lamoreaux, S.K.; Torgerson, J.R.; Nickel, G.H.; Donahue, C.H.; Peterson, C.G.

    2003-01-01

    We describe an error-reconciliation protocol, which we call Winnow, based on the exchange of parity and Hamming's 'syndrome' for N-bit subunits of a large dataset. The Winnow protocol was developed in the context of quantum-key distribution and offers significant advantages and net higher efficiency compared to other widely used protocols within the quantum cryptography community. A detailed mathematical analysis of the Winnow protocol is presented in the context of practical implementations of quantum-key distribution; in particular, the information overhead required for secure implementation is one of the most important criteria in the evaluation of a particular error-reconciliation protocol. The increase in efficiency for the Winnow protocol is largely due to the reduction in authenticated public communication required for its implementation

  20. Experimental quantum error correction with high fidelity

    International Nuclear Information System (INIS)

    Zhang Jingfu; Gangloff, Dorian; Moussa, Osama; Laflamme, Raymond

    2011-01-01

    More than ten years ago a first step toward quantum error correction (QEC) was implemented [Phys. Rev. Lett. 81, 2152 (1998)]. The work showed there was sufficient control in nuclear magnetic resonance to implement QEC, and demonstrated that the error rate changed from ε to ∼ε 2 . In the current work we reproduce a similar experiment using control techniques that have been since developed, such as the pulses generated by gradient ascent pulse engineering algorithm. We show that the fidelity of the QEC gate sequence and the comparative advantage of QEC are appreciably improved. This advantage is maintained despite the errors introduced by the additional operations needed to protect the quantum states.

  1. Structure of multiphoton quantum optics. II. Bipartite systems, physical processes, and heterodyne squeezed states

    Science.gov (United States)

    dell'Anno, Fabio; de Siena, Silvio; Illuminati, Fabrizio

    2004-03-01

    Extending the scheme developed for a single mode of the electromagnetic field in the preceding paper [F. Dell’Anno, S. De Siena, and F. Illuminati, Phys. Rev. A 69, 033812 (2004)], we introduce two-mode nonlinear canonical transformations depending on two heterodyne mixing angles. They are defined in terms of Hermitian nonlinear functions that realize heterodyne superpositions of conjugate quadratures of bipartite systems. The canonical transformations diagonalize a class of Hamiltonians describing nondegenerate and degenerate multiphoton processes. We determine the coherent states associated with the canonical transformations, which generalize the nondegenerate two-photon squeezed states. Such heterodyne multiphoton squeezed states are defined as the simultaneous eigenstates of the transformed, coupled annihilation operators. They are generated by nonlinear unitary evolutions acting on two-mode squeezed states. They are non-Gaussian, highly nonclassical, entangled states. For a quadratic nonlinearity the heterodyne multiphoton squeezed states define two-mode cubic phase states. The statistical properties of these states can be widely adjusted by tuning the heterodyne mixing angles, the phases of the nonlinear couplings, as well as the strength of the nonlinearity. For quadratic nonlinearity, we study the higher-order contributions to the susceptibility in nonlinear media and we suggest possible experimental realizations of multiphoton conversion processes generating the cubic-phase heterodyne squeezed states.

  2. Structure of multiphoton quantum optics. II. Bipartite systems, physical processes, and heterodyne squeezed states

    International Nuclear Information System (INIS)

    Dell'Anno, Fabio; De Siena, Silvio; Illuminati, Fabrizio

    2004-01-01

    Extending the scheme developed for a single mode of the electromagnetic field in the preceding paper [F. Dell'Anno, S. De Siena, and F. Illuminati, Phys. Rev. A 69, 033812 (2004)], we introduce two-mode nonlinear canonical transformations depending on two heterodyne mixing angles. They are defined in terms of Hermitian nonlinear functions that realize heterodyne superpositions of conjugate quadratures of bipartite systems. The canonical transformations diagonalize a class of Hamiltonians describing nondegenerate and degenerate multiphoton processes. We determine the coherent states associated with the canonical transformations, which generalize the nondegenerate two-photon squeezed states. Such heterodyne multiphoton squeezed states are defined as the simultaneous eigenstates of the transformed, coupled annihilation operators. They are generated by nonlinear unitary evolutions acting on two-mode squeezed states. They are non-Gaussian, highly nonclassical, entangled states. For a quadratic nonlinearity the heterodyne multiphoton squeezed states define two-mode cubic phase states. The statistical properties of these states can be widely adjusted by tuning the heterodyne mixing angles, the phases of the nonlinear couplings, as well as the strength of the nonlinearity. For quadratic nonlinearity, we study the higher-order contributions to the susceptibility in nonlinear media and we suggest possible experimental realizations of multiphoton conversion processes generating the cubic-phase heterodyne squeezed states

  3. Bipartite Networks

    NARCIS (Netherlands)

    Agneessens, F.; Moser, C.; Barnett, G.A.

    2011-01-01

    Bipartite networks refer to a specific kind of network in which the nodes (or actors) can be partitioned into two subsets based on the fact that no links exist between actors within each subset, but only between the two subsets. Due to the partition of actors in two sets and the absence of relations

  4. Topics in quantum cryptography, quantum error correction, and channel simulation

    Science.gov (United States)

    Luo, Zhicheng

    In this thesis, we mainly investigate four different topics: efficiently implementable codes for quantum key expansion [51], quantum error-correcting codes based on privacy amplification [48], private classical capacity of quantum channels [44], and classical channel simulation with quantum side information [49, 50]. For the first topic, we propose an efficiently implementable quantum key expansion protocol, capable of increasing the size of a pre-shared secret key by a constant factor. Previously, the Shor-Preskill proof [64] of the security of the Bennett-Brassard 1984 (BB84) [6] quantum key distribution protocol relied on the theoretical existence of good classical error-correcting codes with the "dual-containing" property. But the explicit and efficiently decodable construction of such codes is unknown. We show that we can lift the dual-containing constraint by employing the non-dual-containing codes with excellent performance and efficient decoding algorithms. For the second topic, we propose a construction of Calderbank-Shor-Steane (CSS) [19, 68] quantum error-correcting codes, which are originally based on pairs of mutually dual-containing classical codes, by combining a classical code with a two-universal hash function. We show, using the results of Renner and Koenig [57], that the communication rates of such codes approach the hashing bound on tensor powers of Pauli channels in the limit of large block-length. For the third topic, we prove a regularized formula for the secret key assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak on entanglement assisted quantum communication capacity. This formula provides a new family protocol, the private father protocol, under the resource inequality framework that includes the private classical communication without the assisted secret keys as a child protocol. For the fourth topic, we study and solve the problem of classical channel

  5. Autonomous Quantum Error Correction with Application to Quantum Metrology

    Science.gov (United States)

    Reiter, Florentin; Sorensen, Anders S.; Zoller, Peter; Muschik, Christine A.

    2017-04-01

    We present a quantum error correction scheme that stabilizes a qubit by coupling it to an engineered environment which protects it against spin- or phase flips. Our scheme uses always-on couplings that run continuously in time and operates in a fully autonomous fashion without the need to perform measurements or feedback operations on the system. The correction of errors takes place entirely at the microscopic level through a build-in feedback mechanism. Our dissipative error correction scheme can be implemented in a system of trapped ions and can be used for improving high precision sensing. We show that the enhanced coherence time that results from the coupling to the engineered environment translates into a significantly enhanced precision for measuring weak fields. In a broader context, this work constitutes a stepping stone towards the paradigm of self-correcting quantum information processing.

  6. Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence

    Energy Technology Data Exchange (ETDEWEB)

    Pastawski, Fernando; Yoshida, Beni [Institute for Quantum Information & Matter and Walter Burke Institute for Theoretical Physics,California Institute of Technology,1200 E. California Blvd., Pasadena CA 91125 (United States); Harlow, Daniel [Princeton Center for Theoretical Science, Princeton University,400 Jadwin Hall, Princeton NJ 08540 (United States); Preskill, John [Institute for Quantum Information & Matter and Walter Burke Institute for Theoretical Physics,California Institute of Technology,1200 E. California Blvd., Pasadena CA 91125 (United States)

    2015-06-23

    We propose a family of exactly solvable toy models for the AdS/CFT correspondence based on a novel construction of quantum error-correcting codes with a tensor network structure. Our building block is a special type of tensor with maximal entanglement along any bipartition, which gives rise to an isometry from the bulk Hilbert space to the boundary Hilbert space. The entire tensor network is an encoder for a quantum error-correcting code, where the bulk and boundary degrees of freedom may be identified as logical and physical degrees of freedom respectively. These models capture key features of entanglement in the AdS/CFT correspondence; in particular, the Ryu-Takayanagi formula and the negativity of tripartite information are obeyed exactly in many cases. That bulk logical operators can be represented on multiple boundary regions mimics the Rindler-wedge reconstruction of boundary operators from bulk operators, realizing explicitly the quantum error-correcting features of AdS/CFT recently proposed in http://dx.doi.org/10.1007/JHEP04(2015)163.

  7. Tackling systematic errors in quantum logic gates with composite rotations

    International Nuclear Information System (INIS)

    Cummins, Holly K.; Llewellyn, Gavin; Jones, Jonathan A.

    2003-01-01

    We describe the use of composite rotations to combat systematic errors in single-qubit quantum logic gates and discuss three families of composite rotations which can be used to correct off-resonance and pulse length errors. Although developed and described within the context of nuclear magnetic resonance quantum computing, these sequences should be applicable to any implementation of quantum computation

  8. Singularities of classical and quantum correlations at critical points of the Lipkin–Meshkov–Glick model in bipartitions and tripartitions of spins

    International Nuclear Information System (INIS)

    Zhang, Xiu-xing; Li, Fu-li

    2013-01-01

    By using the lowest order expansion in the number of spins, we study the classical correlation (CC) and quantum correlations (QCs) between two spin subgroups of the Lipkin–Meshkov–Glick (LMG) model in both binary and trinary decompositions of spins. In the case of bipartitions, we find that the CC and all the QCs are divergent in the same singular behavior at the critical point of the LMG model. In the case of tripartitions, however, the CC is still divergent but the QCs remain finite at the critical point. The present result shows that the CC is very robust but the QCs are much frangible to the environment disturbance.

  9. Entanglement and Quantum Error Correction with Superconducting Qubits

    Science.gov (United States)

    Reed, Matthew

    2015-03-01

    Quantum information science seeks to take advantage of the properties of quantum mechanics to manipulate information in ways that are not otherwise possible. Quantum computation, for example, promises to solve certain problems in days that would take a conventional supercomputer the age of the universe to decipher. This power does not come without a cost however, as quantum bits are inherently more susceptible to errors than their classical counterparts. Fortunately, it is possible to redundantly encode information in several entangled qubits, making it robust to decoherence and control imprecision with quantum error correction. I studied one possible physical implementation for quantum computing, employing the ground and first excited quantum states of a superconducting electrical circuit as a quantum bit. These ``transmon'' qubits are dispersively coupled to a superconducting resonator used for readout, control, and qubit-qubit coupling in the cavity quantum electrodynamics (cQED) architecture. In this talk I will give an general introduction to quantum computation and the superconducting technology that seeks to achieve it before explaining some of the specific results reported in my thesis. One major component is that of the first realization of three-qubit quantum error correction in a solid state device, where we encode one logical quantum bit in three entangled physical qubits and detect and correct phase- or bit-flip errors using a three-qubit Toffoli gate. My thesis is available at arXiv:1311.6759.

  10. Unitary Application of the Quantum Error Correction Codes

    International Nuclear Information System (INIS)

    You Bo; Xu Ke; Wu Xiaohua

    2012-01-01

    For applying the perfect code to transmit quantum information over a noise channel, the standard protocol contains four steps: the encoding, the noise channel, the error-correction operation, and the decoding. In present work, we show that this protocol can be simplified. The error-correction operation is not necessary if the decoding is realized by the so-called complete unitary transformation. We also offer a quantum circuit, which can correct the arbitrary single-qubit errors.

  11. NP-hardness of decoding quantum error-correction codes

    Science.gov (United States)

    Hsieh, Min-Hsiu; Le Gall, François

    2011-05-01

    Although the theory of quantum error correction is intimately related to classical coding theory and, in particular, one can construct quantum error-correction codes (QECCs) from classical codes with the dual-containing property, this does not necessarily imply that the computational complexity of decoding QECCs is the same as their classical counterparts. Instead, decoding QECCs can be very much different from decoding classical codes due to the degeneracy property. Intuitively, one expects degeneracy would simplify the decoding since two different errors might not and need not be distinguished in order to correct them. However, we show that general quantum decoding problem is NP-hard regardless of the quantum codes being degenerate or nondegenerate. This finding implies that no considerably fast decoding algorithm exists for the general quantum decoding problems and suggests the existence of a quantum cryptosystem based on the hardness of decoding QECCs.

  12. NP-hardness of decoding quantum error-correction codes

    International Nuclear Information System (INIS)

    Hsieh, Min-Hsiu; Le Gall, Francois

    2011-01-01

    Although the theory of quantum error correction is intimately related to classical coding theory and, in particular, one can construct quantum error-correction codes (QECCs) from classical codes with the dual-containing property, this does not necessarily imply that the computational complexity of decoding QECCs is the same as their classical counterparts. Instead, decoding QECCs can be very much different from decoding classical codes due to the degeneracy property. Intuitively, one expects degeneracy would simplify the decoding since two different errors might not and need not be distinguished in order to correct them. However, we show that general quantum decoding problem is NP-hard regardless of the quantum codes being degenerate or nondegenerate. This finding implies that no considerably fast decoding algorithm exists for the general quantum decoding problems and suggests the existence of a quantum cryptosystem based on the hardness of decoding QECCs.

  13. Quantum error-correcting code for ternary logic

    Science.gov (United States)

    Majumdar, Ritajit; Basu, Saikat; Ghosh, Shibashis; Sur-Kolay, Susmita

    2018-05-01

    Ternary quantum systems are being studied because they provide more computational state space per unit of information, known as qutrit. A qutrit has three basis states, thus a qubit may be considered as a special case of a qutrit where the coefficient of one of the basis states is zero. Hence both (2 ×2 ) -dimensional and (3 ×3 ) -dimensional Pauli errors can occur on qutrits. In this paper, we (i) explore the possible (2 ×2 ) -dimensional as well as (3 ×3 ) -dimensional Pauli errors in qutrits and show that any pairwise bit swap error can be expressed as a linear combination of shift errors and phase errors, (ii) propose a special type of error called a quantum superposition error and show its equivalence to arbitrary rotation, (iii) formulate a nine-qutrit code which can correct a single error in a qutrit, and (iv) provide its stabilizer and circuit realization.

  14. Dissipative quantum error correction and application to quantum sensing with trapped ions.

    Science.gov (United States)

    Reiter, F; Sørensen, A S; Zoller, P; Muschik, C A

    2017-11-28

    Quantum-enhanced measurements hold the promise to improve high-precision sensing ranging from the definition of time standards to the determination of fundamental constants of nature. However, quantum sensors lose their sensitivity in the presence of noise. To protect them, the use of quantum error-correcting codes has been proposed. Trapped ions are an excellent technological platform for both quantum sensing and quantum error correction. Here we present a quantum error correction scheme that harnesses dissipation to stabilize a trapped-ion qubit. In our approach, always-on couplings to an engineered environment protect the qubit against spin-flips or phase-flips. Our dissipative error correction scheme operates in a continuous manner without the need to perform measurements or feedback operations. We show that the resulting enhanced coherence time translates into a significantly enhanced precision for quantum measurements. Our work constitutes a stepping stone towards the paradigm of self-correcting quantum information processing.

  15. A precise error bound for quantum phase estimation.

    Directory of Open Access Journals (Sweden)

    James M Chappell

    Full Text Available Quantum phase estimation is one of the key algorithms in the field of quantum computing, but up until now, only approximate expressions have been derived for the probability of error. We revisit these derivations, and find that by ensuring symmetry in the error definitions, an exact formula can be found. This new approach may also have value in solving other related problems in quantum computing, where an expected error is calculated. Expressions for two special cases of the formula are also developed, in the limit as the number of qubits in the quantum computer approaches infinity and in the limit as the extra added qubits to improve reliability goes to infinity. It is found that this formula is useful in validating computer simulations of the phase estimation procedure and in avoiding the overestimation of the number of qubits required in order to achieve a given reliability. This formula thus brings improved precision in the design of quantum computers.

  16. Efficient one-way quantum computations for quantum error correction

    International Nuclear Information System (INIS)

    Huang Wei; Wei Zhaohui

    2009-01-01

    We show how to explicitly construct an O(nd) size and constant quantum depth circuit which encodes any given n-qubit stabilizer code with d generators. Our construction is derived using the graphic description for stabilizer codes and the one-way quantum computation model. Our result demonstrates how to use cluster states as scalable resources for many multi-qubit entangled states and how to use the one-way quantum computation model to improve the design of quantum algorithms.

  17. A Quantum Theoretical Explanation for Probability Judgment Errors

    Science.gov (United States)

    Busemeyer, Jerome R.; Pothos, Emmanuel M.; Franco, Riccardo; Trueblood, Jennifer S.

    2011-01-01

    A quantum probability model is introduced and used to explain human probability judgment errors including the conjunction and disjunction fallacies, averaging effects, unpacking effects, and order effects on inference. On the one hand, quantum theory is similar to other categorization and memory models of cognition in that it relies on vector…

  18. Efficient decoding of random errors for quantum expander codes

    OpenAIRE

    Fawzi , Omar; Grospellier , Antoine; Leverrier , Anthony

    2017-01-01

    We show that quantum expander codes, a constant-rate family of quantum LDPC codes, with the quasi-linear time decoding algorithm of Leverrier, Tillich and Z\\'emor can correct a constant fraction of random errors with very high probability. This is the first construction of a constant-rate quantum LDPC code with an efficient decoding algorithm that can correct a linear number of random errors with a negligible failure probability. Finding codes with these properties is also motivated by Gottes...

  19. Gate errors in solid-state quantum-computer architectures

    International Nuclear Information System (INIS)

    Hu Xuedong; Das Sarma, S.

    2002-01-01

    We theoretically consider possible errors in solid-state quantum computation due to the interplay of the complex solid-state environment and gate imperfections. In particular, we study two examples of gate operations in the opposite ends of the gate speed spectrum, an adiabatic gate operation in electron-spin-based quantum dot quantum computation and a sudden gate operation in Cooper-pair-box superconducting quantum computation. We evaluate quantitatively the nonadiabatic operation of a two-qubit gate in a two-electron double quantum dot. We also analyze the nonsudden pulse gate in a Cooper-pair-box-based quantum-computer model. In both cases our numerical results show strong influences of the higher excited states of the system on the gate operation, clearly demonstrating the importance of a detailed understanding of the relevant Hilbert-space structure on the quantum-computer operations

  20. Non-binary unitary error bases and quantum codes

    Energy Technology Data Exchange (ETDEWEB)

    Knill, E.

    1996-06-01

    Error operator bases for systems of any dimension are defined and natural generalizations of the bit-flip/ sign-change error basis for qubits are given. These bases allow generalizing the construction of quantum codes based on eigenspaces of Abelian groups. As a consequence, quantum codes can be constructed form linear codes over {ital Z}{sub {ital n}} for any {ital n}. The generalization of the punctured code construction leads to many codes which permit transversal (i.e. fault tolerant) implementations of certain operations compatible with the error basis.

  1. Entanglement renormalization, quantum error correction, and bulk causality

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Isaac H. [IBM T.J. Watson Research Center,1101 Kitchawan Rd., Yorktown Heights, NY (United States); Kastoryano, Michael J. [NBIA, Niels Bohr Institute, University of Copenhagen, Blegdamsvej 17, 2100 Copenhagen (Denmark)

    2017-04-07

    Entanglement renormalization can be viewed as an encoding circuit for a family of approximate quantum error correcting codes. The logical information becomes progressively more well-protected against erasure errors at larger length scales. In particular, an approximate variant of holographic quantum error correcting code emerges at low energy for critical systems. This implies that two operators that are largely separated in scales behave as if they are spatially separated operators, in the sense that they obey a Lieb-Robinson type locality bound under a time evolution generated by a local Hamiltonian.

  2. Error Mitigation for Short-Depth Quantum Circuits

    Science.gov (United States)

    Temme, Kristan; Bravyi, Sergey; Gambetta, Jay M.

    2017-11-01

    Two schemes are presented that mitigate the effect of errors and decoherence in short-depth quantum circuits. The size of the circuits for which these techniques can be applied is limited by the rate at which the errors in the computation are introduced. Near-term applications of early quantum devices, such as quantum simulations, rely on accurate estimates of expectation values to become relevant. Decoherence and gate errors lead to wrong estimates of the expectation values of observables used to evaluate the noisy circuit. The two schemes we discuss are deliberately simple and do not require additional qubit resources, so to be as practically relevant in current experiments as possible. The first method, extrapolation to the zero noise limit, subsequently cancels powers of the noise perturbations by an application of Richardson's deferred approach to the limit. The second method cancels errors by resampling randomized circuits according to a quasiprobability distribution.

  3. Black Hole Entanglement and Quantum Error Correction

    NARCIS (Netherlands)

    Verlinde, E.; Verlinde, H.

    2013-01-01

    It was recently argued in [1] that black hole complementarity strains the basic rules of quantum information theory, such as monogamy of entanglement. Motivated by this argument, we develop a practical framework for describing black hole evaporation via unitary time evolution, based on a holographic

  4. Achieving the Heisenberg limit in quantum metrology using quantum error correction.

    Science.gov (United States)

    Zhou, Sisi; Zhang, Mengzhen; Preskill, John; Jiang, Liang

    2018-01-08

    Quantum metrology has many important applications in science and technology, ranging from frequency spectroscopy to gravitational wave detection. Quantum mechanics imposes a fundamental limit on measurement precision, called the Heisenberg limit, which can be achieved for noiseless quantum systems, but is not achievable in general for systems subject to noise. Here we study how measurement precision can be enhanced through quantum error correction, a general method for protecting a quantum system from the damaging effects of noise. We find a necessary and sufficient condition for achieving the Heisenberg limit using quantum probes subject to Markovian noise, assuming that noiseless ancilla systems are available, and that fast, accurate quantum processing can be performed. When the sufficient condition is satisfied, a quantum error-correcting code can be constructed that suppresses the noise without obscuring the signal; the optimal code, achieving the best possible precision, can be found by solving a semidefinite program.

  5. Quantum money with nearly optimal error tolerance

    Science.gov (United States)

    Amiri, Ryan; Arrazola, Juan Miguel

    2017-06-01

    We present a family of quantum money schemes with classical verification which display a number of benefits over previous proposals. Our schemes are based on hidden matching quantum retrieval games and they tolerate noise up to 23 % , which we conjecture reaches 25 % asymptotically as the dimension of the underlying hidden matching states is increased. Furthermore, we prove that 25 % is the maximum tolerable noise for a wide class of quantum money schemes with classical verification, meaning our schemes are almost optimally noise tolerant. We use methods in semidefinite programming to prove security in a substantially different manner to previous proposals, leading to two main advantages: first, coin verification involves only a constant number of states (with respect to coin size), thereby allowing for smaller coins; second, the reusability of coins within our scheme grows linearly with the size of the coin, which is known to be optimal. Last, we suggest methods by which the coins in our protocol could be implemented using weak coherent states and verified using existing experimental techniques, even in the presence of detector inefficiencies.

  6. Decodoku: Quantum error rorrection as a simple puzzle game

    Science.gov (United States)

    Wootton, James

    To build quantum computers, we need to detect and manage any noise that occurs. This will be done using quantum error correction. At the hardware level, QEC is a multipartite system that stores information non-locally. Certain measurements are made which do not disturb the stored information, but which do allow signatures of errors to be detected. Then there is a software problem. How to take these measurement outcomes and determine: a) The errors that caused them, and (b) how to remove their effects. For qubit error correction, the algorithms required to do this are well known. For qudits, however, current methods are far from optimal. We consider the error correction problem of qubit surface codes. At the most basic level, this is a problem that can be expressed in terms of a grid of numbers. Using this fact, we take the inherent problem at the heart of quantum error correction, remove it from its quantum context, and presented in terms of simple grid based puzzle games. We have developed three versions of these puzzle games, focussing on different aspects of the required algorithms. These have been presented and iOS and Android apps, allowing the public to try their hand at developing good algorithms to solve the puzzles. For more information, see www.decodoku.com. Funding from the NCCR QSIT.

  7. Operator quantum error-correcting subsystems for self-correcting quantum memories

    International Nuclear Information System (INIS)

    Bacon, Dave

    2006-01-01

    The most general method for encoding quantum information is not to encode the information into a subspace of a Hilbert space, but to encode information into a subsystem of a Hilbert space. Recently this notion has led to a more general notion of quantum error correction known as operator quantum error correction. In standard quantum error-correcting codes, one requires the ability to apply a procedure which exactly reverses on the error-correcting subspace any correctable error. In contrast, for operator error-correcting subsystems, the correction procedure need not undo the error which has occurred, but instead one must perform corrections only modulo the subsystem structure. This does not lead to codes which differ from subspace codes, but does lead to recovery routines which explicitly make use of the subsystem structure. Here we present two examples of such operator error-correcting subsystems. These examples are motivated by simple spatially local Hamiltonians on square and cubic lattices. In three dimensions we provide evidence, in the form a simple mean field theory, that our Hamiltonian gives rise to a system which is self-correcting. Such a system will be a natural high-temperature quantum memory, robust to noise without external intervening quantum error-correction procedures

  8. Error suppression and error correction in adiabatic quantum computation: non-equilibrium dynamics

    International Nuclear Information System (INIS)

    Sarovar, Mohan; Young, Kevin C

    2013-01-01

    While adiabatic quantum computing (AQC) has some robustness to noise and decoherence, it is widely believed that encoding, error suppression and error correction will be required to scale AQC to large problem sizes. Previous works have established at least two different techniques for error suppression in AQC. In this paper we derive a model for describing the dynamics of encoded AQC and show that previous constructions for error suppression can be unified with this dynamical model. In addition, the model clarifies the mechanisms of error suppression and allows the identification of its weaknesses. In the second half of the paper, we utilize our description of non-equilibrium dynamics in encoded AQC to construct methods for error correction in AQC by cooling local degrees of freedom (qubits). While this is shown to be possible in principle, we also identify the key challenge to this approach: the requirement of high-weight Hamiltonians. Finally, we use our dynamical model to perform a simplified thermal stability analysis of concatenated-stabilizer-code encoded many-body systems for AQC or quantum memories. This work is a companion paper to ‘Error suppression and error correction in adiabatic quantum computation: techniques and challenges (2013 Phys. Rev. X 3 041013)’, which provides a quantum information perspective on the techniques and limitations of error suppression and correction in AQC. In this paper we couch the same results within a dynamical framework, which allows for a detailed analysis of the non-equilibrium dynamics of error suppression and correction in encoded AQC. (paper)

  9. Error Correction for Non-Abelian Topological Quantum Computation

    Directory of Open Access Journals (Sweden)

    James R. Wootton

    2014-03-01

    Full Text Available The possibility of quantum computation using non-Abelian anyons has been considered for over a decade. However, the question of how to obtain and process information about what errors have occurred in order to negate their effects has not yet been considered. This is in stark contrast with quantum computation proposals for Abelian anyons, for which decoding algorithms have been tailor-made for many topological error-correcting codes and error models. Here, we address this issue by considering the properties of non-Abelian error correction, in general. We also choose a specific anyon model and error model to probe the problem in more detail. The anyon model is the charge submodel of D(S_{3}. This shares many properties with important models such as the Fibonacci anyons, making our method more generally applicable. The error model is a straightforward generalization of those used in the case of Abelian anyons for initial benchmarking of error correction methods. It is found that error correction is possible under a threshold value of 7% for the total probability of an error on each physical spin. This is remarkably comparable with the thresholds for Abelian models.

  10. Efficiently characterizing the total error in quantum circuits

    Science.gov (United States)

    Carignan-Dugas, Arnaud; Wallman, Joel J.; Emerson, Joseph

    A promising technological advancement meant to enlarge our computational means is the quantum computer. Such a device would harvest the quantum complexity of the physical world in order to unfold concrete mathematical problems more efficiently. However, the errors emerging from the implementation of quantum operations are likewise quantum, and hence share a similar level of intricacy. Fortunately, randomized benchmarking protocols provide an efficient way to characterize the operational noise within quantum devices. The resulting figures of merit, like the fidelity and the unitarity, are typically attached to a set of circuit components. While important, this doesn't fulfill the main goal: determining if the error rate of the total circuit is small enough in order to trust its outcome. In this work, we fill the gap by providing an optimal bound on the total fidelity of a circuit in terms of component-wise figures of merit. Our bound smoothly interpolates between the classical regime, in which the error rate grows linearly in the circuit's length, and the quantum regime, which can naturally allow quadratic growth. Conversely, our analysis substantially improves the bounds on single circuit element fidelities obtained through techniques such as interleaved randomized benchmarking. This research was supported by the U.S. Army Research Office through Grant W911NF- 14-1-0103, CIFAR, the Government of Ontario, and the Government of Canada through NSERC and Industry Canada.

  11. Minimum-error discrimination of entangled quantum states

    International Nuclear Information System (INIS)

    Lu, Y.; Coish, N.; Kaltenbaek, R.; Hamel, D. R.; Resch, K. J.; Croke, S.

    2010-01-01

    Strategies to optimally discriminate between quantum states are critical in quantum technologies. We present an experimental demonstration of minimum-error discrimination between entangled states, encoded in the polarization of pairs of photons. Although the optimal measurement involves projection onto entangled states, we use a result of J. Walgate et al. [Phys. Rev. Lett. 85, 4972 (2000)] to design an optical implementation employing only local polarization measurements and feed-forward, which performs at the Helstrom bound. Our scheme can achieve perfect discrimination of orthogonal states and minimum-error discrimination of nonorthogonal states. Our experimental results show a definite advantage over schemes not using feed-forward.

  12. Bounding quantum gate error rate based on reported average fidelity

    International Nuclear Information System (INIS)

    Sanders, Yuval R; Wallman, Joel J; Sanders, Barry C

    2016-01-01

    Remarkable experimental advances in quantum computing are exemplified by recent announcements of impressive average gate fidelities exceeding 99.9% for single-qubit gates and 99% for two-qubit gates. Although these high numbers engender optimism that fault-tolerant quantum computing is within reach, the connection of average gate fidelity with fault-tolerance requirements is not direct. Here we use reported average gate fidelity to determine an upper bound on the quantum-gate error rate, which is the appropriate metric for assessing progress towards fault-tolerant quantum computation, and we demonstrate that this bound is asymptotically tight for general noise. Although this bound is unlikely to be saturated by experimental noise, we demonstrate using explicit examples that the bound indicates a realistic deviation between the true error rate and the reported average fidelity. We introduce the Pauli distance as a measure of this deviation, and we show that knowledge of the Pauli distance enables tighter estimates of the error rate of quantum gates. (fast track communication)

  13. New construction of quantum error-avoiding codes via group representation of quantum stabilizer codes

    Energy Technology Data Exchange (ETDEWEB)

    Xiao, Hailin [Wenzhou University, College of Physics and Electronic Information Engineering, Wenzhou (China); Southeast University, National Mobile Communications Research Laboratory, Nanjing (China); Guilin University of Electronic Technology, Ministry of Education, Key Laboratory of Cognitive Radio and Information Processing, Guilin (China); Zhang, Zhongshan [University of Science and Technology Beijing, Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services, Beijing (China); Chronopoulos, Anthony Theodore [University of Texas at San Antonio, Department of Computer Science, San Antonio, TX (United States)

    2017-10-15

    In quantum computing, nice error bases as generalization of the Pauli basis were introduced by Knill. These bases are known to be projective representations of finite groups. In this paper, we propose a group representation approach to the study of quantum stabilizer codes. We utilize this approach to define decoherence-free subspaces (DFSs). Unlike previous studies of DFSs, this type of DFSs does not involve any spatial symmetry assumptions on the system-environment interaction. Thus, it can be used to construct quantum error-avoiding codes (QEACs) that are fault tolerant automatically. We also propose a new simple construction of QEACs and subsequently develop several classes of QEACs. Finally, we present numerical simulation results encoding the logical error rate over physical error rate on the fidelity performance of these QEACs. Our study demonstrates that DFSs-based QEACs are capable of providing a generalized and unified framework for error-avoiding methods. (orig.)

  14. Error-Transparent Quantum Gates for Small Logical Qubit Architectures

    Science.gov (United States)

    Kapit, Eliot

    2018-02-01

    One of the largest obstacles to building a quantum computer is gate error, where the physical evolution of the state of a qubit or group of qubits during a gate operation does not match the intended unitary transformation. Gate error stems from a combination of control errors and random single qubit errors from interaction with the environment. While great strides have been made in mitigating control errors, intrinsic qubit error remains a serious problem that limits gate fidelity in modern qubit architectures. Simultaneously, recent developments of small error-corrected logical qubit devices promise significant increases in logical state lifetime, but translating those improvements into increases in gate fidelity is a complex challenge. In this Letter, we construct protocols for gates on and between small logical qubit devices which inherit the parent device's tolerance to single qubit errors which occur at any time before or during the gate. We consider two such devices, a passive implementation of the three-qubit bit flip code, and the author's own [E. Kapit, Phys. Rev. Lett. 116, 150501 (2016), 10.1103/PhysRevLett.116.150501] very small logical qubit (VSLQ) design, and propose error-tolerant gate sets for both. The effective logical gate error rate in these models displays superlinear error reduction with linear increases in single qubit lifetime, proving that passive error correction is capable of increasing gate fidelity. Using a standard phenomenological noise model for superconducting qubits, we demonstrate a realistic, universal one- and two-qubit gate set for the VSLQ, with error rates an order of magnitude lower than those for same-duration operations on single qubits or pairs of qubits. These developments further suggest that incorporating small logical qubits into a measurement based code could substantially improve code performance.

  15. Error characterization and quantum control benchmarking in liquid state NMR using quantum information processing techniques

    Science.gov (United States)

    Laforest, Martin

    Quantum information processing has been the subject of countless discoveries since the early 1990's. It is believed to be the way of the future for computation: using quantum systems permits one to perform computation exponentially faster than on a regular classical computer. Unfortunately, quantum systems that not isolated do not behave well. They tend to lose their quantum nature due to the presence of the environment. If key information is known about the noise present in the system, methods such as quantum error correction have been developed in order to reduce the errors introduced by the environment during a given quantum computation. In order to harness the quantum world and implement the theoretical ideas of quantum information processing and quantum error correction, it is imperative to understand and quantify the noise present in the quantum processor and benchmark the quality of the control over the qubits. Usual techniques to estimate the noise or the control are based on quantum process tomography (QPT), which, unfortunately, demands an exponential amount of resources. This thesis presents work towards the characterization of noisy processes in an efficient manner. The protocols are developed from a purely abstract setting with no system-dependent variables. To circumvent the exponential nature of quantum process tomography, three different efficient protocols are proposed and experimentally verified. The first protocol uses the idea of quantum error correction to extract relevant parameters about a given noise model, namely the correlation between the dephasing of two qubits. Following that is a protocol using randomization and symmetrization to extract the probability that a given number of qubits are simultaneously corrupted in a quantum memory, regardless of the specifics of the error and which qubits are affected. Finally, a last protocol, still using randomization ideas, is developed to estimate the average fidelity per computational gates for

  16. Neural network decoder for quantum error correcting codes

    Science.gov (United States)

    Krastanov, Stefan; Jiang, Liang

    Artificial neural networks form a family of extremely powerful - albeit still poorly understood - tools used in anything from image and sound recognition through text generation to, in our case, decoding. We present a straightforward Recurrent Neural Network architecture capable of deducing the correcting procedure for a quantum error-correcting code from a set of repeated stabilizer measurements. We discuss the fault-tolerance of our scheme and the cost of training the neural network for a system of a realistic size. Such decoders are especially interesting when applied to codes, like the quantum LDPC codes, that lack known efficient decoding schemes.

  17. Error estimates for discretized quantum stochastic differential inclusions

    International Nuclear Information System (INIS)

    Ayoola, E.O.

    2001-09-01

    This paper is concerned with the error estimates involved in the solution of a discrete approximation of a quantum stochastic differential inclusion (QSDI). Our main results rely on certain properties of the averaged modulus of continuity for multivalued sesquilinear forms associated with QSDI. We obtained results concerning the estimates of the Hausdorff distance between the set of solutions of the QSDI and the set of solutions of its discrete approximation. This extend the results of Dontchev and Farkhi concerning classical differential inclusions to the present noncommutative Quantum setting involving inclusions in certain locally convex space. (author)

  18. Formulation of uncertainty relation of error and disturbance in quantum measurement by using quantum estimation theory

    International Nuclear Information System (INIS)

    Yu Watanabe; Masahito Ueda

    2012-01-01

    Full text: When we try to obtain information about a quantum system, we need to perform measurement on the system. The measurement process causes unavoidable state change. Heisenberg discussed a thought experiment of the position measurement of a particle by using a gamma-ray microscope, and found a trade-off relation between the error of the measured position and the disturbance in the momentum caused by the measurement process. The trade-off relation epitomizes the complementarity in quantum measurements: we cannot perform a measurement of an observable without causing disturbance in its canonically conjugate observable. However, at the time Heisenberg found the complementarity, quantum measurement theory was not established yet, and Kennard and Robertson's inequality erroneously interpreted as a mathematical formulation of the complementarity. Kennard and Robertson's inequality actually implies the indeterminacy of the quantum state: non-commuting observables cannot have definite values simultaneously. However, Kennard and Robertson's inequality reflects the inherent nature of a quantum state alone, and does not concern any trade-off relation between the error and disturbance in the measurement process. In this talk, we report a resolution to the complementarity in quantum measurements. First, we find that it is necessary to involve the estimation process from the outcome of the measurement for quantifying the error and disturbance in the quantum measurement. We clarify the implicitly involved estimation process in Heisenberg's gamma-ray microscope and other measurement schemes, and formulate the error and disturbance for an arbitrary quantum measurement by using quantum estimation theory. The error and disturbance are defined in terms of the Fisher information, which gives the upper bound of the accuracy of the estimation. Second, we obtain uncertainty relations between the measurement errors of two observables [1], and between the error and disturbance in the

  19. Coexistence of unlimited bipartite and genuine multipartite entanglement: Promiscuous quantum correlations arising from discrete to continuous-variable systems

    International Nuclear Information System (INIS)

    Adesso, Gerardo; Ericsson, Marie; Illuminati, Fabrizio

    2007-01-01

    Quantum mechanics imposes 'monogamy' constraints on the sharing of entanglement. We show that, despite these limitations, entanglement can be fully 'promiscuous', i.e., simultaneously present in unlimited two-body and many-body forms in states living in an infinite-dimensional Hilbert space. Monogamy just bounds the divergence rate of the various entanglement contributions. This is demonstrated in simple families of N-mode (N≥4) Gaussian states of light fields or atomic ensembles, which therefore enable infinitely more freedom in the distribution of information, as opposed to systems of individual qubits. Such a finding is of importance for the quantification, understanding, and potential exploitation of shared quantum correlations in continuous variable systems. We discuss how promiscuity gradually arises when considering simple families of discrete variable states, with increasing Hilbert space dimension towards the continuous variable limit. Such models are somehow analogous to Gaussian states with asymptotically diverging, but finite, squeezing. In this respect, we find that non-Gaussian states (which in general are more entangled than Gaussian states) exhibit also the interesting feature that their entanglement is more shareable: in the non-Gaussian multipartite arena, unlimited promiscuity can be already achieved among three entangled parties, while this is impossible for Gaussian, even infinitely squeezed states

  20. Design of nanophotonic circuits for autonomous subsystem quantum error correction

    Energy Technology Data Exchange (ETDEWEB)

    Kerckhoff, J; Pavlichin, D S; Chalabi, H; Mabuchi, H, E-mail: jkerc@stanford.edu [Edward L Ginzton Laboratory, Stanford University, Stanford, CA 94305 (United States)

    2011-05-15

    We reapply our approach to designing nanophotonic quantum memories in order to formulate an optical network that autonomously protects a single logical qubit against arbitrary single-qubit errors. Emulating the nine-qubit Bacon-Shor subsystem code, the network replaces the traditionally discrete syndrome measurement and correction steps by continuous, time-independent optical interactions and coherent feedback of unitarily processed optical fields.

  1. Continuous quantum error correction for non-Markovian decoherence

    International Nuclear Information System (INIS)

    Oreshkov, Ognyan; Brun, Todd A.

    2007-01-01

    We study the effect of continuous quantum error correction in the case where each qubit in a codeword is subject to a general Hamiltonian interaction with an independent bath. We first consider the scheme in the case of a trivial single-qubit code, which provides useful insights into the workings of continuous error correction and the difference between Markovian and non-Markovian decoherence. We then study the model of a bit-flip code with each qubit coupled to an independent bath qubit and subject to continuous correction, and find its solution. We show that for sufficiently large error-correction rates, the encoded state approximately follows an evolution of the type of a single decohering qubit, but with an effectively decreased coupling constant. The factor by which the coupling constant is decreased scales quadratically with the error-correction rate. This is compared to the case of Markovian noise, where the decoherence rate is effectively decreased by a factor which scales only linearly with the rate of error correction. The quadratic enhancement depends on the existence of a Zeno regime in the Hamiltonian evolution which is absent in purely Markovian dynamics. We analyze the range of validity of this result and identify two relevant time scales. Finally, we extend the result to more general codes and argue that the performance of continuous error correction will exhibit the same qualitative characteristics

  2. Quantum states and their marginals. From multipartite entanglement to quantum error-correcting codes

    International Nuclear Information System (INIS)

    Huber, Felix Michael

    2017-01-01

    At the heart of the curious phenomenon of quantum entanglement lies the relation between the whole and its parts. In my thesis, I explore different aspects of this theme in the multipartite setting by drawing connections to concepts from statistics, graph theory, and quantum error-correcting codes: first, I address the case when joint quantum states are determined by their few-body parts and by Jaynes' maximum entropy principle. This can be seen as an extension of the notion of entanglement, with less complex states already being determined by their few-body marginals. Second, I address the conditions for certain highly entangled multipartite states to exist. In particular, I present the solution of a long-standing open problem concerning the existence of an absolutely maximally entangled state on seven qubits. This sheds light on the algebraic properties of pure quantum states, and on the conditions that constrain the sharing of entanglement amongst multiple particles. Third, I investigate Ulam's graph reconstruction problems in the quantum setting, and obtain legitimacy conditions of a set of states to be the reductions of a joint graph state. Lastly, I apply and extend the weight enumerator machinery from quantum error correction to investigate the existence of codes and highly entangled states in higher dimensions. This clarifies the physical interpretation of the weight enumerators and of the quantum MacWilliams identity, leading to novel applications in multipartite entanglement.

  3. Error modelling of quantum Hall array resistance standards

    Science.gov (United States)

    Marzano, Martina; Oe, Takehiko; Ortolano, Massimo; Callegaro, Luca; Kaneko, Nobu-Hisa

    2018-04-01

    Quantum Hall array resistance standards (QHARSs) are integrated circuits composed of interconnected quantum Hall effect elements that allow the realization of virtually arbitrary resistance values. In recent years, techniques were presented to efficiently design QHARS networks. An open problem is that of the evaluation of the accuracy of a QHARS, which is affected by contact and wire resistances. In this work, we present a general and systematic procedure for the error modelling of QHARSs, which is based on modern circuit analysis techniques and Monte Carlo evaluation of the uncertainty. As a practical example, this method of analysis is applied to the characterization of a 1 MΩ QHARS developed by the National Metrology Institute of Japan. Software tools are provided to apply the procedure to other arrays.

  4. Topological quantum error correction in the Kitaev honeycomb model

    Science.gov (United States)

    Lee, Yi-Chan; Brell, Courtney G.; Flammia, Steven T.

    2017-08-01

    The Kitaev honeycomb model is an approximate topological quantum error correcting code in the same phase as the toric code, but requiring only a 2-body Hamiltonian. As a frustrated spin model, it is well outside the commuting models of topological quantum codes that are typically studied, but its exact solubility makes it more amenable to analysis of effects arising in this noncommutative setting than a generic topologically ordered Hamiltonian. Here we study quantum error correction in the honeycomb model using both analytic and numerical techniques. We first prove explicit exponential bounds on the approximate degeneracy, local indistinguishability, and correctability of the code space. These bounds are tighter than can be achieved using known general properties of topological phases. Our proofs are specialized to the honeycomb model, but some of the methods may nonetheless be of broader interest. Following this, we numerically study noise caused by thermalization processes in the perturbative regime close to the toric code renormalization group fixed point. The appearance of non-topological excitations in this setting has no significant effect on the error correction properties of the honeycomb model in the regimes we study. Although the behavior of this model is found to be qualitatively similar to that of the standard toric code in most regimes, we find numerical evidence of an interesting effect in the low-temperature, finite-size regime where a preferred lattice direction emerges and anyon diffusion is geometrically constrained. We expect this effect to yield an improvement in the scaling of the lifetime with system size as compared to the standard toric code.

  5. Bound on quantum computation time: Quantum error correction in a critical environment

    International Nuclear Information System (INIS)

    Novais, E.; Mucciolo, Eduardo R.; Baranger, Harold U.

    2010-01-01

    We obtain an upper bound on the time available for quantum computation for a given quantum computer and decohering environment with quantum error correction implemented. First, we derive an explicit quantum evolution operator for the logical qubits and show that it has the same form as that for the physical qubits but with a reduced coupling strength to the environment. Using this evolution operator, we find the trace distance between the real and ideal states of the logical qubits in two cases. For a super-Ohmic bath, the trace distance saturates, while for Ohmic or sub-Ohmic baths, there is a finite time before the trace distance exceeds a value set by the user.

  6. Bipartite binomial heaps

    DEFF Research Database (Denmark)

    Elmasry, Amr; Jensen, Claus; Katajainen, Jyrki

    2017-01-01

    the (total) number of elements stored in the data structure(s) prior to the operation. As the resulting data structure consists of two components that are different variants of binomial heaps, we call it a bipartite binomial heap. Compared to its counterpart, a multipartite binomial heap, the new structure...

  7. On lattices, learning with errors, cryptography, and quantum

    International Nuclear Information System (INIS)

    Regev, O.

    2004-01-01

    Full Text:Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the 'learning from parity with error' problem to higher moduli. It can also be viewed as the problem of decoding from a random linear code. This, we believe, gives a strong indication that these problems are hard. Our reduction, however, is quantum. Hence, an efficient solution to the learning problem implies a quantum algorithm for SVP and SIVP. A main open question is whether this reduction can be made classical. Using the main result, we obtain a public-key cryptosystem whose hardness is based on the worst-case quantum hardness of SVP and SIVP. Previous lattice-based public-key cryptosystems such as the one by Ajtai and Dwork were only based on unique-SVP, a special case of SVP. The new cryptosystem is much more efficient than previous cryptosystems: the public key is of size Ο((n 2 ) and encrypting a message increases its size by Ο((n) (in previous cryptosystems these values are Ο((n 4 ) and Ο(n 2 ), respectively)

  8. Quantum information theory mathematical foundation

    CERN Document Server

    Hayashi, Masahito

    2017-01-01

    This graduate textbook provides a unified view of quantum information theory. Clearly explaining the necessary mathematical basis, it merges key topics from both information-theoretic and quantum- mechanical viewpoints and provides lucid explanations of the basic results. Thanks to this unified approach, it makes accessible such advanced topics in quantum communication as quantum teleportation, superdense coding, quantum state transmission (quantum error-correction) and quantum encryption. Since the publication of the preceding book Quantum Information: An Introduction, there have been tremendous strides in the field of quantum information. In particular, the following topics – all of which are addressed here – made seen major advances: quantum state discrimination, quantum channel capacity, bipartite and multipartite entanglement, security analysis on quantum communication, reverse Shannon theorem and uncertainty relation. With regard to the analysis of quantum security, the present book employs an impro...

  9. MRI findings in bipartite patella

    International Nuclear Information System (INIS)

    Kavanagh, Eoin C.; Zoga, Adam; Omar, Imran; Ford, Stephanie; Eustace, Stephen; Schweitzer, Mark

    2007-01-01

    Bipartite patella is a known cause of anterior knee pain. Our purpose was to detail the magnetic resonance imaging (MRI) features of bipartite patella in a retrospective cohort of patients imaged at our institution. MRI exams from 53 patients with findings of bipartite patella were evaluated to assess for the presence of bone marrow edema within the bipartite fragment and for the presence of abnormal signal across the synchondrosis or pseudarthrosis. Any other significant knee pathology seen at MRI was also recorded. We also reviewed 400 consecutive knee MRI studies to determine the MRI prevalence of bipartite patella. Of the 53 patients with bipartite patella 40 (75%) were male; 35 (66%) had edema within the bipartite fragment. Of the 18 with no edema an alternative explanation for knee pain was found in 13 (72%). Edema within the bipartite fragment was the sole finding in 26 of 53 (49%) patients. Bipartite patella was seen in 3 (0.7%) of 400 patients. In patients with bipartite patella at knee MRI, bone marrow edema within the bipartite fragment was the sole finding on knee MRI in almost half of the patients in our series. (orig.)

  10. Iterative Phase Optimization of Elementary Quantum Error Correcting Codes (Open Access, Publisher’s Version)

    Science.gov (United States)

    2016-08-24

    to the seven-qubit Steane code [29] and also represents the smallest instance of a 2D topological color code [30]. Since the realized quantum error...Quantum Computations on a Topologically Encoded Qubit, Science 345, 302 (2014). [17] M. Cramer, M. B. Plenio, S. T. Flammia, R. Somma, D. Gross, S. D...Memory, J. Math . Phys. (N.Y.) 43, 4452 (2002). [20] B. M. Terhal, Quantum Error Correction for Quantum Memories, Rev. Mod. Phys. 87, 307 (2015). [21] D

  11. Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes

    Science.gov (United States)

    Harrington, James William

    Quantum information theory is concerned with identifying how quantum mechanical resources (such as entangled quantum states) can be utilized for a number of information processing tasks, including data storage, computation, communication, and cryptography. Efficient quantum algorithms and protocols have been developed for performing some tasks (e.g. , factoring large numbers, securely communicating over a public channel, and simulating quantum mechanical systems) that appear to be very difficult with just classical resources. In addition to identifying the separation between classical and quantum computational power, much of the theoretical focus in this field over the last decade has been concerned with finding novel ways of encoding quantum information that are robust against errors, which is an important step toward building practical quantum information processing devices. In this thesis I present some results on the quantum error-correcting properties of oscillator codes (also described as symplectic lattice codes) and toric codes. Any harmonic oscillator system (such as a mode of light) can be encoded with quantum information via symplectic lattice codes that are robust against shifts in the system's continuous quantum variables. I show the existence of lattice codes whose achievable rates match the one-shot coherent information over the Gaussian quantum channel. Also, I construct a family of symplectic self-dual lattices and search for optimal encodings of quantum information distributed between several oscillators. Toric codes provide encodings of quantum information into two-dimensional spin lattices that are robust against local clusters of errors and which require only local quantum operations for error correction. Numerical simulations of this system under various error models provide a calculation of the accuracy threshold for quantum memory using toric codes, which can be related to phase transitions in certain condensed matter models. I also present

  12. On superactivation of one-shot quantum zero-error capacity and the related property of quantum measurements

    DEFF Research Database (Denmark)

    Shirokov, M. E.; Shulman, Tatiana

    2014-01-01

    We give a detailed description of a low-dimensional quantum channel (input dimension 4, Choi rank 3) demonstrating the symmetric form of superactivation of one-shot quantum zero-error capacity. This property means appearance of a noiseless (perfectly reversible) subchannel in the tensor square...... of a channel having no noiseless subchannels. Then we describe a quantum channel with an arbitrary given level of symmetric superactivation (including the infinite value). We also show that superactivation of one-shot quantum zero-error capacity of a channel can be reformulated in terms of quantum measurement...

  13. Latent geometry of bipartite networks

    Science.gov (United States)

    Kitsak, Maksim; Papadopoulos, Fragkiskos; Krioukov, Dmitri

    2017-03-01

    Despite the abundance of bipartite networked systems, their organizing principles are less studied compared to unipartite networks. Bipartite networks are often analyzed after projecting them onto one of the two sets of nodes. As a result of the projection, nodes of the same set are linked together if they have at least one neighbor in common in the bipartite network. Even though these projections allow one to study bipartite networks using tools developed for unipartite networks, one-mode projections lead to significant loss of information and artificial inflation of the projected network with fully connected subgraphs. Here we pursue a different approach for analyzing bipartite systems that is based on the observation that such systems have a latent metric structure: network nodes are points in a latent metric space, while connections are more likely to form between nodes separated by shorter distances. This approach has been developed for unipartite networks, and relatively little is known about its applicability to bipartite systems. Here, we fully analyze a simple latent-geometric model of bipartite networks and show that this model explains the peculiar structural properties of many real bipartite systems, including the distributions of common neighbors and bipartite clustering. We also analyze the geometric information loss in one-mode projections in this model and propose an efficient method to infer the latent pairwise distances between nodes. Uncovering the latent geometry underlying real bipartite networks can find applications in diverse domains, ranging from constructing efficient recommender systems to understanding cell metabolism.

  14. Scattering quantum random-walk search with errors

    International Nuclear Information System (INIS)

    Gabris, A.; Kiss, T.; Jex, I.

    2007-01-01

    We analyze the realization of a quantum-walk search algorithm in a passive, linear optical network. The specific model enables us to consider the effect of realistic sources of noise and losses on the search efficiency. Photon loss uniform in all directions is shown to lead to the rescaling of search time. Deviation from directional uniformity leads to the enhancement of the search efficiency compared to uniform loss with the same average. In certain cases even increasing loss in some of the directions can improve search efficiency. We show that while we approach the classical limit of the general search algorithm by introducing random phase fluctuations, its utility for searching is lost. Using numerical methods, we found that for static phase errors the averaged search efficiency displays a damped oscillatory behavior that asymptotically tends to a nonzero value

  15. Activation of zero-error classical capacity in low-dimensional quantum systems

    Science.gov (United States)

    Park, Jeonghoon; Heo, Jun

    2018-06-01

    Channel capacities of quantum channels can be nonadditive even if one of two quantum channels has no channel capacity. We call this phenomenon activation of the channel capacity. In this paper, we show that when we use a quantum channel on a qubit system, only a noiseless qubit channel can generate the activation of the zero-error classical capacity. In particular, we show that the zero-error classical capacity of two quantum channels on qubit systems cannot be activated. Furthermore, we present a class of examples showing the activation of the zero-error classical capacity in low-dimensional systems.

  16. Quantum entanglement in non-local games, graph parameters and zero-error information theory

    NARCIS (Netherlands)

    Scarpa, G.

    2013-01-01

    We study quantum entanglement and some of its applications in graph theory and zero-error information theory. In Chapter 1 we introduce entanglement and other fundamental concepts of quantum theory. In Chapter 2 we address the question of how much quantum correlations generated by entanglement can

  17. Groupies in random bipartite graphs

    OpenAIRE

    Yilun Shang

    2010-01-01

    A vertex $v$ of a graph $G$ is called a groupie if its degree is notless than the average of the degrees of its neighbors. In thispaper we study the influence of bipartition $(B_1,B_2)$ on groupiesin random bipartite graphs $G(B_1,B_2,p)$ with both fixed $p$ and$p$ tending to zero.

  18. Large-scale simulations of error-prone quantum computation devices

    International Nuclear Information System (INIS)

    Trieu, Doan Binh

    2009-01-01

    The theoretical concepts of quantum computation in the idealized and undisturbed case are well understood. However, in practice, all quantum computation devices do suffer from decoherence effects as well as from operational imprecisions. This work assesses the power of error-prone quantum computation devices using large-scale numerical simulations on parallel supercomputers. We present the Juelich Massively Parallel Ideal Quantum Computer Simulator (JUMPIQCS), that simulates a generic quantum computer on gate level. It comprises an error model for decoherence and operational errors. The robustness of various algorithms in the presence of noise has been analyzed. The simulation results show that for large system sizes and long computations it is imperative to actively correct errors by means of quantum error correction. We implemented the 5-, 7-, and 9-qubit quantum error correction codes. Our simulations confirm that using error-prone correction circuits with non-fault-tolerant quantum error correction will always fail, because more errors are introduced than being corrected. Fault-tolerant methods can overcome this problem, provided that the single qubit error rate is below a certain threshold. We incorporated fault-tolerant quantum error correction techniques into JUMPIQCS using Steane's 7-qubit code and determined this threshold numerically. Using the depolarizing channel as the source of decoherence, we find a threshold error rate of (5.2±0.2) x 10 -6 . For Gaussian distributed operational over-rotations the threshold lies at a standard deviation of 0.0431±0.0002. We can conclude that quantum error correction is especially well suited for the correction of operational imprecisions and systematic over-rotations. For realistic simulations of specific quantum computation devices we need to extend the generic model to dynamic simulations, i.e. time-dependent Hamiltonian simulations of realistic hardware models. We focus on today's most advanced technology, i

  19. Large-scale simulations of error-prone quantum computation devices

    Energy Technology Data Exchange (ETDEWEB)

    Trieu, Doan Binh

    2009-07-01

    The theoretical concepts of quantum computation in the idealized and undisturbed case are well understood. However, in practice, all quantum computation devices do suffer from decoherence effects as well as from operational imprecisions. This work assesses the power of error-prone quantum computation devices using large-scale numerical simulations on parallel supercomputers. We present the Juelich Massively Parallel Ideal Quantum Computer Simulator (JUMPIQCS), that simulates a generic quantum computer on gate level. It comprises an error model for decoherence and operational errors. The robustness of various algorithms in the presence of noise has been analyzed. The simulation results show that for large system sizes and long computations it is imperative to actively correct errors by means of quantum error correction. We implemented the 5-, 7-, and 9-qubit quantum error correction codes. Our simulations confirm that using error-prone correction circuits with non-fault-tolerant quantum error correction will always fail, because more errors are introduced than being corrected. Fault-tolerant methods can overcome this problem, provided that the single qubit error rate is below a certain threshold. We incorporated fault-tolerant quantum error correction techniques into JUMPIQCS using Steane's 7-qubit code and determined this threshold numerically. Using the depolarizing channel as the source of decoherence, we find a threshold error rate of (5.2{+-}0.2) x 10{sup -6}. For Gaussian distributed operational over-rotations the threshold lies at a standard deviation of 0.0431{+-}0.0002. We can conclude that quantum error correction is especially well suited for the correction of operational imprecisions and systematic over-rotations. For realistic simulations of specific quantum computation devices we need to extend the generic model to dynamic simulations, i.e. time-dependent Hamiltonian simulations of realistic hardware models. We focus on today's most advanced

  20. Quantum communication in noisy environments

    International Nuclear Information System (INIS)

    Aschauer, H.

    2004-01-01

    In this thesis, we investigate how protocols in quantum communication theory are influenced by noise. Specifically, we take into account noise during the transmission of quantum information and noise during the processing of quantum information. We describe three novel quantum communication protocols which can be accomplished efficiently in a noisy environment: (1) Factorization of Eve: We show that it is possible to disentangle transmitted qubits a posteriori from the quantum channel's degrees of freedom. (2) Cluster state purification: We give multi-partite entanglement purification protocols for a large class of entangled quantum states. (3) Entanglement purification protocols from quantum codes: We describe a constructive method to create bipartite entanglement purification protocols form quantum error correcting codes, and investigate the properties of these protocols, which can be operated in two different modes, which are related to quantum communication and quantum computation protocols, respectively

  1. Anderson localization in bipartite lattices

    International Nuclear Information System (INIS)

    Fabrizio, Michele; Castellani, Claudio

    2000-01-01

    We study the localization properties of a disordered tight-binding Hamiltonian on a generic bipartite lattice close to the band center. By means of a fermionic replica trick method, we derive the effective non-linear σ-model describing the diffusive modes, which we analyse by using the Wilson-Polyakov renormalization group. In addition to the standard parameters which define the non-linear σ-model, namely, the conductance and the external frequency, a new parameter enters, which may be related to the fluctuations of the staggered density of states. We find that, when both the regular hopping and the disorder only couple one sublattice to the other, the quantum corrections to the Kubo conductivity vanish at the band center, thus implying the existence of delocalized states. In two dimensions, the RG equations predict that the conductance flows to a finite value, while both the density of states and the staggered density of states fluctuations diverge. In three dimensions, we find that, sufficiently close to the band center, all states are extended, independently of the disorder strength. We also discuss the role of various symmetry breaking terms, as a regular hopping between same sublattices, or an on-site disorder

  2. Anderson localization in bipartite lattices

    International Nuclear Information System (INIS)

    Fabrizio, M.; Castellani, C.

    2000-04-01

    We study the localization properties of a disordered tight-binding Hamiltonian on a generic bipartite lattice close to the band center. By means of a fermionic replica trick method, we derive the effective non-linear σ-model describing the diffusive modes, which we analyse by using the Wilson-Polyakov renormalization group. In addition to the standard parameters which define the non-linear σ-model, namely the conductance and the external frequency, a new parameter enters, which may be related to the fluctuations of the staggered density of states. We find that, when both the regular hopping and the disorder only couple one sublattice to the other, the quantum corrections to the Kubo conductivity vanish at the band center, thus implying the existence of delocalized states. In two dimensions, the RG equations predict that the conductance flows to a finite value, while both the density of states and the staggered density of states fluctuations diverge. In three dimensions, we find that, sufficiently close to the band center, all states are extended, independently of the disorder strength. We also discuss the role of various symmetry breaking terms, as a regular hopping between same sublattices, or an on-site disorder. (author)

  3. Quantum Error Correction: Optimal, Robust, or Adaptive? Or, Where is The Quantum Flyball Governor?

    Science.gov (United States)

    Kosut, Robert; Grace, Matthew

    2012-02-01

    In The Human Use of Human Beings: Cybernetics and Society (1950), Norbert Wiener introduces feedback control in this way: ``This control of a machine on the basis of its actual performance rather than its expected performance is known as feedback ... It is the function of control ... to produce a temporary and local reversal of the normal direction of entropy.'' The classic classroom example of feedback control is the all-mechanical flyball governor used by James Watt in the 18th century to regulate the speed of rotating steam engines. What is it that is so compelling about this apparatus? First, it is easy to understand how it regulates the speed of a rotating steam engine. Secondly, and perhaps more importantly, it is a part of the device itself. A naive observer would not distinguish this mechanical piece from all the rest. So it is natural to ask, where is the all-quantum device which is self regulating, ie, the Quantum Flyball Governor? Is the goal of quantum error correction (QEC) to design such a device? Devloping the computational and mathematical tools to design this device is the topic of this talk.

  4. Bipartite entanglement in continuous variable cluster states

    Energy Technology Data Exchange (ETDEWEB)

    Cable, Hugo; Browne, Daniel E, E-mail: cqthvc@nus.edu.s, E-mail: d.browne@ucl.ac.u [Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore)

    2010-11-15

    A study of the entanglement properties of Gaussian cluster states, proposed as a universal resource for continuous variable (CV) quantum computing is presented in this paper. The central aim is to compare mathematically idealized cluster states defined using quadrature eigenstates, which have infinite squeezing and cannot exist in nature, with Gaussian approximations that are experimentally accessible. Adopting widely used definitions, we first review the key concepts, by analysing a process of teleportation along a CV quantum wire in the language of matrix product states. Next we consider the bipartite entanglement properties of the wire, providing analytic results. We proceed to grid cluster states, which are universal for the qubit case. To extend our analysis of the bipartite entanglement, we adopt the entropic-entanglement width, a specialized entanglement measure introduced recently by Van den Nest et al (2006 Phys. Rev. Lett. 97 150504), adapting their definition to the CV context. Finally, we consider the effects of photonic loss, extending our arguments to mixed states. Cumulatively our results point to key differences in the properties of idealized and Gaussian cluster states. Even modest loss rates are found to strongly limit the amount of entanglement. We discuss the implications for the potential of CV analogues for measurement-based quantum computation.

  5. Remote one-qubit information concentration and decoding of operator quantum error-correction codes

    International Nuclear Information System (INIS)

    Hsu Liyi

    2007-01-01

    We propose the general scheme of remote one-qubit information concentration. To achieve the task, the Bell-correlated mixed states are exploited. In addition, the nonremote one-qubit information concentration is equivalent to the decoding of the quantum error-correction code. Here we propose how to decode the stabilizer codes. In particular, the proposed scheme can be used for the operator quantum error-correction codes. The encoded state can be recreated on the errorless qubit, regardless how many bit-flip errors and phase-flip errors have occurred

  6. Error Free Quantum Reading by Quasi Bell State of Entangled Coherent States

    Science.gov (United States)

    Hirota, Osamu

    2017-12-01

    Nonclassical states of light field have been exploited to provide marvellous results in quantum information science. Usefulness of nonclassical states in quantum information science depends on whether a physical parameter as a signal is continuous or discrete. Here we present an investigation of the potential of quasi Bell states of entangled coherent states in quantum reading of the classical digital memory which was pioneered by Pirandola (Phys.Rev.Lett.,106,090504,2011). This is a typical example of discrimination for discrete quantum parameters. We show that the quasi Bell state gives the error free performance in the quantum reading that cannot be obtained by any classical state.

  7. Capacity estimation and verification of quantum channels with arbitrarily correlated errors.

    Science.gov (United States)

    Pfister, Corsin; Rol, M Adriaan; Mantri, Atul; Tomamichel, Marco; Wehner, Stephanie

    2018-01-02

    The central figure of merit for quantum memories and quantum communication devices is their capacity to store and transmit quantum information. Here, we present a protocol that estimates a lower bound on a channel's quantum capacity, even when there are arbitrarily correlated errors. One application of these protocols is to test the performance of quantum repeaters for transmitting quantum information. Our protocol is easy to implement and comes in two versions. The first estimates the one-shot quantum capacity by preparing and measuring in two different bases, where all involved qubits are used as test qubits. The second verifies on-the-fly that a channel's one-shot quantum capacity exceeds a minimal tolerated value while storing or communicating data. We discuss the performance using simple examples, such as the dephasing channel for which our method is asymptotically optimal. Finally, we apply our method to a superconducting qubit in experiment.

  8. Computation of Molecular Spectra on a Quantum Processor with an Error-Resilient Algorithm

    Directory of Open Access Journals (Sweden)

    J. I. Colless

    2018-02-01

    Full Text Available Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite coherent lifetimes. Hybrid algorithms, such as the variational quantum eigensolver (VQE, leverage classical resources to reduce the required number of quantum gates. Experimental demonstrations of VQE have resulted in calculation of Hamiltonian ground states, and a new theoretical approach based on a quantum subspace expansion (QSE has outlined a procedure for determining excited states that are central to dynamical processes. We use a superconducting-qubit-based processor to apply the QSE approach to the H_{2} molecule, extracting both ground and excited states without the need for auxiliary qubits or additional minimization. Further, we show that this extended protocol can mitigate the effects of incoherent errors, potentially enabling larger-scale quantum simulations without the need for complex error-correction techniques.

  9. Computation of Molecular Spectra on a Quantum Processor with an Error-Resilient Algorithm

    Science.gov (United States)

    Colless, J. I.; Ramasesh, V. V.; Dahlen, D.; Blok, M. S.; Kimchi-Schwartz, M. E.; McClean, J. R.; Carter, J.; de Jong, W. A.; Siddiqi, I.

    2018-02-01

    Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite coherent lifetimes. Hybrid algorithms, such as the variational quantum eigensolver (VQE), leverage classical resources to reduce the required number of quantum gates. Experimental demonstrations of VQE have resulted in calculation of Hamiltonian ground states, and a new theoretical approach based on a quantum subspace expansion (QSE) has outlined a procedure for determining excited states that are central to dynamical processes. We use a superconducting-qubit-based processor to apply the QSE approach to the H2 molecule, extracting both ground and excited states without the need for auxiliary qubits or additional minimization. Further, we show that this extended protocol can mitigate the effects of incoherent errors, potentially enabling larger-scale quantum simulations without the need for complex error-correction techniques.

  10. Quantum cryptography: individual eavesdropping with the knowledge of the error-correcting protocol

    International Nuclear Information System (INIS)

    Horoshko, D B

    2007-01-01

    The quantum key distribution protocol BB84 combined with the repetition protocol for error correction is analysed from the point of view of its security against individual eavesdropping relying on quantum memory. It is shown that the mere knowledge of the error-correcting protocol changes the optimal attack and provides the eavesdropper with additional information on the distributed key. (fifth seminar in memory of d.n. klyshko)

  11. Methodology for bus layout for topological quantum error correcting codes

    Energy Technology Data Exchange (ETDEWEB)

    Wosnitzka, Martin; Pedrocchi, Fabio L.; DiVincenzo, David P. [RWTH Aachen University, JARA Institute for Quantum Information, Aachen (Germany)

    2016-12-15

    Most quantum computing architectures can be realized as two-dimensional lattices of qubits that interact with each other. We take transmon qubits and transmission line resonators as promising candidates for qubits and couplers; we use them as basic building elements of a quantum code. We then propose a simple framework to determine the optimal experimental layout to realize quantum codes. We show that this engineering optimization problem can be reduced to the solution of standard binary linear programs. While solving such programs is a NP-hard problem, we propose a way to find scalable optimal architectures that require solving the linear program for a restricted number of qubits and couplers. We apply our methods to two celebrated quantum codes, namely the surface code and the Fibonacci code. (orig.)

  12. Correcting errors in a quantum gate with pushed ions via optimal control

    International Nuclear Information System (INIS)

    Poulsen, Uffe V.; Sklarz, Shlomo; Tannor, David; Calarco, Tommaso

    2010-01-01

    We analyze in detail the so-called pushing gate for trapped ions, introducing a time-dependent harmonic approximation for the external motion. We show how to extract the average fidelity for the gate from the resulting semiclassical simulations. We characterize and quantify precisely all types of errors coming from the quantum dynamics and reveal that slight nonlinearities in the ion-pushing force can have a dramatic effect on the adiabaticity of gate operation. By means of quantum optimal control techniques, we show how to suppress each of the resulting gate errors in order to reach a high fidelity compatible with scalable fault-tolerant quantum computing.

  13. Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics

    Directory of Open Access Journals (Sweden)

    Christopher Chamberland

    2018-01-01

    Full Text Available We consider the problem of fault-tolerant quantum computation in the presence of slow error diagnostics, either caused by measurement latencies or slow decoding algorithms. Our scheme offers a few improvements over previously existing solutions, for instance it does not require active error correction and results in a reduced error-correction overhead when error diagnostics is much slower than the gate time. In addition, we adapt our protocol to cases where the underlying error correction strategy chooses the optimal correction amongst all Clifford gates instead of the usual Pauli gates. The resulting Clifford frame protocol is of independent interest as it can increase error thresholds and could find applications in other areas of quantum computation.

  14. Quantum mean-field decoding algorithm for error-correcting codes

    International Nuclear Information System (INIS)

    Inoue, Jun-ichi; Saika, Yohei; Okada, Masato

    2009-01-01

    We numerically examine a quantum version of TAP (Thouless-Anderson-Palmer)-like mean-field algorithm for the problem of error-correcting codes. For a class of the so-called Sourlas error-correcting codes, we check the usefulness to retrieve the original bit-sequence (message) with a finite length. The decoding dynamics is derived explicitly and we evaluate the average-case performance through the bit-error rate (BER).

  15. Optimally combining dynamical decoupling and quantum error correction.

    Science.gov (United States)

    Paz-Silva, Gerardo A; Lidar, D A

    2013-01-01

    Quantum control and fault-tolerant quantum computing (FTQC) are two of the cornerstones on which the hope of realizing a large-scale quantum computer is pinned, yet only preliminary steps have been taken towards formalizing the interplay between them. Here we explore this interplay using the powerful strategy of dynamical decoupling (DD), and show how it can be seamlessly and optimally integrated with FTQC. To this end we show how to find the optimal decoupling generator set (DGS) for various subspaces relevant to FTQC, and how to simultaneously decouple them. We focus on stabilizer codes, which represent the largest contribution to the size of the DGS, showing that the intuitive choice comprising the stabilizers and logical operators of the code is in fact optimal, i.e., minimizes a natural cost function associated with the length of DD sequences. Our work brings hybrid DD-FTQC schemes, and their potentially considerable advantages, closer to realization.

  16. Passive quantum error correction of linear optics networks through error averaging

    Science.gov (United States)

    Marshman, Ryan J.; Lund, Austin P.; Rohde, Peter P.; Ralph, Timothy C.

    2018-02-01

    We propose and investigate a method of error detection and noise correction for bosonic linear networks using a method of unitary averaging. The proposed error averaging does not rely on ancillary photons or control and feedforward correction circuits, remaining entirely passive in its operation. We construct a general mathematical framework for this technique and then give a series of proof of principle examples including numerical analysis. Two methods for the construction of averaging are then compared to determine the most effective manner of implementation and probe the related error thresholds. Finally we discuss some of the potential uses of this scheme.

  17. Topological quantum computing with a very noisy network and local error rates approaching one percent.

    Science.gov (United States)

    Nickerson, Naomi H; Li, Ying; Benjamin, Simon C

    2013-01-01

    A scalable quantum computer could be built by networking together many simple processor cells, thus avoiding the need to create a single complex structure. The difficulty is that realistic quantum links are very error prone. A solution is for cells to repeatedly communicate with each other and so purify any imperfections; however prior studies suggest that the cells themselves must then have prohibitively low internal error rates. Here we describe a method by which even error-prone cells can perform purification: groups of cells generate shared resource states, which then enable stabilization of topologically encoded data. Given a realistically noisy network (≥10% error rate) we find that our protocol can succeed provided that intra-cell error rates for initialisation, state manipulation and measurement are below 0.82%. This level of fidelity is already achievable in several laboratory systems.

  18. Effects of systematic phase errors on optimized quantum random-walk search algorithm

    International Nuclear Information System (INIS)

    Zhang Yu-Chao; Bao Wan-Su; Wang Xiang; Fu Xiang-Qun

    2015-01-01

    This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover’s algorithm. (paper)

  19. Intrinsic errors in transporting a single-spin qubit through a double quantum dot

    Science.gov (United States)

    Li, Xiao; Barnes, Edwin; Kestner, J. P.; Das Sarma, S.

    2017-07-01

    Coherent spatial transport or shuttling of a single electron spin through semiconductor nanostructures is an important ingredient in many spintronic and quantum computing applications. In this work we analyze the possible errors in solid-state quantum computation due to leakage in transporting a single-spin qubit through a semiconductor double quantum dot. In particular, we consider three possible sources of leakage errors associated with such transport: finite ramping times, spin-dependent tunneling rates between quantum dots induced by finite spin-orbit couplings, and the presence of multiple valley states. In each case we present quantitative estimates of the leakage errors, and discuss how they can be minimized. The emphasis of this work is on how to deal with the errors intrinsic to the ideal semiconductor structure, such as leakage due to spin-orbit couplings, rather than on errors due to defects or noise sources. In particular, we show that in order to minimize leakage errors induced by spin-dependent tunnelings, it is necessary to apply pulses to perform certain carefully designed spin rotations. We further develop a formalism that allows one to systematically derive constraints on the pulse shapes and present a few examples to highlight the advantage of such an approach.

  20. Hardware-efficient bosonic quantum error-correcting codes based on symmetry operators

    Science.gov (United States)

    Niu, Murphy Yuezhen; Chuang, Isaac L.; Shapiro, Jeffrey H.

    2018-03-01

    We establish a symmetry-operator framework for designing quantum error-correcting (QEC) codes based on fundamental properties of the underlying system dynamics. Based on this framework, we propose three hardware-efficient bosonic QEC codes that are suitable for χ(2 )-interaction based quantum computation in multimode Fock bases: the χ(2 ) parity-check code, the χ(2 ) embedded error-correcting code, and the χ(2 ) binomial code. All of these QEC codes detect photon-loss or photon-gain errors by means of photon-number parity measurements, and then correct them via χ(2 ) Hamiltonian evolutions and linear-optics transformations. Our symmetry-operator framework provides a systematic procedure for finding QEC codes that are not stabilizer codes, and it enables convenient extension of a given encoding to higher-dimensional qudit bases. The χ(2 ) binomial code is of special interest because, with m ≤N identified from channel monitoring, it can correct m -photon-loss errors, or m -photon-gain errors, or (m -1 )th -order dephasing errors using logical qudits that are encoded in O (N ) photons. In comparison, other bosonic QEC codes require O (N2) photons to correct the same degree of bosonic errors. Such improved photon efficiency underscores the additional error-correction power that can be provided by channel monitoring. We develop quantum Hamming bounds for photon-loss errors in the code subspaces associated with the χ(2 ) parity-check code and the χ(2 ) embedded error-correcting code, and we prove that these codes saturate their respective bounds. Our χ(2 ) QEC codes exhibit hardware efficiency in that they address the principal error mechanisms and exploit the available physical interactions of the underlying hardware, thus reducing the physical resources required for implementing their encoding, decoding, and error-correction operations, and their universal encoded-basis gate sets.

  1. Error of quantum-logic simulation via vector-soliton collisions

    International Nuclear Information System (INIS)

    Janutka, Andrzej

    2007-01-01

    In a concept of simulating the quantum logic with vector solitons by the author (Janutka 2006 J. Phys. A: Math. Gen. 39 12505), the soliton polarization is thought of as a state vector of a system of cebits (classical counterparts of qubits) switched via collisions with other solitons. The advantage of this method of information processing compared to schemes using linear optics is the possibility of the determination of the information-register state in a single measurement. Minimization of the information-processing error for different optical realizations of the logical systems is studied in the framework of a quantum analysis of soliton fluctuations. The problem is considered with relevance to general difficulties of the quantum error-correction schemes for the classical analogies of the quantum-information processing

  2. Error tolerance in an NMR implementation of Grover's fixed-point quantum search algorithm

    International Nuclear Information System (INIS)

    Xiao Li; Jones, Jonathan A.

    2005-01-01

    We describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance quantum computer, searching for either one or two matching items in an unsorted database of four items. In this algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, so that the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored

  3. Correcting errors in a quantum gate with pushed ions via optimal control

    DEFF Research Database (Denmark)

    Poulsen, Uffe Vestergaard; Sklarz, Shlomo; Tannor, David

    2010-01-01

    We analyze in detail the so-called pushing gate for trapped ions, introducing a time-dependent harmonic approximation for the external motion. We show how to extract the average fidelity for the gate from the resulting semiclassical simulations. We characterize and quantify precisely all types...... of errors coming from the quantum dynamics and reveal that slight nonlinearities in the ion-pushing force can have a dramatic effect on the adiabaticity of gate operation. By means of quantum optimal control techniques, we show how to suppress each of the resulting gate errors in order to reach a high...

  4. Controlling bi-partite entanglement in multi-qubit systems

    International Nuclear Information System (INIS)

    Plesch, Martin; Novotny, Jaroslav; Dzurakova, Zuzana; Buzek, VladimIr

    2004-01-01

    Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper, we utilize a concept of entangled graphs with weighted edges in order to analyse pure quantum states of multi-qubit systems. Here qubits are represented by vertexes of the graph, while the presence of bi-partite entanglement is represented by an edge between corresponding vertexes. The weight of each edge is defined to be the entanglement between the two qubits connected by the edge, as measured by the concurrence. We prove that each entangled graph with entanglement bounded by a specific value of the concurrence can be represented by a pure multi-qubit state. In addition, we present a logic network with O(N 2 ) elementary gates that can be used for preparation of the weighted entangled graphs of N qubits

  5. Controlling bi-partite entanglement in multi-qubit systems

    Science.gov (United States)

    Plesch, Martin; Novotný, Jaroslav; Dzuráková, Zuzana; Buzek, Vladimír

    2004-02-01

    Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper, we utilize a concept of entangled graphs with weighted edges in order to analyse pure quantum states of multi-qubit systems. Here qubits are represented by vertexes of the graph, while the presence of bi-partite entanglement is represented by an edge between corresponding vertexes. The weight of each edge is defined to be the entanglement between the two qubits connected by the edge, as measured by the concurrence. We prove that each entangled graph with entanglement bounded by a specific value of the concurrence can be represented by a pure multi-qubit state. In addition, we present a logic network with O(N2) elementary gates that can be used for preparation of the weighted entangled graphs of N qubits.

  6. Correlation/Communication complexity of generating bipartite states

    OpenAIRE

    Jain, Rahul; Shi, Yaoyun; Wei, Zhaohui; Zhang, Shengyu

    2012-01-01

    We study the correlation complexity (or equivalently, the communication complexity) of generating a bipartite quantum state $\\rho$. When $\\rho$ is a pure state, we completely characterize the complexity for approximately generating $\\rho$ by a corresponding approximate rank, closing a gap left in Ambainis, Schulman, Ta-Shma, Vazirani and Wigderson (SIAM Journal on Computing, 32(6):1570-1585, 2003). When $\\rho$ is a classical distribution $P(x,y)$, we tightly characterize the complexity of gen...

  7. Tripartite to Bipartite Entanglement Transformations and Polynomial Identity Testing

    OpenAIRE

    Chitambar, Eric; Duan, Runyao; Shi, Yaoyun

    2009-01-01

    We consider the problem of deciding if a given three-party entangled pure state can be converted, with a non-zero success probability, into a given two-party pure state through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to the question of tripartite to bipartit...

  8. Error Correction using Quantum Quasi-Cyclic Low-Density Parity-Check(LDPC) Codes

    Science.gov (United States)

    Jing, Lin; Brun, Todd; Quantum Research Team

    Quasi-cyclic LDPC codes can approach the Shannon capacity and have efficient decoders. Manabu Hagiwara et al., 2007 presented a method to calculate parity check matrices with high girth. Two distinct, orthogonal matrices Hc and Hd are used. Using submatrices obtained from Hc and Hd by deleting rows, we can alter the code rate. The submatrix of Hc is used to correct Pauli X errors, and the submatrix of Hd to correct Pauli Z errors. We simulated this system for depolarizing noise on USC's High Performance Computing Cluster, and obtained the block error rate (BER) as a function of the error weight and code rate. From the rates of uncorrectable errors under different error weights we can extrapolate the BER to any small error probability. Our results show that this code family can perform reasonably well even at high code rates, thus considerably reducing the overhead compared to concatenated and surface codes. This makes these codes promising as storage blocks in fault-tolerant quantum computation. Error Correction using Quantum Quasi-Cyclic Low-Density Parity-Check(LDPC) Codes.

  9. Electric Field Generation and Control of Bipartite Quantum Entanglement between Electronic Spins in Mixed Valence Polyoxovanadate [GeV14O40]8.

    Science.gov (United States)

    Palii, Andrew; Aldoshin, Sergey; Tsukerblat, Boris; Borràs-Almenar, Juan José; Clemente-Juan, Juan Modesto; Cardona-Serra, Salvador; Coronado, Eugenio

    2017-08-21

    As part of the search for systems in which control of quantum entanglement can be achieved, here we consider the paramagnetic mixed valence polyoxometalate K 2 Na 6 [GeV 14 O 40 ]·10H 2 O in which two electrons are delocalized over the 14 vanadium ions. Applying a homogeneous electric field can induce an antiferromagnetic coupling between the two delocalized electronic spins that behave independently in the absence of the field. On the basis of the proposed theoretical model, we show that the external field can be used to generate controllable quantum entanglement between the two electronic spins traveling over a vanadium network of mixed valence polyoxoanion [GeV 14 O 40 ] 8- . Within a simplified two-level picture of the energy pattern of the electronic pair based on the previous ab initio analysis, we evaluate the temperature and field dependencies of concurrence and thus indicate that the entanglement can be controlled via the temperature, magnitude, and orientation of the electric field with respect to molecular axes of [GeV 14 O 40 ] 8- .

  10. Fractal and multifractal analyses of bipartite networks

    Science.gov (United States)

    Liu, Jin-Long; Wang, Jian; Yu, Zu-Guo; Xie, Xian-Hua

    2017-03-01

    Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions.

  11. An integrity measure to benchmark quantum error correcting memories

    Science.gov (United States)

    Xu, Xiaosi; de Beaudrap, Niel; O'Gorman, Joe; Benjamin, Simon C.

    2018-02-01

    Rapidly developing experiments across multiple platforms now aim to realise small quantum codes, and so demonstrate a memory within which a logical qubit can be protected from noise. There is a need to benchmark the achievements in these diverse systems, and to compare the inherent power of the codes they rely upon. We describe a recently introduced performance measure called integrity, which relates to the probability that an ideal agent will successfully ‘guess’ the state of a logical qubit after a period of storage in the memory. Integrity is straightforward to evaluate experimentally without state tomography and it can be related to various established metrics such as the logical fidelity and the pseudo-threshold. We offer a set of experimental milestones that are steps towards demonstrating unconditionally superior encoded memories. Using intensive numerical simulations we compare memories based on the five-qubit code, the seven-qubit Steane code, and a nine-qubit code which is the smallest instance of a surface code; we assess both the simple and fault-tolerant implementations of each. While the ‘best’ code upon which to base a memory does vary according to the nature and severity of the noise, nevertheless certain trends emerge.

  12. Measurement-device-independent quantum key distribution with correlated source-light-intensity errors

    Science.gov (United States)

    Jiang, Cong; Yu, Zong-Wen; Wang, Xiang-Bin

    2018-04-01

    We present an analysis for measurement-device-independent quantum key distribution with correlated source-light-intensity errors. Numerical results show that the results here can greatly improve the key rate especially with large intensity fluctuations and channel attenuation compared with prior results if the intensity fluctuations of different sources are correlated.

  13. Decoy-state quantum key distribution with both source errors and statistical fluctuations

    International Nuclear Information System (INIS)

    Wang Xiangbin; Yang Lin; Peng Chengzhi; Pan Jianwei

    2009-01-01

    We show how to calculate the fraction of single-photon counts of the 3-intensity decoy-state quantum cryptography faithfully with both statistical fluctuations and source errors. Our results rely only on the bound values of a few parameters of the states of pulses.

  14. Information-preserving structures: A general framework for quantum zero-error information

    International Nuclear Information System (INIS)

    Blume-Kohout, Robin; Ng, Hui Khoon; Poulin, David; Viola, Lorenza

    2010-01-01

    Quantum systems carry information. Quantum theory supports at least two distinct kinds of information (classical and quantum), and a variety of different ways to encode and preserve information in physical systems. A system's ability to carry information is constrained and defined by the noise in its dynamics. This paper introduces an operational framework, using information-preserving structures, to classify all the kinds of information that can be perfectly (i.e., with zero error) preserved by quantum dynamics. We prove that every perfectly preserved code has the same structure as a matrix algebra, and that preserved information can always be corrected. We also classify distinct operational criteria for preservation (e.g., 'noiseless','unitarily correctible', etc.) and introduce two natural criteria for measurement-stabilized and unconditionally preserved codes. Finally, for several of these operational criteria, we present efficient (polynomial in the state-space dimension) algorithms to find all of a channel's information-preserving structures.

  15. Error-resistant distributed quantum computation in a trapped ion chain

    International Nuclear Information System (INIS)

    Braungardt, Sibylle; Sen, Aditi; Sen, Ujjwal; Lewenstein, Maciej

    2007-01-01

    We consider experimentally feasible chains of trapped ions with pseudospin 1/2 and find models that can potentially be used to implement error-resistant quantum computation. Similar in spirit to classical neural networks, the error resistance of the system is achieved by encoding the qubits distributed over the whole system. We therefore call our system a quantum neural network and present a quantum neural network model of quantum computation. Qubits are encoded in a few quasi degenerated low-energy levels of the whole system, separated by a large gap from the excited states and large energy barriers between themselves. We investigate protocols for implementing a universal set of quantum logic gates in the system by adiabatic passage of a few low-lying energy levels of the whole system. Naturally appearing and potentially dangerous distributed noise in the system leaves the fidelity of the computation virtually unchanged, if it is not too strong. The computation is also naturally resilient to local perturbations of the spins

  16. A method for optical ground station reduce alignment error in satellite-ground quantum experiments

    Science.gov (United States)

    He, Dong; Wang, Qiang; Zhou, Jian-Wei; Song, Zhi-Jun; Zhong, Dai-Jun; Jiang, Yu; Liu, Wan-Sheng; Huang, Yong-Mei

    2018-03-01

    A satellite dedicated for quantum science experiments, has been developed and successfully launched from Jiuquan, China, on August 16, 2016. Two new optical ground stations (OGSs) were built to cooperate with the satellite to complete satellite-ground quantum experiments. OGS corrected its pointing direction by satellite trajectory error to coarse tracking system and uplink beacon sight, therefore fine tracking CCD and uplink beacon optical axis alignment accuracy was to ensure that beacon could cover the quantum satellite in all time when it passed the OGSs. Unfortunately, when we tested specifications of the OGSs, due to the coarse tracking optical system was commercial telescopes, the change of position of the target in the coarse CCD was up to 600μrad along with the change of elevation angle. In this paper, a method of reduce alignment error between beacon beam and fine tracking CCD is proposed. Firstly, OGS fitted the curve of target positions in coarse CCD along with the change of elevation angle. Secondly, OGS fitted the curve of hexapod secondary mirror positions along with the change of elevation angle. Thirdly, when tracking satellite, the fine tracking error unloaded on the real-time zero point position of coarse CCD which computed by the firstly calibration data. Simultaneously the positions of the hexapod secondary mirror were adjusted by the secondly calibration data. Finally the experiment result is proposed. Results show that the alignment error is less than 50μrad.

  17. Strictly local one-dimensional topological quantum error correction with symmetry-constrained cellular automata

    Directory of Open Access Journals (Sweden)

    Nicolai Lang, Hans Peter Büchler

    2018-01-01

    Full Text Available Active quantum error correction on topological codes is one of the most promising routes to long-term qubit storage. In view of future applications, the scalability of the used decoding algorithms in physical implementations is crucial. In this work, we focus on the one-dimensional Majorana chain and construct a strictly local decoder based on a self-dual cellular automaton. We study numerically and analytically its performance and exploit these results to contrive a scalable decoder with exponentially growing decoherence times in the presence of noise. Our results pave the way for scalable and modular designs of actively corrected one-dimensional topological quantum memories.

  18. Searching for Communities in Bipartite Networks

    OpenAIRE

    Barber, Michael J.; Faria, Margarida; Streit, Ludwig; Strogan, Oleg

    2008-01-01

    Bipartite networks are a useful tool for representing and investigating interaction networks. We consider methods for identifying communities in bipartite networks. Intuitive notions of network community groups are made explicit using Newman's modularity measure. A specialized version of the modularity, adapted to be appropriate for bipartite networks, is presented; a corresponding algorithm is described for identifying community groups through maximizing this measure. The algorithm is applie...

  19. Bone-scintigraphy in painful bipartite patella

    International Nuclear Information System (INIS)

    Iossifidis, A.; Brueton, R.N.; Nunan, T.O.

    1995-01-01

    Although, the use of technetium scintigraphy in the assessment of anterior knee pain has been described, no reference has been made to the scintigraphic appearances of painful bipartite patella. We report the scintigraphic-appearances of painful bipartite patella in 25-year-old man a 2 1/2 years history of unexplained patellar pain. Painful bipartite patella is a rare cause of chronic post-traumatic patellar pain. Bone scintigraphy, by demonstrating increased uptake by the painful accessory bipartite fragment, appears to be an imaging method of choice in the diagnosis of this condition. (orig./MG)

  20. Tradeoff between energy and error in the discrimination of quantum-optical devices

    Energy Technology Data Exchange (ETDEWEB)

    Bisio, Alessandro; Dall' Arno, Michele; D' Ariano, Giacomo Mauro [Quit group, Dipartimento di Fisica ' ' A. Volta' ' , via Bassi 6, I-27100 Pavia (Italy) and Istituto Nazionale di Fisica Nucleare, Gruppo IV, via Bassi 6, I-27100 Pavia (Italy)

    2011-07-15

    We address the problem of energy-error tradeoff in the discrimination between two linear passive quantum optical devices with a single use. We provide an analytical derivation of the optimal strategy for beamsplitters and an iterative algorithm converging to the optimum in the general case. We then compare the optimal strategy with a simpler strategy using coherent input states and homodyne detection. It turns out that the former requires much less energy in order to achieve the same performances.

  1. Tradeoff between energy and error in the discrimination of quantum-optical devices

    International Nuclear Information System (INIS)

    Bisio, Alessandro; Dall'Arno, Michele; D'Ariano, Giacomo Mauro

    2011-01-01

    We address the problem of energy-error tradeoff in the discrimination between two linear passive quantum optical devices with a single use. We provide an analytical derivation of the optimal strategy for beamsplitters and an iterative algorithm converging to the optimum in the general case. We then compare the optimal strategy with a simpler strategy using coherent input states and homodyne detection. It turns out that the former requires much less energy in order to achieve the same performances.

  2. Global Estimates of Errors in Quantum Computation by the Feynman-Vernon Formalism

    Science.gov (United States)

    Aurell, Erik

    2018-04-01

    The operation of a quantum computer is considered as a general quantum operation on a mixed state on many qubits followed by a measurement. The general quantum operation is further represented as a Feynman-Vernon double path integral over the histories of the qubits and of an environment, and afterward tracing out the environment. The qubit histories are taken to be paths on the two-sphere S^2 as in Klauder's coherent-state path integral of spin, and the environment is assumed to consist of harmonic oscillators initially in thermal equilibrium, and linearly coupled to to qubit operators \\hat{S}_z . The environment can then be integrated out to give a Feynman-Vernon influence action coupling the forward and backward histories of the qubits. This representation allows to derive in a simple way estimates that the total error of operation of a quantum computer without error correction scales linearly with the number of qubits and the time of operation. It also allows to discuss Kitaev's toric code interacting with an environment in the same manner.

  3. Global Estimates of Errors in Quantum Computation by the Feynman-Vernon Formalism

    Science.gov (United States)

    Aurell, Erik

    2018-06-01

    The operation of a quantum computer is considered as a general quantum operation on a mixed state on many qubits followed by a measurement. The general quantum operation is further represented as a Feynman-Vernon double path integral over the histories of the qubits and of an environment, and afterward tracing out the environment. The qubit histories are taken to be paths on the two-sphere S^2 as in Klauder's coherent-state path integral of spin, and the environment is assumed to consist of harmonic oscillators initially in thermal equilibrium, and linearly coupled to to qubit operators \\hat{S}_z. The environment can then be integrated out to give a Feynman-Vernon influence action coupling the forward and backward histories of the qubits. This representation allows to derive in a simple way estimates that the total error of operation of a quantum computer without error correction scales linearly with the number of qubits and the time of operation. It also allows to discuss Kitaev's toric code interacting with an environment in the same manner.

  4. Distinguishing mixed quantum states: Minimum-error discrimination versus optimum unambiguous discrimination

    International Nuclear Information System (INIS)

    Herzog, Ulrike; Bergou, Janos A.

    2004-01-01

    We consider two different optimized measurement strategies for the discrimination of nonorthogonal quantum states. The first is ambiguous discrimination with a minimum probability of inferring an erroneous result, and the second is unambiguous, i.e., error-free, discrimination with a minimum probability of getting an inconclusive outcome, where the measurement fails to give a definite answer. For distinguishing between two mixed quantum states, we investigate the relation between the minimum-error probability achievable in ambiguous discrimination, and the minimum failure probability that can be reached in unambiguous discrimination of the same two states. The latter turns out to be at least twice as large as the former for any two given states. As an example, we treat the case where the state of the quantum system is known to be, with arbitrary prior probability, either a given pure state, or a uniform statistical mixture of any number of mutually orthogonal states. For this case we derive an analytical result for the minimum probability of error and perform a quantitative comparison with the minimum failure probability

  5. All pure bipartite entangled states can be self-tested

    Science.gov (United States)

    Coladangelo, Andrea; Goh, Koon Tong; Scarani, Valerio

    2017-05-01

    Quantum technologies promise advantages over their classical counterparts in the fields of computation, security and sensing. It is thus desirable that classical users are able to obtain guarantees on quantum devices, even without any knowledge of their inner workings. That such classical certification is possible at all is remarkable: it is a consequence of the violation of Bell inequalities by entangled quantum systems. Device-independent self-testing refers to the most complete such certification: it enables a classical user to uniquely identify the quantum state shared by uncharacterized devices by simply inspecting the correlations of measurement outcomes. Self-testing was first demonstrated for the singlet state and a few other examples of self-testable states were reported in recent years. Here, we address the long-standing open question of whether every pure bipartite entangled state is self-testable. We answer it affirmatively by providing explicit self-testing correlations for all such states.

  6. Quantum information theory. Mathematical foundation. 2. ed.

    International Nuclear Information System (INIS)

    Hayashi, Masahito

    2017-01-01

    This graduate textbook provides a unified view of quantum information theory. Clearly explaining the necessary mathematical basis, it merges key topics from both information-theoretic and quantum- mechanical viewpoints and provides lucid explanations of the basic results. Thanks to this unified approach, it makes accessible such advanced topics in quantum communication as quantum teleportation, superdense coding, quantum state transmission (quantum error-correction) and quantum encryption. Since the publication of the preceding book Quantum Information: An Introduction, there have been tremendous strides in the field of quantum information. In particular, the following topics - all of which are addressed here - made seen major advances: quantum state discrimination, quantum channel capacity, bipartite and multipartite entanglement, security analysis on quantum communication, reverse Shannon theorem and uncertainty relation. With regard to the analysis of quantum security, the present book employs an improved method for the evaluation of leaked information and identifies a remarkable relation between quantum security and quantum coherence. Taken together, these two improvements allow a better analysis of quantum state transmission. In addition, various types of the newly discovered uncertainty relation are explained. Presenting a wealth of new developments, the book introduces readers to the latest advances and challenges in quantum information. To aid in understanding, each chapter is accompanied by a set of exercises and solutions.

  7. Quantum information theory. Mathematical foundation. 2. ed.

    Energy Technology Data Exchange (ETDEWEB)

    Hayashi, Masahito [Nagoya Univ. (Japan). Graduate School of Mathematics

    2017-07-01

    This graduate textbook provides a unified view of quantum information theory. Clearly explaining the necessary mathematical basis, it merges key topics from both information-theoretic and quantum- mechanical viewpoints and provides lucid explanations of the basic results. Thanks to this unified approach, it makes accessible such advanced topics in quantum communication as quantum teleportation, superdense coding, quantum state transmission (quantum error-correction) and quantum encryption. Since the publication of the preceding book Quantum Information: An Introduction, there have been tremendous strides in the field of quantum information. In particular, the following topics - all of which are addressed here - made seen major advances: quantum state discrimination, quantum channel capacity, bipartite and multipartite entanglement, security analysis on quantum communication, reverse Shannon theorem and uncertainty relation. With regard to the analysis of quantum security, the present book employs an improved method for the evaluation of leaked information and identifies a remarkable relation between quantum security and quantum coherence. Taken together, these two improvements allow a better analysis of quantum state transmission. In addition, various types of the newly discovered uncertainty relation are explained. Presenting a wealth of new developments, the book introduces readers to the latest advances and challenges in quantum information. To aid in understanding, each chapter is accompanied by a set of exercises and solutions.

  8. Effect of attachment strategies on bipartite networks

    DEFF Research Database (Denmark)

    Ganguly, N.; Saha, S.; Maiti, A.

    2013-01-01

    Bipartite systems show remarkable variations in their topological asymptotic properties, e. g., in their degree distribution. Such variations depend on the underlying growth dynamics. A scenario of particular importance is when the two partitions of the bipartite structure do not grow at an equal...

  9. Magnitude of pseudopotential localization errors in fixed node diffusion quantum Monte Carlo.

    Science.gov (United States)

    Krogel, Jaron T; Kent, P R C

    2017-06-28

    Growth in computational resources has lead to the application of real space diffusion quantum Monte Carlo to increasingly heavy elements. Although generally assumed to be small, we find that when using standard techniques, the pseudopotential localization error can be large, on the order of an electron volt for an isolated cerium atom. We formally show that the localization error can be reduced to zero with improvements to the Jastrow factor alone, and we define a metric of Jastrow sensitivity that may be useful in the design of pseudopotentials. We employ an extrapolation scheme to extract the bare fixed node energy and estimate the localization error in both the locality approximation and the T-moves schemes for the Ce atom in charge states 3+ and 4+. The locality approximation exhibits the lowest Jastrow sensitivity and generally smaller localization errors than T-moves although the locality approximation energy approaches the localization free limit from above/below for the 3+/4+ charge state. We find that energy minimized Jastrow factors including three-body electron-electron-ion terms are the most effective at reducing the localization error for both the locality approximation and T-moves for the case of the Ce atom. Less complex or variance minimized Jastrows are generally less effective. Our results suggest that further improvements to Jastrow factors and trial wavefunction forms may be needed to reduce localization errors to chemical accuracy when medium core pseudopotentials are applied to heavy elements such as Ce.

  10. Statistical analysis of error rate of large-scale single flux quantum logic circuit by considering fluctuation of timing parameters

    International Nuclear Information System (INIS)

    Yamanashi, Yuki; Masubuchi, Kota; Yoshikawa, Nobuyuki

    2016-01-01

    The relationship between the timing margin and the error rate of the large-scale single flux quantum logic circuits is quantitatively investigated to establish a timing design guideline. We observed that the fluctuation in the set-up/hold time of single flux quantum logic gates caused by thermal noises is the most probable origin of the logical error of the large-scale single flux quantum circuit. The appropriate timing margin for stable operation of the large-scale logic circuit is discussed by taking the fluctuation of setup/hold time and the timing jitter in the single flux quantum circuits. As a case study, the dependence of the error rate of the 1-million-bit single flux quantum shift register on the timing margin is statistically analyzed. The result indicates that adjustment of timing margin and the bias voltage is important for stable operation of a large-scale SFQ logic circuit.

  11. Statistical analysis of error rate of large-scale single flux quantum logic circuit by considering fluctuation of timing parameters

    Energy Technology Data Exchange (ETDEWEB)

    Yamanashi, Yuki, E-mail: yamanasi@ynu.ac.jp [Department of Electrical and Computer Engineering, Yokohama National University, Tokiwadai 79-5, Hodogaya-ku, Yokohama 240-8501 (Japan); Masubuchi, Kota; Yoshikawa, Nobuyuki [Department of Electrical and Computer Engineering, Yokohama National University, Tokiwadai 79-5, Hodogaya-ku, Yokohama 240-8501 (Japan)

    2016-11-15

    The relationship between the timing margin and the error rate of the large-scale single flux quantum logic circuits is quantitatively investigated to establish a timing design guideline. We observed that the fluctuation in the set-up/hold time of single flux quantum logic gates caused by thermal noises is the most probable origin of the logical error of the large-scale single flux quantum circuit. The appropriate timing margin for stable operation of the large-scale logic circuit is discussed by taking the fluctuation of setup/hold time and the timing jitter in the single flux quantum circuits. As a case study, the dependence of the error rate of the 1-million-bit single flux quantum shift register on the timing margin is statistically analyzed. The result indicates that adjustment of timing margin and the bias voltage is important for stable operation of a large-scale SFQ logic circuit.

  12. Correct mutual information, quantum bit error rate and secure transmission efficiency in Wojcik's eavesdropping scheme on ping-pong protocol

    OpenAIRE

    Zhang, Zhanjun

    2004-01-01

    Comment: The wrong mutual information, quantum bit error rate and secure transmission efficiency in Wojcik's eavesdropping scheme [PRL90(03)157901]on ping-pong protocol have been pointed out and corrected

  13. Multipartite-to-bipartite entanglement transformations and polynomial identity testing

    International Nuclear Information System (INIS)

    Chitambar, Eric; Duan Runyao; Shi Yaoyun

    2010-01-01

    We consider the problem of deciding if some multiparty entangled pure state can be converted, with a nonzero success probability, into a given bipartite pure state shared between two specified parties through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to our question. As a result, a given transformation is possible if and only if it is generically attainable by a simple randomized protocol.

  14. Nonclassicality and entanglement criteria for bipartite optical fields characterized by quadratic detectors

    Czech Academy of Sciences Publication Activity Database

    Peřina Jr., J.; Arkhipov, I.I.; Michálek, Václav; Haderka, Ondřej

    2017-01-01

    Roč. 96, č. 4 (2017), s. 1-15, č. článku 043845. ISSN 2469-9926 Institutional support: RVO:68378271 Keywords : parametric down-conversion * photon statistic * bipartite optical fields * quadratic detectors Subject RIV: BH - Optics, Masers, Lasers OBOR OECD: Optics (including laser optics and quantum optics) Impact factor: 2.925, year: 2016

  15. Potts glass reflection of the decoding threshold for qudit quantum error correcting codes

    Science.gov (United States)

    Jiang, Yi; Kovalev, Alexey A.; Pryadko, Leonid P.

    We map the maximum likelihood decoding threshold for qudit quantum error correcting codes to the multicritical point in generalized Potts gauge glass models, extending the map constructed previously for qubit codes. An n-qudit quantum LDPC code, where a qudit can be involved in up to m stabilizer generators, corresponds to a ℤd Potts model with n interaction terms which can couple up to m spins each. We analyze general properties of the phase diagram of the constructed model, give several bounds on the location of the transitions, bounds on the energy density of extended defects (non-local analogs of domain walls), and discuss the correlation functions which can be used to distinguish different phases in the original and the dual models. This research was supported in part by the Grants: NSF PHY-1415600 (AAK), NSF PHY-1416578 (LPP), and ARO W911NF-14-1-0272 (LPP).

  16. 3-biplacement of bipartite graphs

    Directory of Open Access Journals (Sweden)

    Lech Adamus

    2008-01-01

    Full Text Available Let \\(G=(L,R;E\\ be a bipartite graph with color classes \\(L\\ and \\(R\\ and edge set \\(E\\. A set of two bijections \\(\\{\\varphi_1 , \\varphi_2\\}\\, \\(\\varphi_1 , \\varphi_2 :L \\cup R \\to L \\cup R\\, is said to be a \\(3\\-biplacement of \\(G\\ if \\(\\varphi_1(L= \\varphi_2(L = L\\ and \\(E \\cap \\varphi_1^*(E=\\emptyset\\, \\(E \\cap \\varphi_2^*(E=\\emptyset\\, \\(\\varphi_1^*(E \\cap \\varphi_2^*(E=\\emptyset\\, where \\(\\varphi_1^*\\, \\(\\varphi_2^*\\ are the maps defined on \\(E\\, induced by \\(\\varphi_1\\, \\(\\varphi_2\\, respectively. We prove that if \\(|L| = p\\, \\(|R| = q\\, \\(3 \\leq p \\leq q\\, then every graph \\(G=(L,R;E\\ of size at most \\(p\\ has a \\(3\\-biplacement.

  17. Separable decompositions of bipartite mixed states

    Science.gov (United States)

    Li, Jun-Li; Qiao, Cong-Feng

    2018-04-01

    We present a practical scheme for the decomposition of a bipartite mixed state into a sum of direct products of local density matrices, using the technique developed in Li and Qiao (Sci. Rep. 8:1442, 2018). In the scheme, the correlation matrix which characterizes the bipartite entanglement is first decomposed into two matrices composed of the Bloch vectors of local states. Then, we show that the symmetries of Bloch vectors are consistent with that of the correlation matrix, and the magnitudes of the local Bloch vectors are lower bounded by the correlation matrix. Concrete examples for the separable decompositions of bipartite mixed states are presented for illustration.

  18. High speed and adaptable error correction for megabit/s rate quantum key distribution.

    Science.gov (United States)

    Dixon, A R; Sato, H

    2014-12-02

    Quantum Key Distribution is moving from its theoretical foundation of unconditional security to rapidly approaching real world installations. A significant part of this move is the orders of magnitude increases in the rate at which secure key bits are distributed. However, these advances have mostly been confined to the physical hardware stage of QKD, with software post-processing often being unable to support the high raw bit rates. In a complete implementation this leads to a bottleneck limiting the final secure key rate of the system unnecessarily. Here we report details of equally high rate error correction which is further adaptable to maximise the secure key rate under a range of different operating conditions. The error correction is implemented both in CPU and GPU using a bi-directional LDPC approach and can provide 90-94% of the ideal secure key rate over all fibre distances from 0-80 km.

  19. Practical scheme to share a secret key through a quantum channel with a 27.6% bit error rate

    International Nuclear Information System (INIS)

    Chau, H.F.

    2002-01-01

    A secret key shared through quantum key distribution between two cooperative players is secure against any eavesdropping attack allowed by the laws of physics. Yet, such a key can be established only when the quantum channel error rate due to eavesdropping or imperfect apparatus is low. Here, a practical quantum key distribution scheme by making use of an adaptive privacy amplification procedure with two-way classical communication is reported. Then, it is proven that the scheme generates a secret key whenever the bit error rate of the quantum channel is less than 0.5-0.1√(5)≅27.6%, thereby making it the most error resistant scheme known to date

  20. Phase-controlled localization and directed transport in an optical bipartite lattice.

    Science.gov (United States)

    Hai, Kuo; Luo, Yunrong; Lu, Gengbiao; Hai, Wenhua

    2014-02-24

    We investigate coherent control of a single atom interacting with an optical bipartite lattice via a combined high-frequency modulation. Our analytical results show that the quantum tunneling and dynamical localization can depend on phase difference between the modulation components, which leads to a different route for the coherent destruction of tunneling and a convenient phase-control method for stabilizing the system to implement the directed transport of atom. The similar directed transport and the phase-controlled quantum transition are revealed for the corresponding many-particle system. The results can be referable for experimentally manipulating quantum transport and transition of cold atoms in the tilted and shaken optical bipartite lattice or of analogical optical two-mode quantum beam splitter, and also can be extended to other optical and solid-state systems.

  1. On the problem of non-zero word error rates for fixed-rate error correction codes in continuous variable quantum key distribution

    International Nuclear Information System (INIS)

    Johnson, Sarah J; Ong, Lawrence; Shirvanimoghaddam, Mahyar; Lance, Andrew M; Symul, Thomas; Ralph, T C

    2017-01-01

    The maximum operational range of continuous variable quantum key distribution protocols has shown to be improved by employing high-efficiency forward error correction codes. Typically, the secret key rate model for such protocols is modified to account for the non-zero word error rate of such codes. In this paper, we demonstrate that this model is incorrect: firstly, we show by example that fixed-rate error correction codes, as currently defined, can exhibit efficiencies greater than unity. Secondly, we show that using this secret key model combined with greater than unity efficiency codes, implies that it is possible to achieve a positive secret key over an entanglement breaking channel—an impossible scenario. We then consider the secret key model from a post-selection perspective, and examine the implications for key rate if we constrain the forward error correction codes to operate at low word error rates. (paper)

  2. Data transfer using complete bipartite graph

    Science.gov (United States)

    Chandrasekaran, V. M.; Praba, B.; Manimaran, A.; Kailash, G.

    2017-11-01

    Information exchange extent is an estimation of the amount of information sent between two focuses on a framework in a given time period. It is an extremely significant perception in present world. There are many ways of message passing in the present situations. Some of them are through encryption, decryption, by using complete bipartite graph. In this paper, we recommend a method for communication using messages through encryption of a complete bipartite graph.

  3. Bipartite fidelity and Loschmidt echo of the bosonic conformal interface

    Science.gov (United States)

    Zhou, Tianci; Lin, Mao

    2017-12-01

    We study the quantum quench problem for a class of bosonic conformal interfaces by computing the Loschmidt echo and the bipartite fidelity. The quench can be viewed as a sudden change of boundary conditions parametrized by θ when connecting two one-dimensional critical systems. They are classified by S (θ ) matrices associated with the current scattering processes on the interface. The resulting Loschmidt echo of the quench has long time algebraic decay t-α, whose exponent also appears in the finite size bipartite fidelity as L-α/2. We perform analytic and numerical calculations of the exponent α , and find that it has a quadratic dependence on the change of θ if the prior and post-quench boundary conditions are of the same type of S , while remaining 1/4 otherwise. Possible physical realizations of these interfaces include, for instance, connecting different quantum wires (Luttinger liquids), quench of the topological phase edge states, etc., and the exponent can be detected in an x-ray edge singularity-type experiment.

  4. Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity

    Science.gov (United States)

    Huber, Felix; Eltschka, Christopher; Siewert, Jens; Gühne, Otfried

    2018-04-01

    A pure multipartite quantum state is called absolutely maximally entangled (AME), if all reductions obtained by tracing out at least half of its parties are maximally mixed. Maximal entanglement is then present across every bipartition. The existence of such states is in many cases unclear. With the help of the weight enumerator machinery known from quantum error correction and the shadow inequalities, we obtain new bounds on the existence of AME states in dimensions larger than two. To complete the treatment on the weight enumerator machinery, the quantum MacWilliams identity is derived in the Bloch representation. Finally, we consider AME states whose subsystems have different local dimensions, and present an example for a 2×3×3×3 system that shows maximal entanglement across every bipartition.

  5. Precursors, gauge invariance, and quantum error correction in AdS/CFT

    Energy Technology Data Exchange (ETDEWEB)

    Freivogel, Ben; Jefferson, Robert A.; Kabir, Laurens [ITFA and GRAPPA, Universiteit van Amsterdam,Science Park 904, Amsterdam (Netherlands)

    2016-04-19

    A puzzling aspect of the AdS/CFT correspondence is that a single bulk operator can be mapped to multiple different boundary operators, or precursors. By improving upon a recent model of Mintun, Polchinski, and Rosenhaus, we demonstrate explicitly how this ambiguity arises in a simple model of the field theory. In particular, we show how gauge invariance in the boundary theory manifests as a freedom in the smearing function used in the bulk-boundary mapping, and explicitly show how this freedom can be used to localize the precursor in different spatial regions. We also show how the ambiguity can be understood in terms of quantum error correction, by appealing to the entanglement present in the CFT. The concordance of these two approaches suggests that gauge invariance and entanglement in the boundary field theory are intimately connected to the reconstruction of local operators in the dual spacetime.

  6. Minimum-error quantum distinguishability bounds from matrix monotone functions: A comment on 'Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds' [J. Math. Phys. 50, 032106 (2009)

    International Nuclear Information System (INIS)

    Tyson, Jon

    2009-01-01

    Matrix monotonicity is used to obtain upper bounds on minimum-error distinguishability of arbitrary ensembles of mixed quantum states. This generalizes one direction of a two-sided bound recently obtained by the author [J. Tyson, J. Math. Phys. 50, 032106 (2009)]. It is shown that the previously obtained special case has unique properties.

  7. Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels

    International Nuclear Information System (INIS)

    Boche, H.; Nötzel, J.

    2014-01-01

    This work is motivated by a quite general question: Under which circumstances are the capacities of information transmission systems continuous? The research is explicitly carried out on finite arbitrarily varying quantum channels (AVQCs). We give an explicit example that answers the recent question whether the transmission of messages over AVQCs can benefit from assistance by distribution of randomness between the legitimate sender and receiver in the affirmative. The specific class of channels introduced in that example is then extended to show that the unassisted capacity does have discontinuity points, while it is known that the randomness-assisted capacity is always continuous in the channel. We characterize the discontinuity points and prove that the unassisted capacity is always continuous around its positivity points. After having established shared randomness as an important resource, we quantify the interplay between the distribution of finite amounts of randomness between the legitimate sender and receiver, the (nonzero) probability of a decoding error with respect to the average error criterion and the number of messages that can be sent over a finite number of channel uses. We relate our results to the entanglement transmission capacities of finite AVQCs, where the role of shared randomness is not yet well understood, and give a new sufficient criterion for the entanglement transmission capacity with randomness assistance to vanish

  8. Hamiltonian formulation of quantum error correction and correlated noise: Effects of syndrome extraction in the long-time limit

    Science.gov (United States)

    Novais, E.; Mucciolo, Eduardo R.; Baranger, Harold U.

    2008-07-01

    We analyze the long-time behavior of a quantum computer running a quantum error correction (QEC) code in the presence of a correlated environment. Starting from a Hamiltonian formulation of realistic noise models, and assuming that QEC is indeed possible, we find formal expressions for the probability of a given syndrome history and the associated residual decoherence encoded in the reduced density matrix. Systems with nonzero gate times (“long gates”) are included in our analysis by using an upper bound on the noise. In order to introduce the local error probability for a qubit, we assume that propagation of signals through the environment is slower than the QEC period (hypercube assumption). This allows an explicit calculation in the case of a generalized spin-boson model and a quantum frustration model. The key result is a dimensional criterion: If the correlations decay sufficiently fast, the system evolves toward a stochastic error model for which the threshold theorem of fault-tolerant quantum computation has been proven. On the other hand, if the correlations decay slowly, the traditional proof of this threshold theorem does not hold. This dimensional criterion bears many similarities to criteria that occur in the theory of quantum phase transitions.

  9. E6 and the bipartite entanglement of three qutrits

    International Nuclear Information System (INIS)

    Duff, M. J.; Ferrara, S.

    2007-01-01

    Recent investigations have established an analogy between the entropy of four-dimensional supersymmetric black holes in string theory and entanglement in quantum information theory. Examples include: (1) N=2 STU black holes and the tripartite entanglement of three qubits (2-state systems), where the common symmetry is [SL(2)] 3 and (2) N=8 black holes and the tripartite entanglement of seven qubits where the common symmetry is E 7 superset of [SL(2)] 7 . Here we present another example: N=8 black holes (or black strings) in five dimensions and the bipartite entanglement of three qutrits (3-state systems), where the common symmetry is E 6 superset of [SL(3)] 3 . Both the black hole (or black string) entropy and the entanglement measure are provided by the Cartan cubic E 6 invariant. Similar analogies exist for magic N=2 supergravity black holes in both four and five dimensions

  10. Eigenvalues and expansion of bipartite graphs

    DEFF Research Database (Denmark)

    Høholdt, Tom; Janwa, Heeralal

    2012-01-01

    We prove lower bounds on the largest and second largest eigenvalue of the adjacency matrix of bipartite graphs and give necessary and sufficient conditions for equality. We give several examples of classes that are optimal with respect to the bouns. We prove that BIBD-graphs are characterized by ...

  11. Dynamic Matchings in Convex Bipartite Graphs

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Georgiadis, Loukas; Hansen, Kristoffer Arnsfelt

    2007-01-01

    We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching...

  12. On bipartite pure-state entanglement structure in terms of disentanglement

    Science.gov (United States)

    Herbut, Fedor

    2006-12-01

    Schrödinger's disentanglement [E. Schrödinger, Proc. Cambridge Philos. Soc. 31, 555 (1935)], i.e., remote state decomposition, as a physical way to study entanglement, is carried one step further with respect to previous work in investigating the qualitative side of entanglement in any bipartite state vector. Remote measurement (or, equivalently, remote orthogonal state decomposition) from previous work is generalized to remote linearly independent complete state decomposition both in the nonselective and the selective versions. The results are displayed in terms of commutative square diagrams, which show the power and beauty of the physical meaning of the (antiunitary) correlation operator inherent in the given bipartite state vector. This operator, together with the subsystem states (reduced density operators), constitutes the so-called correlated subsystem picture. It is the central part of the antilinear representation of a bipartite state vector, and it is a kind of core of its entanglement structure. The generalization of previously elaborated disentanglement expounded in this article is a synthesis of the antilinear representation of bipartite state vectors, which is reviewed, and the relevant results of [Cassinelli et al., J. Math. Anal. Appl. 210, 472 (1997)] in mathematical analysis, which are summed up. Linearly independent bases (finite or infinite) are shown to be almost as useful in some quantum mechanical studies as orthonormal ones. Finally, it is shown that linearly independent remote pure-state preparation carries the highest probability of occurrence. This singles out linearly independent remote influence from all possible ones.

  13. Quantum correlations and distinguishability of quantum states

    Energy Technology Data Exchange (ETDEWEB)

    Spehner, Dominique [Université Grenoble Alpes and CNRS, Institut Fourier, F-38000 Grenoble, France and Laboratoire de Physique et Modélisation des Milieux Condensés, F-38000 Grenoble (France)

    2014-07-15

    A survey of various concepts in quantum information is given, with a main emphasis on the distinguishability of quantum states and quantum correlations. Covered topics include generalized and least square measurements, state discrimination, quantum relative entropies, the Bures distance on the set of quantum states, the quantum Fisher information, the quantum Chernoff bound, bipartite entanglement, the quantum discord, and geometrical measures of quantum correlations. The article is intended both for physicists interested not only by collections of results but also by the mathematical methods justifying them, and for mathematicians looking for an up-to-date introductory course on these subjects, which are mainly developed in the physics literature.

  14. Quantum correlations and distinguishability of quantum states

    International Nuclear Information System (INIS)

    Spehner, Dominique

    2014-01-01

    A survey of various concepts in quantum information is given, with a main emphasis on the distinguishability of quantum states and quantum correlations. Covered topics include generalized and least square measurements, state discrimination, quantum relative entropies, the Bures distance on the set of quantum states, the quantum Fisher information, the quantum Chernoff bound, bipartite entanglement, the quantum discord, and geometrical measures of quantum correlations. The article is intended both for physicists interested not only by collections of results but also by the mathematical methods justifying them, and for mathematicians looking for an up-to-date introductory course on these subjects, which are mainly developed in the physics literature

  15. Efficiency of coherent-state quantum cryptography in the presence of loss: Influence of realistic error correction

    International Nuclear Information System (INIS)

    Heid, Matthias; Luetkenhaus, Norbert

    2006-01-01

    We investigate the performance of a continuous-variable quantum key distribution scheme in a practical setting. More specifically, we take a nonideal error reconciliation procedure into account. The quantum channel connecting the two honest parties is assumed to be lossy but noiseless. Secret key rates are given for the case that the measurement outcomes are postselected or a reverse reconciliation scheme is applied. The reverse reconciliation scheme loses its initial advantage in the practical setting. If one combines postselection with reverse reconciliation, however, much of this advantage can be recovered

  16. Probing quantum entanglement, quantum discord, classical correlation, and the quantum state without disturbing them

    International Nuclear Information System (INIS)

    Li Zhenni; Jin Jiasen; Yu Changshui

    2011-01-01

    We present schemes for a type of one-parameter bipartite quantum state to probe quantum entanglement, quantum discord, the classical correlation, and the quantum state based on cavity QED. It is shown that our detection does not influence all these measured quantities. We also discuss how the spontaneous emission introduced by our probe atom influences our detection.

  17. Local non-Calderbank-Shor-Steane quantum error-correcting code on a three-dimensional lattice

    International Nuclear Information System (INIS)

    Kim, Isaac H.

    2011-01-01

    We present a family of non-Calderbank-Shor-Steane quantum error-correcting code consisting of geometrically local stabilizer generators on a 3D lattice. We study the Hamiltonian constructed from ferromagnetic interaction of overcomplete set of local stabilizer generators. The degenerate ground state of the system is characterized by a quantum error-correcting code whose number of encoded qubits are equal to the second Betti number of the manifold. These models (i) have solely local interactions; (ii) admit a strong-weak duality relation with an Ising model on a dual lattice; (iii) have topological order in the ground state, some of which survive at finite temperature; and (iv) behave as classical memory at finite temperature.

  18. Local non-Calderbank-Shor-Steane quantum error-correcting code on a three-dimensional lattice

    Science.gov (United States)

    Kim, Isaac H.

    2011-05-01

    We present a family of non-Calderbank-Shor-Steane quantum error-correcting code consisting of geometrically local stabilizer generators on a 3D lattice. We study the Hamiltonian constructed from ferromagnetic interaction of overcomplete set of local stabilizer generators. The degenerate ground state of the system is characterized by a quantum error-correcting code whose number of encoded qubits are equal to the second Betti number of the manifold. These models (i) have solely local interactions; (ii) admit a strong-weak duality relation with an Ising model on a dual lattice; (iii) have topological order in the ground state, some of which survive at finite temperature; and (iv) behave as classical memory at finite temperature.

  19. Qubits in phase space: Wigner-function approach to quantum-error correction and the mean-king problem

    International Nuclear Information System (INIS)

    Paz, Juan Pablo; Roncaglia, Augusto Jose; Saraceno, Marcos

    2005-01-01

    We analyze and further develop a method to represent the quantum state of a system of n qubits in a phase-space grid of NxN points (where N=2 n ). The method, which was recently proposed by Wootters and co-workers (Gibbons et al., Phys. Rev. A 70, 062101 (2004).), is based on the use of the elements of the finite field GF(2 n ) to label the phase-space axes. We present a self-contained overview of the method, we give insights into some of its features, and we apply it to investigate problems which are of interest for quantum-information theory: We analyze the phase-space representation of stabilizer states and quantum error-correction codes and present a phase-space solution to the so-called mean king problem

  20. Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators

    International Nuclear Information System (INIS)

    Flammia, Steven T; Gross, David; Liu, Yi-Kai; Eisert, Jens

    2012-01-01

    Intuitively, if a density operator has small rank, then it should be easier to estimate from experimental data, since in this case only a few eigenvectors need to be learned. We prove two complementary results that confirm this intuition. Firstly, we show that a low-rank density matrix can be estimated using fewer copies of the state, i.e. the sample complexity of tomography decreases with the rank. Secondly, we show that unknown low-rank states can be reconstructed from an incomplete set of measurements, using techniques from compressed sensing and matrix completion. These techniques use simple Pauli measurements, and their output can be certified without making any assumptions about the unknown state. In this paper, we present a new theoretical analysis of compressed tomography, based on the restricted isometry property for low-rank matrices. Using these tools, we obtain near-optimal error bounds for the realistic situation where the data contain noise due to finite statistics, and the density matrix is full-rank with decaying eigenvalues. We also obtain upper bounds on the sample complexity of compressed tomography, and almost-matching lower bounds on the sample complexity of any procedure using adaptive sequences of Pauli measurements. Using numerical simulations, we compare the performance of two compressed sensing estimators—the matrix Dantzig selector and the matrix Lasso—with standard maximum-likelihood estimation (MLE). We find that, given comparable experimental resources, the compressed sensing estimators consistently produce higher fidelity state reconstructions than MLE. In addition, the use of an incomplete set of measurements leads to faster classical processing with no loss of accuracy. Finally, we show how to certify the accuracy of a low-rank estimate using direct fidelity estimation, and describe a method for compressed quantum process tomography that works for processes with small Kraus rank and requires only Pauli eigenstate preparations

  1. Perioperative management of facial bipartition surgery

    Directory of Open Access Journals (Sweden)

    Caruselli M

    2015-11-01

    Full Text Available Marco Caruselli,1 Michael Tsapis,1,2 Fabrice Ughetto,1 Gregoire Pech-Gourg,3 Dario Galante,4 Olivier Paut1 1Anesthesia and Intensive Care Unit, La Timone Children’s Hospital, 2Pediatric Transport Team, SAMU 13, La Timone Hospital, 3Pediatric Neurosurgery Unit, La Timone Children’s Hospital, Marseille, France; 4Anesthesia and Intensive Care Unit, University Hospital Ospedali Riuniti of Foggia, Foggia, Italy Abstract: Severe craniofacial malformations, such as Crouzon, Apert, Saethre-Chotzen, and Pfeiffer syndromes, are very rare conditions (one in 50,000/100,000 live births that often require corrective surgery. Facial bipartition is the more radical corrective surgery. It is a high-risk intervention and needs complex perioperative management and a multidisciplinary approach. Keywords: craniofacial surgery, facial bipartition surgery, craniofacial malformations, pediatric anesthesia

  2. Quantum quasi-cyclic low-density parity-check error-correcting codes

    International Nuclear Information System (INIS)

    Yuan, Li; Gui-Hua, Zeng; Lee, Moon Ho

    2009-01-01

    In this paper, we propose the approach of employing circulant permutation matrices to construct quantum quasicyclic (QC) low-density parity-check (LDPC) codes. Using the proposed approach one may construct some new quantum codes with various lengths and rates of no cycles-length 4 in their Tanner graphs. In addition, these constructed codes have the advantages of simple implementation and low-complexity encoding. Finally, the decoding approach for the proposed quantum QC LDPC is investigated. (general)

  3. An evolving model of online bipartite networks

    Science.gov (United States)

    Zhang, Chu-Xu; Zhang, Zi-Ke; Liu, Chuang

    2013-12-01

    Understanding the structure and evolution of online bipartite networks is a significant task since they play a crucial role in various e-commerce services nowadays. Recently, various attempts have been tried to propose different models, resulting in either power-law or exponential degree distributions. However, many empirical results show that the user degree distribution actually follows a shifted power-law distribution, the so-called Mandelbrot’s law, which cannot be fully described by previous models. In this paper, we propose an evolving model, considering two different user behaviors: random and preferential attachment. Extensive empirical results on two real bipartite networks, Delicious and CiteULike, show that the theoretical model can well characterize the structure of real networks for both user and object degree distributions. In addition, we introduce a structural parameter p, to demonstrate that the hybrid user behavior leads to the shifted power-law degree distribution, and the region of power-law tail will increase with the increment of p. The proposed model might shed some lights in understanding the underlying laws governing the structure of real online bipartite networks.

  4. Gaussian Error Correction of Quantum States in a Correlated Noisy Channel

    DEFF Research Database (Denmark)

    Lassen, Mikael Østergaard; Berni, Adriano; Madsen, Lars Skovgaard

    2013-01-01

    Noise is the main obstacle for the realization of fault-tolerant quantum information processing and secure communication over long distances. In this work, we propose a communication protocol relying on simple linear optics that optimally protects quantum states from non-Markovian or correlated...... noise. We implement the protocol experimentally and demonstrate the near-ideal protection of coherent and entangled states in an extremely noisy channel. Since all real-life channels are exhibiting pronounced non-Markovian behavior, the proposed protocol will have immediate implications in improving...... the performance of various quantum information protocols....

  5. On the Source of the Systematic Errors in the Quantum Mechanical Calculation of the Superheavy Elements

    Directory of Open Access Journals (Sweden)

    Khazan A.

    2010-10-01

    Full Text Available It is shown that only the hyperbolic law of the Periodic Table of Elements allows the exact calculation for the atomic masses. The reference data of Periods 8 and 9 manifest a systematic error in the computer software applied to such a calculation (this systematic error increases with the number of the elements in the Table.

  6. Parameter optimization in biased decoy-state quantum key distribution with both source errors and statistical fluctuations

    Science.gov (United States)

    Zhu, Jian-Rong; Li, Jian; Zhang, Chun-Mei; Wang, Qin

    2017-10-01

    The decoy-state method has been widely used in commercial quantum key distribution (QKD) systems. In view of the practical decoy-state QKD with both source errors and statistical fluctuations, we propose a universal model of full parameter optimization in biased decoy-state QKD with phase-randomized sources. Besides, we adopt this model to carry out simulations of two widely used sources: weak coherent source (WCS) and heralded single-photon source (HSPS). Results show that full parameter optimization can significantly improve not only the secure transmission distance but also the final key generation rate. And when taking source errors and statistical fluctuations into account, the performance of decoy-state QKD using HSPS suffered less than that of decoy-state QKD using WCS.

  7. A novel community detection method in bipartite networks

    Science.gov (United States)

    Zhou, Cangqi; Feng, Liang; Zhao, Qianchuan

    2018-02-01

    Community structure is a common and important feature in many complex networks, including bipartite networks, which are used as a standard model for many empirical networks comprised of two types of nodes. In this paper, we propose a two-stage method for detecting community structure in bipartite networks. Firstly, we extend the widely-used Louvain algorithm to bipartite networks. The effectiveness and efficiency of the Louvain algorithm have been proved by many applications. However, there lacks a Louvain-like algorithm specially modified for bipartite networks. Based on bipartite modularity, a measure that extends unipartite modularity and that quantifies the strength of partitions in bipartite networks, we fill the gap by developing the Bi-Louvain algorithm that iteratively groups the nodes in each part by turns. This algorithm in bipartite networks often produces a balanced network structure with equal numbers of two types of nodes. Secondly, for the balanced network yielded by the first algorithm, we use an agglomerative clustering method to further cluster the network. We demonstrate that the calculation of the gain of modularity of each aggregation, and the operation of joining two communities can be compactly calculated by matrix operations for all pairs of communities simultaneously. At last, a complete hierarchical community structure is unfolded. We apply our method to two benchmark data sets and a large-scale data set from an e-commerce company, showing that it effectively identifies community structure in bipartite networks.

  8. Three methods to distill multipartite entanglement over bipartite noisy channels

    International Nuclear Information System (INIS)

    Lee, Soojoon; Park, Jungjoon

    2008-01-01

    We first assume that there are only bipartite noisy qubit channels in a given multipartite system, and present three methods to distill the general Greenberger-Horne-Zeilinger state. By investigating the methods, we show that multipartite entanglement distillation by bipartite entanglement distillation has higher yield than ones in the previous multipartite entanglement distillations

  9. Connectivity and Nestedness in Bipartite Networks from Community Ecology

    International Nuclear Information System (INIS)

    Corso, Gilberto; De Araujo, A I Levartoski; De Almeida, Adriana M

    2011-01-01

    Bipartite networks and the nestedness concept appear in two different contexts in theoretical ecology: community ecology and islands biogeography. From a mathematical perspective nestedness is a pattern in a bipartite network. There are several nestedness indices in the market, we used the index ν. The index ν is found using the relation ν = 1 - τ where τ is the temperature of the adjacency matrix of the bipartite network. By its turn τ is defined with help of the Manhattan distance of the occupied elements of the adjacency matrix of the bipartite network. We prove that the nestedness index ν is a function of the connectivities of the bipartite network. In addition we find a concise way to find ν which avoid cumbersome algorithm manupulation of the adjacency matrix.

  10. Connectivity and Nestedness in Bipartite Networks from Community Ecology

    Energy Technology Data Exchange (ETDEWEB)

    Corso, Gilberto [Departamento de Biofisica e Farmacologia, Centro de Biociencias, Universidade Federal do Rio Grande do Norte, UFRN - Campus Universitario, Lagoa Nova, CEP 59078 972, Natal, RN (Brazil); De Araujo, A I Levartoski [Instituto Federal de Educacao, Ciencia e Tecnologia do Ceara Av. Treze de Maio, 2081 - Benfica CEP 60040-531 - Fortaleza, CE (Brazil); De Almeida, Adriana M, E-mail: corso@cb.ufrn.br [Departamento de Botanica, Ecologia e Zoologia, Centro de Biociencias, Universidade Federal do Rio Grande do Norte, UFRN - Campus Universitario, Lagoa Nova, CEP 59078 972, Natal, RN (Brazil)

    2011-03-01

    Bipartite networks and the nestedness concept appear in two different contexts in theoretical ecology: community ecology and islands biogeography. From a mathematical perspective nestedness is a pattern in a bipartite network. There are several nestedness indices in the market, we used the index {nu}. The index {nu} is found using the relation {nu} = 1 - {tau} where {tau} is the temperature of the adjacency matrix of the bipartite network. By its turn {tau} is defined with help of the Manhattan distance of the occupied elements of the adjacency matrix of the bipartite network. We prove that the nestedness index {nu} is a function of the connectivities of the bipartite network. In addition we find a concise way to find {nu} which avoid cumbersome algorithm manupulation of the adjacency matrix.

  11. Clustering coefficient and community structure of bipartite networks

    Science.gov (United States)

    Zhang, Peng; Wang, Jinliang; Li, Xiaojia; Li, Menghui; Di, Zengru; Fan, Ying

    2008-12-01

    Many real-world networks display natural bipartite structure, where the basic cycle is a square. In this paper, with the similar consideration of standard clustering coefficient in binary networks, a definition of the clustering coefficient for bipartite networks based on the fraction of squares is proposed. In order to detect community structures in bipartite networks, two different edge clustering coefficients LC4 and LC3 of bipartite networks are defined, which are based on squares and triples respectively. With the algorithm of cutting the edge with the least clustering coefficient, communities in artificial and real world networks are identified. The results reveal that investigating bipartite networks based on the original structure can show the detailed properties that is helpful to get deep understanding about the networks.

  12. Enhancing non-local correlations in the bipartite partitions of two qubit-system with non-mutual interaction

    Energy Technology Data Exchange (ETDEWEB)

    Mohamed, A.-B.A., E-mail: abdelbastm@yahoo.com [College of Sciences and Humanities, Prince Sattam Bin Abdulaziz University, Al-Aflaj (Saudi Arabia); Faculty of Science, Assiut University, Assiut (Egypt); Joshi, A., E-mail: mcbamji@gmail.com [Physics Department, Adelphi University Garden City, NY 11530 (United States); Department of Physics and Optical Engineering, RHIT, Terra Haute IN 47803 (United States); Hassan, S.S., E-mail: shoukryhassan@hotmail.com [Department of Mathematics, College of Science, University of Bahrain, P.O. Box 32038 (Bahrain)

    2016-03-15

    Several quantum-mechanical correlations, notably, quantum entanglement, measurement-induced nonlocality and Bell nonlocality are studied for a two qubit-system having no mutual interaction. Analytical expressions for the measures of these quantum-mechanical correlations of different bipartite partitions of the system are obtained, for initially two entangled qubits and the two photons are in their vacuum states. It is found that the qubits-fields interaction leads to the loss and gain of the initial quantum correlations. The lost initial quantum correlations transfer from the qubits to the cavity fields. It is found that the maximal violation of Bell’s inequality is occurring when the quantum correlations of both the logarithmic negativity and measurement-induced nonlocality reach particular values. The maximal violation of Bell’s inequality occurs only for certain bipartite partitions of the system. The frequency detuning leads to quick oscillations of the quantum correlations and inhibits their transfer from the qubits to the cavity modes. It is also found that the dynamical behavior of the quantum correlation clearly depends on the qubit distribution angle.

  13. Community detection for networks with unipartite and bipartite structure

    Science.gov (United States)

    Chang, Chang; Tang, Chao

    2014-09-01

    Finding community structures in networks is important in network science, technology, and applications. To date, most algorithms that aim to find community structures only focus either on unipartite or bipartite networks. A unipartite network consists of one set of nodes and a bipartite network consists of two nonoverlapping sets of nodes with only links joining the nodes in different sets. However, a third type of network exists, defined here as the mixture network. Just like a bipartite network, a mixture network also consists of two sets of nodes, but some nodes may simultaneously belong to two sets, which breaks the nonoverlapping restriction of a bipartite network. The mixture network can be considered as a general case, with unipartite and bipartite networks viewed as its limiting cases. A mixture network can represent not only all the unipartite and bipartite networks, but also a wide range of real-world networks that cannot be properly represented as either unipartite or bipartite networks in fields such as biology and social science. Based on this observation, we first propose a probabilistic model that can find modules in unipartite, bipartite, and mixture networks in a unified framework based on the link community model for a unipartite undirected network [B Ball et al (2011 Phys. Rev. E 84 036103)]. We test our algorithm on synthetic networks (both overlapping and nonoverlapping communities) and apply it to two real-world networks: a southern women bipartite network and a human transcriptional regulatory mixture network. The results suggest that our model performs well for all three types of networks, is competitive with other algorithms for unipartite or bipartite networks, and is applicable to real-world networks.

  14. Toric Varieties and Codes, Error-correcting Codes, Quantum Codes, Secret Sharing and Decoding

    DEFF Research Database (Denmark)

    Hansen, Johan Peder

    We present toric varieties and associated toric codes and their decoding. Toric codes are applied to construct Linear Secret Sharing Schemes (LSSS) with strong multiplication by the Massey construction. Asymmetric Quantum Codes are obtained from toric codes by the A.R. Calderbank P.W. Shor and A.......M. Steane construction of stabilizer codes (CSS) from linear codes containing their dual codes....

  15. Fast and simple high-capacity quantum cryptography with error detection

    Science.gov (United States)

    Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Zhang, Jun; Pan, Lei; Li, Shudong; Orgun, Mehmet A.

    2017-04-01

    Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.

  16. Fast and simple high-capacity quantum cryptography with error detection.

    Science.gov (United States)

    Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Zhang, Jun; Pan, Lei; Li, Shudong; Orgun, Mehmet A

    2017-04-13

    Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.

  17. Quantum coherence and correlations in quantum system

    Science.gov (United States)

    Xi, Zhengjun; Li, Yongming; Fan, Heng

    2015-01-01

    Criteria of measure quantifying quantum coherence, a unique property of quantum system, are proposed recently. In this paper, we first give an uncertainty-like expression relating the coherence and the entropy of quantum system. This finding allows us to discuss the relations between the entanglement and the coherence. Further, we discuss in detail the relations among the coherence, the discord and the deficit in the bipartite quantum system. We show that, the one-way quantum deficit is equal to the sum between quantum discord and the relative entropy of coherence of measured subsystem. PMID:26094795

  18. Conditional mutual information of bipartite unitaries and scrambling

    Energy Technology Data Exchange (ETDEWEB)

    Ding, Dawei; Hayden, Patrick; Walter, Michael [Stanford Institute for Theoretical Physics, Department of Physics, Stanford University,382 Via Pueblo, Stanford, CA 94305 (United States)

    2016-12-28

    One way to diagnose chaos in bipartite unitary channels is via the tripartite information of the corresponding Choi state, which for certain choices of the subsystems reduces to the negative conditional mutual information (CMI). We study this quantity from a quantum information-theoretic perspective to clarify its role in diagnosing scrambling. When the CMI is zero, we find that the channel has a special normal form consisting of local channels between individual inputs and outputs. However, we find that arbitrarily low CMI does not imply arbitrary proximity to a channel of this form, although it does imply a type of approximate recoverability of one of the inputs. When the CMI is maximal, we find that the residual channel from an individual input to an individual output is completely depolarizing when the other input is maximally mixed. However, we again find that this result is not robust. We also extend some of these results to the multipartite case and to the case of Haar-random pure input states. Finally, we look at the relationship between tripartite information and its Rényi-2 version which is directly related to out-of-time-order correlation functions. In particular, we demonstrate an arbitrarily large gap between the two quantities.

  19. Strong monogamy of bipartite and genuine multipartite entanglement: the Gaussian case.

    Science.gov (United States)

    Adesso, Gerardo; Illuminati, Fabrizio

    2007-10-12

    We demonstrate the existence of general constraints on distributed quantum correlations, which impose a trade-off on bipartite and multipartite entanglement at once. For all N-mode Gaussian states under permutation invariance, we establish exactly a monogamy inequality, stronger than the traditional one, that by recursion defines a proper measure of genuine N-partite entanglement. Strong monogamy holds as well for subsystems of arbitrary size, and the emerging multipartite entanglement measure is found to be scale invariant. We unveil its operational connection with the optimal fidelity of continuous variable teleportation networks.

  20. Quantum error correction of continuous-variable states against Gaussian noise

    Energy Technology Data Exchange (ETDEWEB)

    Ralph, T. C. [Centre for Quantum Computation and Communication Technology, School of Mathematics and Physics, University of Queensland, St Lucia, Queensland 4072 (Australia)

    2011-08-15

    We describe a continuous-variable error correction protocol that can correct the Gaussian noise induced by linear loss on Gaussian states. The protocol can be implemented using linear optics and photon counting. We explore the theoretical bounds of the protocol as well as the expected performance given current knowledge and technology.

  1. Asymptotic adaptive bipartite entanglement-distillation protocol

    International Nuclear Information System (INIS)

    Hostens, Erik; Dehaene, Jeroen; De Moor, Bart

    2006-01-01

    We present an asymptotic bipartite entanglement-distillation protocol that outperforms all existing asymptotic schemes. This protocol is based on the breeding protocol with the incorporation of two-way classical communication. Like breeding, the protocol starts with an infinite number of copies of a Bell-diagonal mixed state. Breeding can be carried out as successive stages of partial information extraction, yielding the same result: one bit of information is gained at the cost (measurement) of one pure Bell state pair (ebit). The basic principle of our protocol is at every stage to replace measurements on ebits by measurements on a finite number of copies, whenever there are two equiprobable outcomes. In that case, the entropy of the global state is reduced by more than one bit. Therefore, every such replacement results in an improvement of the protocol. We explain how our protocol is organized as to have as many replacements as possible. The yield is then calculated for Werner states

  2. Catalytic transformations for bipartite pure states

    International Nuclear Information System (INIS)

    Turgut, S

    2007-01-01

    Entanglement catalysis is a phenomenon that usually enhances the conversion probability in the transformation of entangled states by the temporary involvement of another entangled state (so-called catalyst), where after the process is completed the catalyst is returned to the same state. For some pairs of bipartite pure entangled states, catalysis enables a transformation with unit probability of success, in which case the respective Schmidt coefficients of the states are said to satisfy the trumping relation, a mathematical relation which is an extension of the majorization relation. This paper provides all necessary and sufficient conditions for the trumping and two other associated relations. Using these conditions, the least upper bound of conversion probabilities using catalysis is also obtained. Moreover, best conversion ratios achievable with catalysis are found for transformations involving many copies of states

  3. Equivalence of quantum states under local unitary transformations

    International Nuclear Information System (INIS)

    Fei Shaoming; Jing Naihuan

    2005-01-01

    In terms of the analysis of fixed point subgroup and tensor decomposability of certain matrices, we study the equivalence of quantum bipartite mixed states under local unitary transformations. For non-degenerate case an operational criterion for the equivalence of two such mixed bipartite states under local unitary transformations is presented

  4. An Analysis of Error Reconciliation Protocols for use in Quantum Key Distribution

    Science.gov (United States)

    2012-02-01

    INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR...of the messages passed, and that the time to prepare or separate the message information is negligible . Finally, for this experiment all errors...of interactions becomes negligible . In fact, of the three protocols, experiments performed here have shown that Winnow produces the highest average

  5. Local hypothesis testing between a pure bipartite state and the white noise state

    OpenAIRE

    Owari, Masaki; Hayashi, Masahito

    2010-01-01

    In this paper, we treat a local discrimination problem in the framework of asymmetric hypothesis testing. We choose a known bipartite pure state $\\ket{\\Psi}$ as an alternative hypothesis, and the completely mixed state as a null hypothesis. As a result, we analytically derive an optimal type 2 error and an optimal POVM for one-way LOCC POVM and Separable POVM. For two-way LOCC POVM, we study a family of simple three-step LOCC protocols, and show that the best protocol in this family has stric...

  6. Inefficiency and classical communication bounds for conversion between partially entangled pure bipartite states

    International Nuclear Information System (INIS)

    Fortescue, Ben; Lo, H.-K.

    2005-01-01

    We derive lower limits on the inefficiency and classical communication costs of dilution between two-term bipartite pure states that are partially entangled. We first calculate explicit relations between the allowable error and classical communication costs of entanglement dilution using a previously described protocol, then consider a two-stage dilution from singlets with this protocol followed by some unknown protocol for conversion between partially entangled states. Applying overall lower bounds on classical communication and inefficiency to this two-stage protocol, we derive bounds for the unknown protocol. In addition we derive analogous (but looser) bounds for general pure states

  7. Asymmetric intimacy and algorithm for detecting communities in bipartite networks

    Science.gov (United States)

    Wang, Xingyuan; Qin, Xiaomeng

    2016-11-01

    In this paper, an algorithm to choose a good partition in bipartite networks has been proposed. Bipartite networks have more theoretical significance and broader prospect of application. In view of distinctive structure of bipartite networks, in our method, two parameters are defined to show the relationships between the same type nodes and heterogeneous nodes respectively. Moreover, our algorithm employs a new method of finding and expanding the core communities in bipartite networks. Two kinds of nodes are handled separately and merged, and then the sub-communities are obtained. After that, objective communities will be found according to the merging rule. The proposed algorithm has been simulated in real-world networks and artificial networks, and the result verifies the accuracy and reliability of the parameters on intimacy for our algorithm. Eventually, comparisons with similar algorithms depict that the proposed algorithm has better performance.

  8. Average subentropy, coherence and entanglement of random mixed quantum states

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Lin, E-mail: godyalin@163.com [Institute of Mathematics, Hangzhou Dianzi University, Hangzhou 310018 (China); Singh, Uttam, E-mail: uttamsingh@hri.res.in [Harish-Chandra Research Institute, Allahabad, 211019 (India); Pati, Arun K., E-mail: akpati@hri.res.in [Harish-Chandra Research Institute, Allahabad, 211019 (India)

    2017-02-15

    Compact expressions for the average subentropy and coherence are obtained for random mixed states that are generated via various probability measures. Surprisingly, our results show that the average subentropy of random mixed states approaches the maximum value of the subentropy which is attained for the maximally mixed state as we increase the dimension. In the special case of the random mixed states sampled from the induced measure via partial tracing of random bipartite pure states, we establish the typicality of the relative entropy of coherence for random mixed states invoking the concentration of measure phenomenon. Our results also indicate that mixed quantum states are less useful compared to pure quantum states in higher dimension when we extract quantum coherence as a resource. This is because of the fact that average coherence of random mixed states is bounded uniformly, however, the average coherence of random pure states increases with the increasing dimension. As an important application, we establish the typicality of relative entropy of entanglement and distillable entanglement for a specific class of random bipartite mixed states. In particular, most of the random states in this specific class have relative entropy of entanglement and distillable entanglement equal to some fixed number (to within an arbitrary small error), thereby hugely reducing the complexity of computation of these entanglement measures for this specific class of mixed states.

  9. A general evolving model for growing bipartite networks

    International Nuclear Information System (INIS)

    Tian, Lixin; He, Yinghuan; Liu, Haijun; Du, Ruijin

    2012-01-01

    In this Letter, we propose and study an inner evolving bipartite network model. Significantly, we prove that the degree distribution of two different kinds of nodes both obey power-law form with adjustable exponents. Furthermore, the joint degree distribution of any two nodes for bipartite networks model is calculated analytically by the mean-field method. The result displays that such bipartite networks are nearly uncorrelated networks, which is different from one-mode networks. Numerical simulations and empirical results are given to verify the theoretical results. -- Highlights: ► We proposed a general evolving bipartite network model which was based on priority connection, reconnection and breaking edges. ► We prove that the degree distribution of two different kinds of nodes both obey power-law form with adjustable exponents. ► The joint degree distribution of any two nodes for bipartite networks model is calculated analytically by the mean-field method. ► The result displays that such bipartite networks are nearly uncorrelated networks, which is different from one-mode networks.

  10. Effect of Bipartite Hallucal Sesamoid on Hallux Valgus Surgery.

    Science.gov (United States)

    Park, Young Hwan; Jeong, Chan Dong; Choi, Gi Won; Kim, Hak Jun

    2017-06-01

    Bipartite hallucal sesamoids are often found in patients with hallux valgus. However, it is unknown whether bipartite hallucal sesamoids affect the results of hallux valgus surgery or not. The purpose of the present study was to evaluate the outcomes of chevron osteotomy for hallux valgus with and without bipartite hallucal sesamoid. A total of 152 patients (168 feet) treated with distal or proximal chevron osteotomy for hallux valgus constituted the study cohort. The 168 feet were divided into 2 groups: bipartite hallucal sesamoid (31 feet) and without bipartite hallucal sesamoid (137 feet). Hallux valgus angle (HVA), intermetatarsal angle (IMA), distal metatarsal articular angle (DMAA), tibial sesamoid position, and first metatarsal length were measured for radiographic outcomes and the American Orthopaedic Foot & Ankle Society (AOFAS) hallux metatarsophalangeal-interphalangeal (MTP-IP) score was measured for clinical outcomes. All radiographic measurements and the AOFAS score showed significant ( P .05) were found between the 2 groups in terms of HVA, IMA, DMAA, tibial sesamoid position, metatarsal shortening, and AOFAS score on final follow-up. This study suggests that bipartite hallucal sesamoids do not affect the results of hallux valgus surgery. Level III, retrospective comparative study.

  11. Tripartite entanglement in qudit stabilizer states and application in quantum error correction

    Energy Technology Data Exchange (ETDEWEB)

    Looi, Shiang Yong; Griffiths, Robert B. [Department of Physics, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213 (United States)

    2011-11-15

    Consider a stabilizer state on n qudits, each of dimension D with D being a prime or squarefree integer, divided into three mutually disjoint sets or parts. Generalizing a result of Bravyi et al.[J. Math. Phys. 47, 062106 (2006)] for qubits (D=2), we show that up to local unitaries, the three parts of the state can be written as tensor product of unentangled signle-qudit states, maximally entangled Einstein-Podolsky-Rosen (EPR) pairs, and tripartite Greenberger-Horne-Zeilinger (GHZ) states. We employ this result to obtain a complete characterization of the properties of a class of channels associated with stabilizer error-correcting codes, along with their complementary channels.

  12. Influence of intrinsic decoherence on tripartite entanglement and bipartite fidelity of polar molecules in pendular states

    Energy Technology Data Exchange (ETDEWEB)

    Han, Jia-Xing; Hu, Yuan; Jin, Yu [Key Laboratory of Micro-Nano Measurement-Manipulation and Physics (Ministry of Education), School of Physics and Nuclear Energy Engineering, Beihang University, Xueyuan Road No. 37, Beijing 100191 (China); Zhang, Guo-Feng, E-mail: gf1978zhang@buaa.edu.cn [Key Laboratory of Micro-Nano Measurement-Manipulation and Physics (Ministry of Education), School of Physics and Nuclear Energy Engineering, Beihang University, Xueyuan Road No. 37, Beijing 100191 (China); State Key Laboratory of Software Development Environment, Beihang University, Xueyuan Road No. 37, Beijing 100191 (China); State Key Laboratory of Low-Dimensional Quantum Physics, Tsinghua University, Beijing 100084 (China); Key Laboratory of Quantum Information, University of Science and Technology of China, Chinese Academy of Sciences, Hefei 230026 (China)

    2016-04-07

    An array of ultracold polar molecules trapped in an external electric field is regarded as a promising carrier of quantum information. Under the action of this field, molecules are compelled to undergo pendular oscillations by the Stark effect. Particular attention has been paid to the influence of intrinsic decoherence on the model of linear polar molecular pendular states, thereby we evaluate the tripartite entanglement with negativity, as well as fidelity of bipartite quantum systems for input and output signals using electric dipole moments of polar molecules as qubits. According to this study, we consider three typical initial states for both systems, respectively, and investigate the temporal evolution with variable values of the external field intensity, the intrinsic decoherence factor, and the dipole-dipole interaction. Thus, we demonstrate the sound selection of these three main parameters to obtain the best entanglement degree and fidelity.

  13. Bipartite Community Structure of eQTLs.

    Science.gov (United States)

    Platig, John; Castaldi, Peter J; DeMeo, Dawn; Quackenbush, John

    2016-09-01

    Genome Wide Association Studies (GWAS) and expression quantitative trait locus (eQTL) analyses have identified genetic associations with a wide range of human phenotypes. However, many of these variants have weak effects and understanding their combined effect remains a challenge. One hypothesis is that multiple SNPs interact in complex networks to influence functional processes that ultimately lead to complex phenotypes, including disease states. Here we present CONDOR, a method that represents both cis- and trans-acting SNPs and the genes with which they are associated as a bipartite graph and then uses the modular structure of that graph to place SNPs into a functional context. In applying CONDOR to eQTLs in chronic obstructive pulmonary disease (COPD), we found the global network "hub" SNPs were devoid of disease associations through GWAS. However, the network was organized into 52 communities of SNPs and genes, many of which were enriched for genes in specific functional classes. We identified local hubs within each community ("core SNPs") and these were enriched for GWAS SNPs for COPD and many other diseases. These results speak to our intuition: rather than single SNPs influencing single genes, we see groups of SNPs associated with the expression of families of functionally related genes and that disease SNPs are associated with the perturbation of those functions. These methods are not limited in their application to COPD and can be used in the analysis of a wide variety of disease processes and other phenotypic traits.

  14. Competition for popularity in bipartite networks

    Science.gov (United States)

    Beguerisse Díaz, Mariano; Porter, Mason A.; Onnela, Jukka-Pekka

    2010-12-01

    We present a dynamical model for rewiring and attachment in bipartite networks. Edges are placed between nodes that belong to catalogs that can either be fixed in size or growing in size. The model is motivated by an empirical study of data from the video rental service Netflix, which invites its users to give ratings to the videos available in its catalog. We find that the distribution of the number of ratings given by users and that of the number of ratings received by videos both follow a power law with an exponential cutoff. We also examine the activity patterns of Netflix users and find bursts of intense video-rating activity followed by long periods of inactivity. We derive ordinary differential equations to model the acquisition of edges by the nodes over time and obtain the corresponding time-dependent degree distributions. We then compare our results with the Netflix data and find good agreement. We conclude with a discussion of how catalog models can be used to study systems in which agents are forced to choose, rate, or prioritize their interactions from a large set of options.

  15. General entanglement-assisted transformation for bipartite pure quantum states

    Science.gov (United States)

    Song, Wei; Huang, Yan; Nai-LeLiu; Chen, Zeng-Bing

    2007-01-01

    We introduce the general catalysts for pure entanglement transformations under local operations and classical communications in such a way that we disregard the profit and loss of entanglement of the catalysts per se. As such, the possibilities of pure entanglement transformations are greatly expanded. We also design an efficient algorithm to detect whether a k × k general catalyst exists for a given entanglement transformation. This algorithm can also be exploited to witness the existence of standard catalysts.

  16. Invariant measures on multimode quantum Gaussian states

    Science.gov (United States)

    Lupo, C.; Mancini, S.; De Pasquale, A.; Facchi, P.; Florio, G.; Pascazio, S.

    2012-12-01

    We derive the invariant measure on the manifold of multimode quantum Gaussian states, induced by the Haar measure on the group of Gaussian unitary transformations. To this end, by introducing a bipartition of the system in two disjoint subsystems, we use a parameterization highlighting the role of nonlocal degrees of freedom—the symplectic eigenvalues—which characterize quantum entanglement across the given bipartition. A finite measure is then obtained by imposing a physically motivated energy constraint. By averaging over the local degrees of freedom we finally derive the invariant distribution of the symplectic eigenvalues in some cases of particular interest for applications in quantum optics and quantum information.

  17. Invariant measures on multimode quantum Gaussian states

    International Nuclear Information System (INIS)

    Lupo, C.; Mancini, S.; De Pasquale, A.; Facchi, P.; Florio, G.; Pascazio, S.

    2012-01-01

    We derive the invariant measure on the manifold of multimode quantum Gaussian states, induced by the Haar measure on the group of Gaussian unitary transformations. To this end, by introducing a bipartition of the system in two disjoint subsystems, we use a parameterization highlighting the role of nonlocal degrees of freedom—the symplectic eigenvalues—which characterize quantum entanglement across the given bipartition. A finite measure is then obtained by imposing a physically motivated energy constraint. By averaging over the local degrees of freedom we finally derive the invariant distribution of the symplectic eigenvalues in some cases of particular interest for applications in quantum optics and quantum information.

  18. Invariant measures on multimode quantum Gaussian states

    Energy Technology Data Exchange (ETDEWEB)

    Lupo, C. [School of Science and Technology, Universita di Camerino, I-62032 Camerino (Italy); Mancini, S. [School of Science and Technology, Universita di Camerino, I-62032 Camerino (Italy); Istituto Nazionale di Fisica Nucleare, Sezione di Perugia, I-06123 Perugia (Italy); De Pasquale, A. [NEST, Scuola Normale Superiore and Istituto Nanoscienze-CNR, I-56126 Pisa (Italy); Facchi, P. [Dipartimento di Matematica and MECENAS, Universita di Bari, I-70125 Bari (Italy); Istituto Nazionale di Fisica Nucleare, Sezione di Bari, I-70126 Bari (Italy); Florio, G. [Istituto Nazionale di Fisica Nucleare, Sezione di Bari, I-70126 Bari (Italy); Museo Storico della Fisica e Centro Studi e Ricerche Enrico Fermi, Piazza del Viminale 1, I-00184 Roma (Italy); Dipartimento di Fisica and MECENAS, Universita di Bari, I-70126 Bari (Italy); Pascazio, S. [Istituto Nazionale di Fisica Nucleare, Sezione di Bari, I-70126 Bari (Italy); Dipartimento di Fisica and MECENAS, Universita di Bari, I-70126 Bari (Italy)

    2012-12-15

    We derive the invariant measure on the manifold of multimode quantum Gaussian states, induced by the Haar measure on the group of Gaussian unitary transformations. To this end, by introducing a bipartition of the system in two disjoint subsystems, we use a parameterization highlighting the role of nonlocal degrees of freedom-the symplectic eigenvalues-which characterize quantum entanglement across the given bipartition. A finite measure is then obtained by imposing a physically motivated energy constraint. By averaging over the local degrees of freedom we finally derive the invariant distribution of the symplectic eigenvalues in some cases of particular interest for applications in quantum optics and quantum information.

  19. Quantum metrology

    International Nuclear Information System (INIS)

    Xiang Guo-Yong; Guo Guang-Can

    2013-01-01

    The statistical error is ineluctable in any measurement. Quantum techniques, especially with the development of quantum information, can help us squeeze the statistical error and enhance the precision of measurement. In a quantum system, there are some quantum parameters, such as the quantum state, quantum operator, and quantum dimension, which have no classical counterparts. So quantum metrology deals with not only the traditional parameters, but also the quantum parameters. Quantum metrology includes two important parts: measuring the physical parameters with a precision beating the classical physics limit and measuring the quantum parameters precisely. In this review, we will introduce how quantum characters (e.g., squeezed state and quantum entanglement) yield a higher precision, what the research areas are scientists most interesting in, and what the development status of quantum metrology and its perspectives are. (topical review - quantum information)

  20. Using nonlocal coherence to quantify quantum correlation

    OpenAIRE

    Pei, Pei; Wang, Wei; Li, Chong; Song, He-Shan

    2010-01-01

    We reexamine quantum correlation from the fundamental perspective of its consanguineous quantum property, the coherence. We emphasize the importance of specifying the tensor product structure of the total state space before discussing quantum correlation. A measure of quantum correlation for arbitrary dimension bipartite states using nonlocal coherence is proposed, and it can be easily generalized to the multipartite case. The quantification of non-entangled component within quantum correlati...

  1. A Partial Order on Bipartite Graphs with n Vertices

    Directory of Open Access Journals (Sweden)

    Emil Daniel Schwab

    2009-01-01

    Full Text Available The paper examines a partial order on bipartite graphs (X1, X2, E with n vertices, X1∪X2={1,2,…,n}. The basis of such bipartite graph is X1 = {1,2,…,k}, 0≤k≤n. If U = (X1, X2, E(U and V = (Y1,Y2, E(V then U≤V iff |X1| ≤ |Y1| and {(i,jE(U: j>|Y1|} = ={(i,jE(V:i≤|X1|}. This partial order is a natural partial order of subobjects of an object in a triangular category with bipartite graphs as morphisms.

  2. Two classes of bipartite networks: nested biological and social systems.

    Science.gov (United States)

    Burgos, Enrique; Ceva, Horacio; Hernández, Laura; Perazzo, R P J; Devoto, Mariano; Medan, Diego

    2008-10-01

    Bipartite graphs have received some attention in the study of social networks and of biological mutualistic systems. A generalization of a previous model is presented, that evolves the topology of the graph in order to optimally account for a given contact preference rule between the two guilds of the network. As a result, social and biological graphs are classified as belonging to two clearly different classes. Projected graphs, linking the agents of only one guild, are obtained from the original bipartite graph. The corresponding evolution of its statistical properties is also studied. An example of a biological mutualistic network is analyzed in detail, and it is found that the model provides a very good fitting of all the main statistical features. The model also provides a proper qualitative description of the same features observed in social webs, suggesting the possible reasons underlying the difference in the organization of these two kinds of bipartite networks.

  3. Localization in random bipartite graphs: Numerical and empirical study

    Science.gov (United States)

    Slanina, František

    2017-05-01

    We investigate adjacency matrices of bipartite graphs with a power-law degree distribution. Motivation for this study is twofold: first, vibrational states in granular matter and jammed sphere packings; second, graphs encoding social interaction, especially electronic commerce. We establish the position of the mobility edge and show that it strongly depends on the power in the degree distribution and on the ratio of the sizes of the two parts of the bipartite graph. At the jamming threshold, where the two parts have the same size, localization vanishes. We found that the multifractal spectrum is nontrivial in the delocalized phase, but still near the mobility edge. We also study an empirical bipartite graph, namely, the Amazon reviewer-item network. We found that in this specific graph the mobility edge disappears, and we draw a conclusion from this fact regarding earlier empirical studies of the Amazon network.

  4. Bipartite Fuzzy Stochastic Differential Equations with Global Lipschitz Condition

    Directory of Open Access Journals (Sweden)

    Marek T. Malinowski

    2016-01-01

    Full Text Available We introduce and analyze a new type of fuzzy stochastic differential equations. We consider equations with drift and diffusion terms occurring at both sides of equations. Therefore we call them the bipartite fuzzy stochastic differential equations. Under the Lipschitz and boundedness conditions imposed on drifts and diffusions coefficients we prove existence of a unique solution. Then, insensitivity of the solution under small changes of data of equation is examined. Finally, we mention that all results can be repeated for solutions to bipartite set-valued stochastic differential equations.

  5. Inseparability inequalities for higher order moments for bipartite systems

    International Nuclear Information System (INIS)

    Agarwal, G S; Biswas, Asoka

    2005-01-01

    There are several examples of bipartite entangled states of continuous variables for which the existing criteria for entanglement using the inequalities involving the second-order moments are insufficient. We derive new inequalities involving higher order correlation, for testing entanglement in non-Gaussian states. In this context, we study an example of a non-Gaussian state, which is a bipartite entangled state of the form Ψ(x a , x b ) ∝ (αx a + βx b ) e -(x a 2 +x b 2 )/2 . Our results open up an avenue to search for new inequalities to test entanglement in non-Gaussian states

  6. Bounds on Entanglement Dimensions and Quantum Graph Parameters via Noncommutative Polynomial Optimization

    NARCIS (Netherlands)

    Gribling, Sander; de Laat, David; Laurent, Monique

    2017-01-01

    In this paper we study bipartite quantum correlations using techniques from tracial polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal

  7. Schur complements of matrices with acyclic bipartite graphs

    DEFF Research Database (Denmark)

    Britz, Thomas Johann; Olesky, D.D.; van den Driessche, P.

    2005-01-01

    Bipartite graphs are used to describe the generalized Schur complements of real matrices having nos quare submatrix with two or more nonzero diagonals. For any matrix A with this property, including any nearly reducible matrix, the sign pattern of each generalized Schur complement is shown to be ...

  8. Transformation of bipartite non-maximally entangled states into a ...

    Indian Academy of Sciences (India)

    We present two schemes for transforming bipartite non-maximally entangled states into a W state in cavity QED system, by using highly detuned interactions and the resonant interactions between two-level atoms and a single-mode cavity field. A tri-atom W state can be generated by adjusting the interaction times between ...

  9. Transformation of bipartite non-maximally entangled states into a ...

    Indian Academy of Sciences (India)

    We present two schemes for transforming bipartite non-maximally entangled states into a W state in cavity QED system, by using highly detuned interactions and the resonant interactions between ... Proceedings of the International Workshop/Conference on Computational Condensed Matter Physics and Materials Science

  10. Entanglement fidelity of the standard quantum teleportation channel

    Energy Technology Data Exchange (ETDEWEB)

    Li, Gang; Ye, Ming-Yong, E-mail: myye@fjnu.edu.cn; Lin, Xiu-Min

    2013-09-16

    We consider the standard quantum teleportation protocol where a general bipartite state is used as entanglement resource. We use the entanglement fidelity to describe how well the standard quantum teleportation channel transmits quantum entanglement and give a simple expression for the entanglement fidelity when it is averaged on all input states.

  11. A bipartite fitness model for online music streaming services

    Science.gov (United States)

    Pongnumkul, Suchit; Motohashi, Kazuyuki

    2018-01-01

    This paper proposes an evolution model and an analysis of the behavior of music consumers on online music streaming services. While previous studies have observed power-law degree distributions of usage in online music streaming services, the underlying behavior of users has not been well understood. Users and songs can be described using a bipartite network where an edge exists between a user node and a song node when the user has listened that song. The growth mechanism of bipartite networks has been used to understand the evolution of online bipartite networks Zhang et al. (2013). Existing bipartite models are based on a preferential attachment mechanism László Barabási and Albert (1999) in which the probability that a user listens to a song is proportional to its current popularity. This mechanism does not allow for two types of real world phenomena. First, a newly released song with high quality sometimes quickly gains popularity. Second, the popularity of songs normally decreases as time goes by. Therefore, this paper proposes a new model that is more suitable for online music services by adding fitness and aging functions to the song nodes of the bipartite network proposed by Zhang et al. (2013). Theoretical analyses are performed for the degree distribution of songs. Empirical data from an online streaming service, Last.fm, are used to confirm the degree distribution of the object nodes. Simulation results show improvements from a previous model. Finally, to illustrate the application of the proposed model, a simplified royalty cost model for online music services is used to demonstrate how the changes in the proposed parameters can affect the costs for online music streaming providers. Managerial implications are also discussed.

  12. Reveal quantum correlation in complementary bases

    OpenAIRE

    Shengjun Wu; Zhihao Ma; Zhihua Chen; Sixia Yu

    2014-01-01

    An essential feature of genuine quantum correlation is the simultaneous existence of correlation in complementary bases. We reveal this feature of quantum correlation by defining measures based on invariance under a basis change. For a bipartite quantum state, the classical correlation is the maximal correlation present in a certain optimum basis, while the quantum correlation is characterized as a series of residual correlations in the mutually unbiased bases. Compared with other approaches ...

  13. Quantum communication with photons

    International Nuclear Information System (INIS)

    Tittel, W.

    2005-01-01

    Full text: The discovery that transmission of information encoded into single quantum systems enables new forms of communication let to the emergence of the domain of quantum communication. During the last ten years, various key experiments based on photons as carrier of the quantum information have been realized. Today, quantum cryptography systems based on faint laser pulses can be purchased commercially, bi-partite entanglement has been distributed over long distances and has been used for quantum key distribution, and quantum purification, teleportation and entanglement swapping have been demonstrated. I will give a general introduction into this fascinating field and will review experimental achievements in the domain of quantum communication with discrete two-level quantum systems (qubits) encoded into photons. (author)

  14. Volumes of conditioned bipartite state spaces

    International Nuclear Information System (INIS)

    Milz, Simon; Strunz, Walter T

    2015-01-01

    We analyze the metric properties of conditioned quantum state spaces M η (n×m) . These spaces are the convex sets of nm×nm density matrices that, when partially traced over m degrees of freedom, respectively yield the given n × n density matrix η. For the case n = 2, the volume of M η (2×m) equipped with the Hilbert–Schmidt measure can be conjectured to be a simple polynomial of the radius of η in the Bloch-ball. Remarkably, for m=2,3 we find numerically that the probability p sep (2×m) (η) to find a separable state in M η (2×m) is independent of η (except for η pure). For m>3, the same holds for p PosPart (2×m) (η), the probability to find a state with a positive partial transpose in M η (2×m) . These results are proven analytically for the case of the family of 4 × 4 X-states, and thoroughly numerically investigated for the general case. The important implications of these findings for the clarification of open problems in quantum theory are pointed out and discussed. (paper)

  15. Quantum

    CERN Document Server

    Al-Khalili, Jim

    2003-01-01

    In this lively look at quantum science, a physicist takes you on an entertaining and enlightening journey through the basics of subatomic physics. Along the way, he examines the paradox of quantum mechanics--beautifully mathematical in theory but confoundingly unpredictable in the real world. Marvel at the Dual Slit experiment as a tiny atom passes through two separate openings at the same time. Ponder the peculiar communication of quantum particles, which can remain in touch no matter how far apart. Join the genius jewel thief as he carries out a quantum measurement on a diamond without ever touching the object in question. Baffle yourself with the bizzareness of quantum tunneling, the equivalent of traveling partway up a hill, only to disappear then reappear traveling down the opposite side. With its clean, colorful layout and conversational tone, this text will hook you into the conundrum that is quantum mechanics.

  16. Emergent bipartiteness in a society of knights and knaves

    International Nuclear Information System (INIS)

    Del Genio, C I; Gross, T

    2011-01-01

    We propose a simple model of a social network based on the so-called knights-and-knaves puzzles. The model describes the formation of networks between two classes of agents where links are formed by agents introducing their neighbors to others of their own class. We show that if the proportion of knights and knaves is within a certain range, the network self-organizes to a perfectly bipartite state. However, if the excess of one of the two classes is greater than a threshold value, bipartiteness is not observed. We offer a detailed theoretical analysis of the behavior of the model, investigate its behavior in the thermodynamic limit and argue that it provides a simple example of a topology-driven model whose behavior is strongly reminiscent of first-order phase transitions far from equilibrium. (paper)

  17. Ultrafast all-optical switching and error-free 10 Gbit/s wavelength conversion in hybrid InP-silicon on insulator nanocavities using surface quantum wells

    Energy Technology Data Exchange (ETDEWEB)

    Bazin, Alexandre; Monnier, Paul; Beaudoin, Grégoire; Sagnes, Isabelle; Raj, Rama [Laboratoire de Photonique et de Nanostructures (CNRS UPR20), Route de Nozay, Marcoussis 91460 (France); Lenglé, Kevin; Gay, Mathilde; Bramerie, Laurent [Université Européenne de Bretagne (UEB), 5 Boulevard Laënnec, 35000 Rennes (France); CNRS-Foton Laboratory (UMR 6082), Enssat, BP 80518, 22305 Lannion Cedex (France); Braive, Rémy; Raineri, Fabrice, E-mail: fabrice.raineri@lpn.cnrs.fr [Laboratoire de Photonique et de Nanostructures (CNRS UPR20), Route de Nozay, Marcoussis 91460 (France); Université Paris Diderot, Sorbonne Paris Cité, 75207 Paris Cedex 13 (France)

    2014-01-06

    Ultrafast switching with low energies is demonstrated using InP photonic crystal nanocavities embedding InGaAs surface quantum wells heterogeneously integrated to a silicon on insulator waveguide circuitry. Thanks to the engineered enhancement of surface non radiative recombination of carriers, switching time is obtained to be as fast as 10 ps. These hybrid nanostructures are shown to be capable of achieving systems level performance by demonstrating error free wavelength conversion at 10 Gbit/s with 6 mW switching powers.

  18. Complexity of Products of Some Complete and Complete Bipartite Graphs

    Directory of Open Access Journals (Sweden)

    S. N. Daoud

    2013-01-01

    Full Text Available The number of spanning trees in graphs (networks is an important invariant; it is also an important measure of reliability of a network. In this paper, we derive simple formulas of the complexity, number of spanning trees, of products of some complete and complete bipartite graphs such as cartesian product, normal product, composition product, tensor product, and symmetric product, using linear algebra and matrix analysis techniques.

  19. One-sided interval edge-colorings of bipartite graphs

    DEFF Research Database (Denmark)

    Casselgren, Carl Johan; Toft, Bjarne

    2016-01-01

    Let G be a bipartite graph with parts X and Y . An X-interval coloring of G is a proper edge coloring of G by integers such that the colors on the edges incident to any vertex in X form an interval. Denote by χ′int(G,X) the minimum k such that G has an X-interval coloring with k colors. In this p...

  20. Introduction into bi-partite networks in python

    OpenAIRE

    Kasberger, Stefan

    2016-01-01

    This essay and the related computation delivers a comprehensive introduction into the concept of bipartite networks, a class of networks whose nodes are divided into two sets and only the connection between two nodes in different sets is allowed (Easley and Kleinberg, 2010). The analysis and visualization is done in the programming language Python and offers easy to understand first steps in both fields, network analyses and python programming. As data a collaboration network of github users ...

  1. Disentangling bipartite and core-periphery structure in financial networks

    International Nuclear Information System (INIS)

    Barucca, Paolo; Lillo, Fabrizio

    2016-01-01

    A growing number of systems are represented as networks whose architecture conveys significant information and determines many of their properties. Examples of network architecture include modular, bipartite, and core-periphery structures. However inferring the network structure is a non trivial task and can depend sometimes on the chosen null model. Here we propose a method for classifying network structures and ranking its nodes in a statistically well-grounded fashion. The method is based on the use of Belief Propagation for learning through Entropy Maximization on both the Stochastic Block Model (SBM) and the degree-corrected Stochastic Block Model (dcSBM). As a specific application we show how the combined use of the two ensembles—SBM and dcSBM—allows to disentangle the bipartite and the core-periphery structure in the case of the e-MID interbank network. Specifically we find that, taking into account the degree, this interbank network is better described by a bipartite structure, while using the SBM the core-periphery structure emerges only when data are aggregated for more than a week.

  2. Grand canonical validation of the bipartite international trade network

    Science.gov (United States)

    Straka, Mika J.; Caldarelli, Guido; Saracco, Fabio

    2017-08-01

    Devising strategies for economic development in a globally competitive landscape requires a solid and unbiased understanding of countries' technological advancements and similarities among export products. Both can be addressed through the bipartite representation of the International Trade Network. In this paper, we apply the recently proposed grand canonical projection algorithm to uncover country and product communities. Contrary to past endeavors, our methodology, based on information theory, creates monopartite projections in an unbiased and analytically tractable way. Single links between countries or products represent statistically significant signals, which are not accounted for by null models such as the bipartite configuration model. We find stable country communities reflecting the socioeconomic distinction in developed, newly industrialized, and developing countries. Furthermore, we observe product clusters based on the aforementioned country groups. Our analysis reveals the existence of a complicated structure in the bipartite International Trade Network: apart from the diversification of export baskets from the most basic to the most exclusive products, we observe a statistically significant signal of an export specialization mechanism towards more sophisticated products.

  3. Grand canonical validation of the bipartite international trade network.

    Science.gov (United States)

    Straka, Mika J; Caldarelli, Guido; Saracco, Fabio

    2017-08-01

    Devising strategies for economic development in a globally competitive landscape requires a solid and unbiased understanding of countries' technological advancements and similarities among export products. Both can be addressed through the bipartite representation of the International Trade Network. In this paper, we apply the recently proposed grand canonical projection algorithm to uncover country and product communities. Contrary to past endeavors, our methodology, based on information theory, creates monopartite projections in an unbiased and analytically tractable way. Single links between countries or products represent statistically significant signals, which are not accounted for by null models such as the bipartite configuration model. We find stable country communities reflecting the socioeconomic distinction in developed, newly industrialized, and developing countries. Furthermore, we observe product clusters based on the aforementioned country groups. Our analysis reveals the existence of a complicated structure in the bipartite International Trade Network: apart from the diversification of export baskets from the most basic to the most exclusive products, we observe a statistically significant signal of an export specialization mechanism towards more sophisticated products.

  4. Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders

    Directory of Open Access Journals (Sweden)

    Salah Al-Addasi

    2008-01-01

    in which this upper bound is attained, this graph can be viewed as a generalization of the Rhombic Dodecahedron. Then we show that for any ≥2, the graph (2,2 is the unique (up to isomorphism bipartite diametrical graph of diameter 4 and partite sets of cardinalities 2 and 2, and hence in particular, for =3, the graph (6,8 which is just the Rhombic Dodecahedron is the unique (up to isomorphism bipartite diametrical graph of such a diameter and cardinalities of partite sets. Thus we complete a characterization of -graphs of diameter 4 and cardinality of the smaller partite set not exceeding 6. We prove that the neighborhoods of vertices of the larger partite set of (2,2 form a matroid whose basis graph is the hypercube . We prove that any -graph of diameter 4 is bipartite self complementary, thus in particular (2,2. Finally, we study some additional properties of (2,2 concerning the order of its automorphism group, girth, domination number, and when being Eulerian.

  5. From quantum coherence to quantum correlations

    Science.gov (United States)

    Sun, Yuan; Mao, Yuanyuan; Luo, Shunlong

    2017-06-01

    In quantum mechanics, quantum coherence of a state relative to a quantum measurement can be identified with the quantumness that has to be destroyed by the measurement. In particular, quantum coherence of a bipartite state relative to a local quantum measurement encodes quantum correlations in the state. If one takes minimization with respect to the local measurements, then one is led to quantifiers which capture quantum correlations from the perspective of coherence. In this vein, quantum discord, which quantifies the minimal correlations that have to be destroyed by quantum measurements, can be identified as the minimal coherence, with the coherence measured by the relative entropy of coherence. To advocate and formulate this idea in a general context, we first review coherence relative to Lüders measurements which extends the notion of coherence relative to von Neumann measurements (or equivalently, orthonomal bases), and highlight the observation that quantum discord arises as minimal coherence through two prototypical examples. Then, we introduce some novel measures of quantum correlations in terms of coherence, illustrate them through examples, investigate their fundamental properties and implications, and indicate their applications to quantum metrology.

  6. Robustness of quantum correlations against linear noise

    International Nuclear Information System (INIS)

    Guo, Zhihua; Cao, Huaixin; Qu, Shixian

    2016-01-01

    Relative robustness of quantum correlations (RRoQC) of a bipartite state is firstly introduced relative to a classically correlated state. Robustness of quantum correlations (RoQC) of a bipartite state is then defined as the minimum of RRoQC of the state relative to all classically correlated ones. It is proved that as a function on quantum states, RoQC is nonnegative, lower semi-continuous and neither convex nor concave; especially, it is zero if and only if the state is classically correlated. Thus, RoQC not only quantifies the endurance of quantum correlations of a state against linear noise, but also can be used to distinguish between quantum and classically correlated states. Furthermore, the effects of local quantum channels on the robustness are explored and characterized. (paper)

  7. Ground states, magnetization plateaus and bipartite entanglement of frustrated spin-1/2 Ising-Heisenberg and Heisenberg triangular tubes

    International Nuclear Information System (INIS)

    Alécio, Raphael C.; Lyra, Marcelo L.; Strečka, Jozef

    2016-01-01

    The ground-state phase diagram, magnetization process and bipartite entanglement of the frustrated spin-1/2 Ising-Heisenberg and Heisenberg triangular tube (three-leg ladder) are investigated in a non-zero external magnetic field. The exact ground-state phase diagram of the spin-1/2 Ising-Heisenberg tube with Heisenberg intra-rung and Ising inter-rung couplings consists of six distinct gapped phases, which manifest themselves in a magnetization curve as intermediate plateaus at zero, one-third and two-thirds of the saturation magnetization. Four out of six available ground states exhibit quantum entanglement between two spins from the same triangular unit evidenced by a non-zero concurrence. Density-matrix renormalization group calculations are used in order to construct the ground-state phase diagram of the analogous but purely quantum spin-1/2 Heisenberg tube with Heisenberg intra- and inter-rung couplings, which consists of four gapped and three gapless phases. The Heisenberg tube shows a continuous change of the magnetization instead of a plateau at zero magnetization, while the intermediate one-third and two-thirds plateaus may be present or not in the zero-temperature magnetization curve. - Highlights: • Ground-state properties of Ising-Heisenberg and full Heisenberg spin tubes are studied. • Phases with 1/3 and 2/3 magnetization plateaus are present in both models. • We unveil the region in the parameter space on which inter-rung quantum fluctuations are relevant. • The full Heisenberg tube exhibits quantum bipartite entanglement between intra- as well as inter-rung spins.

  8. Quantum discord as a resource for quantum cryptography.

    Science.gov (United States)

    Pirandola, Stefano

    2014-11-07

    Quantum discord is the minimal bipartite resource which is needed for a secure quantum key distribution, being a cryptographic primitive equivalent to non-orthogonality. Its role becomes crucial in device-dependent quantum cryptography, where the presence of preparation and detection noise (inaccessible to all parties) may be so strong to prevent the distribution and distillation of entanglement. The necessity of entanglement is re-affirmed in the stronger scenario of device-independent quantum cryptography, where all sources of noise are ascribed to the eavesdropper.

  9. Effect of ancilla's structure on quantum error correction using the seven-qubit Calderbank-Shor-Steane code

    International Nuclear Information System (INIS)

    Salas, P.J.; Sanz, A.L.

    2004-01-01

    In this work we discuss the ability of different types of ancillas to control the decoherence of a qubit interacting with an environment. The error is introduced into the numerical simulation via a depolarizing isotropic channel. The ranges of values considered are 10 -4 ≤ε≤10 -2 for memory errors and 3x10 -5 ≤γ/7≤10 -2 for gate errors. After the correction we calculate the fidelity as a quality criterion for the qubit recovered. We observe that a recovery method with a three-qubit ancilla provides reasonably good results bearing in mind its economy. If we want to go further, we have to use fault tolerant ancillas with a high degree of parallelism, even if this condition implies introducing additional ancilla verification qubits

  10. Geometric measure of quantum discord and total quantum correlations in an N-partite quantum state

    International Nuclear Information System (INIS)

    Hassan, Ali Saif M; Joag, Pramod S

    2012-01-01

    Quantum discord, as introduced by Ollivier and Zurek (2001 Phys. Rev. Lett. 88 017901), is a measure of the discrepancy between quantum versions of two classically equivalent expressions for mutual information and is found to be useful in quantification and application of quantum correlations in mixed states. It is viewed as a key resource present in certain quantum communication tasks and quantum computational models without containing much entanglement. An early step toward the quantification of quantum discord in a quantum state was by Dakic et al (2010 Phys. Rev. Lett. 105 190502) who introduced a geometric measure of quantum discord and derived an explicit formula for any two-qubit state. Recently, Luo and Fu (2010 Phys. Rev. A 82 034302) introduced a generic form of the geometric measure of quantum discord for a bipartite quantum state. We extend these results and find generic forms of the geometric measure of quantum discord and total quantum correlations in a general N-partite quantum state. Further, we obtain computable exact formulas for the geometric measure of quantum discord and total quantum correlations in an N-qubit quantum state. The exact formulas for the N-qubit quantum state can be used to get experimental estimates of the quantum discord and the total quantum correlation. (paper)

  11. Efficient quantum circuits for Szegedy quantum walks

    International Nuclear Information System (INIS)

    Loke, T.; Wang, J.B.

    2017-01-01

    A major advantage in using Szegedy’s formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov chain on a directed or weighted graph. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two classes of Markov chains that are amenable to this construction are cyclic permutations and complete bipartite graphs, for which we provide explicit efficient quantum circuit implementations. We also prove that our scheme can be applied to Markov chains formed by a tensor product. We also briefly discuss the implementation of Markov chains based on weighted interdependent networks. In addition, we apply this scheme to construct efficient quantum circuits simulating the Szegedy walks used in the quantum Pagerank algorithm for some classes of non-trivial graphs, providing a necessary tool for experimental demonstration of the quantum Pagerank algorithm. - Highlights: • A general theoretical framework for implementing Szegedy walks using quantum circuits. • Explicit efficient quantum circuit implementation of the Szegedy walk for several classes of graphs. • Efficient implementation of Szegedy walks for quantum page-ranking of a certain class of graphs.

  12. Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity and Efficient Estimators (Open Access, Publisher’s Version)

    Science.gov (United States)

    2012-09-27

    ultralong lifetimes and their tomographic state analysis Phys. Rev. Lett. 92 220402 [7] Resch K J, Walther P and Zeilinger A 2005 Full characterization...of a three-photon Greenberger– Horne– Zeilinger state using quantum state tomography Phys. Rev. Lett. 94 070402 [8] Häffner H et al 2005 Scalable...Iterative algorithm for reconstruction of entangled states Phys. Rev. A 63 040303 [74] Molina-Terriza G, Vaziri A, Řeháček J, Hradil Z and Zeilinger

  13. Traumatic separation of a type I patella bipartite in a sportsman

    DEFF Research Database (Denmark)

    Ottesen, Casper Smedegaard; Barfod, Kristoffer Weisskirchner; Holck, Kim

    2014-01-01

    fibrocartilage was found on both parts of the patella. Asymptomatic patella bi-partite was found on X-ray imaging of the patient's left knee, and he was diagnosed to have traumatic separation of a type I patella bipartite. The diagnosis was confirmed by surgical and radiological findings....

  14. Mutually Unbiased Maximally Entangled Bases for the Bipartite System Cd⊗ C^{dk}

    Science.gov (United States)

    Nan, Hua; Tao, Yuan-Hong; Wang, Tian-Jiao; Zhang, Jun

    2016-10-01

    The construction of maximally entangled bases for the bipartite system Cd⊗ Cd is discussed firstly, and some mutually unbiased bases with maximally entangled bases are given, where 2≤ d≤5. Moreover, we study a systematic way of constructing mutually unbiased maximally entangled bases for the bipartite system Cd⊗ C^{dk}.

  15. Quantum Computer Science

    Science.gov (United States)

    Mermin, N. David

    2007-08-01

    Preface; 1. Cbits and Qbits; 2. General features and some simple examples; 3. Breaking RSA encryption with a quantum computer; 4. Searching with a quantum computer; 5. Quantum error correction; 6. Protocols that use just a few Qbits; Appendices; Index.

  16. Functional analysis of bipartite begomovirus coat protein promoter sequences

    International Nuclear Information System (INIS)

    Lacatus, Gabriela; Sunter, Garry

    2008-01-01

    We demonstrate that the AL2 gene of Cabbage leaf curl virus (CaLCuV) activates the CP promoter in mesophyll and acts to derepress the promoter in vascular tissue, similar to that observed for Tomato golden mosaic virus (TGMV). Binding studies indicate that sequences mediating repression and activation of the TGMV and CaLCuV CP promoter specifically bind different nuclear factors common to Nicotiana benthamiana, spinach and tomato. However, chromatin immunoprecipitation demonstrates that TGMV AL2 can interact with both sequences independently. Binding of nuclear protein(s) from different crop species to viral sequences conserved in both bipartite and monopartite begomoviruses, including TGMV, CaLCuV, Pepper golden mosaic virus and Tomato yellow leaf curl virus suggests that bipartite begomoviruses bind common host factors to regulate the CP promoter. This is consistent with a model in which AL2 interacts with different components of the cellular transcription machinery that bind viral sequences important for repression and activation of begomovirus CP promoters

  17. Faster Double-Size Bipartite Multiplication out of Montgomery Multipliers

    Science.gov (United States)

    Yoshino, Masayuki; Okeya, Katsuyuki; Vuillaume, Camille

    This paper proposes novel algorithms for computing double-size modular multiplications with few modulus-dependent precomputations. Low-end devices such as smartcards are usually equipped with hardware Montgomery multipliers. However, due to progresses of mathematical attacks, security institutions such as NIST have steadily demanded longer bit-lengths for public-key cryptography, making the multipliers quickly obsolete. In an attempt to extend the lifespan of such multipliers, double-size techniques compute modular multiplications with twice the bit-length of the multipliers. Techniques are known for extending the bit-length of classical Euclidean multipliers, of Montgomery multipliers and the combination thereof, namely bipartite multipliers. However, unlike classical and bipartite multiplications, Montgomery multiplications involve modulus-dependent precomputations, which amount to a large part of an RSA encryption or signature verification. The proposed double-size technique simulates double-size multiplications based on single-size Montgomery multipliers, and yet precomputations are essentially free: in an 2048-bit RSA encryption or signature verification with public exponent e=216+1, the proposal with a 1024-bit Montgomery multiplier is at least 1.5 times faster than previous double-size Montgomery multiplications.

  18. Uncovering collective listening habits and music genres in bipartite networks

    Science.gov (United States)

    Lambiotte, R.; Ausloos, M.

    2005-12-01

    In this paper, we analyze web-downloaded data on people sharing their music library, that we use as their individual musical signatures. The system is represented by a bipartite network, nodes being the music groups and the listeners. Music groups’ audience size behaves like a power law, but the individual music library size is an exponential with deviations at small values. In order to extract structures from the network, we focus on correlation matrices, that we filter by removing the least correlated links. This percolation idea-based method reveals the emergence of social communities and music genres, that are visualized by a branching representation. Evidence of collective listening habits that do not fit the neat usual genres defined by the music industry indicates an alternative way of classifying listeners and music groups. The structure of the network is also studied by a more refined method, based upon a random walk exploration of its properties. Finally, a personal identification-community imitation model for growing bipartite networks is outlined, following Potts ingredients. Simulation results do reproduce quite well the empirical data.

  19. Upper bounds on entangling rates of bipartite Hamiltonians

    International Nuclear Information System (INIS)

    Bravyi, Sergey

    2007-01-01

    We discuss upper bounds on the rate at which unitary evolution governed by a nonlocal Hamiltonian can generate entanglement in a bipartite system. Given a bipartite Hamiltonian H coupling two finite dimensional particles A and B, the entangling rate is shown to be upper bounded by c log(d) parallel H parallel, where d is the smallest dimension of the interacting particles parallel H parallel is the operator norm of H, and c is a constant close to 1. Under certain restrictions on the initial state we prove an analogous upper bound for the ancilla-assisted entangling rate with a constant c that does not depend upon dimensions of local ancillas. The restriction is that the initial state has at most two distinct Schmidt coefficients (each coefficient may have arbitrarily large multiplicity). Our proof is based on analysis of a mixing rate - a functional measuring how fast entropy can be produced if one mixes a time-independent state with a state evolving unitarily

  20. Cumulative quantum work-deficit versus entanglement in the dynamics of an infinite spin chain

    Energy Technology Data Exchange (ETDEWEB)

    Dhar, Himadri Shekhar [School of Physical Sciences, Jawaharlal Nehru University, New Delhi 110067 (India); Ghosh, Rupamanjari [School of Physical Sciences, Jawaharlal Nehru University, New Delhi 110067 (India); School of Natural Sciences, Shiv Nadar University, Gautam Budh Nagar, UP 203207 (India); Sen, Aditi [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Sen, Ujjwal, E-mail: ujjwal@hri.res.in [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India)

    2014-03-01

    We find that the dynamical phase transition (DPT) in nearest-neighbor bipartite entanglement of time-evolved states of the anisotropic infinite quantum XY spin chain, in a transverse time-dependent magnetic field, can be quantitatively characterized by the dynamics of an information-theoretic quantum correlation measure, namely, quantum work-deficit (QWD). We show that only those nonequilibrium states exhibit entanglement resurrection after death, on changing the field parameter during the DPT, for which the cumulative bipartite QWD is above a threshold. The results point to an interesting inter-relation between two quantum correlation measures that are conceptualized from different perspectives.

  1. Quantum teleportation of entangled squeezed vacuum states

    Institute of Scientific and Technical Information of China (English)

    蔡新华

    2003-01-01

    An optical scheme for probabilistic teleporting entangled squeezed vacuum states (SVS) is proposed. In this scheme,the teleported state is a bipartite entangled SVS,and the quantum channel is a tripartite entangled SVS.The process of the teleportation is achieved by using a 50/50 symmetric beamsplitter and photon detectors with the help of classical information.

  2. Teleportations of Mixed States and Multipartite Quantum States

    Institute of Scientific and Technical Information of China (English)

    YU Chang-Shui; WANG Ya-Hong; SONG He-Shan

    2007-01-01

    In this paper, we propose a protocol to deterministically teleport an unknown mixed state of qubit by utilizing a maximally bipartite entangled state of qubits as quantum channel. Ifa non-maximally entangled bipartite pure state is employed as quantum channel, the unknown mixed quantum state of qubit can be teleported with 1 - √1 - C2 probability, where C is the concurrence of the quantum channel. The protocol can also be generalized to teleport a mixed state of qudit or a multipartite mixed state. More important purpose is that, on the basis of the protocol, the teleportation of an arbitrary multipartite (pure or mixed) quantum state can be decomposed into the teleportation of each subsystem by employing separate entangled states as quantum channels. In the case of deterministic teleportation,Bob only needs to perform unitary transformations on his single particles in order to recover the initial teleported multipartite quantum state.

  3. Quantum Locality in Game Strategy.

    Science.gov (United States)

    Melo-Luna, Carlos A; Susa, Cristian E; Ducuara, Andrés F; Barreiro, Astrid; Reina, John H

    2017-03-22

    Game theory is a well established branch of mathematics whose formalism has a vast range of applications from the social sciences, biology, to economics. Motivated by quantum information science, there has been a leap in the formulation of novel game strategies that lead to new (quantum Nash) equilibrium points whereby players in some classical games are always outperformed if sharing and processing joint information ruled by the laws of quantum physics is allowed. We show that, for a bipartite non zero-sum game, input local quantum correlations, and separable states in particular, suffice to achieve an advantage over any strategy that uses classical resources, thus dispensing with quantum nonlocality, entanglement, or even discord between the players' input states. This highlights the remarkable key role played by pure quantum coherence at powering some protocols. Finally, we propose an experiment that uses separable states and basic photon interferometry to demonstrate the locally-correlated quantum advantage.

  4. Quantum Locality in Game Strategy

    Science.gov (United States)

    Melo-Luna, Carlos A.; Susa, Cristian E.; Ducuara, Andrés F.; Barreiro, Astrid; Reina, John H.

    2017-03-01

    Game theory is a well established branch of mathematics whose formalism has a vast range of applications from the social sciences, biology, to economics. Motivated by quantum information science, there has been a leap in the formulation of novel game strategies that lead to new (quantum Nash) equilibrium points whereby players in some classical games are always outperformed if sharing and processing joint information ruled by the laws of quantum physics is allowed. We show that, for a bipartite non zero-sum game, input local quantum correlations, and separable states in particular, suffice to achieve an advantage over any strategy that uses classical resources, thus dispensing with quantum nonlocality, entanglement, or even discord between the players’ input states. This highlights the remarkable key role played by pure quantum coherence at powering some protocols. Finally, we propose an experiment that uses separable states and basic photon interferometry to demonstrate the locally-correlated quantum advantage.

  5. Quantum correlations support probabilistic pure state cloning

    Energy Technology Data Exchange (ETDEWEB)

    Roa, Luis, E-mail: lroa@udec.cl [Departamento de Física, Universidad de Concepción, Casilla 160-C, Concepción (Chile); Alid-Vaccarezza, M.; Jara-Figueroa, C. [Departamento de Física, Universidad de Concepción, Casilla 160-C, Concepción (Chile); Klimov, A.B. [Departamento de Física, Universidad de Guadalajara, Avenida Revolución 1500, 44420 Guadalajara, Jalisco (Mexico)

    2014-02-01

    The probabilistic scheme for making two copies of two nonorthogonal pure states requires two auxiliary systems, one for copying and one for attempting to project onto the suitable subspace. The process is performed by means of a unitary-reduction scheme which allows having a success probability of cloning different from zero. The scheme becomes optimal when the probability of success is maximized. In this case, a bipartite state remains as a free degree which does not affect the probability. We find bipartite states for which the unitarity does not introduce entanglement, but does introduce quantum discord between some involved subsystems.

  6. Quantum computers and quantum computations

    International Nuclear Information System (INIS)

    Valiev, Kamil' A

    2005-01-01

    This review outlines the principles of operation of quantum computers and their elements. The theory of ideal computers that do not interact with the environment and are immune to quantum decohering processes is presented. Decohering processes in quantum computers are investigated. The review considers methods for correcting quantum computing errors arising from the decoherence of the state of the quantum computer, as well as possible methods for the suppression of the decohering processes. A brief enumeration of proposed quantum computer realizations concludes the review. (reviews of topical problems)

  7. Rendezvous effects in the diffusion process on bipartite metapopulation networks.

    Science.gov (United States)

    Cao, Lang; Li, Xun; Wang, Bing; Aihara, Kazuyuki

    2011-10-01

    Epidemic outbreaks have been shown to be closely related to the rendezvous-induced transmission of infection, which is caused by casual contact with infected individuals in public gatherings. To investigate rendezvous effects in the spread of infectious diseases, we propose an epidemic model on metapopulation networks bipartite-divided into two sets of location and rendezvous nodes. At a given transition rate γ(kk')(p), each individual transfers from location k to rendezvous p (where rendezvous-induced disease incidence occurs) and thereafter moves to location k'. We find that the eigenstructure of a transition-rate-dependent matrix determines the epidemic threshold condition. Both analytical and numerical results show that rendezvous-induced transmission accelerates the progress of infectious diseases, implying the significance of outbreak control measures including prevention of public gatherings or decentralization of a large-scale rendezvous into downsized ones.

  8. No-signaling, perfect bipartite dichotomic correlations and local randomness

    International Nuclear Information System (INIS)

    Seevinck, M. P.

    2011-01-01

    The no-signaling constraint on bi-partite correlations is reviewed. It is shown that in order to obtain non-trivial Bell-type inequalities that discern no-signaling correlations from more general ones, one must go beyond considering expectation values of products of observables only. A new set of nontrivial no-signaling inequalities is derived which have a remarkably close resemblance to the CHSH inequality, yet are fundamentally different. A set of inequalities by Roy and Singh and Avis et al., which is claimed to be useful for discerning no-signaling correlations, is shown to be trivially satisfied by any correlation whatsoever. Finally, using the set of newly derived no-signaling inequalities a result with potential cryptographic consequences is proven: if different parties use identical devices, then, once they have perfect correlations at spacelike separation between dichotomic observables, they know that because of no-signaling the local marginals cannot but be completely random.

  9. Partial recovery of entanglement in bipartite-entanglement transformations

    International Nuclear Information System (INIS)

    Bandyopadhyay, Somshubhro; Roychowdhury, Vwani; Vatan, Farrokh

    2002-01-01

    Any deterministic bipartite-entanglement transformation involving finite copies of pure states and carried out using local operations and classical communication (LOCC) results in a net loss of entanglement. We show that for almost all such transformations, partial recovery of lost entanglement is achievable by using 2x2 auxiliary entangled states, no matter how large the dimensions of the parent states are. For the rest of the special cases of deterministic LOCC transformations, we show that the dimension of the auxiliary entangled state depends on the presence of equalities in the majorization relations of the parent states. We show that genuine recovery is still possible using auxiliary states in dimensions less than that of the parent states for all patterns of majorization relations except only one special case

  10. Epidemic spread in bipartite network by considering risk awareness

    Science.gov (United States)

    Han, She; Sun, Mei; Ampimah, Benjamin Chris; Han, Dun

    2018-02-01

    Human awareness plays an important role in the spread of infectious diseases and the control of propagation patterns. Exploring the interplay between human awareness and epidemic spreading is a topic that has been receiving increasing attention. Considering the fact, some well-known diseases only spread between different species we propose a theoretical analysis of the Susceptible-Infected-Susceptible (SIS) epidemic spread from the perspective of bipartite network and risk aversion. Using mean field theory, the epidemic threshold is calculated theoretically. Simulation results are consistent with the proposed analytic model. The results show that, the final infection density is negative linear with the value of individuals' risk awareness. Therefore, the epidemic spread could be effectively suppressed by improving individuals' risk awareness.

  11. Spin-1 Dirac-Weyl fermions protected by bipartite symmetry

    Energy Technology Data Exchange (ETDEWEB)

    Lin, Zeren [College of Chemistry and Molecular Engineering, Peking University, Beijing 100871 (China); School of Physics, Peking University, Beijing 100871 (China); Liu, Zhirong, E-mail: LiuZhiRong@pku.edu.cn [College of Chemistry and Molecular Engineering, Peking University, Beijing 100871 (China); Center for Nanochemistry, Beijing National Laboratory for Molecular Sciences (BNLMS), Peking University, Beijing 100871 (China)

    2015-12-07

    We propose that bipartite symmetry allows spin-1 Dirac-Weyl points, a generalization of the spin-1/2 Dirac points in graphene, to appear as topologically protected at the Fermi level. In this spirit, we provide methodology to construct spin-1 Dirac-Weyl points of this kind in a given 2D space group and get the classification of the known spin-1 systems in the literature. We also apply the workflow to predict two new systems, P3m1-9 and P31m-15, to possess spin-1 at K/K′ in the Brillouin zone of hexagonal lattice. Their stability under various strains is investigated and compared with that of T{sub 3}, an extensively studied model of ultracold atoms trapped in optical lattice with spin-1 also at K/K′.

  12. Effect of bipartition on spectral properties of nanorings

    International Nuclear Information System (INIS)

    Gutiérrez, W.; García, L.F.; Mikhailov, I.D.

    2013-01-01

    The effects of a special topological transformation on the energy levels, far-infrared spectra and magnetization of one electron inside a semiconductor nanoring under magnetic fields are studied. We have called this transformation as bipartition, and it is defined by a change in ring topological structure, when its shape is changed successively from a single oval-shaped loop up to quasi-two disconnected loops. Our results show that in the course of such transformation the low-lying energies dependencies with multiple crossovers between them, typical for the free electron rotation along an almost circular loop, are converted into a set of non-crossing double plaits related to a sub-barrier electron tunneling along a strongly non-circular loop in a quasi-local state. Also, we find that during the restructuring of the oval-shaped nanostructures the selection rules for the dipole transitions are changed allowing the appearance of additional peaks in the FIR spectrum

  13. Entanglement dynamics of a pure bipartite system in dissipative environments

    Energy Technology Data Exchange (ETDEWEB)

    Tahira, Rabia; Ikram, Manzoor; Azim, Tasnim; Suhail Zubairy, M [Centre for Quantum Physics, COMSATS Institute of Information Technology, Islamabad (Pakistan)

    2008-10-28

    We investigate the phenomenon of sudden death of entanglement in a bipartite system subjected to dissipative environments with arbitrary initial pure entangled state between two atoms. We find that in a vacuum reservoir the presence of the state where both atoms are in excited states is a necessary condition for the sudden death of entanglement. Otherwise entanglement remains for an infinite time and decays asymptotically with the decay of individual qubits. For pure 2-qubit entangled states in a thermal environment, we observe that the sudden death of entanglement always happens. The sudden death time of the entangled states is related to the temperature of the reservoir and the initial preparation of the entangled states.

  14. Entanglement dynamics of a pure bipartite system in dissipative environments

    International Nuclear Information System (INIS)

    Tahira, Rabia; Ikram, Manzoor; Azim, Tasnim; Suhail Zubairy, M

    2008-01-01

    We investigate the phenomenon of sudden death of entanglement in a bipartite system subjected to dissipative environments with arbitrary initial pure entangled state between two atoms. We find that in a vacuum reservoir the presence of the state where both atoms are in excited states is a necessary condition for the sudden death of entanglement. Otherwise entanglement remains for an infinite time and decays asymptotically with the decay of individual qubits. For pure 2-qubit entangled states in a thermal environment, we observe that the sudden death of entanglement always happens. The sudden death time of the entangled states is related to the temperature of the reservoir and the initial preparation of the entangled states.

  15. Asystasia mosaic Madagascar virus: a novel bipartite begomovirus infecting the weed Asystasia gangetica in Madagascar.

    Science.gov (United States)

    De Bruyn, Alexandre; Harimalala, Mireille; Hoareau, Murielle; Ranomenjanahary, Sahondramalala; Reynaud, Bernard; Lefeuvre, Pierre; Lett, Jean-Michel

    2015-06-01

    Here, we describe for the first time the complete genome sequence of a new bipartite begomovirus in Madagascar isolated from the weed Asystasia gangetica (Acanthaceae), for which we propose the tentative name asystasia mosaic Madagascar virus (AMMGV). DNA-A and -B nucleotide sequences of AMMGV were only distantly related to known begomovirus sequence and shared highest nucleotide sequence identity of 72.9 % (DNA-A) and 66.9 % (DNA-B) with a recently described bipartite begomovirus infecting Asystasia sp. in West Africa. Phylogenetic analysis demonstrated that this novel virus from Madagascar belongs to a new lineage of Old World bipartite begomoviruses.

  16. Genuine quantum correlations in quantum many-body systems: a review of recent progress.

    Science.gov (United States)

    De Chiara, Gabriele; Sanpera, Anna

    2018-04-19

    Quantum information theory has considerably helped in the understanding of quantum many-body systems. The role of quantum correlations and in particular, bipartite entanglement, has become crucial to characterise, classify and simulate quantum many body systems. Furthermore, the scaling of entanglement has inspired modifications to numerical techniques for the simulation of many-body systems leading to the, now established, area of tensor networks. However, the notions and methods brought by quantum information do not end with bipartite entanglement. There are other forms of correlations embedded in the ground, excited and thermal states of quantum many-body systems that also need to be explored and might be utilised as potential resources for quantum technologies. The aim of this work is to review the most recent developments regarding correlations in quantum many-body systems focussing on multipartite entanglement, quantum nonlocality, quantum discord, mutual information but also other non classical measures of correlations based on quantum coherence. Moreover, we also discuss applications of quantum metrology in quantum many-body systems. © 2018 IOP Publishing Ltd.

  17. Hybrid quantum logic and a test of Bell's inequality using two different atomic isotopes.

    Science.gov (United States)

    Ballance, C J; Schäfer, V M; Home, J P; Szwer, D J; Webster, S C; Allcock, D T C; Linke, N M; Harty, T P; Aude Craik, D P L; Stacey, D N; Steane, A M; Lucas, D M

    2015-12-17

    Entanglement is one of the most fundamental properties of quantum mechanics, and is the key resource for quantum information processing (QIP). Bipartite entangled states of identical particles have been generated and studied in several experiments, and post-selected or heralded entangled states involving pairs of photons, single photons and single atoms, or different nuclei in the solid state, have also been produced. Here we use a deterministic quantum logic gate to generate a 'hybrid' entangled state of two trapped-ion qubits held in different isotopes of calcium, perform full tomography of the state produced, and make a test of Bell's inequality with non-identical atoms. We use a laser-driven two-qubit gate, whose mechanism is insensitive to the qubits' energy splittings, to produce a maximally entangled state of one (40)Ca(+) qubit and one (43)Ca(+) qubit, held 3.5 micrometres apart in the same ion trap, with 99.8 ± 0.6 per cent fidelity. We test the CHSH (Clauser-Horne-Shimony-Holt) version of Bell's inequality for this novel entangled state and find that it is violated by 15 standard deviations; in this test, we close the detection loophole but not the locality loophole. Mixed-species quantum logic is a powerful technique for the construction of a quantum computer based on trapped ions, as it allows protection of memory qubits while other qubits undergo logic operations or are used as photonic interfaces to other processing units. The entangling gate mechanism used here can also be applied to qubits stored in different atomic elements; this would allow both memory and logic gate errors caused by photon scattering to be reduced below the levels required for fault-tolerant quantum error correction, which is an essential prerequisite for general-purpose quantum computing.

  18. Efficient quantum circuits for Szegedy quantum walks

    Science.gov (United States)

    Loke, T.; Wang, J. B.

    2017-07-01

    A major advantage in using Szegedy's formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov chain on a directed or weighted graph. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two classes of Markov chains that are amenable to this construction are cyclic permutations and complete bipartite graphs, for which we provide explicit efficient quantum circuit implementations. We also prove that our scheme can be applied to Markov chains formed by a tensor product. We also briefly discuss the implementation of Markov chains based on weighted interdependent networks. In addition, we apply this scheme to construct efficient quantum circuits simulating the Szegedy walks used in the quantum Pagerank algorithm for some classes of non-trivial graphs, providing a necessary tool for experimental demonstration of the quantum Pagerank algorithm.

  19. Bayesian latent feature modeling for modeling bipartite networks with overlapping groups

    DEFF Research Database (Denmark)

    Jørgensen, Philip H.; Mørup, Morten; Schmidt, Mikkel Nørgaard

    2016-01-01

    Bi-partite networks are commonly modelled using latent class or latent feature models. Whereas the existing latent class models admit marginalization of parameters specifying the strength of interaction between groups, existing latent feature models do not admit analytical marginalization...... by the notion of community structure such that the edge density within groups is higher than between groups. Our model further assumes that entities can have different propensities of generating links in one of the modes. The proposed framework is contrasted on both synthetic and real bi-partite networks...... feature representations in bipartite networks provides a new framework for accounting for structure in bi-partite networks using binary latent feature representations providing interpretable representations that well characterize structure as quantified by link prediction....

  20. Communication: Toward an improved control of the fixed-node error in quantum Monte Carlo: The case of the water molecule

    International Nuclear Information System (INIS)

    Caffarel, Michel; Applencourt, Thomas; Scemama, Anthony; Giner, Emmanuel

    2016-01-01

    All-electron Fixed-node Diffusion Monte Carlo calculations for the nonrelativistic ground-state energy of the water molecule at equilibrium geometry are presented. The determinantal part of the trial wavefunction is obtained from a selected Configuration Interaction calculation [Configuration Interaction using a Perturbative Selection done Iteratively (CIPSI) method] including up to about 1.4 × 10 6 of determinants. Calculations are made using the cc-pCVnZ family of basis sets, with n = 2 to 5. In contrast with most quantum Monte Carlo works no re-optimization of the determinantal part in presence of a Jastrow is performed. For the largest cc-pCV5Z basis set the lowest upper bound for the ground-state energy reported so far of −76.437 44(18) is obtained. The fixed-node energy is found to decrease regularly as a function of the cardinal number n and the Complete Basis Set limit associated with exact nodes is easily extracted. The resulting energy of −76.438 94(12) — in perfect agreement with the best experimentally derived value — is the most accurate theoretical estimate reported so far. We emphasize that employing selected configuration interaction nodes of increasing quality in a given family of basis sets may represent a simple, deterministic, reproducible, and systematic way of controlling the fixed-node error in diffusion Monte Carlo.

  1. Communication: Toward an improved control of the fixed-node error in quantum Monte Carlo: The case of the water molecule

    Energy Technology Data Exchange (ETDEWEB)

    Caffarel, Michel; Applencourt, Thomas; Scemama, Anthony [Laboratoire de Chimie et Physique Quantique, CNRS-Université de Toulouse, Toulouse (France); Giner, Emmanuel [Dipartimento di Scienze Chimiche e Farmaceutiche, Universit degli Studi di Ferrara, Ferrara (Italy)

    2016-04-21

    All-electron Fixed-node Diffusion Monte Carlo calculations for the nonrelativistic ground-state energy of the water molecule at equilibrium geometry are presented. The determinantal part of the trial wavefunction is obtained from a selected Configuration Interaction calculation [Configuration Interaction using a Perturbative Selection done Iteratively (CIPSI) method] including up to about 1.4 × 10{sup 6} of determinants. Calculations are made using the cc-pCVnZ family of basis sets, with n = 2 to 5. In contrast with most quantum Monte Carlo works no re-optimization of the determinantal part in presence of a Jastrow is performed. For the largest cc-pCV5Z basis set the lowest upper bound for the ground-state energy reported so far of −76.437 44(18) is obtained. The fixed-node energy is found to decrease regularly as a function of the cardinal number n and the Complete Basis Set limit associated with exact nodes is easily extracted. The resulting energy of −76.438 94(12) — in perfect agreement with the best experimentally derived value — is the most accurate theoretical estimate reported so far. We emphasize that employing selected configuration interaction nodes of increasing quality in a given family of basis sets may represent a simple, deterministic, reproducible, and systematic way of controlling the fixed-node error in diffusion Monte Carlo.

  2. A Family of Bipartite |Cardinality Matching Problems Solvable in O(n\\^2) Time

    DEFF Research Database (Denmark)

    Clausen, Jens; Krarup, J.

    1995-01-01

    For a given, unweighted bipartite graph G with 2n non isolated vertices, we consider the so called bipartite cardinality matching problem (BCMP) for which the time complexity of the fastest exact algorithm available is O(n/sup 5/2/ ). We devise a greedy algorithm which either finds a perfect...... matching in O(n/sup 2/ ) time or identifies cycle of length 4 in the complement G of G...

  3. Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks

    International Nuclear Information System (INIS)

    Daminelli, Simone; Thomas, Josephine Maria; Durán, Claudio; Vittorio Cannistraci, Carlo

    2015-01-01

    Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug–target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively

  4. Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks

    Science.gov (United States)

    Daminelli, Simone; Thomas, Josephine Maria; Durán, Claudio; Vittorio Cannistraci, Carlo

    2015-11-01

    Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug-target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively

  5. Nonadditivity of quantum and classical capacities for entanglement breaking multiple-access channels and the butterfly network

    International Nuclear Information System (INIS)

    Grudka, Andrzej; Horodecki, Pawel

    2010-01-01

    We analyze quantum network primitives which are entanglement breaking. We show superadditivity of quantum and classical capacity regions for quantum multiple-access channels and the quantum butterfly network. Since the effects are especially visible at high noise they suggest that quantum information effects may be particularly helpful in the case of the networks with occasional high noise rates. The present effects provide a qualitative borderline between superadditivities of bipartite and multipartite systems.

  6. Quantum information and continuous variable systems

    International Nuclear Information System (INIS)

    Giedke, G.K.

    2001-08-01

    This thesis treats several questions concerning quantum information theory of infinite dimensional continuous variable (CV) systems. We investigate the separability properties of Gaussian states of such systems. Both the separability and the distillability problem for bipartite Gaussian states are solved by deriving operational criteria for these properties. We consider multipartite Gaussian states and obtain a necessary and sufficient condition that allows the complete classification of three-mode tripartite states according to their separability properties. Moreover we study entanglement distillation protocols. We show that the standard protocols for qubits are robust against imperfect implementation of the required quantum operations. For bipartite Gaussian states we find a universal scheme to distill all distillable states and propose a concrete quantum optical realization. (author)

  7. Error Floor Analysis of Coded Slotted ALOHA over Packet Erasure Channels

    DEFF Research Database (Denmark)

    Ivanov, Mikhail; Graell i Amat, Alexandre; Brannstrom, F.

    2014-01-01

    We present a framework for the analysis of the error floor of coded slotted ALOHA (CSA) for finite frame lengths over the packet erasure channel. The error floor is caused by stopping sets in the corresponding bipartite graph, whose enumeration is, in general, not a trivial problem. We therefore ...... identify the most dominant stopping sets for the distributions of practical interest. The derived analytical expressions allow us to accurately predict the error floor at low to moderate channel loads and characterize the unequal error protection inherent in CSA.......We present a framework for the analysis of the error floor of coded slotted ALOHA (CSA) for finite frame lengths over the packet erasure channel. The error floor is caused by stopping sets in the corresponding bipartite graph, whose enumeration is, in general, not a trivial problem. We therefore...

  8. The bipartite mitochondrial genome of Ruizia karukerae (Rhigonematomorpha, Nematoda).

    Science.gov (United States)

    Kim, Taeho; Kern, Elizabeth; Park, Chungoo; Nadler, Steven A; Bae, Yeon Jae; Park, Joong-Ki

    2018-05-10

    Mitochondrial genes and whole mitochondrial genome sequences are widely used as molecular markers in studying population genetics and resolving both deep and shallow nodes in phylogenetics. In animals the mitochondrial genome is generally composed of a single chromosome, but mystifying exceptions sometimes occur. We determined the complete mitochondrial genome of the millipede-parasitic nematode Ruizia karukerae and found its mitochondrial genome consists of two circular chromosomes, which is highly unusual in bilateral animals. Chromosome I is 7,659 bp and includes six protein-coding genes, two rRNA genes and nine tRNA genes. Chromosome II comprises 7,647 bp, with seven protein-coding genes and 16 tRNA genes. Interestingly, both chromosomes share a 1,010 bp sequence containing duplicate copies of cox2 and three tRNA genes (trnD, trnG and trnH), and the nucleotide sequences between the duplicated homologous gene copies are nearly identical, suggesting a possible recent genesis for this bipartite mitochondrial genome. Given that little is known about the formation, maintenance or evolution of abnormal mitochondrial genome structures, R. karukerae mtDNA may provide an important early glimpse into this process.

  9. Identifying online user reputation of user-object bipartite networks

    Science.gov (United States)

    Liu, Xiao-Lu; Liu, Jian-Guo; Yang, Kai; Guo, Qiang; Han, Jing-Ti

    2017-02-01

    Identifying online user reputation based on the rating information of the user-object bipartite networks is important for understanding online user collective behaviors. Based on the Bayesian analysis, we present a parameter-free algorithm for ranking online user reputation, where the user reputation is calculated based on the probability that their ratings are consistent with the main part of all user opinions. The experimental results show that the AUC values of the presented algorithm could reach 0.8929 and 0.8483 for the MovieLens and Netflix data sets, respectively, which is better than the results generated by the CR and IARR methods. Furthermore, the experimental results for different user groups indicate that the presented algorithm outperforms the iterative ranking methods in both ranking accuracy and computation complexity. Moreover, the results for the synthetic networks show that the computation complexity of the presented algorithm is a linear function of the network size, which suggests that the presented algorithm is very effective and efficient for the large scale dynamic online systems.

  10. The Random Walk Model Based on Bipartite Network

    Directory of Open Access Journals (Sweden)

    Zhang Man-Dun

    2016-01-01

    Full Text Available With the continuing development of the electronic commerce and growth of network information, there is a growing possibility for citizens to be confused by the information. Though the traditional technology of information retrieval have the ability to relieve the overload of information in some extent, it can not offer a targeted personality service based on user’s interests and activities. In this context, the recommendation algorithm arose. In this paper, on the basis of conventional recommendation, we studied the scheme of random walk based on bipartite network and the application of it. We put forward a similarity measurement based on implicit feedback. In this method, a uneven character vector is imported(the weight of item in the system. We put forward a improved random walk pattern which make use of partial or incomplete neighbor information to create recommendation information. In the end, there is an experiment in the real data set, the recommendation accuracy and practicality are improved. We promise the reality of the result of the experiment

  11. Stability of Quantum Loops and Exchange Operations in the Construction of Quantum Computation Gates

    International Nuclear Information System (INIS)

    Bermúdez, D; Delgado, F

    2017-01-01

    Quantum information and quantum computation is a rapidly emergent field where quantum systems and their applications play a central role. In the gate version of quantum computation, the construction of universal quantum gates to manipulate quantum information is currently an intensive arena for quantum engineering. Specific properties of systems should be able to reproduce such idealized gates imitating the classically inspired computational gates. Recently, for magnetic systems driven by the bipartite Heisenberg-Ising model a universal set of gates has been realized, an alternative easy design for the Boykin set but using the Bell states as grammar. Exact control can be then used to construct specific prescriptions to achieve those gates. Physical parameters impose a challenge in the gate control. This work analyzes, based on the worst case quantum fidelity, the associated instability for the proposed set of gates. An strong performance is found in those gates for the most of quantum states involved. (paper)

  12. Quantum-information processing in disordered and complex quantum systems

    International Nuclear Information System (INIS)

    Sen, Aditi; Sen, Ujjwal; Ahufinger, Veronica; Briegel, Hans J.; Sanpera, Anna; Lewenstein, Maciej

    2006-01-01

    We study quantum information processing in complex disordered many body systems that can be implemented by using lattices of ultracold atomic gases and trapped ions. We demonstrate, first in the short range case, the generation of entanglement and the local realization of quantum gates in a disordered magnetic model describing a quantum spin glass. We show that in this case it is possible to achieve fidelities of quantum gates higher than in the classical case. Complex systems with long range interactions, such as ions chains or dipolar atomic gases, can be used to model neural network Hamiltonians. For such systems, where both long range interactions and disorder appear, it is possible to generate long range bipartite entanglement. We provide an efficient analytical method to calculate the time evolution of a given initial state, which in turn allows us to calculate its quantum correlations

  13. Quantum biological information theory

    CERN Document Server

    Djordjevic, Ivan B

    2016-01-01

    This book is a self-contained, tutorial-based introduction to quantum information theory and quantum biology. It serves as a single-source reference to the topic for researchers in bioengineering, communications engineering, electrical engineering, applied mathematics, biology, computer science, and physics. The book provides all the essential principles of the quantum biological information theory required to describe the quantum information transfer from DNA to proteins, the sources of genetic noise and genetic errors as well as their effects. Integrates quantum information and quantum biology concepts; Assumes only knowledge of basic concepts of vector algebra at undergraduate level; Provides a thorough introduction to basic concepts of quantum information processing, quantum information theory, and quantum biology; Includes in-depth discussion of the quantum biological channel modelling, quantum biological channel capacity calculation, quantum models of aging, quantum models of evolution, quantum models o...

  14. Investigating Einstein-Podolsky-Rosen steering of continuous-variable bipartite states by non-Gaussian pseudospin measurements

    Science.gov (United States)

    Xiang, Yu; Xu, Buqing; Mišta, Ladislav; Tufarelli, Tommaso; He, Qiongyi; Adesso, Gerardo

    2017-10-01

    Einstein-Podolsky-Rosen (EPR) steering is an asymmetric form of correlations which is intermediate between quantum entanglement and Bell nonlocality, and can be exploited as a resource for quantum communication with one untrusted party. In particular, steering of continuous-variable Gaussian states has been extensively studied theoretically and experimentally, as a fundamental manifestation of the EPR paradox. While most of these studies focused on quadrature measurements for steering detection, two recent works revealed that there exist Gaussian states which are only steerable by suitable non-Gaussian measurements. In this paper we perform a systematic investigation of EPR steering of bipartite Gaussian states by pseudospin measurements, complementing and extending previous findings. We first derive the density-matrix elements of two-mode squeezed thermal Gaussian states in the Fock basis, which may be of independent interest. We then use such a representation to investigate steering of these states as detected by a simple nonlinear criterion, based on second moments of the correlation matrix constructed from pseudospin operators. This analysis reveals previously unexplored regimes where non-Gaussian measurements are shown to be more effective than Gaussian ones to witness steering of Gaussian states in the presence of local noise. We further consider an alternative set of pseudospin observables, whose expectation value can be expressed more compactly in terms of Wigner functions for all two-mode Gaussian states. However, according to the adopted criterion, these observables are found to be always less sensitive than conventional Gaussian observables for steering detection. Finally, we investigate continuous-variable Werner states, which are non-Gaussian mixtures of Gaussian states, and find that pseudospin measurements are always more effective than Gaussian ones to reveal their steerability. Our results provide useful insights on the role of non

  15. Quantum discord of Bell cat states under amplitude damping

    International Nuclear Information System (INIS)

    Daoud, M; Laamara, R Ahl

    2012-01-01

    The evolution of pairwise quantum correlations of Bell cat states under amplitude damping is examined using the concept of quantum discord which goes beyond entanglement. A closed expression of the quantum discord is explicitly derived. We used the Koashi–Winter relation, a relation which facilitates the optimization process of the conditional entropy. We also discuss the temporal evolution of bipartite quantum correlations under a dephasing channel and compare the behaviors of quantum discord and entanglement whose properties are characterized through the concurrence. (paper)

  16. Quantum entangling power of adiabatically connected Hamiltonians

    International Nuclear Information System (INIS)

    Hamma, Alioscia; Zanardi, Paolo

    2004-01-01

    The space of quantum Hamiltonians has a natural partition in classes of operators that can be adiabatically deformed into each other. We consider parametric families of Hamiltonians acting on a bipartite quantum state space. When the different Hamiltonians in the family fall in the same adiabatic class, one can manipulate entanglement by moving through energy eigenstates corresponding to different values of the control parameters. We introduce an associated notion of adiabatic entangling power. This novel measure is analyzed for general dxd quantum systems, and specific two-qubit examples are studied

  17. Introduction to quantum information science

    CERN Document Server

    Hayashi, Masahito; Kawachi, Akinori; Kimura, Gen; Ogawa, Tomohiro

    2015-01-01

    This book presents the basics of quantum information, e.g., foundation of quantum theory, quantum algorithms, quantum entanglement, quantum entropies, quantum coding, quantum error correction and quantum cryptography. The required knowledge is only elementary calculus and linear algebra. This way the book can be understood by undergraduate students. In order to study quantum information, one usually has to study the foundation of quantum theory. This book describes it from more an operational viewpoint which is suitable for quantum information while traditional textbooks of quantum theory lack this viewpoint. The current  book bases on Shor's algorithm, Grover's algorithm, Deutsch-Jozsa's algorithm as basic algorithms. To treat several topics in quantum information, this book covers several kinds of information quantities in quantum systems including von Neumann entropy. The limits of several kinds of quantum information processing are given. As important quantum protocols,this book contains quantum teleport...

  18. Bipartite non-classical correlations for a lossy two connected qubit-cavity systems: trace distance discord and Bell's non-locality

    Science.gov (United States)

    Mohamed, Abdel-Baset A.

    2018-04-01

    In this paper, some non-classical correlations are investigated for bipartite partitions of two qubits trapped in two spatially separated cavities connected by an optical fiber. The results show that the trace distance discord and Bell's non-locality introduce other quantum correlations beyond the entanglement. Moreover, the correlation functions of the trace distance discord and the Bell's non-locality are very sensitive to the initial correlations, the coupling strengths, and the dissipation rates of the cavities. The fluctuations of the correlation functions between their initial values and gained (loss) values appear due to the unitary evolution of the system. These fluctuations depend on the chosen initial correlations between the two subsystems. The maximal violations of Bell's inequality occur when the logarithmic negativity and the trace distance discord reach certain values. It is shown that the robustness of the non-classical correlations, against the dissipation rates of the cavities, depends on the bipartite partitions reduced density matrices of the system, and is also greatly enhanced by choosing appropriate coupling strengths.

  19. Identification and functional characterization of a novel bipartite nuclear localization sequence in ARID1A

    Energy Technology Data Exchange (ETDEWEB)

    Bateman, Nicholas W. [Women' s Health Integrated Research Center at Inova Health System, Gynecologic Cancer Center of Excellence, Annandale 22003, VA (United States); The John P. Murtha Cancer Center, Walter Reed National Military Medical Center, 8901 Wisconsin Avenue, Bethesda 20889, MD (United States); Shoji, Yutaka [Department of Obstetrics, Gynecology and Reproductive Biology, Michigan State University, Grand Rapids 49503, MI (United States); Conrads, Kelly A.; Stroop, Kevin D. [Women' s Health Integrated Research Center at Inova Health System, Gynecologic Cancer Center of Excellence, Annandale 22003, VA (United States); Hamilton, Chad A. [Women' s Health Integrated Research Center at Inova Health System, Gynecologic Cancer Center of Excellence, Annandale 22003, VA (United States); The John P. Murtha Cancer Center, Walter Reed National Military Medical Center, 8901 Wisconsin Avenue, Bethesda 20889, MD (United States); Gynecologic Oncology Service, Department of Obstetrics and Gynecology, Walter Reed National Military Medical Center, 8901 Wisconsin Ave, MD, Bethesda, 20889 (United States); Department of Obstetrics and Gynecology, Uniformed Services University of the Health Sciences, Bethesda 20814, MD (United States); Darcy, Kathleen M. [Women' s Health Integrated Research Center at Inova Health System, Gynecologic Cancer Center of Excellence, Annandale 22003, VA (United States); The John P. Murtha Cancer Center, Walter Reed National Military Medical Center, 8901 Wisconsin Avenue, Bethesda 20889, MD (United States); Maxwell, George L. [Department of Obstetrics and Gynecology, Inova Fairfax Hospital, Falls Church, VA 22042 (United States); Risinger, John I. [Department of Obstetrics, Gynecology and Reproductive Biology, Michigan State University, Grand Rapids 49503, MI (United States); and others

    2016-01-01

    AT-rich interactive domain-containing protein 1A (ARID1A) is a recently identified nuclear tumor suppressor frequently altered in solid tumor malignancies. We have identified a bipartite-like nuclear localization sequence (NLS) that contributes to nuclear import of ARID1A not previously described. We functionally confirm activity using GFP constructs fused with wild-type or mutant NLS sequences. We further show that cyto-nuclear localized, bipartite NLS mutant ARID1A exhibits greater stability than nuclear-localized, wild-type ARID1A. Identification of this undescribed functional NLS within ARID1A contributes vital insights to rationalize the impact of ARID1A missense mutations observed in patient tumors. - Highlights: • We have identified a bipartite nuclear localization sequence (NLS) in ARID1A. • Confirmation of the NLS was performed using GFP constructs. • NLS mutant ARID1A exhibits greater stability than wild-type ARID1A.

  20. Effect of the social influence on topological properties of user-object bipartite networks

    Science.gov (United States)

    Liu, Jian-Guo; Hu, Zhaolong; Guo, Qiang

    2013-11-01

    Social influence plays an important role in analyzing online users' collective behaviors [Salganik et al., Science 311, 854 (2006)]. However, the effect of the social influence from the viewpoint of theoretical model is missing. In this paper, by taking into account the social influence and users' preferences, we develop a theoretical model to analyze the topological properties of user-object bipartite networks, including the degree distribution, average nearest neighbor degree and the bipartite clustering coefficient, as well as topological properties of the original user-object networks and their unipartite projections. According to the users' preferences and the global ranking effect, we analyze the theoretical results for two benchmark data sets, Amazon and Bookcrossing, which are approximately consistent with the empirical results. This work suggests that this model is feasible to analyze topological properties of bipartite networks in terms of the social influence and the users' preferences.

  1. Complete genome sequence of a new bipartite begomovirus infecting fluted pumpkin (Telfairia occidentalis) plants in Cameroon.

    Science.gov (United States)

    Leke, Walter N; Khatabi, Behnam; Fondong, Vincent N; Brown, Judith K

    2016-08-01

    The complete genome sequence was determined and characterized for a previously unreported bipartite begomovirus from fluted pumpkin (Telfairia occidentalis, family Cucurbitaceae) plants displaying mosaic symptoms in Cameroon. The DNA-A and DNA-B components were ~2.7 kb and ~2.6 kb in size, and the arrangement of viral coding regions on the genomic components was like those characteristic of other known bipartite begomoviruses originating in the Old World. While the DNA-A component was more closely related to that of chayote yellow mosaic virus (ChaYMV), at 78 %, the DNA-B component was more closely related to that of soybean chlorotic blotch virus (SbCBV), at 64 %. This newly discovered bipartite Old World virus is herein named telfairia mosaic virus (TelMV).

  2. Quantum discord for two-qubit X states

    International Nuclear Information System (INIS)

    Ali, Mazhar; Rau, A. R. P.; Alber, G.

    2010-01-01

    Quantum discord, a kind of quantum correlation, is defined as the difference between quantum mutual information and classical correlation in a bipartite system. In general, this correlation is different from entanglement, and quantum discord may be nonzero even for certain separable states. Even in the simple case of bipartite quantum systems, this different kind of quantum correlation has interesting and significant applications in quantum information processing. So far, quantum discord has been calculated explicitly only for a rather limited set of two-qubit quantum states and expressions for more general quantum states are not known. In this article, we derive explicit expressions for quantum discord for a larger class of two-qubit states, namely, a seven-parameter family of so called X states that have been of interest in a variety of contexts in the field. We also study the relation between quantum discord, classical correlation, and entanglement for a number of two-qubit states to demonstrate that they are independent measures of correlation with no simple relative ordering between them.

  3. Quantum information processing

    National Research Council Canada - National Science Library

    Leuchs, Gerd; Beth, Thomas

    2003-01-01

    ... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.5 SimulationofHamiltonians... References... 1 1 1 3 5 8 10 2 Quantum Information Processing and Error Correction with Jump Codes (G. Alber, M. Mussinger...

  4. Quantum computing with trapped ions

    International Nuclear Information System (INIS)

    Haeffner, H.; Roos, C.F.; Blatt, R.

    2008-01-01

    Quantum computers hold the promise of solving certain computational tasks much more efficiently than classical computers. We review recent experimental advances towards a quantum computer with trapped ions. In particular, various implementations of qubits, quantum gates and some key experiments are discussed. Furthermore, we review some implementations of quantum algorithms such as a deterministic teleportation of quantum information and an error correction scheme

  5. Entanglement as a signature of quantum chaos.

    Science.gov (United States)

    Wang, Xiaoguang; Ghose, Shohini; Sanders, Barry C; Hu, Bambi

    2004-01-01

    We explore the dynamics of entanglement in classically chaotic systems by considering a multiqubit system that behaves collectively as a spin system obeying the dynamics of the quantum kicked top. In the classical limit, the kicked top exhibits both regular and chaotic dynamics depending on the strength of the chaoticity parameter kappa in the Hamiltonian. We show that the entanglement of the multiqubit system, considered for both the bipartite and the pairwise entanglement, yields a signature of quantum chaos. Whereas bipartite entanglement is enhanced in the chaotic region, pairwise entanglement is suppressed. Furthermore, we define a time-averaged entangling power and show that this entangling power changes markedly as kappa moves the system from being predominantly regular to being predominantly chaotic, thus sharply identifying the edge of chaos. When this entangling power is averaged over all states, it yields a signature of global chaos. The qualitative behavior of this global entangling power is similar to that of the classical Lyapunov exponent.

  6. An operator description of entanglement matching in quantum teleportation

    International Nuclear Information System (INIS)

    Kurucz, Z; Koniorczyk, M; Adam, P; Janszky, J

    2003-01-01

    The antilinear operator representation of bipartite pure states of the relative state formulation of quantum mechanics is applied to describe quantum teleportation schemes utilizing an arbitrary pure state as the entangled resource. Bennett type teleportation schemes with nonmaximally entangled pure states are characterized and the notion of 'entanglement matching' is introduced in general. Examples, including a scheme based on coherent-state superposition states of the electromagnetic field, are provided

  7. Bipartite consensus for multi-agent systems with antagonistic interactions and communication delays

    Science.gov (United States)

    Guo, Xing; Lu, Jianquan; Alsaedi, Ahmed; Alsaadi, Fuad E.

    2018-04-01

    This paper studies the consensus problems over signed digraphs with arbitrary finite communication delays. For the considered system, the information flow is directed and only locally delayed information can be used for each node. We derive that bipartite consensus of this system can be realized when the associated signed digraph is strongly connected. Furthermore, for structurally balanced networks, this paper studies the pinning partite consensus for the considered system. we design a pinning scheme to pin any one agent in the signed network, and obtain that the network achieves pinning bipartite consensus with any initial conditions. Finally, two examples are provided to demonstrate the effectiveness of our main results.

  8. Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue

    Directory of Open Access Journals (Sweden)

    Shu-Guang Guo

    2016-05-01

    Full Text Available Abstract A unicyclic graph is a connected graph whose number of edges is equal to the number of vertices. Fan et al. (Discrete Math. 313:903-909, 2013 and Liu et al. (Electron. J. Linear Algebra 26:333-344, 2013 determined, independently, the unique unicyclic graph whose least Q-eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with k pendant vertices. In this paper, we extend their results and determine the first three non-bipartite unicyclic graphs of order n with k pendant vertices ordering by least Q-eigenvalue.

  9. BATAS ATAS BILANGAN RAMSEY UNTUK GRAF BINTANG DAN GRAF BIPARTIT LENGKAP

    OpenAIRE

    Rosyida, Isnaini

    2008-01-01

    Misal G dan H dua buah graf sebarang, bilangan Ramsey R(G,H) adalah bilangan asli terkecil n sehingga untuk setiap graf F dengan n titik akan memuat G atau komplemen dari F memuat H. Makalah ini akan membahas batas atas dari bilangan Ramsey untuk graf bintang Sn dan graf bipartit lengkap Kp,q. Khususnya, kita akan menunjukkan batas atas dari R(Sn, K2,q) serta batas atas dari R(Sn, Kp,q) untuk n ≥ 5, 3 ≤ p ≤ n-1 dan q ≤ 2.Kata Kunci : Bilangan Ramsey, Graf Bintang dan Bipartit

  10. Congenital bipartite atlas with hypodactyly in a dog: clinical, radiographic and CT findings.

    Science.gov (United States)

    Wrzosek, M; Płonek, M; Zeira, O; Bieżyński, J; Kinda, W; Guziński, M

    2014-07-01

    A three-year-old Border collie was diagnosed with a bipartite atlas and bilateral forelimb hypodactyly. The dog showed signs of acute, non-progressive neck pain, general stiffness and right thoracic limb non-weight-bearing lameness. Computed tomography imaging revealed a bipartite atlas with abaxial vertical bone proliferation, which was the cause of the clinical signs. In addition, bilateral hypodactyly of the second and fifth digits was incidentally found. This report suggests that hypodactyly may be associated with atlas malformations. © 2014 British Small Animal Veterinary Association.

  11. Correlations in local measurements on a quantum state, and complementarity as an explanation of nonclassicality

    DEFF Research Database (Denmark)

    Wu, Shengjun; Poulsen, Uffe Vestergaard; Mølmer, Klaus

    2009-01-01

    and the classical correlations and we relate our quantitative finding to the so-called classical correlation locked in a quantum state. We derive upper bounds for the sum of classical correlation obtained by measurements in different mutually unbiased bases and we show that the complementarity gap is also present......We consider the classical correlations that two observers can extract by measurements on a bipartite quantum state and we discuss how they are related to the quantum mutual information of the state. We show with several examples how complementarity gives rise to a gap between the quantum...... in the deterministic quantum computation with one quantum bit....

  12. The study of entanglement and teleportation of the harmonic oscillator bipartite coherent states

    Directory of Open Access Journals (Sweden)

    A Rabeie and

    2015-01-01

    Full Text Available In this paper, we reproduce the harmonic oscillator bipartite coherent states with imperfect cloning of coherent states. We show that if these entangled coherent states are embedded in a vacuum environment, their entanglement is degraded but not totally lost . Also, the optimal fidelity of these states is worked out for investigating their teleportation

  13. Effects of the bipartite structure of a network on performance of recommenders

    Science.gov (United States)

    Wang, Qing-Xian; Li, Jian; Luo, Xin; Xu, Jian-Jun; Shang, Ming-Sheng

    2018-02-01

    Recommender systems aim to predict people's preferences for online items by analyzing their historical behaviors. A recommender can be modeled as a high-dimensional and sparse bipartite network, where the key issue is to understand the relation between the network structure and a recommender's performance. To address this issue, we choose three network characteristics, clustering coefficient, network density and user-item ratio, as the analyzing targets. For the cluster coefficient, we adopt the Degree-preserving rewiring algorithm to obtain a series of bipartite network with varying cluster coefficient, while the degree of user and item keep unchanged. Furthermore, five state-of-the-art recommenders are applied on two real datasets. The performances of recommenders are measured by both numerical and physical metrics. These results show that a recommender's performance is positively related to the clustering coefficient of a bipartite network. Meanwhile, higher density of a bipartite network can provide more accurate but less diverse or novel recommendations. Furthermore, the user-item ratio is positively correlated with the accuracy metrics but negatively correlated with the diverse and novel metrics.

  14. Bipartite Networks of Wikipediaʼs Articles and Authors: a Meso-level Approach

    DEFF Research Database (Denmark)

    Jesus, Rut; Hansen-Schwartz, Martin; Jørgensen, Sune Lehmann

    2009-01-01

    This exploratory study investigates the bipartite network of articles linked by common editors in Wikipedia, 'The Free Encyclopedia that Anyone Can Edit'. We use the articles in the categories (to depth three) of Physics and Philosophy and extract and focus on significant editors (at least 7 or 10...

  15. Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

    Science.gov (United States)

    Nagarathinam, R.; Parvathi, N.

    2018-04-01

    Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

  16. A simple model of bipartite cooperation for ecological and organizational networks.

    Science.gov (United States)

    Saavedra, Serguei; Reed-Tsochas, Felix; Uzzi, Brian

    2009-01-22

    In theoretical ecology, simple stochastic models that satisfy two basic conditions about the distribution of niche values and feeding ranges have proved successful in reproducing the overall structural properties of real food webs, using species richness and connectance as the only input parameters. Recently, more detailed models have incorporated higher levels of constraint in order to reproduce the actual links observed in real food webs. Here, building on previous stochastic models of consumer-resource interactions between species, we propose a highly parsimonious model that can reproduce the overall bipartite structure of cooperative partner-partner interactions, as exemplified by plant-animal mutualistic networks. Our stochastic model of bipartite cooperation uses simple specialization and interaction rules, and only requires three empirical input parameters. We test the bipartite cooperation model on ten large pollination data sets that have been compiled in the literature, and find that it successfully replicates the degree distribution, nestedness and modularity of the empirical networks. These properties are regarded as key to understanding cooperation in mutualistic networks. We also apply our model to an extensive data set of two classes of company engaged in joint production in the garment industry. Using the same metrics, we find that the network of manufacturer-contractor interactions exhibits similar structural patterns to plant-animal pollination networks. This surprising correspondence between ecological and organizational networks suggests that the simple rules of cooperation that generate bipartite networks may be generic, and could prove relevant in many different domains, ranging from biological systems to human society.

  17. Multidimensional quantum entanglement with large-scale integrated optics

    DEFF Research Database (Denmark)

    Wang, Jianwei; Paesani, Stefano; Ding, Yunhong

    2018-01-01

    -dimensional entanglement. A programmable bipartite entangled system is realized with dimension up to 15 × 15 on a large-scale silicon-photonics quantum circuit. The device integrates more than 550 photonic components on a single chip, including 16 identical photon-pair sources. We verify the high precision, generality......The ability to control multidimensional quantum systems is key for the investigation of fundamental science and for the development of advanced quantum technologies. We demonstrate a multidimensional integrated quantum photonic platform able to generate, control and analyze high...

  18. Partial list of bipartite Bell inequalities with four binary settings

    International Nuclear Information System (INIS)

    Brunner, Nicolas; Gisin, Nicolas

    2008-01-01

    We give a partial list of 26 tight Bell inequalities for the case where Alice and Bob choose among four two-outcome measurements. All tight Bell inequalities with less settings are reviewed as well. For each inequality we compute numerically the maximal quantum violation, the resistance to noise and the minimal detection efficiency required for closing the detection loophole. Surprisingly, most of these inequalities are outperformed by the CHSH inequality

  19. QUANTUM AND CLASSICAL CORRELATIONS IN GAUSSIAN OPEN QUANTUM SYSTEMS

    Directory of Open Access Journals (Sweden)

    Aurelian ISAR

    2015-01-01

    Full Text Available In the framework of the theory of open systems based on completely positive quantum dynamical semigroups, we give a description of the continuous-variable quantum correlations (quantum entanglement and quantum discord for a system consisting of two noninteracting bosonic modes embedded in a thermal environment. We solve the Kossakowski-Lindblad master equation for the time evolution of the considered system and describe the entanglement and discord in terms of the covariance matrix for Gaussian input states. For all values of the temperature of the thermal reservoir, an initial separable Gaussian state remains separable for all times. We study the time evolution of logarithmic negativity, which characterizes the degree of entanglement, and show that in the case of an entangled initial squeezed thermal state, entanglement suppression takes place for all temperatures of the environment, including zero temperature. We analyze the time evolution of the Gaussian quantum discord, which is a measure of all quantum correlations in the bipartite state, including entanglement, and show that it decays asymptotically in time under the effect of the thermal bath. This is in contrast with the sudden death of entanglement. Before the suppression of the entanglement, the qualitative evolution of quantum discord is very similar to that of the entanglement. We describe also the time evolution of the degree of classical correlations and of quantum mutual information, which measures the total correlations of the quantum system.

  20. Formation of multipartite entanglement using random quantum gates

    International Nuclear Information System (INIS)

    Most, Yonatan; Shimoni, Yishai; Biham, Ofer

    2007-01-01

    The formation of multipartite quantum entanglement by repeated operation of one- and two-qubit gates is examined. The resulting entanglement is evaluated using two measures: the average bipartite entanglement and the Groverian measure. A comparison is made between two geometries of the quantum register: a one-dimensional chain in which two-qubit gates apply only locally between nearest neighbors and a nonlocal geometry in which such gates may apply between any pair of qubits. More specifically, we use a combination of random single-qubit rotations and a fixed two-qubit gate such as the controlled-phase gate. It is found that in the nonlocal geometry the entanglement is generated at a higher rate. In both geometries, the Groverian measure converges to its asymptotic value more slowly than the average bipartite entanglement. These results are expected to have implications on different proposed geometries of future quantum computers with local and nonlocal interactions between the qubits

  1. Error Patterns

    NARCIS (Netherlands)

    Hoede, C.; Li, Z.

    2001-01-01

    In coding theory the problem of decoding focuses on error vectors. In the simplest situation code words are $(0,1)$-vectors, as are the received messages and the error vectors. Comparison of a received word with the code words yields a set of error vectors. In deciding on the original code word,

  2. Quantum steering in cascaded four-wave mixing processes.

    Science.gov (United States)

    Wang, Li; Lv, Shuchao; Jing, Jietai

    2017-07-24

    Quantum steering is used to describe the "spooky action-at-a-distance" nonlocality raised in the Einstein-Podolsky-Rosen (EPR) paradox, which is important for understanding entanglement distribution and constructing quantum networks. Here, in this paper, we study an experimentally feasible scheme for generating quantum steering based on cascaded four-wave-mixing (FWM) processes in hot rubidium (Rb) vapor. Quantum steering, including bipartite steering and genuine tripartite steering among the output light fields, is theoretically analyzed. We find the corresponding gain regions in which the bipartite and tripartite steering exist. The results of bipartite steering can be used to establish a hierarchical steering model in which one beam can steer the other two beams in the whole gain region; however, the other two beams cannot steer the first beam simultaneously. Moreover, the other two beams cannot steer with each other in the whole gain region. More importantly, we investigate the gain dependence of the existence of the genuine tripartite steering and we find that the genuine tripartite steering exists in most of the whole gain region in the ideal case. Also we discuss the effect of losses on the genuine tripartite steering. Our results pave the way to experimental demonstration of quantum steering in cascaded FWM process.

  3. Concatenated quantum codes

    Energy Technology Data Exchange (ETDEWEB)

    Knill, E.; Laflamme, R.

    1996-07-01

    One main problem for the future of practial quantum computing is to stabilize the computation against unwanted interactions with the environment and imperfections in the applied operations. Existing proposals for quantum memories and quantum channels require gates with asymptotically zero error to store or transmit an input quantum state for arbitrarily long times or distances with fixed error. This report gives a method which has the property that to store or transmit a qubit with maximum error {epsilon} requires gates with errors at most {ital c}{epsilon} and storage or channel elements with error at most {epsilon}, independent of how long we wish to store the state or how far we wish to transmit it. The method relies on using concatenated quantum codes and hierarchically implemented recovery operations. The overhead of the method is polynomial in the time of storage or the distance of the transmission. Rigorous and heuristic lower bounds for the constant {ital c} are given.

  4. Quantum Computations: Fundamentals and Algorithms

    International Nuclear Information System (INIS)

    Duplij, S.A.; Shapoval, I.I.

    2007-01-01

    Basic concepts of quantum information theory, principles of quantum calculations and the possibility of creation on this basis unique on calculation power and functioning principle device, named quantum computer, are concerned. The main blocks of quantum logic, schemes of quantum calculations implementation, as well as some known today effective quantum algorithms, called to realize advantages of quantum calculations upon classical, are presented here. Among them special place is taken by Shor's algorithm of number factorization and Grover's algorithm of unsorted database search. Phenomena of decoherence, its influence on quantum computer stability and methods of quantum errors correction are described

  5. Quantum Computing: Pro and Con

    OpenAIRE

    Preskill, John

    1997-01-01

    I assess the potential of quantum computation. Broad and important applications must be found to justify construction of a quantum computer; I review some of the known quantum algorithms and consider the prospects for finding new ones. Quantum computers are notoriously susceptible to making errors; I discuss recently developed fault-tolerant procedures that enable a quantum computer with noisy gates to perform reliably. Quantum computing hardware is still in its infancy; I comment on the spec...

  6. Layered architecture for quantum computing

    OpenAIRE

    Jones, N. Cody; Van Meter, Rodney; Fowler, Austin G.; McMahon, Peter L.; Kim, Jungsang; Ladd, Thaddeus D.; Yamamoto, Yoshihisa

    2010-01-01

    We develop a layered quantum-computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. We discuss many of the prominent techniques for implementing circuit-model quantum computing and introduce several new methods, with an emphasis on employing surface-code quantum error correction. In doing so, we propose a new quantum-computer architecture based on optical control of quantum dot...

  7. Cloning of a quantum measurement

    International Nuclear Information System (INIS)

    Bisio, Alessandro; D'Ariano, Giacomo Mauro; Perinotti, Paolo; Sedlak, Michal

    2011-01-01

    We analyze quantum algorithms for cloning of a quantum measurement. Our aim is to mimic two uses of a device performing an unknown von Neumann measurement with a single use of the device. When the unknown device has to be used before the bipartite state to be measured is available we talk about 1→2 learning of the measurement, otherwise the task is called 1→2 cloning of a measurement. We perform the optimization for both learning and cloning for arbitrary dimension d of the Hilbert space. For 1→2 cloning we also propose a simple quantum network that achieves the optimal fidelity. The optimal fidelity for 1→2 learning just slightly outperforms the estimate and prepare strategy in which one first estimates the unknown measurement and depending on the result suitably prepares the duplicate.

  8. Cloning of a quantum measurement

    Energy Technology Data Exchange (ETDEWEB)

    Bisio, Alessandro; D' Ariano, Giacomo Mauro; Perinotti, Paolo; Sedlak, Michal [QUIT Group, Dipartimento di Fisica ' ' A. Volta' ' and INFN, via Bassi 6, I-27100 Pavia (Italy); QUIT Group, Dipartimento di Fisica ' ' A. Volta' ' via Bassi 6, I-27100 Pavia (Italy) and Institute of Physics, Slovak Academy of Sciences, Dubravska cesta 9, SK-845 11 Bratislava (Slovakia)

    2011-10-15

    We analyze quantum algorithms for cloning of a quantum measurement. Our aim is to mimic two uses of a device performing an unknown von Neumann measurement with a single use of the device. When the unknown device has to be used before the bipartite state to be measured is available we talk about 1{yields}2 learning of the measurement, otherwise the task is called 1{yields}2 cloning of a measurement. We perform the optimization for both learning and cloning for arbitrary dimension d of the Hilbert space. For 1{yields}2 cloning we also propose a simple quantum network that achieves the optimal fidelity. The optimal fidelity for 1{yields}2 learning just slightly outperforms the estimate and prepare strategy in which one first estimates the unknown measurement and depending on the result suitably prepares the duplicate.

  9. Manipulating quantum information by propagation

    Energy Technology Data Exchange (ETDEWEB)

    Perales, Alvaro [Departmento de Automatica, Escuela Politecnica, Universidad de Alcala, 28871 Alcala de Henares, Madrid (Spain); Plenio, Martin B [Blackett Laboratory, Imperial College London, Prince Consort Road, London SW7 2BW (United Kingdom); Institute for Mathematical Sciences, Imperial College London, 53 Exhibition Road, London SW7 2AZ (United Kingdom)

    2005-12-01

    We study the creation of bipartite and multipartite continuous variable entanglement in structures of coupled quantum harmonic oscillators. By adjusting the interaction strengths between nearest neighbours we show how to maximize the entanglement production between the arms in a Y-shaped structure where an initial single mode squeezed state is created in the first oscillator of the input arm. We also consider the action of the same structure as an approximate quantum cloner. For a specific time in the system dynamics the last oscillators in the output arms can be considered as imperfect copies of the initial state. By increasing the number of arms in the structure, multipartite entanglement is obtained, as well as 1 {yields}M cloning. Finally, we consider configurations that implement the symmetric splitting of an initial entangled state. All calculations are carried out within the framework of the rotating wave approximation in quantum optics, and our predictions could be tested with current available experimental techniques.

  10. Conditional quantum entropy power inequality for d-level quantum systems

    Science.gov (United States)

    Jeong, Kabgyun; Lee, Soojoon; Jeong, Hyunseok

    2018-04-01

    We propose an extension of the quantum entropy power inequality for finite dimensional quantum systems, and prove a conditional quantum entropy power inequality by using the majorization relation as well as the concavity of entropic functions also given by Audenaert et al (2016 J. Math. Phys. 57 052202). Here, we make particular use of the fact that a specific local measurement after a partial swap operation (or partial swap quantum channel) acting only on finite dimensional bipartite subsystems does not affect the majorization relation for the conditional output states when a separable ancillary subsystem is involved. We expect our conditional quantum entropy power inequality to be useful, and applicable in bounding and analyzing several capacity problems for quantum channels.

  11. Heat engine driven by purely quantum information

    OpenAIRE

    Park, Jung Jun; Kim, Kang-Hwan; Sagawa, Takahiro; Kim, Sang Wook

    2013-01-01

    The key question of this paper is whether work can be extracted from a heat engine by using purely quantum mechanical information. If the answer is yes, what is its mathematical formula? First, by using a bipartite memory we show that the work extractable from a heat engine is bounded not only by the free energy change and the sum of the entropy change of an individual memory but also by the change of quantum mutual information contained inside the memory. We then find that the engine can be ...

  12. Quantum entanglement and fixed-point bifurcations

    International Nuclear Information System (INIS)

    Hines, Andrew P.; McKenzie, Ross H.; Milburn, G.J.

    2005-01-01

    How does the classical phase-space structure for a composite system relate to the entanglement characteristics of the corresponding quantum system? We demonstrate how the entanglement in nonlinear bipartite systems can be associated with a fixed-point bifurcation in the classical dynamics. Using the example of coupled giant spins we show that when a fixed point undergoes a supercritical pitchfork bifurcation, the corresponding quantum state--the ground state--achieves its maximum amount of entanglement near the critical point. We conjecture that this will be a generic feature of systems whose classical limit exhibits such a bifurcation

  13. Operator errors

    International Nuclear Information System (INIS)

    Knuefer; Lindauer

    1980-01-01

    Besides that at spectacular events a combination of component failure and human error is often found. Especially the Rasmussen-Report and the German Risk Assessment Study show for pressurised water reactors that human error must not be underestimated. Although operator errors as a form of human error can never be eliminated entirely, they can be minimized and their effects kept within acceptable limits if a thorough training of personnel is combined with an adequate design of the plant against accidents. Contrary to the investigation of engineering errors, the investigation of human errors has so far been carried out with relatively small budgets. Intensified investigations in this field appear to be a worthwhile effort. (orig.)

  14. Heat engine driven by purely quantum information.

    Science.gov (United States)

    Park, Jung Jun; Kim, Kang-Hwan; Sagawa, Takahiro; Kim, Sang Wook

    2013-12-06

    The key question of this Letter is whether work can be extracted from a heat engine by using purely quantum mechanical information. If the answer is yes, what is its mathematical formula? First, by using a bipartite memory we show that the work extractable from a heat engine is bounded not only by the free energy change and the sum of the entropy change of an individual memory but also by the change of quantum mutual information contained inside the memory. We then find that the engine can be driven by purely quantum information, expressed as the so-called quantum discord, forming a part of the quantum mutual information. To confirm it, as a physical example we present the Szilard engine containing a diatomic molecule with a semipermeable wall.

  15. Extent of multiparticle quantum nonlocality

    International Nuclear Information System (INIS)

    Jones, Nick S.; Linden, Noah; Massar, Serge

    2005-01-01

    It is well known that entangled quantum states are nonlocal: the corrrelations between local measurements carried out on these states cannot be reproduced by local hidden variable models. Svetlichny, followed by others, showed that multipartite quantum states are more nonlocal than bipartite ones in the sense that even some nonlocal classical models with (super-luminal) communication between some of the parties cannot reproduce the quantum correlations. Here we study in detail the kinds of nonlocality present in quantum states. More precisely, we enquire what kinds of classical communication patterns cannot reproduce quantum correlations. By studying the extremal points of the space of all multiparty probability distributions, in which all parties can make one of a pair of measurements each with two possible outcomes, we find a necessary condition for classical nonlocal models to reproduce the statistics of all quantum states. This condition extends and generalizes work of Svetlichny and others in which it was showed that a particular class of classical nonlocal models, the 'separable' models, cannot reproduce the statistics of all multiparticle quantum states. Our condition shows that the nonlocality present in some entangled multiparticle quantum states is much stronger than previously thought. We also study the sufficiency of our condition

  16. Comparison of the attempts of quantum discord and quantum entanglement to capture quantum correlations

    International Nuclear Information System (INIS)

    Qasimi, Asma Al-; James, Daniel F. V.

    2011-01-01

    Measurements of quantum systems disturb their states. To quantify this nonclassical characteristic, Zurek and Ollivier [Phys. Rev. Lett. 88, 017901 (2001)] introduced the quantum discord, a quantum correlation that can be nonzero even when entanglement in the system is zero. Discord has aroused great interest as a resource that is more robust against the effects of decoherence and offers the exponential speed-up of certain computational algorithms. Here, we study general two-level bipartite systems and give general results on the relationship between discord, entanglement, and linear entropy. We also identify the states for which discord takes a maximal value for a given entropy or entanglement, thus placing strong bounds on entanglement-discord and entropy-discord relations. We find out that although discord and entanglement are identical for pure states, they differ when generalized to mixed states as a result of the difference in the method of generalization.

  17. Introduction to quantum information science

    Energy Technology Data Exchange (ETDEWEB)

    Hayashi, Masahito [Nagoya Univ. (Japan). Graduate School of Mathematics; Ishizaka, Satoshi [Hiroshima Univ., Higashi-Hiroshima (Japan). Graduate School of Integrated Arts and Sciences; Kawachi, Akinori [Tokyo Institute of Technology (Japan). Dept. of Mathematical and Computing Sciences; Kimura, Gen [Shibaura Institute of Technology, Saitama (Japan). College of Systems Engineering and Science; Ogawa, Tomohiro [Univ. of Electro-Communications, Tokyo (Japan). Graduate School of Information Systems

    2015-04-01

    Presents the mathematical foundation for quantum information in a very didactic way. Summarizes all required mathematical knowledge in linear algebra. Supports teaching and learning with more than 100 exercises with solutions. Includes brief descriptions to recent results with references. This book presents the basics of quantum information, e.g., foundation of quantum theory, quantum algorithms, quantum entanglement, quantum entropies, quantum coding, quantum error correction and quantum cryptography. The required knowledge is only elementary calculus and linear algebra. This way the book can be understood by undergraduate students. In order to study quantum information, one usually has to study the foundation of quantum theory. This book describes it from more an operational viewpoint which is suitable for quantum information while traditional textbooks of quantum theory lack this viewpoint. The current book bases on Shor's algorithm, Grover's algorithm, Deutsch-Jozsa's algorithm as basic algorithms. To treat several topics in quantum information, this book covers several kinds of information quantities in quantum systems including von Neumann entropy. The limits of several kinds of quantum information processing are given. As important quantum protocols,this book contains quantum teleportation, quantum dense coding, quantum data compression. In particular conversion theory of entanglement via local operation and classical communication are treated too. This theory provides the quantification of entanglement, which coincides with von Neumann entropy. The next part treats the quantum hypothesis testing. The decision problem of two candidates of the unknown state are given. The asymptotic performance of this problem is characterized by information quantities. Using this result, the optimal performance of classical information transmission via noisy quantum channel is derived. Quantum information transmission via noisy quantum channel by quantum error

  18. Introduction to quantum information science

    International Nuclear Information System (INIS)

    Hayashi, Masahito; Ishizaka, Satoshi; Kawachi, Akinori; Kimura, Gen; Ogawa, Tomohiro

    2015-01-01

    Presents the mathematical foundation for quantum information in a very didactic way. Summarizes all required mathematical knowledge in linear algebra. Supports teaching and learning with more than 100 exercises with solutions. Includes brief descriptions to recent results with references. This book presents the basics of quantum information, e.g., foundation of quantum theory, quantum algorithms, quantum entanglement, quantum entropies, quantum coding, quantum error correction and quantum cryptography. The required knowledge is only elementary calculus and linear algebra. This way the book can be understood by undergraduate students. In order to study quantum information, one usually has to study the foundation of quantum theory. This book describes it from more an operational viewpoint which is suitable for quantum information while traditional textbooks of quantum theory lack this viewpoint. The current book bases on Shor's algorithm, Grover's algorithm, Deutsch-Jozsa's algorithm as basic algorithms. To treat several topics in quantum information, this book covers several kinds of information quantities in quantum systems including von Neumann entropy. The limits of several kinds of quantum information processing are given. As important quantum protocols,this book contains quantum teleportation, quantum dense coding, quantum data compression. In particular conversion theory of entanglement via local operation and classical communication are treated too. This theory provides the quantification of entanglement, which coincides with von Neumann entropy. The next part treats the quantum hypothesis testing. The decision problem of two candidates of the unknown state are given. The asymptotic performance of this problem is characterized by information quantities. Using this result, the optimal performance of classical information transmission via noisy quantum channel is derived. Quantum information transmission via noisy quantum channel by quantum error correction are

  19. Enhancing robustness of multiparty quantum correlations using weak measurement

    International Nuclear Information System (INIS)

    Singh, Uttam; Mishra, Utkarsh; Dhar, Himadri Shekhar

    2014-01-01

    Multipartite quantum correlations are important resources for the development of quantum information and computation protocols. However, the resourcefulness of multipartite quantum correlations in practical settings is limited by its fragility under decoherence due to environmental interactions. Though there exist protocols to protect bipartite entanglement under decoherence, the implementation of such protocols for multipartite quantum correlations has not been sufficiently explored. Here, we study the effect of local amplitude damping channel on the generalized Greenberger–Horne–Zeilinger state, and use a protocol of optimal reversal quantum weak measurement to protect the multipartite quantum correlations. We observe that the weak measurement reversal protocol enhances the robustness of multipartite quantum correlations. Further it increases the critical damping value that corresponds to entanglement sudden death. To emphasize the efficacy of the technique in protection of multipartite quantum correlation, we investigate two proximately related quantum communication tasks, namely, quantum teleportation in a one sender, many receivers setting and multiparty quantum information splitting, through a local amplitude damping channel. We observe an increase in the average fidelity of both the quantum communication tasks under the weak measurement reversal protocol. The method may prove beneficial, for combating external interactions, in other quantum information tasks using multipartite resources. - Highlights: • Extension of weak measurement reversal scheme to protect multiparty quantum correlations. • Protection of multiparty quantum correlation under local amplitude damping noise. • Enhanced fidelity of quantum teleportation in one sender and many receivers setting. • Enhanced fidelity of quantum information splitting protocol

  20. Enhancing robustness of multiparty quantum correlations using weak measurement

    Energy Technology Data Exchange (ETDEWEB)

    Singh, Uttam, E-mail: uttamsingh@hri.res.in [Quantum Information and Computation Group, Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211 019 (India); Mishra, Utkarsh, E-mail: utkarsh@hri.res.in [Quantum Information and Computation Group, Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211 019 (India); Dhar, Himadri Shekhar, E-mail: dhar.himadri@gmail.com [School of Physical Sciences, Jawaharlal Nehru University, New Delhi 110067 (India)

    2014-11-15

    Multipartite quantum correlations are important resources for the development of quantum information and computation protocols. However, the resourcefulness of multipartite quantum correlations in practical settings is limited by its fragility under decoherence due to environmental interactions. Though there exist protocols to protect bipartite entanglement under decoherence, the implementation of such protocols for multipartite quantum correlations has not been sufficiently explored. Here, we study the effect of local amplitude damping channel on the generalized Greenberger–Horne–Zeilinger state, and use a protocol of optimal reversal quantum weak measurement to protect the multipartite quantum correlations. We observe that the weak measurement reversal protocol enhances the robustness of multipartite quantum correlations. Further it increases the critical damping value that corresponds to entanglement sudden death. To emphasize the efficacy of the technique in protection of multipartite quantum correlation, we investigate two proximately related quantum communication tasks, namely, quantum teleportation in a one sender, many receivers setting and multiparty quantum information splitting, through a local amplitude damping channel. We observe an increase in the average fidelity of both the quantum communication tasks under the weak measurement reversal protocol. The method may prove beneficial, for combating external interactions, in other quantum information tasks using multipartite resources. - Highlights: • Extension of weak measurement reversal scheme to protect multiparty quantum correlations. • Protection of multiparty quantum correlation under local amplitude damping noise. • Enhanced fidelity of quantum teleportation in one sender and many receivers setting. • Enhanced fidelity of quantum information splitting protocol.

  1. Quantum computing

    International Nuclear Information System (INIS)

    Steane, Andrew

    1998-01-01

    The subject of quantum computing brings together ideas from classical information theory, computer science, and quantum physics. This review aims to summarize not just quantum computing, but the whole subject of quantum information theory. Information can be identified as the most general thing which must propagate from a cause to an effect. It therefore has a fundamentally important role in the science of physics. However, the mathematical treatment of information, especially information processing, is quite recent, dating from the mid-20th century. This has meant that the full significance of information as a basic concept in physics is only now being discovered. This is especially true in quantum mechanics. The theory of quantum information and computing puts this significance on a firm footing, and has led to some profound and exciting new insights into the natural world. Among these are the use of quantum states to permit the secure transmission of classical information (quantum cryptography), the use of quantum entanglement to permit reliable transmission of quantum states (teleportation), the possibility of preserving quantum coherence in the presence of irreversible noise processes (quantum error correction), and the use of controlled quantum evolution for efficient computation (quantum computation). The common theme of all these insights is the use of quantum entanglement as a computational resource. It turns out that information theory and quantum mechanics fit together very well. In order to explain their relationship, this review begins with an introduction to classical information theory and computer science, including Shannon's theorem, error correcting codes, Turing machines and computational complexity. The principles of quantum mechanics are then outlined, and the Einstein, Podolsky and Rosen (EPR) experiment described. The EPR-Bell correlations, and quantum entanglement in general, form the essential new ingredient which distinguishes quantum from

  2. Quantum computing

    Energy Technology Data Exchange (ETDEWEB)

    Steane, Andrew [Department of Atomic and Laser Physics, University of Oxford, Clarendon Laboratory, Oxford (United Kingdom)

    1998-02-01

    The subject of quantum computing brings together ideas from classical information theory, computer science, and quantum physics. This review aims to summarize not just quantum computing, but the whole subject of quantum information theory. Information can be identified as the most general thing which must propagate from a cause to an effect. It therefore has a fundamentally important role in the science of physics. However, the mathematical treatment of information, especially information processing, is quite recent, dating from the mid-20th century. This has meant that the full significance of information as a basic concept in physics is only now being discovered. This is especially true in quantum mechanics. The theory of quantum information and computing puts this significance on a firm footing, and has led to some profound and exciting new insights into the natural world. Among these are the use of quantum states to permit the secure transmission of classical information (quantum cryptography), the use of quantum entanglement to permit reliable transmission of quantum states (teleportation), the possibility of preserving quantum coherence in the presence of irreversible noise processes (quantum error correction), and the use of controlled quantum evolution for efficient computation (quantum computation). The common theme of all these insights is the use of quantum entanglement as a computational resource. It turns out that information theory and quantum mechanics fit together very well. In order to explain their relationship, this review begins with an introduction to classical information theory and computer science, including Shannon's theorem, error correcting codes, Turing machines and computational complexity. The principles of quantum mechanics are then outlined, and the Einstein, Podolsky and Rosen (EPR) experiment described. The EPR-Bell correlations, and quantum entanglement in general, form the essential new ingredient which distinguishes quantum from

  3. Generalized concatenated quantum codes

    International Nuclear Information System (INIS)

    Grassl, Markus; Shor, Peter; Smith, Graeme; Smolin, John; Zeng Bei

    2009-01-01

    We discuss the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we construct families of single-error-correcting nonadditive quantum codes, in both binary and nonbinary cases, which not only outperform any stabilizer codes for finite block length but also asymptotically meet the quantum Hamming bound for large block length.

  4. Quantum computing and probability.

    Science.gov (United States)

    Ferry, David K

    2009-11-25

    Over the past two decades, quantum computing has become a popular and promising approach to trying to solve computationally difficult problems. Missing in many descriptions of quantum computing is just how probability enters into the process. Here, we discuss some simple examples of how uncertainty and probability enter, and how this and the ideas of quantum computing challenge our interpretations of quantum mechanics. It is found that this uncertainty can lead to intrinsic decoherence, and this raises challenges for error correction.

  5. Quantum computing and probability

    International Nuclear Information System (INIS)

    Ferry, David K

    2009-01-01

    Over the past two decades, quantum computing has become a popular and promising approach to trying to solve computationally difficult problems. Missing in many descriptions of quantum computing is just how probability enters into the process. Here, we discuss some simple examples of how uncertainty and probability enter, and how this and the ideas of quantum computing challenge our interpretations of quantum mechanics. It is found that this uncertainty can lead to intrinsic decoherence, and this raises challenges for error correction. (viewpoint)

  6. Chimera states in bipartite networks of FitzHugh-Nagumo oscillators

    Science.gov (United States)

    Wu, Zhi-Min; Cheng, Hong-Yan; Feng, Yuee; Li, Hai-Hong; Dai, Qiong-Lin; Yang, Jun-Zhong

    2018-04-01

    Chimera states consisting of spatially coherent and incoherent domains have been observed in different topologies such as rings, spheres, and complex networks. In this paper, we investigate bipartite networks of nonlocally coupled FitzHugh-Nagumo (FHN) oscillators in which the units are allocated evenly to two layers, and FHN units interact with each other only when they are in different layers. We report the existence of chimera states in bipartite networks. Owing to the interplay between chimera states in the two layers, many types of chimera states such as in-phase chimera states, antiphase chimera states, and out-of-phase chimera states are classified. Stability diagrams of several typical chimera states in the coupling strength-coupling radius plane, which show strong multistability of chimera states, are explored.

  7. Co-clustering Analysis of Weblogs Using Bipartite Spectral Projection Approach

    DEFF Research Database (Denmark)

    Xu, Guandong; Zong, Yu; Dolog, Peter

    2010-01-01

    Web clustering is an approach for aggregating Web objects into various groups according to underlying relationships among them. Finding co-clusters of Web objects is an interesting topic in the context of Web usage mining, which is able to capture the underlying user navigational interest...... and content preference simultaneously. In this paper we will present an algorithm using bipartite spectral clustering to co-cluster Web users and pages. The usage data of users visiting Web sites is modeled as a bipartite graph and the spectral clustering is then applied to the graph representation of usage...... data. The proposed approach is evaluated by experiments performed on real datasets, and the impact of using various clustering algorithms is also investigated. Experimental results have demonstrated the employed method can effectively reveal the subset aggregates of Web users and pages which...

  8. Bipartite hallucal sesamoid bones: relationship with hallux valgus and metatarsal index

    Energy Technology Data Exchange (ETDEWEB)

    Munuera, Pedro V.; Dominguez, Gabriel [University of Seville, Department of Podiatrics, Seville (Spain); Centro Docente de Fisioterapia y Podologia, Departamento de Podologia, Seville (Spain); Reina, Maria; Trujillo, Piedad [Centro Docente de Fisioterapia y Podologia, Departamento de Podologia, Seville (Spain)

    2007-11-15

    The objective was to relate the incidence of the partition of the hallucal sesamoid bones to the size of the first metatarsal and the hallux valgus deformity. In a sample of 474 radiographs, the frequency of appearance of bipartite sesamoids was studied. The length and relative protrusion of the first metatarsal, and the hallux abductus angle, were measured and compared between the feet with and without sesamoid partition. The results showed that 14.6% of the feet studied had at least one partite sesamoid, that the sesamoid most frequently divided was the medial, and that unilateral partition was the most common. No difference was found in the incidence of partite sesamoids between men and women, or between left and right feet. Protrusion and length of the first metatarsal are greater in feet with partite sesamoids than in feet without this condition. A significantly higher incidence of bipartite medial sesamoid was obtained in feet with hallux valgus compared with normal feet. (orig.)

  9. Bipartite hallucal sesamoid bones: relationship with hallux valgus and metatarsal index

    International Nuclear Information System (INIS)

    Munuera, Pedro V.; Dominguez, Gabriel; Reina, Maria; Trujillo, Piedad

    2007-01-01

    The objective was to relate the incidence of the partition of the hallucal sesamoid bones to the size of the first metatarsal and the hallux valgus deformity. In a sample of 474 radiographs, the frequency of appearance of bipartite sesamoids was studied. The length and relative protrusion of the first metatarsal, and the hallux abductus angle, were measured and compared between the feet with and without sesamoid partition. The results showed that 14.6% of the feet studied had at least one partite sesamoid, that the sesamoid most frequently divided was the medial, and that unilateral partition was the most common. No difference was found in the incidence of partite sesamoids between men and women, or between left and right feet. Protrusion and length of the first metatarsal are greater in feet with partite sesamoids than in feet without this condition. A significantly higher incidence of bipartite medial sesamoid was obtained in feet with hallux valgus compared with normal feet. (orig.)

  10. Bipartite entangled stabilizer mutually unbiased bases as maximum cliques of Cayley graphs

    Science.gov (United States)

    van Dam, Wim; Howard, Mark

    2011-07-01

    We examine the existence and structure of particular sets of mutually unbiased bases (MUBs) in bipartite qudit systems. In contrast to well-known power-of-prime MUB constructions, we restrict ourselves to using maximally entangled stabilizer states as MUB vectors. Consequently, these bipartite entangled stabilizer MUBs (BES MUBs) provide no local information, but are sufficient and minimal for decomposing a wide variety of interesting operators including (mixtures of) Jamiołkowski states, entanglement witnesses, and more. The problem of finding such BES MUBs can be mapped, in a natural way, to that of finding maximum cliques in a family of Cayley graphs. Some relationships with known power-of-prime MUB constructions are discussed, and observables for BES MUBs are given explicitly in terms of Pauli operators.

  11. Bipartite entangled stabilizer mutually unbiased bases as maximum cliques of Cayley graphs

    International Nuclear Information System (INIS)

    Dam, Wim van; Howard, Mark

    2011-01-01

    We examine the existence and structure of particular sets of mutually unbiased bases (MUBs) in bipartite qudit systems. In contrast to well-known power-of-prime MUB constructions, we restrict ourselves to using maximally entangled stabilizer states as MUB vectors. Consequently, these bipartite entangled stabilizer MUBs (BES MUBs) provide no local information, but are sufficient and minimal for decomposing a wide variety of interesting operators including (mixtures of) Jamiolkowski states, entanglement witnesses, and more. The problem of finding such BES MUBs can be mapped, in a natural way, to that of finding maximum cliques in a family of Cayley graphs. Some relationships with known power-of-prime MUB constructions are discussed, and observables for BES MUBs are given explicitly in terms of Pauli operators.

  12. Towards a quantum internet

    Science.gov (United States)

    Dür, Wolfgang; Lamprecht, Raphael; Heusler, Stefan

    2017-07-01

    A long-range quantum communication network is among the most promising applications of emerging quantum technologies. We discuss the potential of such a quantum internet for the secure transmission of classical and quantum information, as well as theoretical and experimental approaches and recent advances to realize them. We illustrate the involved concepts such as error correction, teleportation or quantum repeaters and consider an approach to this topic based on catchy visualizations as a context-based, modern treatment of quantum theory at high school.

  13. SibRank: Signed bipartite network analysis for neighbor-based collaborative ranking

    Science.gov (United States)

    Shams, Bita; Haratizadeh, Saman

    2016-09-01

    Collaborative ranking is an emerging field of recommender systems that utilizes users' preference data rather than rating values. Unfortunately, neighbor-based collaborative ranking has gained little attention despite its more flexibility and justifiability. This paper proposes a novel framework, called SibRank that seeks to improve the state of the art neighbor-based collaborative ranking methods. SibRank represents users' preferences as a signed bipartite network, and finds similar users, through a novel personalized ranking algorithm in signed networks.

  14. Inferring monopartite projections of bipartite networks: an entropy-based approach

    Science.gov (United States)

    Saracco, Fabio; Straka, Mika J.; Di Clemente, Riccardo; Gabrielli, Andrea; Caldarelli, Guido; Squartini, Tiziano

    2017-05-01

    Bipartite networks are currently regarded as providing a major insight into the organization of many real-world systems, unveiling the mechanisms driving the interactions occurring between distinct groups of nodes. One of the most important issues encountered when modeling bipartite networks is devising a way to obtain a (monopartite) projection on the layer of interest, which preserves as much as possible the information encoded into the original bipartite structure. In the present paper we propose an algorithm to obtain statistically-validated projections of bipartite networks, according to which any two nodes sharing a statistically-significant number of neighbors are linked. Since assessing the statistical significance of nodes similarity requires a proper statistical benchmark, here we consider a set of four null models, defined within the exponential random graph framework. Our algorithm outputs a matrix of link-specific p-values, from which a validated projection is straightforwardly obtainable, upon running a multiple hypothesis testing procedure. Finally, we test our method on an economic network (i.e. the countries-products World Trade Web representation) and a social network (i.e. MovieLens, collecting the users’ ratings of a list of movies). In both cases non-trivial communities are detected: while projecting the World Trade Web on the countries layer reveals modules of similarly-industrialized nations, projecting it on the products layer allows communities characterized by an increasing level of complexity to be detected; in the second case, projecting MovieLens on the films layer allows clusters of movies whose affinity cannot be fully accounted for by genre similarity to be individuated.

  15. Some Congruence Properties of a Restricted Bipartition Function cN(n

    Directory of Open Access Journals (Sweden)

    Nipen Saikia

    2016-01-01

    Full Text Available Let cN(n denote the number of bipartitions (λ,μ of a positive integer n subject to the restriction that each part of μ is divisible by N. In this paper, we prove some congruence properties of the function cN(n for N=7, 11, and 5l, for any integer l≥1, by employing Ramanujan’s theta-function identities.

  16. iBGP: A Bipartite Graph Propagation Approach for Mobile Advertising Fraud Detection

    OpenAIRE

    Hu, Jinlong; Liang, Junjie; Dong, Shoubin

    2017-01-01

    Online mobile advertising plays a vital financial role in supporting free mobile apps, but detecting malicious apps publishers who generate fraudulent actions on the advertisements hosted on their apps is difficult, since fraudulent traffic often mimics behaviors of legitimate users and evolves rapidly. In this paper, we propose a novel bipartite graph-based propagation approach, iBGP, for mobile apps advertising fraud detection in large advertising system. We exploit the characteristics of m...

  17. Information Filtering via Clustering Coefficients of User-Object Bipartite Networks

    Science.gov (United States)

    Guo, Qiang; Leng, Rui; Shi, Kerui; Liu, Jian-Guo

    The clustering coefficient of user-object bipartite networks is presented to evaluate the overlap percentage of neighbors rating lists, which could be used to measure interest correlations among neighbor sets. The collaborative filtering (CF) information filtering algorithm evaluates a given user's interests in terms of his/her friends' opinions, which has become one of the most successful technologies for recommender systems. In this paper, different from the object clustering coefficient, users' clustering coefficients of user-object bipartite networks are introduced to improve the user similarity measurement. Numerical results for MovieLens and Netflix data sets show that users' clustering effects could enhance the algorithm performance. For MovieLens data set, the algorithmic accuracy, measured by the average ranking score, can be improved by 12.0% and the diversity could be improved by 18.2% and reach 0.649 when the recommendation list equals to 50. For Netflix data set, the accuracy could be improved by 14.5% at the optimal case and the popularity could be reduced by 13.4% comparing with the standard CF algorithm. Finally, we investigate the sparsity effect on the performance. This work indicates the user clustering coefficients is an effective factor to measure the user similarity, meanwhile statistical properties of user-object bipartite networks should be investigated to estimate users' tastes.

  18. Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games

    Science.gov (United States)

    Peña, Jorge; Rochat, Yannick

    2012-01-01

    By combining evolutionary game theory and graph theory, “games on graphs” study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of unipartite graphs, and social interactions by two-person games such as the famous prisoner’s dilemma. Unipartite graphs have also been used for modeling interactions going beyond pairwise interactions. In this paper, we argue that bipartite graphs are a better alternative to unipartite graphs for describing population structures in evolutionary multiplayer games. To illustrate this point, we make use of bipartite graphs to investigate, by means of computer simulations, the evolution of cooperation under the conventional and the distributed N-person prisoner’s dilemma. We show that several implicit assumptions arising from the standard approach based on unipartite graphs (such as the definition of replacement neighborhoods, the intertwining of individual and group diversity, and the large overlap of interaction neighborhoods) can have a large impact on the resulting evolutionary dynamics. Our work provides a clear example of the importance of construction procedures in games on graphs, of the suitability of bigraphs and hypergraphs for computational modeling, and of the importance of concepts from social network analysis such as centrality, centralization and bipartite clustering for the understanding of dynamical processes occurring on networked population structures. PMID:22970237

  19. Enhanced capital-asset pricing model for the reconstruction of bipartite financial networks

    Science.gov (United States)

    Squartini, Tiziano; Almog, Assaf; Caldarelli, Guido; van Lelyveld, Iman; Garlaschelli, Diego; Cimini, Giulio

    2017-09-01

    Reconstructing patterns of interconnections from partial information is one of the most important issues in the statistical physics of complex networks. A paramount example is provided by financial networks. In fact, the spreading and amplification of financial distress in capital markets are strongly affected by the interconnections among financial institutions. Yet, while the aggregate balance sheets of institutions are publicly disclosed, information on single positions is mostly confidential and, as such, unavailable. Standard approaches to reconstruct the network of financial interconnection produce unrealistically dense topologies, leading to a biased estimation of systemic risk. Moreover, reconstruction techniques are generally designed for monopartite networks of bilateral exposures between financial institutions, thus failing in reproducing bipartite networks of security holdings (e.g., investment portfolios). Here we propose a reconstruction method based on constrained entropy maximization, tailored for bipartite financial networks. Such a procedure enhances the traditional capital-asset pricing model (CAPM) and allows us to reproduce the correct topology of the network. We test this enhanced CAPM (ECAPM) method on a dataset, collected by the European Central Bank, of detailed security holdings of European institutional sectors over a period of six years (2009-2015). Our approach outperforms the traditional CAPM and the recently proposed maximum-entropy CAPM both in reproducing the network topology and in estimating systemic risk due to fire sales spillovers. In general, ECAPM can be applied to the whole class of weighted bipartite networks described by the fitness model.

  20. Quantumness and the role of locality on quantum correlations

    Science.gov (United States)

    Bellomo, G.; Plastino, A.; Plastino, A. R.

    2016-06-01

    Quantum correlations in a physical system are usually studied with respect to a unique and fixed decomposition of the system into subsystems, without fully exploiting the rich structure of the state space. Here, we show several examples in which the consideration of different ways to decompose a physical system enhances the quantum resources and accounts for a more flexible definition of quantumness measures. Furthermore, we give a different perspective regarding how to reassess the fact that local operations play a key role in general quantumness measures that go beyond entanglement—as discordlike ones. We propose a family of measures to quantify the maximum quantumness of a given state. For the discord-based case, we present some analytical results for 2 ×d -dimensional states. Applying our definition to low-dimensional bipartite states, we show that different behaviors can be reported for separable and entangled states vis-à-vis those corresponding to the usual measures of quantum correlations. We show that there is a close link between our proposal and the criterion to witness quantum correlations based on the rank of the correlation matrix, proposed by Dakić, Vedral, and Brukner [Phys. Rev. Lett. 105, 190502 (2010), 10.1103/PhysRevLett.105.190502].

  1. Multidimensional quantum entanglement with large-scale integrated optics.

    Science.gov (United States)

    Wang, Jianwei; Paesani, Stefano; Ding, Yunhong; Santagati, Raffaele; Skrzypczyk, Paul; Salavrakos, Alexia; Tura, Jordi; Augusiak, Remigiusz; Mančinska, Laura; Bacco, Davide; Bonneau, Damien; Silverstone, Joshua W; Gong, Qihuang; Acín, Antonio; Rottwitt, Karsten; Oxenløwe, Leif K; O'Brien, Jeremy L; Laing, Anthony; Thompson, Mark G

    2018-04-20

    The ability to control multidimensional quantum systems is central to the development of advanced quantum technologies. We demonstrate a multidimensional integrated quantum photonic platform able to generate, control, and analyze high-dimensional entanglement. A programmable bipartite entangled system is realized with dimensions up to 15 × 15 on a large-scale silicon photonics quantum circuit. The device integrates more than 550 photonic components on a single chip, including 16 identical photon-pair sources. We verify the high precision, generality, and controllability of our multidimensional technology, and further exploit these abilities to demonstrate previously unexplored quantum applications, such as quantum randomness expansion and self-testing on multidimensional states. Our work provides an experimental platform for the development of multidimensional quantum technologies. Copyright © 2018 The Authors, some rights reserved; exclusive licensee American Association for the Advancement of Science. No claim to original U.S. Government Works.

  2. Einstein's error

    International Nuclear Information System (INIS)

    Winterflood, A.H.

    1980-01-01

    In discussing Einstein's Special Relativity theory it is claimed that it violates the principle of relativity itself and that an anomalous sign in the mathematics is found in the factor which transforms one inertial observer's measurements into those of another inertial observer. The apparent source of this error is discussed. Having corrected the error a new theory, called Observational Kinematics, is introduced to replace Einstein's Special Relativity. (U.K.)

  3. Layered Architecture for Quantum Computing

    Directory of Open Access Journals (Sweden)

    N. Cody Jones

    2012-07-01

    Full Text Available We develop a layered quantum-computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. We discuss many of the prominent techniques for implementing circuit-model quantum computing and introduce several new methods, with an emphasis on employing surface-code quantum error correction. In doing so, we propose a new quantum-computer architecture based on optical control of quantum dots. The time scales of physical-hardware operations and logical, error-corrected quantum gates differ by several orders of magnitude. By dividing functionality into layers, we can design and analyze subsystems independently, demonstrating the value of our layered architectural approach. Using this concrete hardware platform, we provide resource analysis for executing fault-tolerant quantum algorithms for integer factoring and quantum simulation, finding that the quantum-dot architecture we study could solve such problems on the time scale of days.

  4. Local hidden variable modelling, classicality, quantum separability and the original Bell inequality

    International Nuclear Information System (INIS)

    Loubenets, Elena R

    2011-01-01

    We introduce a general condition sufficient for the validity of the original Bell inequality (1964) in a local hidden variable (LHV) frame. This condition can be checked experimentally and incorporates only as a particular case the assumption on perfect correlations or anticorrelations usually argued for this inequality in the literature. Specifying this general condition for a quantum bipartite case, we introduce the whole class of bipartite quantum states, separable and nonseparable, that (i) admit an LHV description under any bipartite measurements with two settings per site; (ii) do not necessarily exhibit perfect correlations and may even have a negative correlation function if the same quantum observable is measured at both sites, but (iii) satisfy the 'perfect correlation' version of the original Bell inequality for any three bounded quantum observables A 1 , A 2 = B 1 , B 2 at sites 'A' and 'B', respectively. Analysing the validity of this general LHV condition under classical and quantum correlation scenarios with the same physical context, we stress that, unlike the Clauser-Horne-Shimony-Holt inequality, the original Bell inequality distinguishes between classicality and quantum separability.

  5. Study on multipartite quantum states: preparation, simulation, and characterization

    International Nuclear Information System (INIS)

    Kruszynska, C.

    2009-01-01

    also study the efficiency of intermediate strategies, including sequences of purification and connection. We show that a multipartite strategy is to be used if one wishes to achieve high fidelity, whereas a bipartite strategy gives a better yield for low target fidelity. The third part focuses on the entanglement properties of pure quantum states describing n qubits. We introduce a generalization of the stabilizer formalism in which the condition that the stabilizer elements are products of local operators is relaxed. We characterize a class of generalized stabilizer states of three qubits and show that some of the entanglement properties of those states can be deduced from the particular form of a set of operators stabilizing them. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this property if one can construct out of it an orthonormal basis by applying independent local unitary operations. This implies that those states can be used to encode locally the maximum amount of $n$ bits. Examples of these states are the so--called stabilizer states, which are used for quantum error correction and one--way quantum computing. We give a simple characterization of these states and construct a complete set of commuting unitary observables which characterize the state uniquely. Furthermore we show how these states can be prepared and discuss their applications. Finally, in the last part we introduce a class of variational states to describe quantum many-body systems. This class generalizes matrix product states which underly the density-matrix renormalization group approach by combining them with weighted graph states. This new variational class of states can be thought of as being prepared from matrix product states, followed by commuting unitary operations on arbitrary constituents, hence truly generalizing both matrix product and weighted graph states. We use this class of states to

  6. Quantum Discord Determines the Interferometric Power of Quantum States

    Science.gov (United States)

    Girolami, Davide; Souza, Alexandre M.; Giovannetti, Vittorio; Tufarelli, Tommaso; Filgueiras, Jefferson G.; Sarthour, Roberto S.; Soares-Pinto, Diogo O.; Oliveira, Ivan S.; Adesso, Gerardo

    2014-05-01

    Quantum metrology exploits quantum mechanical laws to improve the precision in estimating technologically relevant parameters such as phase, frequency, or magnetic fields. Probe states are usually tailored to the particular dynamics whose parameters are being estimated. Here we consider a novel framework where quantum estimation is performed in an interferometric configuration, using bipartite probe states prepared when only the spectrum of the generating Hamiltonian is known. We introduce a figure of merit for the scheme, given by the worst-case precision over all suitable Hamiltonians, and prove that it amounts exactly to a computable measure of discord-type quantum correlations for the input probe. We complement our theoretical results with a metrology experiment, realized in a highly controllable room-temperature nuclear magnetic resonance setup, which provides a proof-of-concept demonstration for the usefulness of discord in sensing applications. Discordant probes are shown to guarantee a nonzero phase sensitivity for all the chosen generating Hamiltonians, while classically correlated probes are unable to accomplish the estimation in a worst-case setting. This work establishes a rigorous and direct operational interpretation for general quantum correlations, shedding light on their potential for quantum technology.

  7. Quantum engineering of continuous variable quantum states

    International Nuclear Information System (INIS)

    Sabuncu, Metin

    2009-01-01

    Quantum information with continuous variables is a field attracting increasing attention recently. In continuous variable quantum information one makes use of the continuous information encoded into the quadrature of a quantized light field instead of binary quantities such as the polarization state of a single photon. This brand new research area is witnessing exciting theoretical and experimental achievements such as teleportation, quantum computation and quantum error correction. The rapid development of the field is mainly due higher optical data rates and the availability of simple and efficient manipulation tools in continuous-variable quantum information processing. We in this thesis extend the work in continuous variable quantum information processing and report on novel experiments on amplification, cloning, minimal disturbance and noise erasure protocols. The promising results we obtain in these pioneering experiments indicate that the future of continuous variable quantum information is bright and many advances can be foreseen. (orig.)

  8. Quantum engineering of continuous variable quantum states

    Energy Technology Data Exchange (ETDEWEB)

    Sabuncu, Metin

    2009-10-29

    Quantum information with continuous variables is a field attracting increasing attention recently. In continuous variable quantum information one makes use of the continuous information encoded into the quadrature of a quantized light field instead of binary quantities such as the polarization state of a single photon. This brand new research area is witnessing exciting theoretical and experimental achievements such as teleportation, quantum computation and quantum error correction. The rapid development of the field is mainly due higher optical data rates and the availability of simple and efficient manipulation tools in continuous-variable quantum information processing. We in this thesis extend the work in continuous variable quantum information processing and report on novel experiments on amplification, cloning, minimal disturbance and noise erasure protocols. The promising results we obtain in these pioneering experiments indicate that the future of continuous variable quantum information is bright and many advances can be foreseen. (orig.)

  9. Modeling the dynamics of multipartite quantum systems created departing from two-level systems using general local and non-local interactions

    Science.gov (United States)

    Delgado, Francisco

    2017-12-01

    Quantum information is an emergent area merging physics, mathematics, computer science and engineering. To reach its technological goals, it is requiring adequate approaches to understand how to combine physical restrictions, computational approaches and technological requirements to get functional universal quantum information processing. This work presents the modeling and the analysis of certain general type of Hamiltonian representing several physical systems used in quantum information and establishing a dynamics reduction in a natural grammar for bipartite processing based on entangled states.

  10. Private quantum decoupling and secure disposal of information

    International Nuclear Information System (INIS)

    Buscemi, Francesco

    2009-01-01

    Given a bipartite system, correlations between its subsystems can be understood as the information that each one carries about the other. In order to give a model-independent description of secure information disposal, we propose the paradigm of private quantum decoupling, corresponding to locally reducing correlations in a given bipartite quantum state without transferring them to the environment. In this framework, the concept of private local randomness naturally arises as a resource, and total correlations are divided into eliminable and ineliminable ones. We prove upper and lower bounds on the quantity of ineliminable correlations present in an arbitrary bipartite state, and show that, in tripartite pure states, ineliminable correlations satisfy a monogamy constraint, making apparent their quantum nature. A relation with entanglement theory is provided by showing that ineliminable correlations constitute an entanglement parameter. In the limit of infinitely many copies of the initial state provided, we compute the regularized ineliminable correlations to be measured by the coherent information, which is thus equipped with a new operational interpretation. In particular, our results imply that two subsystems can be privately decoupled if their joint state is separable.

  11. Quantum Fourier Transform Over Galois Rings

    OpenAIRE

    Zhang, Yong

    2009-01-01

    Galois rings are regarded as "building blocks" of a finite commutative ring with identity. There have been many papers on classical error correction codes over Galois rings published. As an important warm-up before exploring quantum algorithms and quantum error correction codes over Galois rings, we study the quantum Fourier transform (QFT) over Galois rings and prove it can be efficiently preformed on a quantum computer. The properties of the QFT over Galois rings lead to the quantum algorit...

  12. Revealing Tripartite Quantum Discord with Tripartite Information Diagram

    Directory of Open Access Journals (Sweden)

    Wei-Ting Lee

    2017-11-01

    Full Text Available A new measure based on the tripartite information diagram is proposed for identifying quantum discord in tripartite systems. The proposed measure generalizes the mutual information underlying discord from bipartite to tripartite systems, and utilizes both one-particle and two-particle projective measurements to reveal the characteristics of the tripartite quantum discord. The feasibility of the proposed measure is demonstrated by evaluating the tripartite quantum discord for systems with states close to Greenberger–Horne–Zeilinger, W, and biseparable states. In addition, the connections between tripartite quantum discord and two other quantum correlations—namely genuine tripartite entanglement and genuine tripartite Einstein–Podolsky–Rosen steering—are briefly discussed. The present study considers the case of quantum discord in tripartite systems. However, the proposed framework can be readily extended to general N-partite systems.

  13. Non-parametric co-clustering of large scale sparse bipartite networks on the GPU

    DEFF Research Database (Denmark)

    Hansen, Toke Jansen; Mørup, Morten; Hansen, Lars Kai

    2011-01-01

    of row and column clusters from a hypothesis space of an infinite number of clusters. To reach large scale applications of co-clustering we exploit that parameter inference for co-clustering is well suited for parallel computing. We develop a generic GPU framework for efficient inference on large scale...... sparse bipartite networks and achieve a speedup of two orders of magnitude compared to estimation based on conventional CPUs. In terms of scalability we find for networks with more than 100 million links that reliable inference can be achieved in less than an hour on a single GPU. To efficiently manage...

  14. Bipartite Anterior Extraperitoneal Teratoma: Evidence for the Embryological Origins of Teratomas?

    Directory of Open Access Journals (Sweden)

    D. J. B. Keene

    2011-01-01

    Full Text Available Teratomas are thought to arise from totipotent primordial germ cells (PGCs Dehner (1983 which may miss their target destination Moore and Persaud (1984. Teratomas can occur anywhere from the brain to the coccygeal area but are usually in the midline close to the embryological position of the gonadal ridges Bale (1984, Nguyen and Laberge (2000. We report a case of a bipartite anterior extraperitoneal teratoma. This is an unusual position for a teratoma, but one which may support the “missed target” theory of embryology.

  15. Editorial Commentary: Got Evidence? What We Really Need Is an Algorithm for Treating Symptomatic Bipartite Patella.

    Science.gov (United States)

    Fithian, Donald C

    2018-05-01

    Bipartite patella is an uncommon but potentially troublesome problem for young athletes. Numerous uncontrolled retrospective studies have reported good results after various treatments. What is needed are studies that will guide workup and support treatment decisions based on the condition of the cartilage surfaces of the fragment, presence of pseudoarthrosis, and size and location of the fragment. To support decisions, we need prospective comparative studies, either randomized or, at least, prospective cohort studies that identify patients at the time of presentation, document key decision points, and follow patients to successful resolution of symptoms. Copyright © 2018 Arthroscopy Association of North America. Published by Elsevier Inc. All rights reserved.

  16. Self-healing diffusion quantum Monte Carlo algorithms: methods for direct reduction of the fermion sign error in electronic structure calculations

    International Nuclear Information System (INIS)

    Reboredo, F.A.; Hood, R.Q.; Kent, P.C.

    2009-01-01

    We develop a formalism and present an algorithm for optimization of the trial wave-function used in fixed-node diffusion quantum Monte Carlo (DMC) methods. The formalism is based on the DMC mixed estimator of the ground state probability density. We take advantage of a basic property of the walker configuration distribution generated in a DMC calculation, to (i) project-out a multi-determinant expansion of the fixed node ground state wave function and (ii) to define a cost function that relates the interacting-ground-state-fixed-node and the non-interacting trial wave functions. We show that (a) locally smoothing out the kink of the fixed-node ground-state wave function at the node generates a new trial wave function with better nodal structure and (b) we argue that the noise in the fixed-node wave function resulting from finite sampling plays a beneficial role, allowing the nodes to adjust towards the ones of the exact many-body ground state in a simulated annealing-like process. Based on these principles, we propose a method to improve both single determinant and multi-determinant expansions of the trial wave function. The method can be generalized to other wave function forms such as pfaffians. We test the method in a model system where benchmark configuration interaction calculations can be performed and most components of the Hamiltonian are evaluated analytically. Comparing the DMC calculations with the exact solutions, we find that the trial wave function is systematically improved. The overlap of the optimized trial wave function and the exact ground state converges to 100% even starting from wave functions orthogonal to the exact ground state. Similarly, the DMC total energy and density converges to the exact solutions for the model. In the optimization process we find an optimal non-interacting nodal potential of density-functional-like form whose existence was predicted in a previous publication (Phys. Rev. B 77 245110 (2008)). Tests of the method are

  17. A Heterogeneous Quantum Computer Architecture

    NARCIS (Netherlands)

    Fu, X.; Riesebos, L.; Lao, L.; Garcia Almudever, C.; Sebastiano, F.; Versluis, R.; Charbon, E.; Bertels, K.

    2016-01-01

    In this paper, we present a high level view of the heterogeneous quantum computer architecture as any future quantum computer will consist of both a classical and quantum computing part. The classical part is needed for error correction as well as for the execution of algorithms that contain both

  18. The Role of Frame Force in Quantum Detection

    National Research Council Canada - National Science Library

    Benedetto, John J; Kebo, Andrew

    2007-01-01

    .... In this paper, we focus on a quantum detection problem, where the goal is to construct a tight frame that minimizes an error term, which in quantum physics has the interpretation of the probability of a detection error...

  19. Quantum analogue computing.

    Science.gov (United States)

    Kendon, Vivien M; Nemoto, Kae; Munro, William J

    2010-08-13

    We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data are encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error-correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous-variable quantum computers, becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.

  20. A mathematical model for generating bipartite graphs and its application to protein networks

    Science.gov (United States)

    Nacher, J. C.; Ochiai, T.; Hayashida, M.; Akutsu, T.

    2009-12-01

    Complex systems arise in many different contexts from large communication systems and transportation infrastructures to molecular biology. Most of these systems can be organized into networks composed of nodes and interacting edges. Here, we present a theoretical model that constructs bipartite networks with the particular feature that the degree distribution can be tuned depending on the probability rate of fundamental processes. We then use this model to investigate protein-domain networks. A protein can be composed of up to hundreds of domains. Each domain represents a conserved sequence segment with specific functional tasks. We analyze the distribution of domains in Homo sapiens and Arabidopsis thaliana organisms and the statistical analysis shows that while (a) the number of domain types shared by k proteins exhibits a power-law distribution, (b) the number of proteins composed of k types of domains decays as an exponential distribution. The proposed mathematical model generates bipartite graphs and predicts the emergence of this mixing of (a) power-law and (b) exponential distributions. Our theoretical and computational results show that this model requires (1) growth process and (2) copy mechanism.

  1. iBGP: A Bipartite Graph Propagation Approach for Mobile Advertising Fraud Detection

    Directory of Open Access Journals (Sweden)

    Jinlong Hu

    2017-01-01

    Full Text Available Online mobile advertising plays a vital financial role in supporting free mobile apps, but detecting malicious apps publishers who generate fraudulent actions on the advertisements hosted on their apps is difficult, since fraudulent traffic often mimics behaviors of legitimate users and evolves rapidly. In this paper, we propose a novel bipartite graph-based propagation approach, iBGP, for mobile apps advertising fraud detection in large advertising system. We exploit the characteristics of mobile advertising user’s behavior and identify two persistent patterns: power law distribution and pertinence and propose an automatic initial score learning algorithm to formulate both concepts to learn the initial scores of non-seed nodes. We propose a weighted graph propagation algorithm to propagate the scores of all nodes in the user-app bipartite graphs until convergence. To extend our approach for large-scale settings, we decompose the objective function of the initial score learning model into separate one-dimensional problems and parallelize the whole approach on an Apache Spark cluster. iBGP was applied on a large synthetic dataset and a large real-world mobile advertising dataset; experiment results demonstrate that iBGP significantly outperforms other popular graph-based propagation methods.

  2. A mathematical model for generating bipartite graphs and its application to protein networks

    Energy Technology Data Exchange (ETDEWEB)

    Nacher, J C [Department of Complex Systems, Future University-Hakodate (Japan); Ochiai, T [Faculty of Engineering, Toyama Prefectural University (Japan); Hayashida, M; Akutsu, T [Bioinformatics Center, Institute for Chemical Research, Kyoto University (Japan)

    2009-12-04

    Complex systems arise in many different contexts from large communication systems and transportation infrastructures to molecular biology. Most of these systems can be organized into networks composed of nodes and interacting edges. Here, we present a theoretical model that constructs bipartite networks with the particular feature that the degree distribution can be tuned depending on the probability rate of fundamental processes. We then use this model to investigate protein-domain networks. A protein can be composed of up to hundreds of domains. Each domain represents a conserved sequence segment with specific functional tasks. We analyze the distribution of domains in Homo sapiens and Arabidopsis thaliana organisms and the statistical analysis shows that while (a) the number of domain types shared by k proteins exhibits a power-law distribution, (b) the number of proteins composed of k types of domains decays as an exponential distribution. The proposed mathematical model generates bipartite graphs and predicts the emergence of this mixing of (a) power-law and (b) exponential distributions. Our theoretical and computational results show that this model requires (1) growth process and (2) copy mechanism.

  3. A mathematical model for generating bipartite graphs and its application to protein networks

    International Nuclear Information System (INIS)

    Nacher, J C; Ochiai, T; Hayashida, M; Akutsu, T

    2009-01-01

    Complex systems arise in many different contexts from large communication systems and transportation infrastructures to molecular biology. Most of these systems can be organized into networks composed of nodes and interacting edges. Here, we present a theoretical model that constructs bipartite networks with the particular feature that the degree distribution can be tuned depending on the probability rate of fundamental processes. We then use this model to investigate protein-domain networks. A protein can be composed of up to hundreds of domains. Each domain represents a conserved sequence segment with specific functional tasks. We analyze the distribution of domains in Homo sapiens and Arabidopsis thaliana organisms and the statistical analysis shows that while (a) the number of domain types shared by k proteins exhibits a power-law distribution, (b) the number of proteins composed of k types of domains decays as an exponential distribution. The proposed mathematical model generates bipartite graphs and predicts the emergence of this mixing of (a) power-law and (b) exponential distributions. Our theoretical and computational results show that this model requires (1) growth process and (2) copy mechanism.

  4. Balanced Bipartite Graph Based Register Allocation for Network Processors in Mobile and Wireless Networks

    Directory of Open Access Journals (Sweden)

    Feilong Tang

    2010-01-01

    Full Text Available Mobile and wireless networks are the integrant infrastructure of mobile and pervasive computing that aims at providing transparent and preferred information and services for people anytime anywhere. In such environments, end-to-end network bandwidth is crucial to improve user's transparent experience when providing on-demand services such as mobile video playing. As a result, powerful computing power is required for networked nodes, especially for routers. General-purpose processors cannot meet such requirements due to their limited processing ability, and poor programmability and scalability. Intel's network processor IXP is specially designed for fast packet processing to achieve a broad bandwidth. IXP provides a large number of registers to reduce the number of memory accesses. Registers in an IXP are physically partitioned as two banks so that two source operands in an instruction have to come from the two banks respectively, which makes the IXP register allocation tricky and different from conventional ones. In this paper, we investigate an approach for efficiently generating balanced bipartite graph and register allocation algorithms for the dual-bank register allocation in IXPs. The paper presents a graph uniform 2-way partition algorithm (FPT, which provides an optimal solution to the graph partition, and a heuristic algorithm for generating balanced bipartite graph. Finally, we design a framework for IXP register allocation. Experimental results demonstrate the framework and the algorithms are efficient in register allocation for IXP network processors.

  5. Bipartite field theories: from D-brane probes to scattering amplitudes

    Science.gov (United States)

    Franco, Sebastián

    2012-11-01

    We introduce and initiate the investigation of a general class of 4d, {N}=1 quiver gauge theories whose Lagrangian is defined by a bipartite graph on a Riemann surface, with or without boundaries. We refer to such class of theories as Bipartite Field Theories (BFTs). BFTs underlie a wide spectrum of interesting physical systems, including: D3-branes probing toric Calabi-Yau 3-folds, their mirror configurations of D6-branes, cluster integrable systems in (0 + 1) dimensions and leading singularities in scattering amplitudes for {N}=4 SYM. While our discussion is fully general, we focus on models that are relevant for scattering amplitudes. We investigate the BFT perspective on graph modifications, the emergence of Calabi-Yau manifolds (which arise as the master and moduli spaces of BFTs), the translation between square moves in the graph and Seiberg duality and the identification of dual theories by means of the underlying Calabi-Yaus, the phenomenon of loop reduction and the interpretation of the boundary operator for cells in the positive Grassmannian as higgsing in the BFT. We develop a technique based on generalized Kasteleyn matrices that permits an efficient determination of the Calabi-Yau geometries associated to arbitrary graphs. Our techniques allow us to go beyond the planar limit by both increasing the number of boundaries of the graphs and the genus of the underlying Riemann surface. Our investigation suggests a central role for Calabi-Yau manifolds in the context of leading singularities, whose full scope is yet to be uncovered.

  6. Data Acquisition Based on Stable Matching of Bipartite Graph in Cooperative Vehicle-Infrastructure Systems.

    Science.gov (United States)

    Tang, Xiaolan; Hong, Donghui; Chen, Wenlong

    2017-06-08

    Existing studies on data acquisition in vehicular networks often take the mobile vehicular nodes as data carriers. However, their autonomous movements, limited resources and security risks impact the quality of services. In this article, we propose a data acquisition model using stable matching of bipartite graph in cooperative vehicle-infrastructure systems, namely, DAS. Contents are distributed to roadside units, while vehicular nodes support supplementary storage. The original distribution problem is formulated as a stable matching problem of bipartite graph, where the data and the storage cells compose two sides of vertices. Regarding the factors relevant with the access ratio and delay, the preference rankings for contents and roadside units are calculated, respectively. With a multi-replica preprocessing algorithm to handle the potential one-to-many mapping, the matching problem is addressed in polynomial time. In addition, vehicular nodes carry and forward assistant contents to deliver the failed packets because of bandwidth competition. Furthermore, an incentive strategy is put forward to boost the vehicle cooperation and to achieve a fair bandwidth allocation at roadside units. Experiments show that DAS achieves a high access ratio and a small storage cost with an acceptable delay.

  7. Locking classical correlations in quantum States.

    Science.gov (United States)

    DiVincenzo, David P; Horodecki, Michał; Leung, Debbie W; Smolin, John A; Terhal, Barbara M

    2004-02-13

    We show that there exist bipartite quantum states which contain a large locked classical correlation that is unlocked by a disproportionately small amount of classical communication. In particular, there are (2n+1)-qubit states for which a one-bit message doubles the optimal classical mutual information between measurement results on the subsystems, from n/2 bits to n bits. This phenomenon is impossible classically. However, states exhibiting this behavior need not be entangled. We study the range of states exhibiting this phenomenon and bound its magnitude.

  8. Majorization uncertainty relations for mixed quantum states

    Science.gov (United States)

    Puchała, Zbigniew; Rudnicki, Łukasz; Krawiec, Aleksandra; Życzkowski, Karol

    2018-04-01

    Majorization uncertainty relations are generalized for an arbitrary mixed quantum state ρ of a finite size N. In particular, a lower bound for the sum of two entropies characterizing the probability distributions corresponding to measurements with respect to two arbitrary orthogonal bases is derived in terms of the spectrum of ρ and the entries of a unitary matrix U relating both bases. The results obtained can also be formulated for two measurements performed on a single subsystem of a bipartite system described by a pure state, and consequently expressed as an uncertainty relation for the sum of conditional entropies.

  9. Using measurement-induced disturbance to characterize correlations as classical or quantum

    International Nuclear Information System (INIS)

    Luo Shunlong

    2008-01-01

    In contrast to the seminal entanglement-separability paradigm widely used in quantum information theory, we introduce a quantum-classical dichotomy in order to classify and quantify statistical correlations in bipartite states. This is based on the idea that while in the classical description of nature measurements can be carried out without disturbance, in the quantum description, generic measurements often disturb the system and the disturbance can be exploited to quantify the quantumness of correlations therein. It turns out that certain separable states still possess correlations of a quantum nature and indicates that quantum correlations are more general than entanglement. The results are illustrated in the Werner states and the isotropic states, and are applied to quantify the quantum advantage of the model of quantum computation proposed by Knill and Laflamme [Phys. Rev. Lett. 81, 5672 (1998)

  10. Reasonable fermionic quantum information theories require relativity

    International Nuclear Information System (INIS)

    Friis, Nicolai

    2016-01-01

    We show that any quantum information theory based on anticommuting operators must be supplemented by a superselection rule deeply rooted in relativity to establish a reasonable notion of entanglement. While quantum information may be encoded in the fermionic Fock space, the unrestricted theory has a peculiar feature: the marginals of bipartite pure states need not have identical entropies, which leads to an ambiguous definition of entanglement. We solve this problem, by proving that it is removed by relativity, i.e., by the parity superselection rule that arises from Lorentz invariance via the spin-statistics connection. Our results hence unveil a fundamental conceptual inseparability of quantum information and the causal structure of relativistic field theory. (paper)

  11. Dynamics of a complex quantum magnet

    International Nuclear Information System (INIS)

    Landry, James W.; Coppersmith, S. N.

    2003-01-01

    We have computed the low energy quantum states and low frequency dynamical susceptibility of complex quantum spin systems in the limit of strong interactions, obtaining exact results for system sizes enormously larger than accessible previously. The ground state is a complex superposition of a substantial fraction of all the classical ground states, and yet the dynamical susceptibility exhibits sharp resonances reminiscent of the behavior of single spins. These results show that strongly interacting quantum systems can organize to generate coherent excitations and shed light on recent experiments demonstrating that coherent excitations are present in a disordered spin liquid. The dependence of the energy spectra on system size differs qualitatively from that of the energy spectra of random undirected bipartite graphs with similar statistics, implying that strong interactions are giving rise to these unusual spectral properties

  12. Experimental verification of quantum discord in continuous-variable states

    International Nuclear Information System (INIS)

    Hosseini, S; Haw, J Y; Assad, S M; Chrzanowski, H M; Janousek, J; Symul, T; Lam, P K; Rahimi-Keshari, S; Ralph, T C

    2014-01-01

    We introduce a simple and efficient technique to verify quantum discord in unknown Gaussian states and a certain class of non-Gaussian states. We show that any separation in the peaks of the marginal distributions of one subsystem conditioned on two different outcomes of homodyne measurements performed on the other subsystem indicates correlation between the corresponding quadratures, and hence nonzero discord. We also apply this method to non-Gaussian states that are prepared by overlapping a statistical mixture of coherent and vacuum states on a beam splitter. We experimentally demonstrate this technique by verifying nonzero quantum discord in a bipartite Gaussian and certain non-Gaussian states. (paper)

  13. Quantum optics

    National Research Council Canada - National Science Library

    Agarwal, G. S

    2013-01-01

    .... Focusing on applications of quantum optics, the textbook covers recent developments such as engineering of quantum states, quantum optics on a chip, nano-mechanical mirrors, quantum entanglement...

  14. Quantum entanglement and geometry of determinantal varieties

    International Nuclear Information System (INIS)

    Chen Hao

    2006-01-01

    Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky, and Rosen. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation, quantum communication, and quantum cryptography. In this paper, we introduce algebraic sets, which are determinantal varieties in the complex projective spaces or the products of complex projective spaces, for the mixed states on bipartite or multipartite quantum systems as their invariants under local unitary transformations. These invariants are naturally arised from the physical consideration of measuring mixed states by separable pure states. Our construction has applications in the following important topics in quantum information theory: (1) separability criterion, it is proved that the algebraic sets must be a union of the linear subspaces if the mixed states are separable; (2) simulation of Hamiltonians, it is proved that the simulation of semipositive Hamiltonians of the same rank implies the projective isomorphisms of the corresponding algebraic sets; (3) construction of bound entangled mixed states, examples of the entangled mixed states which are invariant under partial transpositions (thus PPT bound entanglement) are constructed systematically from our new separability criterion

  15. Experimental verification of multidimensional quantum steering

    Science.gov (United States)

    Li, Che-Ming; Lo, Hsin-Pin; Chen, Liang-Yu; Yabushita, Atsushi

    2018-03-01

    Quantum steering enables one party to communicate with another remote party even if the sender is untrusted. Such characteristics of quantum systems not only provide direct applications to quantum information science, but are also conceptually important for distinguishing between quantum and classical resources. While concrete illustrations of steering have been shown in several experiments, quantum steering has not been certified for higher dimensional systems. Here, we introduce a simple method to experimentally certify two different kinds of quantum steering: Einstein-Podolsky-Rosen (EPR) steering and single-system (SS) steering (i.e., temporal steering), for dimensionality (d) up to d = 16. The former reveals the steerability among bipartite systems, whereas the latter manifests itself in single quantum objects. We use multidimensional steering witnesses to verify EPR steering of polarization-entangled pairs and SS steering of single photons. The ratios between the measured witnesses and the maximum values achieved by classical mimicries are observed to increase with d for both EPR and SS steering. The designed scenario offers a new method to study further the genuine multipartite steering of large dimensionality and potential uses in quantum information processing.

  16. Atom-number squeezing and bipartite entanglement of two-component Bose-Einstein condensates: analytical results

    Energy Technology Data Exchange (ETDEWEB)

    Jin, G R; Wang, X W; Li, D; Lu, Y W, E-mail: grjin@bjtu.edu.c [Department of Physics, Beijing Jiaotong University, Beijing 100044 (China)

    2010-02-28

    We investigate spin dynamics of a two-component Bose-Einstein condensate with weak Josephson coupling. Analytical expressions of atom-number squeezing and bipartite entanglement are presented for atom-atom repulsive interactions. For attractive interactions, there is no number squeezing; however, the squeezing parameter is still useful to recognize the appearance of Schroedinger's cat state.

  17. Magnetic resonance imaging findings in bipartite medial cuneiform – a potential pitfall in diagnosis of midfoot injuries: a case series

    Directory of Open Access Journals (Sweden)

    Elias Ilan

    2008-08-01

    Full Text Available Abstract Introduction The bipartite medial cuneiform is an uncommon developmental osseous variant in the midfoot. To our knowledge, Magnetic Resonance Imaging (MRI characteristics of a non-symptomatic bipartite medial cuneiform have not been described in the orthopaedic literature. It is important for orthopaedic foot and ankle surgeons, musculoskeletal radiologists, and for podiatrists to identify this osseous variant as it may be mistakenly diagnosed as a fracture or not recognized as a source of non-traumatic or traumatic foot pain, which may sometimes even require surgical treatment. Case presentations In this report, we describe the characteristics of three cases of bipartite medial cuneiform on Magnetic Resonance Imaging and contrast its appearance to that of a medial cuneiform fracture. Conclusion A bipartite medial cuneiform is a rare developmental anomaly of the midfoot and may be the source of midfoot pain. Knowledge about its characteristic appearance on magnetic resonance imaging is important because it is a potential pitfall in diagnosis of midfoot injuries.

  18. On the balanced case of the Brualdi-Shen conjecture on 4-cycle decompositions of Eulerian bipartite tournaments

    Directory of Open Access Journals (Sweden)

    Rafael Del Valle Vega

    2015-10-01

    Full Text Available The Brualdi-Shen Conjecture on Eulerian Bipartite Tournaments states that any such graph can be decomposed into oriented 4-cycles. In this article we prove the balanced case of the mentioned conjecture. We show that for any $2n\\times 2n$ bipartite graph $G=(U\\cup V, E$ in which each vertex has $n$-neighbors with biadjacency matrix $M$ (or its transpose there is a proper edge coloring of a column permutation of $M$ denoted $M^{\\sigma}$ in which the nonzero entries of each of the $first$ $n$ columns are colored with elements from the set $\\{n+1, n+2, \\ldots, 2n\\}$ and the nonzero entries of each of the $last$  $n$ columns are colored with elements from the set $\\{1, 2, \\ldots, n\\}$ and if the nonzero entry $M^{\\sigma}_{r,j}$ is colored with color $i$ then $M^{\\sigma}_{r,i}$ must be a zero entry. Such a coloring will induce an oriented 4-cycle decomposition of the bipartite tournament corresponding to $M$. We achieve this by constructing an euler tour on the bipartite tournament which avoids traversing both pair of edges of any two internally disjoint $s$-$t$ 2-paths consecutively, where $s$ and $t$ belong to $V$.

  19. Medication Errors - A Review

    OpenAIRE

    Vinay BC; Nikhitha MK; Patel Sunil B

    2015-01-01

    In this present review article, regarding medication errors its definition, medication error problem, types of medication errors, common causes of medication errors, monitoring medication errors, consequences of medication errors, prevention of medication error and managing medication errors have been explained neatly and legibly with proper tables which is easy to understand.

  20. Computationally Efficient Nonlinear Bell Inequalities for Quantum Networks

    Science.gov (United States)

    Luo, Ming-Xing

    2018-04-01

    The correlations in quantum networks have attracted strong interest with new types of violations of the locality. The standard Bell inequalities cannot characterize the multipartite correlations that are generated by multiple sources. The main problem is that no computationally efficient method is available for constructing useful Bell inequalities for general quantum networks. In this work, we show a significant improvement by presenting new, explicit Bell-type inequalities for general networks including cyclic networks. These nonlinear inequalities are related to the matching problem of an equivalent unweighted bipartite graph that allows constructing a polynomial-time algorithm. For the quantum resources consisting of bipartite entangled pure states and generalized Greenberger-Horne-Zeilinger (GHZ) states, we prove the generic nonmultilocality of quantum networks with multiple independent observers using new Bell inequalities. The violations are maximal with respect to the presented Tsirelson's bound for Einstein-Podolsky-Rosen states and GHZ states. Moreover, these violations hold for Werner states or some general noisy states. Our results suggest that the presented Bell inequalities can be used to characterize experimental quantum networks.

  1. Digital Quantum Estimation

    Science.gov (United States)

    Hassani, Majid; Macchiavello, Chiara; Maccone, Lorenzo

    2017-11-01

    Quantum metrology calculates the ultimate precision of all estimation strategies, measuring what is their root-mean-square error (RMSE) and their Fisher information. Here, instead, we ask how many bits of the parameter we can recover; namely, we derive an information-theoretic quantum metrology. In this setting, we redefine "Heisenberg bound" and "standard quantum limit" (the usual benchmarks in the quantum estimation theory) and show that the former can be attained only by sequential strategies or parallel strategies that employ entanglement among probes, whereas parallel-separable strategies are limited by the latter. We highlight the differences between this setting and the RMSE-based one.

  2. High-speed quantum networking by ship

    Science.gov (United States)

    Devitt, Simon J.; Greentree, Andrew D.; Stephens, Ashley M.; van Meter, Rodney

    2016-11-01

    Networked entanglement is an essential component for a plethora of quantum computation and communication protocols. Direct transmission of quantum signals over long distances is prevented by fibre attenuation and the no-cloning theorem, motivating the development of quantum repeaters, designed to purify entanglement, extending its range. Quantum repeaters have been demonstrated over short distances, but error-corrected, global repeater networks with high bandwidth require new technology. Here we show that error corrected quantum memories installed in cargo containers and carried by ship can provide a exible connection between local networks, enabling low-latency, high-fidelity quantum communication across global distances at higher bandwidths than previously proposed. With demonstrations of technology with sufficient fidelity to enable topological error-correction, implementation of the quantum memories is within reach, and bandwidth increases with improvements in fabrication. Our approach to quantum networking avoids technological restrictions of repeater deployment, providing an alternate path to a worldwide Quantum Internet.

  3. Entanglement in bipartite pure states of an interacting boson gas obtained by local projective measurements

    International Nuclear Information System (INIS)

    Paraan, Francis N. C.; Korepin, Vladimir E.; Molina-Vilaplana, Javier; Bose, Sougato

    2011-01-01

    We quantify the extractable entanglement of excited states of a Lieb-Liniger gas that are obtained from coarse-grained measurements on the ground state in which the boson number in one of two complementary contiguous partitions of the gas is determined. Numerically exact results obtained from the coordinate Bethe ansatz show that the von Neumann entropy of the resulting bipartite pure state increases monotonically with the strength of repulsive interactions and saturates to the impenetrable-boson limiting value. We also present evidence indicating that the largest amount of entanglement can be extracted from the most probable projected state having half the number of bosons in a given partition. Our study points to a fundamental difference between the nature of the entanglement in free-bosonic and free-fermionic systems, with the entanglement in the former being zero after projection, while that in the latter (corresponding to the impenetrable-boson limit) being nonzero.

  4. Entanglement dynamics of high-dimensional bipartite field states inside the cavities in dissipative environments

    Energy Technology Data Exchange (ETDEWEB)

    Tahira, Rabia; Ikram, Manzoor; Zubairy, M Suhail [Centre for Quantum Physics, COMSATS Institute of Information Technology, Islamabad (Pakistan); Bougouffa, Smail [Department of Physics, Faculty of Science, Taibah University, PO Box 30002, Madinah (Saudi Arabia)

    2010-02-14

    We investigate the phenomenon of sudden death of entanglement in a high-dimensional bipartite system subjected to dissipative environments with an arbitrary initial pure entangled state between two fields in the cavities. We find that in a vacuum reservoir, the presence of the state where one or more than one (two) photons in each cavity are present is a necessary condition for the sudden death of entanglement. Otherwise entanglement remains for infinite time and decays asymptotically with the decay of individual qubits. For pure two-qubit entangled states in a thermal environment, we observe that sudden death of entanglement always occurs. The sudden death time of the entangled states is related to the number of photons in the cavities, the temperature of the reservoir and the initial preparation of the entangled states.

  5. Entanglement dynamics of high-dimensional bipartite field states inside the cavities in dissipative environments

    International Nuclear Information System (INIS)

    Tahira, Rabia; Ikram, Manzoor; Zubairy, M Suhail; Bougouffa, Smail

    2010-01-01

    We investigate the phenomenon of sudden death of entanglement in a high-dimensional bipartite system subjected to dissipative environments with an arbitrary initial pure entangled state between two fields in the cavities. We find that in a vacuum reservoir, the presence of the state where one or more than one (two) photons in each cavity are present is a necessary condition for the sudden death of entanglement. Otherwise entanglement remains for infinite time and decays asymptotically with the decay of individual qubits. For pure two-qubit entangled states in a thermal environment, we observe that sudden death of entanglement always occurs. The sudden death time of the entangled states is related to the number of photons in the cavities, the temperature of the reservoir and the initial preparation of the entangled states.

  6. Statistical Mechanics of a Simplified Bipartite Matching Problem: An Analytical Treatment

    Science.gov (United States)

    Dell'Erba, Matías Germán

    2012-03-01

    We perform an analytical study of a simplified bipartite matching problem in which there exists a constant matching energy, and both heterosexual and homosexual pairings are allowed. We obtain the partition function in a closed analytical form and we calculate the corresponding thermodynamic functions of this model. We conclude that the model is favored at high temperatures, for which the probabilities of heterosexual and homosexual pairs tend to become equal. In the limits of low and high temperatures, the system is extensive, however this property is lost in the general case. There exists a relation between the matching energies for which the system becomes more stable under external (thermal) perturbations. As the difference of energies between the two possible matches increases the system becomes more ordered, while the maximum of entropy is achieved when these energies are equal. In this limit, there is a first order phase transition between two phases with constant entropy.

  7. Neural Correlates of Phrase Rhythm: An EEG Study of Bipartite vs. Rondo Sonata Form

    Directory of Open Access Journals (Sweden)

    Antonio Fernández-Caballero

    2017-04-01

    Full Text Available This paper introduces the neural correlates of phrase rhythm. In short, phrase rhythm is the rhythmic aspect of phrase construction and the relationships between phrases. For the sake of establishing the neural correlates, a musical experiment has been designed to induce music-evoked stimuli related to phrase rhythm. Brain activity is monitored through electroencephalography (EEG by using a brain–computer interface. The power spectral value of each EEG channel is estimated to obtain how power variance distributes as a function of frequency. Our experiment shows statistical differences in theta and alpha bands in the phrase rhythm variations of two classical sonatas, one in bipartite form and the other in rondo form.

  8. Modeling the spread of vector-borne diseases on bipartite networks.

    Directory of Open Access Journals (Sweden)

    Donal Bisanzio

    Full Text Available BACKGROUND: Vector-borne diseases for which transmission occurs exclusively between vectors and hosts can be modeled as spreading on a bipartite network. METHODOLOGY/PRINCIPAL FINDINGS: In such models the spreading of the disease strongly depends on the degree distribution of the two classes of nodes. It is sufficient for one of the classes to have a scale-free degree distribution with a slow enough decay for the network to have asymptotically vanishing epidemic threshold. Data on the distribution of Ixodes ricinus ticks on mice and lizards from two independent studies are well described by a scale-free distribution compatible with an asymptotically vanishing epidemic threshold. The commonly used negative binomial, instead, cannot describe the right tail of the empirical distribution. CONCLUSIONS/SIGNIFICANCE: The extreme aggregation of vectors on hosts, described by the power-law decay of the degree distribution, makes the epidemic threshold decrease with the size of the network and vanish asymptotically.

  9. Bipartite Networks of Universities and Companies: Recruiting New Graduates in Japan

    Science.gov (United States)

    Takahashi, Katsuhide; Kobayashi, Yuh; Kondo, Yohei; Takayasu, Hideki; Takayasu, Misako

    We investigated the bipartite Universities-Companies Network in Japan in terms of companies' recruitment of new graduates. In Japan, graduates of universities are typically hired by companies upon their graduation. To examine socially accepted ideas about this recruiting system, we combined different types of data on education, recruitment and corporate finance. The hypothesis that graduates from prestigious universities have the advantage of entering excellent companies was verified by examining the determinants of ratio of graduates entering top-ranked companies. Through hierarchical clustering, we obtained classification trees and observed the stability of their structure, as well as interesting changes corresponding to the business climate. We also calculated weighted HITS hub and authority values for each university and company and identified the links between the results of this analysis and those above. Finally, analysis of all the data indicated that excellent companies recruiting many graduates from prestigious universities do not necessarily show superb performance in profit-making and growth.

  10. Quantum steganography using prior entanglement

    International Nuclear Information System (INIS)

    Mihara, Takashi

    2015-01-01

    Steganography is the hiding of secret information within innocent-looking information (e.g., text, audio, image, video, etc.). A quantum version of steganography is a method based on quantum physics. In this paper, we propose quantum steganography by combining quantum error-correcting codes with prior entanglement. In many steganographic techniques, embedding secret messages in error-correcting codes may cause damage to them if the embedded part is corrupted. However, our proposed steganography can separately create secret messages and the content of cover messages. The intrinsic form of the cover message does not have to be modified for embedding secret messages. - Highlights: • Our steganography combines quantum error-correcting codes with prior entanglement. • Our steganography can separately create secret messages and the content of cover messages. • Errors in cover messages do not have affect the recovery of secret messages. • We embed a secret message in the Steane code as an example of our steganography

  11. Quantum steganography using prior entanglement

    Energy Technology Data Exchange (ETDEWEB)

    Mihara, Takashi, E-mail: mihara@toyo.jp

    2015-06-05

    Steganography is the hiding of secret information within innocent-looking information (e.g., text, audio, image, video, etc.). A quantum version of steganography is a method based on quantum physics. In this paper, we propose quantum steganography by combining quantum error-correcting codes with prior entanglement. In many steganographic techniques, embedding secret messages in error-correcting codes may cause damage to them if the embedded part is corrupted. However, our proposed steganography can separately create secret messages and the content of cover messages. The intrinsic form of the cover message does not have to be modified for embedding secret messages. - Highlights: • Our steganography combines quantum error-correcting codes with prior entanglement. • Our steganography can separately create secret messages and the content of cover messages. • Errors in cover messages do not have affect the recovery of secret messages. • We embed a secret message in the Steane code as an example of our steganography.

  12. General tradeoff relations of quantum nonlocality in the Clauser–Horne–Shimony–Holt scenario

    Energy Technology Data Exchange (ETDEWEB)

    Su, Hong-Yi, E-mail: hongyisu@chonnam.ac.kr [Department of Physics Education, Chonnam National University, Gwangju 500-757 (Korea, Republic of); Chen, Jing-Ling [Theoretical Physics Division, Chern Institute of Mathematics, Nankai University, Tianjin 300071 (China); Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore); Hwang, Won-Young, E-mail: wyhwang@jnu.ac.kr [Department of Physics Education, Chonnam National University, Gwangju 500-757 (Korea, Republic of)

    2017-02-15

    General tradeoff relations present in nonlocal correlations of bipartite systems are studied, regardless of any specific quantum states and measuring directions. Extensions to multipartite scenarios are possible and very promising. Tsirelson’s bound can be derived out in particular. The close connection with uncertainty relations is also presented and discussed. - Highlights: • Quantum violation of CHSH inequalities is found to satisfy tradeoff relations. • Tsirelson’s bound for quantum mechanics can be directly implied from these tradeoffs. • Tradeoff relations shed new light on uncertainty relations in summation forms.

  13. Preservation of a lower bound of quantum secret key rate in the presence of decoherence

    Energy Technology Data Exchange (ETDEWEB)

    Datta, Shounak, E-mail: shounak.datta@bose.res.in; Goswami, Suchetana, E-mail: suchetana.goswami@bose.res.in; Pramanik, Tanumoy, E-mail: tanu.pram99@bose.res.in; Majumdar, A.S., E-mail: archan@bose.res.in

    2017-03-11

    It is well known that the interaction of quantum systems with the environment reduces the inherent quantum correlations. Under special circumstances the effect of decoherence can be reversed, for example, the interaction modelled by an amplitude damping channel can boost the teleportation fidelity from the classical to the quantum region for a bipartite quantum state. Here, we first show that this phenomenon fails to preserve the quantum secret key rate derived under individual attack. We further show that the technique of weak measurement can be used to slow down the process of decoherence, thereby helping to preserve the quantum secret key rate when one or both systems are interacting with the environment via an amplitude damping channel. Most interestingly, in certain cases weak measurement with post-selection where one considers both success and failure of the technique is shown to be more useful than without it when both systems interact with the environment. - Highlights: • In general, decoherence has negative effect on the steerability and quantum secret key rate of a bipartite state. • Quantum key rate can be preserved against the effect of decoherence using the technique of weak measurement. • The technique of weak measurements includes a weak measurement and its reversal. • For some strength of weak measurement and environmental interaction, the average secret key rate is improved.

  14. Preservation of a lower bound of quantum secret key rate in the presence of decoherence

    International Nuclear Information System (INIS)

    Datta, Shounak; Goswami, Suchetana; Pramanik, Tanumoy; Majumdar, A.S.

    2017-01-01

    It is well known that the interaction of quantum systems with the environment reduces the inherent quantum correlations. Under special circumstances the effect of decoherence can be reversed, for example, the interaction modelled by an amplitude damping channel can boost the teleportation fidelity from the classical to the quantum region for a bipartite quantum state. Here, we first show that this phenomenon fails to preserve the quantum secret key rate derived under individual attack. We further show that the technique of weak measurement can be used to slow down the process of decoherence, thereby helping to preserve the quantum secret key rate when one or both systems are interacting with the environment via an amplitude damping channel. Most interestingly, in certain cases weak measurement with post-selection where one considers both success and failure of the technique is shown to be more useful than without it when both systems interact with the environment. - Highlights: • In general, decoherence has negative effect on the steerability and quantum secret key rate of a bipartite state. • Quantum key rate can be preserved against the effect of decoherence using the technique of weak measurement. • The technique of weak measurements includes a weak measurement and its reversal. • For some strength of weak measurement and environmental interaction, the average secret key rate is improved.

  15. Error Budgeting

    Energy Technology Data Exchange (ETDEWEB)

    Vinyard, Natalia Sergeevna [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Perry, Theodore Sonne [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Usov, Igor Olegovich [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2017-10-04

    We calculate opacity from k (hn)=-ln[T(hv)]/pL, where T(hv) is the transmission for photon energy hv, p is sample density, and L is path length through the sample. The density and path length are measured together by Rutherford backscatter. Δk = $\\partial k$\\ $\\partial T$ ΔT + $\\partial k$\\ $\\partial (pL)$. We can re-write this in terms of fractional error as Δk/k = Δ1n(T)/T + Δ(pL)/(pL). Transmission itself is calculated from T=(U-E)/(V-E)=B/B0, where B is transmitted backlighter (BL) signal and B0 is unattenuated backlighter signal. Then ΔT/T=Δln(T)=ΔB/B+ΔB0/B0, and consequently Δk/k = 1/T (ΔB/B + ΔB$_0$/B$_0$ + Δ(pL)/(pL). Transmission is measured in the range of 0.2

  16. Quantum solitons

    Energy Technology Data Exchange (ETDEWEB)

    Abram, I [Centre National d' Etudes des Telecommunications (CNET), 196 Avenue Henri Ravera, F-92220 Bagneux (France)

    1999-02-01

    results in an improvement in the bit-error rate of the transmission. The fact that squeezing does not survive attenuation does not matter in this case, since it is alive during the nonlinear interaction when it is needed. Another possible application of squeezed solitons would be in switching devices and logic gates based on soliton interactions, such as the fibre-end devices for signal processing in telecommunications developed by Mohamed Islam at AT and T in the US in the early 1990s. The use of number-squeezing would allow collisions between solitons to be controlled to high precision, thus significantly reducing the error rate of these devices. Solitons and quantum information It might also be possible to use solitons in the processing of quantum information. Quantum information is an emerging field of physics that takes advantage of phenomena that are particular to quantum mechanics such as uncertainty, superposition and entanglement to code, transmit or process information (see Physics World March 1998). Recent highlights in this field include quantum cryptography (which can be used to achieve unconditionally secure key distribution) and quantum computing, which considerably speeds up the solution of problems that are exponentially difficult. These problems include the factorization of large numbers and searches of large databases. Although most proposals for processing quantum information to date concentrate on single-photon or single-spin implementations, optical solitons may offer an alternative that is easier to handle experimentally, yet still provides many of the basic quantum features that are displayed by single quanta. This could lead to new paradigms for computation and communications. In particular, the existence of quantum correlations in the fluctuations of the spectral and temporal sidebands of the solitons turns them into macroscopic quantum objects with internal entanglement. If these internal quantum correlations can be tailored into prescribed

  17. Quantum Zeno and anti-Zeno effects on quantum and classical correlations

    International Nuclear Information System (INIS)

    Francica, F.; Plastina, F.; Maniscalco, S.

    2010-01-01

    In this paper we study the possibility of modifying the dynamics of both quantum correlations, such as entanglement and discord, and classical correlations of an open bipartite system by means of the quantum Zeno effect. We consider two qubits coupled to a common boson reservoir at zero temperature. This model describes, for example, two atoms interacting with a quantized mode of a lossy cavity. We show that when the frequencies of the two atoms are symmetrically detuned from that of the cavity mode, oscillations between the Zeno and anti-Zeno regimes occur. We also calculate analytically the time evolution of both classical correlations and quantum discord, and we compare the Zeno dynamics of entanglement with the Zeno dynamics of classical correlations and discord.

  18. Autonomous quantum Maxwell's demon based on two exchange-coupled quantum dots

    Science.gov (United States)

    Ptaszyński, Krzysztof

    2018-01-01

    I study an autonomous quantum Maxwell's demon based on two exchange-coupled quantum dots attached to the spin-polarized leads. The principle of operation of the demon is based on the coherent oscillations between the spin states of the system which act as a quantum iSWAP gate. Due to the operation of the iSWAP gate, one of the dots acts as a feedback controller which blocks the transport with the bias in the other dot, thus inducing the electron pumping against the bias; this leads to the locally negative entropy production. Operation of the demon is associated with the information transfer between the dots, which is studied quantitatively by mapping the analyzed setup onto the thermodynamically equivalent auxiliary system. The calculated entropy production in a single subsystem and information flow between the subsystems are shown to obey a local form of the second law of thermodynamics, similar to the one previously derived for classical bipartite systems.

  19. Quantum Illumination with Noiseless Linear Amplifier

    International Nuclear Information System (INIS)

    Zhang Sheng-Li; Wang -Kun; Guo Jian-Sheng; Shi Jian-Hong

    2015-01-01

    Quantum illumination, that is, quantum target detection, is to detect the potential target with two-mode quantum entangled state. For a given transmitted energy, the quantum illumination can achieve a target-detection probability of error much lower than the illumination scheme without entanglement. We investigate the usefulness of noiseless linear amplification (NLA) for quantum illumination. Our result shows that NLA can help to substantially reduce the number of quantum entangled states collected for joint measurement of multi-copy quantum state. Our analysis on the NLA-assisted scheme could help to develop more efficient schemes for quantum illumination. (paper)

  20. Matrix Results and Techniques in Quantum Information Science and Related Topics

    Science.gov (United States)

    Pelejo, Diane Christine

    In this dissertation, we present several matrix-related problems and results motivated by quantum information theory. Some background material of quantum information science will be discussed in chapter 1, while chapter 7 gives a summary of results and concluding remarks. In chapter 2, we look at 2n x 2 n unitary matrices, which describe operations on a closed n-qubit system. We define a set of simple quantum gates, called controlled single qubit gates, and their associated operational cost. We then present a recurrence scheme to decompose a general 2n x 2n unitary matrix to the product of no more than 2n-12n-1 single qubit gates with small number of controls. In chapter 3, we address the problem of finding a specific element phi among a given set of quantum channels S that will produce the optimal value of a scalar function D(rho 1,phi(rho2)), on two fixed quantum states rho 1 and rho2. Some of the functions we considered for D(·,·) are the trace distance, quantum fidelity and quantum relative entropy. We discuss the optimal solution when S is the set of unitary quantum channels, the set of mixed unitary channels, the set of unital quantum channels, and the set of all quantum channels. In chapter 4, we focus on the spectral properties of qubit-qudit bipartite states with a maximally mixed qudit subsystem. More specifically, given positive numbers a1 ≥ ... ≥ a 2n ≥ 0, we want to determine if there exist a 2n x 2n density matrix rho having eigenvalues a1,..., a2n and satisfying tr 1(rho)=1/n In. This problem is a special case of the more general quantum marginal problem. We give the minimal necessary and sufficient conditions on a1,..., a2n for n ≤ 6 and state some observations on general values of n.. In chapter 5, we discuss the numerical method of alternating projections and illustrate its usefulness in: (a) constructing a quantum channel, if it exists, such that phi(rho(1))=sigma(1),...,phi(rho (k))=sigma(k) for given rho (1),...,rho(k) ∈ Dn and

  1. Underlying Information Technology Tailored Quantum Error Correction

    Science.gov (United States)

    2006-07-28

    typically constructed by using an optical beam splitter . • We used a decoherence-free-subspace encoding to reduce the sensitivity of an optical Deutsch...process tomography on one- and two-photon polarisation states, from full and partial data "• Accomplished complete two-photon QPT. "• Discovered surprising...protocol giving a quadratic speedup over all previously known such protocols. • Developed the first completely positive non -Markovian master equation

  2. Quantum prisoners' dilemma under enhanced interrogation

    Science.gov (United States)

    Siopsis, George; Balu, Radhakrishnan; Solmeyer, Neal

    2018-06-01

    In the quantum version of prisoners' dilemma, each prisoner is equipped with a single qubit that the interrogator can entangle. We enlarge the available Hilbert space by introducing a third qubit that the interrogator can entangle with the other two. We discuss an enhanced interrogation technique based on tripartite entanglement and analyze Nash equilibria. We show that for tripartite entanglement approaching a W-state, we calculate the Nash equilibria numerically and show that they coincide with the Pareto-optimal choice where both prisoners cooperate. Upon continuous variation between a W-state and a pure bipartite entangled state, the game is shown to have a surprisingly rich structure. The role of bipartite and tripartite entanglement is explored to explain that structure. As an application, we consider an evolutionary game based on our quantum game with a network of agents on a square lattice with periodic boundary conditions and show that the strategy corresponding to Nash equilibrium completely dominates without placing any restrictions on the initial set of strategies.

  3. Quantum Erasure: Quantum Interference Revisited

    OpenAIRE

    Walborn, Stephen P.; Cunha, Marcelo O. Terra; Pádua, Sebastião; Monken, Carlos H.

    2005-01-01

    Recent experiments in quantum optics have shed light on the foundations of quantum physics. Quantum erasers - modified quantum interference experiments - show that quantum entanglement is responsible for the complementarity principle.

  4. Entanglement growth and simulation efficiency in one-dimensional quantum lattice systems

    OpenAIRE

    Perales, Alvaro; Vidal, Guifre

    2007-01-01

    We study the evolution of one-dimensional quantum lattice systems when the ground state is perturbed by altering one site in the middle of the chain. For a large class of models, we observe a similar pattern of entanglement growth during the evolution, characterized by a moderate increase of significant Schmidt coefficients in all relevant bipartite decompositions of the state. As a result, the evolution can be accurately described by a matrix product state and efficiently simulated using the...

  5. Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement

    OpenAIRE

    Shi, Yaoyun; Zhu, Yufan

    2005-01-01

    We initiate the study of quantifying nonlocalness of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds, which are expressed in terms of certain tensor norms of the measurement operator. As applications, we show that (a) If the amount of communication is constant, quantum and classical communication protocols with unlimited amount of shared entanglement or shared randomness compute the same set of funct...

  6. Conservation law for distributed entanglement of formation and quantum discord

    International Nuclear Information System (INIS)

    Fanchini, Felipe F.; Cornelio, Marcio F.; Oliveira, Marcos C. de; Caldeira, Amir O.

    2011-01-01

    We present a direct relation, based upon a monogamic principle, between entanglement of formation (EOF) and quantum discord (QD), showing how they are distributed in an arbitrary tripartite pure system. By extending it to a paradigmatic situation of a bipartite system coupled to an environment, we demonstrate that the EOF and the QD obey conservation relation. By means of this relation we show that in the deterministic quantum computer with one pure qubit the protocol has the ability to rearrange the EOF and the QD, which implies that quantum computation can be understood on a different basis as a coherent dynamics where quantum correlations are distributed between the qubits of the computer. Furthermore, for a tripartite mixed state we show that the balance between distributed EOF and QD results in a stronger version of the strong subadditivity of entropy.

  7. Quantum Computation--The Ultimate Frontier

    OpenAIRE

    Adami, Chris; Dowling, Jonathan P.

    2002-01-01

    The discovery of an algorithm for factoring which runs in polynomial time on a quantum computer has given rise to a concerted effort to understand the principles, advantages, and limitations of quantum computing. At the same time, many different quantum systems are being explored for their suitability to serve as a physical substrate for the quantum computer of the future. I discuss some of the theoretical foundations of quantum computer science, including algorithms and error correction, and...

  8. Noise management to achieve superiority in quantum information systems

    Science.gov (United States)

    Nemoto, Kae; Devitt, Simon; Munro, William J.

    2017-06-01

    Quantum information systems are expected to exhibit superiority compared with their classical counterparts. This superiority arises from the quantum coherences present in these quantum systems, which are obviously absent in classical ones. To exploit such quantum coherences, it is essential to control the phase information in the quantum state. The phase is analogue in nature, rather than binary. This makes quantum information technology fundamentally different from our classical digital information technology. In this paper, we analyse error sources and illustrate how these errors must be managed for the system to achieve the required fidelity and a quantum superiority. This article is part of the themed issue 'Quantum technology for the 21st century'.

  9. Quantum steganography with noisy quantum channels

    International Nuclear Information System (INIS)

    Shaw, Bilal A.; Brun, Todd A.

    2011-01-01

    Steganography is the technique of hiding secret information by embedding it in a seemingly ''innocent'' message. We present protocols for hiding quantum information by disguising it as noise in a codeword of a quantum error-correcting code. The sender (Alice) swaps quantum information into the codeword and applies a random choice of unitary operation, drawing on a secret random key she shares with the receiver (Bob). Using the key, Bob can retrieve the information, but an eavesdropper (Eve) with the power to monitor the channel, but without the secret key, cannot distinguish the message from channel noise. We consider two types of protocols: one in which the hidden quantum information is stored locally in the codeword, and another in which it is embedded in the space of error syndromes. We analyze how difficult it is for Eve to detect the presence of secret messages, and estimate rates of steganographic communication and secret key consumption for specific protocols and examples of error channels. We consider both the case where there is no actual noise in the channel (so that all errors in the codeword result from the deliberate actions of Alice), and the case where the channel is noisy and not controlled by Alice and Bob.

  10. Equivalence of Szegedy's and coined quantum walks

    Science.gov (United States)

    Wong, Thomas G.

    2017-09-01

    Szegedy's quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the bipartite double cover of the original graph. To search, one can simply quantize a Markov chain with absorbing vertices. Recently, Santos proposed two alternative search algorithms that instead utilize the sign-flip oracle in Grover's algorithm rather than absorbing vertices. In this paper, we show that these two algorithms are exactly equivalent to two algorithms involving coined quantum walks, which are walks on the vertices of the original graph with an internal degree of freedom. The first scheme is equivalent to a coined quantum walk with one walk step per query of Grover's oracle, and the second is equivalent to a coined quantum walk with two walk steps per query of Grover's oracle. These equivalences lie outside the previously known equivalence of Szegedy's quantum walk with absorbing vertices and the coined quantum walk with the negative identity operator as the coin for marked vertices, whose precise relationships we also investigate.

  11. Separability of quantum states and the violation of Bell-type inequalities

    International Nuclear Information System (INIS)

    Loubenets, Elena R.

    2004-01-01

    In contrast to the widespread opinion that any separable quantum state satisfies every classical probabilistic constraint, we present a simple example where separable quantum state does not satisfy the original Bell inequality although the latter inequality, in its perfect correlation form, is valid for all joint classical measurements. In a very general setting, we discuss inequalities for joint experiments upon a bipartite quantum system. For any separable quantum state, we derive quantum analogs of the original Bell inequality and specify the conditions sufficient for a separable state to satisfy the original Bell inequality. We introduce the extended Clauser-Horne-Shimony-Holt inequality and prove that, for any separable quantum state, this inequality holds for a variety of linear combinations

  12. Correlated Errors in the Surface Code

    Science.gov (United States)

    Lopez, Daniel; Mucciolo, E. R.; Novais, E.

    2012-02-01

    A milestone step into the development of quantum information technology would be the ability to design and operate a reliable quantum memory. The greatest obstacle to create such a device has been decoherence due to the unavoidable interaction between the quantum system and its environment. Quantum Error Correction is therefore an essential ingredient to any quantum computing information device. A great deal of attention has been given to surface codes, since it has very good scaling properties. In this seminar, we discuss the time evolution of a qubit encoded in the logical basis of a surface code. The system is interacting with a bosonic environment at zero temperature. Our results show how much spatial and time correlations can be detrimental to the efficiency of the code.

  13. A quantum byte with 10{sup -4} crosstalk for fault-tolerant quantum computing

    Energy Technology Data Exchange (ETDEWEB)

    Piltz, Christian; Sriarunothai, Theeraphot; Varon, Andres; Wunderlich, Christof [Department Physik, Universitaet Siegen, 57068 Siegen (Germany)

    2014-07-01

    A prerequisite for fault-tolerant and thus scalable operation of a quantum computer is the use of quantum error correction protocols. Such protocols come with a maximum tolerable gate error, and there is consensus that an error of order 10{sup -4} is an important threshold. This threshold was already breached for single-qubit gates with trapped ions using microwave radiation. However, crosstalk - the error that is induced in qubits within a quantum register, when one qubit (or a subset of qubits) is coherently manipulated, still prevents the realization of a scalable quantum computer. The application of a quantum gate - even if the gate error itself is low - induces errors in other qubits within the quantum register. We present an experimental study using quantum registers consisting of microwave-driven trapped {sup 171}Yb{sup +} ions in a static magnetic gradient. We demonstrate a quantum register of three qubits with a next-neighbour crosstalk of 6(1) . 10{sup -5} that for the first time breaches the error correction threshold. Furthermore, we present a quantum register of eight qubits - a quantum byte - with a next-neighbour crosstalk error better than 2.9(4) . 10{sup -4}. Importantly, our results are obtained with thermally excited ions far above the motional ground state.

  14. Dynamics of bloggers’ communities: Bipartite networks from empirical data and agent-based modeling

    Science.gov (United States)

    Mitrović, Marija; Tadić, Bosiljka

    2012-11-01

    We present an analysis of the empirical data and the agent-based modeling of the emotional behavior of users on the Web portals where the user interaction is mediated by posted comments, like Blogs and Diggs. We consider the dataset of discussion-driven popular Diggs, in which all comments are screened by machine-learning emotion detection in the text, to determine positive and negative valence (attractiveness and aversiveness) of each comment. By mapping the data onto a suitable bipartite network, we perform an analysis of the network topology and the related time-series of the emotional comments. The agent-based model is then introduced to simulate the dynamics and to capture the emergence of the emotional behaviors and communities. The agents are linked to posts on a bipartite network, whose structure evolves through their actions on the posts. The emotional states (arousal and valence) of each agent fluctuate in time, subject to the current contents of the posts to which the agent is exposed. By an agent’s action on a post its current emotions are transferred to the post. The model rules and the key parameters are inferred from the considered empirical data to ensure their realistic values and mutual consistency. The model assumes that the emotional arousal over posts drives the agent’s action. The simulations are preformed for the case of constant flux of agents and the results are analyzed in full analogy with the empirical data. The main conclusions are that the emotion-driven dynamics leads to long-range temporal correlations and emergent networks with community structure, that are comparable with the ones in the empirical system of popular posts. In view of pure emotion-driven agents actions, this type of comparisons provide a quantitative measure for the role of emotions in the dynamics on real blogs. Furthermore, the model reveals the underlying mechanisms which relate the post popularity with the emotion dynamics and the prevalence of negative

  15. Quantum-chaotic cryptography

    Science.gov (United States)

    de Oliveira, G. L.; Ramos, R. V.

    2018-03-01

    In this work, it is presented an optical scheme for quantum key distribution employing two synchronized optoelectronic oscillators (OEO) working in the chaotic regime. The produced key depends on the chaotic dynamic, and the synchronization between Alice's and Bob's OEOs uses quantum states. An attack on the synchronization signals will disturb the synchronization of the chaotic systems increasing the error rate in the final key.

  16. 20 Gbit/s error free transmission with ~850 nm GaAs-based vertical cavity surface emitting lasers (VCSELs) containing InAs-GaAs submonolayer quantum dot insertions

    Science.gov (United States)

    Lott, J. A.; Shchukin, V. A.; Ledentsov, N. N.; Stinz, A.; Hopfer, F.; Mutig, A.; Fiol, G.; Bimberg, D.; Blokhin, S. A.; Karachinsky, L. Y.; Novikov, I. I.; Maximov, M. V.; Zakharov, N. D.; Werner, P.

    2009-02-01

    We report on the modeling, epitaxial growth, fabrication, and characterization of 830-845 nm vertical cavity surface emitting lasers (VCSELs) that employ InAs-GaAs quantum dot (QD) gain elements. The GaAs-based VCSELs are essentially conventional in design, grown by solid-source molecular beam epitaxy, and include top and bottom gradedheterointerface AlGaAs distributed Bragg reflectors, a single selectively-oxidized AlAs waveguiding/current funneling aperture layer, and a quasi-antiwaveguiding microcavity. The active region consists of three sheets of InAs-GaAs submonolayer insertions separated by AlGaAs matrix layers. Compared to QWs the InAs-GaAs insertions are expected to offer higher exciton-dominated modal gain and improved carrier capture and retention, thus resulting in superior temperature stability and resilience to degradation caused by operating at the larger switching currents commonly employed to increase the data rates of modern optical communication systems. We investigate the robustness and temperature performance of our QD VCSEL design by fabricating prototype devices in a high-frequency ground-sourceground contact pad configuration suitable for on-wafer probing. Arrays of VCSELs are produced with precise variations in top mesa diameter from 24 to 36 μm and oxide aperture diameter from 1 to 12 μm resulting in VCSELs that operate in full single-mode, single-mode to multi-mode, and full multi-mode regimes. The single-mode QD VCSELs have room temperature threshold currents below 0.5 mA and peak output powers near 1 mW, whereas the corresponding values for full multi-mode devices range from about 0.5 to 1.5 mA and 2.5 to 5 mW. At 20°C we observe optical transmission at 20 Gb/s through 150 m of OM3 fiber with a bit error ratio better than 10-12, thus demonstrating the great potential of our QD VCSELs for applications in next-generation short-distance optical data communications and interconnect systems.

  17. Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels

    Science.gov (United States)

    Ahlswede, Rudolf; Bjelaković, Igor; Boche, Holger; Nötzel, Janis

    2013-01-01

    We investigate entanglement transmission over an unknown channel in the presence of a third party (called the adversary), which is enabled to choose the channel from a given set of memoryless but non-stationary channels without informing the legitimate sender and receiver about the particular choice that he made. This channel model is called an arbitrarily varying quantum channel (AVQC). We derive a quantum version of Ahlswede's dichotomy for classical arbitrarily varying channels. This includes a regularized formula for the common randomness-assisted capacity for entanglement transmission of an AVQC. Quite surprisingly and in contrast to the classical analog of the problem involving the maximal and average error probability, we find that the capacity for entanglement transmission of an AVQC always equals its strong subspace transmission capacity. These results are accompanied by different notions of symmetrizability (zero-capacity conditions) as well as by conditions for an AVQC to have a capacity described by a single-letter formula. In the final part of the paper the capacity of the erasure-AVQC is computed and some light shed on the connection between AVQCs and zero-error capacities. Additionally, we show by entirely elementary and operational arguments motivated by the theory of AVQCs that the quantum, classical, and entanglement-assisted zero-error capacities of quantum channels are generically zero and are discontinuous at every positivity point.

  18. Quantum optics

    National Research Council Canada - National Science Library

    Agarwal, G. S

    2013-01-01

    ..., quantum metrology, spin squeezing, control of decoherence and many other key topics. Readers are guided through the principles of quantum optics and their uses in a wide variety of areas including quantum information science and quantum mechanics...

  19. Reaction factoring and bipartite update graphs accelerate the Gillespie Algorithm for large-scale biochemical systems.

    Directory of Open Access Journals (Sweden)

    Sagar Indurkhya

    Full Text Available ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biological systems: (1 a small number of reactions tend to occur a disproportionately large percentage of the time, and (2 a small number of species tend to participate in a disproportionately large percentage of reactions. We exploit these properties in LOLCAT Method, a new implementation of the Gillespie Algorithm. First, factoring reaction propensities allows many propensities dependent on a single species to be updated in a single operation. Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only storage for reactions, rather than the required for a graph that includes only reactions. Together, these improvements allow our implementation of LOLCAT Method to execute orders of magnitude faster than currently existing Gillespie Algorithm variants when simulating several yeast MAPK cascade models.

  20. Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

    International Nuclear Information System (INIS)

    Azad, Ariful; Buluc, Aydn; Pothen, Alex

    2016-01-01

    It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting path is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.

  1. Reaction Factoring and Bipartite Update Graphs Accelerate the Gillespie Algorithm for Large-Scale Biochemical Systems

    Science.gov (United States)

    Indurkhya, Sagar; Beal, Jacob

    2010-01-01

    ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biological systems: (1) a small number of reactions tend to occur a disproportionately large percentage of the time, and (2) a small number of species tend to participate in a disproportionately large percentage of reactions. We exploit these properties in LOLCAT Method, a new implementation of the Gillespie Algorithm. First, factoring reaction propensities allows many propensities dependent on a single species to be updated in a single operation. Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only storage for reactions, rather than the required for a graph that includes only reactions. Together, these improvements allow our implementation of LOLCAT Method to execute orders of magnitude faster than currently existing Gillespie Algorithm variants when simulating several yeast MAPK cascade models. PMID:20066048

  2. Integration of Phenotypic Metadata and Protein Similarity in Archaea Using a Spectral Bipartitioning Approach

    Energy Technology Data Exchange (ETDEWEB)

    Hooper, Sean D.; Anderson, Iain J; Pati, Amrita; Dalevi, Daniel; Mavromatis, Konstantinos; Kyrpides, Nikos C

    2009-01-01

    In order to simplify and meaningfully categorize large sets of protein sequence data, it is commonplace to cluster proteins based on the similarity of those sequences. However, it quickly becomes clear that the sequence flexibility allowed a given protein varies significantly among different protein families. The degree to which sequences are conserved not only differs for each protein family, but also is affected by the phylogenetic divergence of the source organisms. Clustering techniques that use similarity thresholds for protein families do not always allow for these variations and thus cannot be confidently used for applications such as automated annotation and phylogenetic profiling. In this work, we applied a spectral bipartitioning technique to all proteins from 53 archaeal genomes. Comparisons between different taxonomic levels allowed us to study the effects of phylogenetic distances on cluster structure. Likewise, by associating functional annotations and phenotypic metadata with each protein, we could compare our protein similarity clusters with both protein function and associated phenotype. Our clusters can be analyzed graphically and interactively online.

  3. Bank-firm credit network in Japan: an analysis of a bipartite network.

    Science.gov (United States)

    Marotta, Luca; Miccichè, Salvatore; Fujiwara, Yoshi; Iyetomi, Hiroshi; Aoyama, Hideaki; Gallegati, Mauro; Mantegna, Rosario N

    2015-01-01

    We investigate the networked nature of the Japanese credit market. Our investigation is performed with tools of network science. In our investigation we perform community detection with an algorithm which is identifying communities composed of both banks and firms. We show that the communities obtained by directly working on the bipartite network carry information about the networked nature of the Japanese credit market. Our analysis is performed for each calendar year during the time period from 1980 to 2011. To investigate the time evolution of the networked structure of the credit market we introduce a new statistical method to track the time evolution of detected communities. We then characterize the time evolution of communities by detecting for each time evolving set of communities the over-expression of attributes of firms and banks. Specifically, we consider as attributes the economic sector and the geographical location of firms and the type of banks. In our 32-year-long analysis we detect a persistence of the over-expression of attributes of communities of banks and firms together with a slow dynamic of changes from some specific attributes to new ones. Our empirical observations show that the credit market in Japan is a networked market where the type of banks, geographical location of firms and banks, and economic sector of the firm play a role in shaping the credit relationships between banks and firms.

  4. Simple sequence repeats and compositional bias in the bipartite Ralstonia solanacearum GMI1000 genome

    Directory of Open Access Journals (Sweden)

    Vandamme Peter

    2003-03-01

    Full Text Available Abstract Background Ralstonia solanacearum is an important plant pathogen. The genome of R. solananearum GMI1000 is organised into two replicons (a 3.7-Mb chromosome and a 2.1-Mb megaplasmid and this bipartite genome structure is characteristic for most R. solanacearum strains. To determine whether the megaplasmid was acquired via recent horizontal gene transfer or is part of an ancestral single chromosome, we compared the abundance, distribution and compositon of simple sequence repeats (SSRs between both replicons and also compared the respective compositional biases. Results Our data show that both replicons are very similar in respect to distribution and composition of SSRs and presence of compositional biases. Minor variations in SSR and compositional biases observed may be attributable to minor differences in gene expression and regulation of gene expression or can be attributed to the small sample numbers observed. Conclusions The observed similarities indicate that both replicons have shared a similar evolutionary history and thus suggest that the megaplasmid was not recently acquired from other organisms by lateral gene transfer but is a part of an ancestral R. solanacearum chromosome.

  5. Bank-Firm Credit Network in Japan: An Analysis of a Bipartite Network

    Science.gov (United States)

    Marotta, Luca; Miccichè, Salvatore; Fujiwara, Yoshi; Iyetomi, Hiroshi; Aoyama, Hideaki; Gallegati, Mauro; Mantegna, Rosario N.

    2015-01-01

    We investigate the networked nature of the Japanese credit market. Our investigation is performed with tools of network science. In our investigation we perform community detection with an algorithm which is identifying communities composed of both banks and firms. We show that the communities obtained by directly working on the bipartite network carry information about the networked nature of the Japanese credit market. Our analysis is performed for each calendar year during the time period from 1980 to 2011. To investigate the time evolution of the networked structure of the credit market we introduce a new statistical method to track the time evolution of detected communities. We then characterize the time evolution of communities by detecting for each time evolving set of communities the over-expression of attributes of firms and banks. Specifically, we consider as attributes the economic sector and the geographical location of firms and the type of banks. In our 32-year-long analysis we detect a persistence of the over-expression of attributes of communities of banks and firms together with a slow dynamic of changes from some specific attributes to new ones. Our empirical observations show that the credit market in Japan is a networked market where the type of banks, geographical location of firms and banks, and economic sector of the firm play a role in shaping the credit relationships between banks and firms. PMID:25933413

  6. Reaction factoring and bipartite update graphs accelerate the Gillespie Algorithm for large-scale biochemical systems.

    Science.gov (United States)

    Indurkhya, Sagar; Beal, Jacob

    2010-01-06

    ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biological systems: (1) a small number of reactions tend to occur a disproportionately large percentage of the time, and (2) a small number of species tend to participate in a disproportionately large percentage of reactions. We exploit these properties in LOLCAT Method, a new implementation of the Gillespie Algorithm. First, factoring reaction propensities allows many propensities dependent on a single species to be updated in a single operation. Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only storage for reactions, rather than the required for a graph that includes only reactions. Together, these improvements allow our implementation of LOLCAT Method to execute orders of magnitude faster than currently existing Gillespie Algorithm variants when simulating several yeast MAPK cascade models.

  7. An Extended HITS Algorithm on Bipartite Network for Features Extraction of Online Customer Reviews

    Directory of Open Access Journals (Sweden)

    Chen Liu

    2018-05-01

    Full Text Available How to acquire useful information intelligently in the age of information explosion has become an important issue. In this context, sentiment analysis emerges with the growth of the need of information extraction. One of the most important tasks of sentiment analysis is feature extraction of entities in consumer reviews. This paper first constitutes a directed bipartite feature-sentiment relation network with a set of candidate features-sentiment pairs that is extracted by dependency syntax analysis from consumer reviews. Then, a novel method called MHITS which combines PMI with weighted HITS algorithm is proposed to rank these candidate product features to find out real product features. Empirical experiments indicate the effectiveness of our approach across different kinds and various data sizes of product. In addition, the effect of the proposed algorithm is not the same for the corpus with different proportions of the word pair that includes the “bad”, “good”, “poor”, “pretty good”, “not bad” these general collocation words.

  8. Analysis of limiting information characteristics of quantum-cryptography protocols

    International Nuclear Information System (INIS)

    Sych, D V; Grishanin, Boris A; Zadkov, Viktor N

    2005-01-01

    The problem of increasing the critical error rate of quantum-cryptography protocols by varying a set of letters in a quantum alphabet for space of a fixed dimensionality is studied. Quantum alphabets forming regular polyhedra on the Bloch sphere and the continual alphabet equally including all the quantum states are considered. It is shown that, in the absence of basis reconciliation, a protocol with the tetrahedral alphabet has the highest critical error rate among the protocols considered, while after the basis reconciliation, a protocol with the continual alphabet possesses the highest critical error rate. (quantum optics and quantum computation)

  9. Quantum information and convex optimization

    International Nuclear Information System (INIS)

    Reimpell, Michael

    2008-01-01

    This thesis is concerned with convex optimization problems in quantum information theory. It features an iterative algorithm for optimal quantum error correcting codes, a postprocessing method for incomplete tomography data, a method to estimate the amount of entanglement in witness experiments, and it gives necessary and sufficient criteria for the existence of retrodiction strategies for a generalized mean king problem. (orig.)

  10. Quantum information and convex optimization

    Energy Technology Data Exchange (ETDEWEB)

    Reimpell, Michael

    2008-07-01

    This thesis is concerned with convex optimization problems in quantum information theory. It features an iterative algorithm for optimal quantum error correcting codes, a postprocessing method for incomplete tomography data, a method to estimate the amount of entanglement in witness experiments, and it gives necessary and sufficient criteria for the existence of retrodiction strategies for a generalized mean king problem. (orig.)

  11. Error correction and degeneracy in surface codes suffering loss

    International Nuclear Information System (INIS)

    Stace, Thomas M.; Barrett, Sean D.

    2010-01-01

    Many proposals for quantum information processing are subject to detectable loss errors. In this paper, we give a detailed account of recent results in which we showed that topological quantum memories can simultaneously tolerate both loss errors and computational errors, with a graceful tradeoff between the threshold for each. We further discuss a number of subtleties that arise when implementing error correction on topological memories. We particularly focus on the role played by degeneracy in the matching algorithms and present a systematic study of its effects on thresholds. We also discuss some of the implications of degeneracy for estimating phase transition temperatures in the random bond Ising model.

  12. Quantum cryptography as a retrodiction problem.

    Science.gov (United States)

    Werner, A H; Franz, T; Werner, R F

    2009-11-27

    We propose a quantum key distribution protocol based on a quantum retrodiction protocol, known as the Mean King problem. The protocol uses a two way quantum channel. We show security against coherent attacks in a transmission-error free scenario, even if Eve is allowed to attack both transmissions. This establishes a connection between retrodiction and key distribution.

  13. Quantum Instantons and Quantum Chaos

    OpenAIRE

    Jirari, H.; Kröger, H.; Luo, X. Q.; Moriarty, K. J. M.; Rubin, S. G.

    1999-01-01

    Based on a closed form expression for the path integral of quantum transition amplitudes, we suggest rigorous definitions of both, quantum instantons and quantum chaos. As an example we compute the quantum instanton of the double well potential.

  14. Generalized Choi states and 2-distillability of quantum states

    Science.gov (United States)

    Chen, Lin; Tang, Wai-Shing; Yang, Yu

    2018-05-01

    We investigate the distillability of bipartite quantum states in terms of positive and completely positive maps. We construct the so-called generalized Choi states and show that it is distillable when it has negative partial transpose. We convert the distillability problem of 2-copy n× n Werner states into the determination of the positivity of an Hermitian matrix. We obtain several sufficient conditions by which the positivity holds. Further, we investigate the case n=3 by the classification of 2× 3× 3 pure states.

  15. Entanglement entropy of 2D conformal quantum critical points: hearing the shape of a quantum drum.

    Science.gov (United States)

    Fradkin, Eduardo; Moore, Joel E

    2006-08-04

    The entanglement entropy of a pure quantum state of a bipartite system A union or logical sumB is defined as the von Neumann entropy of the reduced density matrix obtained by tracing over one of the two parts. In one dimension, the entanglement of critical ground states diverges logarithmically in the subsystem size, with a universal coefficient that for conformally invariant critical points is related to the central charge of the conformal field theory. We find that the entanglement entropy of a standard class of z=2 conformal quantum critical points in two spatial dimensions, in addition to a nonuniversal "area law" contribution linear in the size of the AB boundary, generically has a universal logarithmically divergent correction, which is completely determined by the geometry of the partition and by the central charge of the field theory that describes the critical wave function.

  16. Quantum Distinction: Quantum Distinctiones!

    OpenAIRE

    Zeps, Dainis

    2009-01-01

    10 pages; How many distinctions, in Latin, quantum distinctiones. We suggest approach of anthropic principle based on anthropic reference system which should be applied equally both in theoretical physics and in mathematics. We come to principle that within reference system of life subject of mathematics (that of thinking) should be equated with subject of physics (that of nature). For this reason we enter notions of series of distinctions, quantum distinction, and argue that quantum distinct...

  17. Robust dynamical decoupling for quantum computing and quantum memory.

    Science.gov (United States)

    Souza, Alexandre M; Alvarez, Gonzalo A; Suter, Dieter

    2011-06-17

    Dynamical decoupling (DD) is a popular technique for protecting qubits from the environment. However, unless special care is taken, experimental errors in the control pulses used in this technique can destroy the quantum information instead of preserving it. Here, we investigate techniques for making DD sequences robust against different types of experimental errors while retaining good decoupling efficiency in a fluctuating environment. We present experimental data from solid-state nuclear spin qubits and introduce a new DD sequence that is suitable for quantum computing and quantum memory.

  18. Some applications of uncertainty relations in quantum information

    Science.gov (United States)

    Majumdar, A. S.; Pramanik, T.

    2016-08-01

    We discuss some applications of various versions of uncertainty relations for both discrete and continuous variables in the context of quantum information theory. The Heisenberg uncertainty relation enables demonstration of the Einstein, Podolsky and Rosen (EPR) paradox. Entropic uncertainty relations (EURs) are used to reveal quantum steering for non-Gaussian continuous variable states. EURs for discrete variables are studied in the context of quantum memory where fine-graining yields the optimum lower bound of uncertainty. The fine-grained uncertainty relation is used to obtain connections between uncertainty and the nonlocality of retrieval games for bipartite and tripartite systems. The Robertson-Schrödinger (RS) uncertainty relation is applied for distinguishing pure and mixed states of discrete variables.

  19. Entanglement in Quantum Field Theory: particle mixing and oscillations

    International Nuclear Information System (INIS)

    Blasone, M; Dell'Anno, F; De Siena, S; Illuminati, F

    2013-01-01

    The phenomena of particle mixing and flavor oscillations in elementary particle physics are associated with multi-mode entanglement of single-particle states. We show that, in the framework of quantum field theory, these phenomena exhibit a fine structure of quantum correlations, as multi-mode multi-particle entanglement appears. Indeed, the presence of anti-particles adds further degrees of freedom, thus providing nontrivial contributions both to flavor entanglement and, more generally, to multi-partite entanglement. By using the global entanglement measure, based on the linear entropies associated with all the possible bipartitions, we analyze the entanglement in the multiparticle states of two-flavor neutrinos and anti-neutrinos. A direct comparison with the instance of the quantum mechanical Pontecorvo single-particle states is also performed.

  20. Computing Coherence Vectors and Correlation Matrices with Application to Quantum Discord Quantification

    Directory of Open Access Journals (Sweden)

    Jonas Maziero

    2016-01-01

    Full Text Available Coherence vectors and correlation matrices are important functions frequently used in physics. The numerical calculation of these functions directly from their definitions, which involves Kronecker products and matrix multiplications, may seem to be a reasonable option. Notwithstanding, as we demonstrate in this paper, some algebraic manipulations before programming can reduce considerably their computational complexity. Besides, we provide Fortran code to generate generalized Gell-Mann matrices and to compute the optimized and unoptimized versions of associated Bloch’s vectors and correlation matrix in the case of bipartite quantum systems. As a code test and application example, we consider the calculation of Hilbert-Schmidt quantum discords.

  1. Learning from prescribing errors

    OpenAIRE

    Dean, B

    2002-01-01

    

 The importance of learning from medical error has recently received increasing emphasis. This paper focuses on prescribing errors and argues that, while learning from prescribing errors is a laudable goal, there are currently barriers that can prevent this occurring. Learning from errors can take place on an individual level, at a team level, and across an organisation. Barriers to learning from prescribing errors include the non-discovery of many prescribing errors, lack of feedback to th...

  2. Quantum measurement and algebraic quantum field theories

    International Nuclear Information System (INIS)

    DeFacio, B.

    1976-01-01

    It is shown that the physics and semantics of quantum measurement provide a natural interpretation of the weak neighborhoods of the states on observable algebras without invoking any ideas of ''a reading error'' or ''a measured range.'' Then the state preparation process in quantum measurement theory is shown to give the normal (or locally normal) states on the observable algebra. Some remarks are made concerning the physical implications of normal state for systems with an infinite number of degrees of freedom, including questions on open and closed algebraic theories

  3. Gaussian Hypothesis Testing and Quantum Illumination.

    Science.gov (United States)

    Wilde, Mark M; Tomamichel, Marco; Lloyd, Seth; Berta, Mario

    2017-09-22

    Quantum hypothesis testing is one of the most basic tasks in quantum information theory and has fundamental links with quantum communication and estimation theory. In this paper, we establish a formula that characterizes the decay rate of the minimal type-II error probability in a quantum hypothesis test of two Gaussian states given a fixed constraint on the type-I error probability. This formula is a direct function of the mean vectors and covariance matrices of the quantum Gaussian states in question. We give an application to quantum illumination, which is the task of determining whether there is a low-reflectivity object embedded in a target region with a bright thermal-noise bath. For the asymmetric-error setting, we find that a quantum illumination transmitter can achieve an error probability exponent stronger than a coherent-state transmitter of the same mean photon number, and furthermore, that it requires far fewer trials to do so. This occurs when the background thermal noise is either low or bright, which means that a quantum advantage is even easier to witness than in the symmetric-error setting because it occurs for a larger range of parameters. Going forward from here, we expect our formula to have applications in settings well beyond those considered in this paper, especially to quantum communication tasks involving quantum Gaussian channels.

  4. Mathematical foundation of quantum annealing

    International Nuclear Information System (INIS)

    Morita, Satoshi; Nishimori, Hidetoshi

    2008-01-01

    Quantum annealing is a generic name of quantum algorithms that use quantum-mechanical fluctuations to search for the solution of an optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundations of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution following the Schroedinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence for both the Schroedinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping

  5. Fault tolerance in protein interaction networks: stable bipartite subgraphs and redundant pathways.

    Directory of Open Access Journals (Sweden)

    Arthur Brady

    Full Text Available As increasing amounts of high-throughput data for the yeast interactome become available, more system-wide properties are uncovered. One interesting question concerns the fault tolerance of protein interaction networks: whether there exist alternative pathways that can perform some required function if a gene essential to the main mechanism is defective, absent or suppressed. A signature pattern for redundant pathways is the BPM (between-pathway model motif, introduced by Kelley and Ideker. Past methods proposed to search the yeast interactome for BPM motifs have had several important limitations. First, they have been driven heuristically by local greedy searches, which can lead to the inclusion of extra genes that may not belong in the motif; second, they have been validated solely by functional coherence of the putative pathways using GO enrichment, making it difficult to evaluate putative BPMs in the absence of already known biological annotation. We introduce stable bipartite subgraphs, and show they form a clean and efficient way of generating meaningful BPMs which naturally discard extra genes included by local greedy methods. We show by GO enrichment measures that our BPM set outperforms previous work, covering more known complexes and functional pathways. Perhaps most importantly, since our BPMs are initially generated by examining the genetic-interaction network only, the location of edges in the protein-protein physical interaction network can then be used to statistically validate each candidate BPM, even with sparse GO annotation (or none at all. We uncover some interesting biological examples of previously unknown putative redundant pathways in such areas as vesicle-mediated transport and DNA repair.

  6. Fault tolerance in protein interaction networks: stable bipartite subgraphs and redundant pathways.

    Science.gov (United States)

    Brady, Arthur; Maxwell, Kyle; Daniels, Noah; Cowen, Lenore J

    2009-01-01

    As increasing amounts of high-throughput data for the yeast interactome become available, more system-wide properties are uncovered. One interesting question concerns the fault tolerance of protein interaction networks: whether there exist alternative pathways that can perform some required function if a gene essential to the main mechanism is defective, absent or suppressed. A signature pattern for redundant pathways is the BPM (between-pathway model) motif, introduced by Kelley and Ideker. Past methods proposed to search the yeast interactome for BPM motifs have had several important limitations. First, they have been driven heuristically by local greedy searches, which can lead to the inclusion of extra genes that may not belong in the motif; second, they have been validated solely by functional coherence of the putative pathways using GO enrichment, making it difficult to evaluate putative BPMs in the absence of already known biological annotation. We introduce stable bipartite subgraphs, and show they form a clean and efficient way of generating meaningful BPMs which naturally discard extra genes included by local greedy methods. We show by GO enrichment measures that our BPM set outperforms previous work, covering more known complexes and functional pathways. Perhaps most importantly, since our BPMs are initially generated by examining the genetic-interaction network only, the location of edges in the protein-protein physical interaction network can then be used to statistically validate each candidate BPM, even with sparse GO annotation (or none at all). We uncover some interesting biological examples of previously unknown putative redundant pathways in such areas as vesicle-mediated transport and DNA repair.

  7. Strictly contractive quantum channels and physically realizable quantum computers

    International Nuclear Information System (INIS)

    Raginsky, Maxim

    2002-01-01

    We study the robustness of quantum computers under the influence of errors modeled by strictly contractive channels. A channel T is defined to be strictly contractive if, for any pair of density operators ρ, σ in its domain, parallel Tρ-Tσ parallel 1 ≤k parallel ρ-σ parallel 1 for some 0≤k 1 denotes the trace norm). In other words, strictly contractive channels render the states of the computer less distinguishable in the sense of quantum detection theory. Starting from the premise that all experimental procedures can be carried out with finite precision, we argue that there exists a physically meaningful connection between strictly contractive channels and errors in physically realizable quantum computers. We show that, in the absence of error correction, sensitivity of quantum memories and computers to strictly contractive errors grows exponentially with storage time and computation time, respectively, and depends only on the constant k and the measurement precision. We prove that strict contractivity rules out the possibility of perfect error correction, and give an argument that approximate error correction, which covers previous work on fault-tolerant quantum computation as a special case, is possible

  8. Quantum stopwatch: how to store time in a quantum memory.

    Science.gov (United States)

    Yang, Yuxiang; Chiribella, Giulio; Hayashi, Masahito

    2018-05-01

    Quantum mechanics imposes a fundamental trade-off between the accuracy of time measurements and the size of the systems used as clocks. When the measurements of different time intervals are combined, the errors due to the finite clock size accumulate, resulting in an overall inaccuracy that grows with the complexity of the set-up. Here, we introduce a method that, in principle, eludes the accumulation of errors by coherently transferring information from a quantum clock to a quantum memory of the smallest possible size. Our method could be used to measure the total duration of a sequence of events with enhanced accuracy, and to reduce the amount of quantum communication needed to stabilize clocks in a quantum network.

  9. A quantum extended Kalman filter

    International Nuclear Information System (INIS)

    Emzir, Muhammad F; Woolley, Matthew J; Petersen, Ian R

    2017-01-01

    In quantum physics, a stochastic master equation (SME) estimates the state (density operator) of a quantum system in the Schrödinger picture based on a record of measurements made on the system. In the Heisenberg picture, the SME is a quantum filter. For a linear quantum system subject to linear measurements and Gaussian noise, the dynamics may be described by quantum stochastic differential equations (QSDEs), also known as quantum Langevin equations, and the quantum filter reduces to a so-called quantum Kalman filter. In this article, we introduce a quantum extended Kalman filter (quantum EKF), which applies a commutative approximation and a time-varying linearization to systems of nonlinear QSDEs. We will show that there are conditions under which a filter similar to a classical EKF can be implemented for quantum systems. The boundedness of estimation errors and the filtering problem with ‘state-dependent’ covariances for process and measurement noises are also discussed. We demonstrate the effectiveness of the quantum EKF by applying it to systems that involve multiple modes, nonlinear Hamiltonians, and simultaneous jump-diffusive measurements. (paper)

  10. A quantum extended Kalman filter

    Science.gov (United States)

    Emzir, Muhammad F.; Woolley, Matthew J.; Petersen, Ian R.

    2017-06-01

    In quantum physics, a stochastic master equation (SME) estimates the state (density operator) of a quantum system in the Schrödinger picture based on a record of measurements made on the system. In the Heisenberg picture, the SME is a quantum filter. For a linear quantum system subject to linear measurements and Gaussian noise, the dynamics may be described by quantum stochastic differential equations (QSDEs), also known as quantum Langevin equations, and the quantum filter reduces to a so-called quantum Kalman filter. In this article, we introduce a quantum extended Kalman filter (quantum EKF), which applies a commutative approximation and a time-varying linearization to systems of nonlinear QSDEs. We will show that there are conditions under which a filter similar to a classical EKF can be implemented for quantum systems. The boundedness of estimation errors and the filtering problem with ‘state-dependent’ covariances for process and measurement noises are also discussed. We demonstrate the effectiveness of the quantum EKF by applying it to systems that involve multiple modes, nonlinear Hamiltonians, and simultaneous jump-diffusive measurements.

  11. Quantum cryptography: towards realization in realistic conditions

    Energy Technology Data Exchange (ETDEWEB)

    Imoto, M; Koashi, M; Shimizu, K [NTT Basic Research Laboratories, 3-1 Morinosato-Wakamiya, Atsugi-shi, Kanagawa 243-01 (Japan); Huttner, B [Universite de Geneve, GAP-optique, 20, Rue de l` Ecole de Medecine CH1211, Geneve 4 (Switzerland)

    1997-05-11

    Many of quantum cryptography schemes have been proposed based on some assumptions such as no transmission loss, no measurement error, and an ideal single photon generator. We have been trying to develop a theory of quantum cryptography considering realistic conditions. As such attempts, we propose quantum cryptography with coherent states, quantum cryptography with two-photon interference, and generalization of two-state cryptography to two-mixed-state cases. (author) 15 refs., 1 fig., 1 tab.

  12. Quantum cryptography: towards realization in realistic conditions

    International Nuclear Information System (INIS)

    Imoto, M.; Koashi, M.; Shimizu, K.; Huttner, B.

    1997-01-01

    Many of quantum cryptography schemes have been proposed based on some assumptions such as no transmission loss, no measurement error, and an ideal single photon generator. We have been trying to develop a theory of quantum cryptography considering realistic conditions. As such attempts, we propose quantum cryptography with coherent states, quantum cryptography with two-photon interference, and generalization of two-state cryptography to two-mixed-state cases. (author)

  13. Quantum walks, quantum gates, and quantum computers

    International Nuclear Information System (INIS)

    Hines, Andrew P.; Stamp, P. C. E.

    2007-01-01

    The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between quantum walk Hamiltonians and Hamiltonians for qubit systems and quantum circuits; this is done for both single-excitation and multiexcitation encodings. Specific examples of spin chains, as well as static and dynamic systems of qubits, are mapped to quantum walks, and walks on hyperlattices and hypercubes are mapped to various gate systems. We also show how to map a quantum circuit performing the quantum Fourier transform, the key element of Shor's algorithm, to a quantum walk system doing the same. The results herein are an essential preliminary to a Hamiltonian formulation of quantum walks in which coupling to a dynamic quantum environment is included

  14. Two-dimensional errors

    International Nuclear Information System (INIS)

    Anon.

    1991-01-01

    This chapter addresses the extension of previous work in one-dimensional (linear) error theory to two-dimensional error analysis. The topics of the chapter include the definition of two-dimensional error, the probability ellipse, the probability circle, elliptical (circular) error evaluation, the application to position accuracy, and the use of control systems (points) in measurements

  15. Part two: Error propagation

    International Nuclear Information System (INIS)

    Picard, R.R.

    1989-01-01

    Topics covered in this chapter include a discussion of exact results as related to nuclear materials management and accounting in nuclear facilities; propagation of error for a single measured value; propagation of error for several measured values; error propagation for materials balances; and an application of error propagation to an example of uranium hexafluoride conversion process

  16. Learning from Errors

    OpenAIRE

    Martínez-Legaz, Juan Enrique; Soubeyran, Antoine

    2003-01-01

    We present a model of learning in which agents learn from errors. If an action turns out to be an error, the agent rejects not only that action but also neighboring actions. We find that, keeping memory of his errors, under mild assumptions an acceptable solution is asymptotically reached. Moreover, one can take advantage of big errors for a faster learning.

  17. The family Rhabdoviridae: Mono- and bipartite negative-sense RNA viruses with diverse genome organization and common evolutionary origins

    Science.gov (United States)

    Dietzgen, Ralf G.; Kondo, Hideki; Goodin, Michael M.; Kurath, Gael; Vasilakis, Nikos

    2017-01-01

    The family Rhabdoviridae consists of mostly enveloped, bullet-shaped or bacilliform viruses with a negative-sense, single-stranded RNA genome that infect vertebrates, invertebrates or plants. This ecological diversity is reflected by the diversity and complexity of their genomes. Five canonical structural protein genes are conserved in all rhabdoviruses, but may be overprinted, overlapped or interspersed with several novel and diverse accessory genes. This review gives an overview of the characteristics and diversity of rhabdoviruses, their taxonomic classification, replication mechanism, properties of classical rhabdoviruses such as rabies virus and rhabdoviruses with complex genomes, rhabdoviruses infecting aquatic species, and plant rhabdoviruses with both mono- and bipartite genomes.

  18. Quantum BCH Codes Based on Spectral Techniques

    International Nuclear Information System (INIS)

    Guo Ying; Zeng Guihua

    2006-01-01

    When the time variable in quantum signal processing is discrete, the Fourier transform exists on the vector space of n-tuples over the Galois field F 2 , which plays an important role in the investigation of quantum signals. By using Fourier transforms, the idea of quantum coding theory can be described in a setting that is much different from that seen that far. Quantum BCH codes can be defined as codes whose quantum states have certain specified consecutive spectral components equal to zero and the error-correcting ability is also described by the number of the consecutive zeros. Moreover, the decoding of quantum codes can be described spectrally with more efficiency.

  19. Quantum control of optomechanical systems

    International Nuclear Information System (INIS)

    Hofer, S.

    2015-01-01

    This thesis explores the prospects of entanglement-enhanced quantum control of optomechanical systems. We first discuss several pulsed schemes in which the radiation-pressure interaction is used to generate EPR entanglement between the mechanical mode of a cavity-optomechanical system and a travelling-wave light pulse. The entanglement created in this way can be used as a resource for mechanical state preparation. On the basis of this protocol, we introduce an optomechanical teleportation scheme to transfer an arbitrary light state onto the mechanical system. Furthermore, we describe how one can create a mechanical non-classical state (i.e., a state with a negative Wigner function) by single-photon detection, and, in a similar protocol, how optomechanical systems can be used to demonstrate the violation of a Bell inequality. The second part of the thesis is dedicated to time-continuous quantum control protocols. Making use of optimal-control techniques, we analyse measurement-based feedback cooling of a mechanical oscillator and demonstrate that ground-state cooling is achievable in the sideband-resolved, blue-detuned regime. We then extend this homodyne-detection based setup and introduce the notion of a time-continuous Bell measurement---a generalisation of the standard continuous variable Bell measurement to a continuous measurement setting. Combining this concept with continuous feedback we analyse the generation of a squeezed mechanical steady state via time-continuous teleportation, and the creation of bipartite mechanical entanglement by entanglement swapping. Finally we discuss an experiment demonstrating the evaluation of the conditional optomechanical quantum state by Kalman filtering, constituting a important step towards time-continuous quantum control of optomechanical systems and the possible realisation of the protocols presented in this thesis. (author) [de

  20. Modular architectures for quantum networks

    Science.gov (United States)

    Pirker, A.; Wallnöfer, J.; Dür, W.

    2018-05-01

    We consider the problem of generating multipartite entangled states in a quantum network upon request. We follow a top-down approach, where the required entanglement is initially present in the network in form of network states shared between network devices, and then manipulated in such a way that the desired target state is generated. This minimizes generation times, and allows for network structures that are in principle independent of physical links. We present a modular and flexible architecture, where a multi-layer network consists of devices of varying complexity, including quantum network routers, switches and clients, that share certain resource states. We concentrate on the generation of graph states among clients, which are resources for numerous distributed quantum tasks. We assume minimal functionality for clients, i.e. they do not participate in the complex and distributed generation process of the target state. We present architectures based on shared multipartite entangled Greenberger–Horne–Zeilinger states of different size, and fully connected decorated graph states, respectively. We compare the features of these architectures to an approach that is based on bipartite entanglement, and identify advantages of the multipartite approach in terms of memory requirements and complexity of state manipulation. The architectures can handle parallel requests, and are designed in such a way that the network state can be dynamically extended if new clients or devices join the network. For generation or dynamical extension of the network states, we propose a quantum network configuration protocol, where entanglement purification is used to establish high fidelity states. The latter also allows one to show that the entanglement generated among clients is private, i.e. the network is secure.