Superdense Coding with GHZ and Quantum Key Distribution with W in the ZX-calculus

  title={Superdense Coding with GHZ and Quantum Key Distribution with W in the ZX-calculus},
  author={Anne Hillebrand},
  • A. Hillebrand
  • Published in QPL 1 October 2012
  • Computer Science, Physics
Quantum entanglement is a key resource in many quantum protocols, such as quantum teleportation and quantum cryptography. Yet entanglement makes protocols presented in Dirac notation difficult to verify. This is why Coecke and Duncan have introduced a diagrammatic language for quantum protocols, called the ZX-calculus. This diagrammatic notation is both intuitive and formally rigorous. It is a simple, graphical, high level language that emphasises the composition of systems and naturally… 

Figures and Tables from this paper

Completeness and the ZX-calculus

A graphical calculus similar to the ZX-calculus is developed that fully describes Spekkens' toy theory, and it is shown that it is complete, which implies that a wide range of realistic scenarios in quantum computation can be analysed graphically without loss of deductive power.

Graphical Methods in Device-Independent Quantum Cryptography

A framework for graphical security proofs in device-independent quantum cryptography is introduced using the methods of categorical quantum mechanics to make some of the highly complex proofs in quantum cryptography more accessible, facilitate the discovery of new proofs, and enable automated proof verification.

Superdense coding based on intraparticle entanglement states

Based on the literature survey, this scheme reaches the level at which a single-photon currently carries the most information with good security and robustness, and this work reveals a good idea for realizing superdense coding.

Quantum communication over bit flip channels using entangled bipartite and tripartite states

  • Ankur RainaS. G. Srinivasa
  • Computer Science
    2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2014
The idea of super dense coding is extended to a tripartite system and expressions for Holevo capacity and accessible information for various communication scenarios among the node links are derived.

Different Architectures of Quantum Key Distribution Network

This chapter discusses various architectures for Quantum Key Distribution Network, which operate in a point-to-multi-point (Multicast) configuration rather than in point- to-point mode, so it is crucial to demonstrate compatibility with this type of network in order to maximize the application range for QKD.

Categorical composable cryptography: extended version

. We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract

The ZX calculus is incomplete for quantum mechanics

We prove that the ZX-calculus is incomplete for quantum mechanics. We suggest the addition of a new 'color-swap' rule, of which currently no analytical formulation is known and which we suspect may

Categorical composable cryptography

. We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract



Generalized quantum secret sharing

We explore a generalization of quantum secret sharing (QSS) in which classical shares play a complementary role to quantum shares, exploring further consequences of an idea first studied by

Three qubit entanglement within graphical Z/X-calculus

A new concept of supplementarity allows us to characterise inhabitants of the W class within the abstract diagrammatic calculus; these method extends to more general multipartite qubit states.

Interacting quantum observables: categorical algebra and diagrammatics

The ZX-calculus is introduced, an intuitive and universal graphical calculus for multi-qubit systems, which greatly simplifies derivations in the area of quantum computation and information and axiomatize phase shifts within this framework.

A Quantum Information Theoretical Model for Quantum Secret Sharing Schemes

It is proved that the information theoretical requirements for a class of quantum secret sharing schemes reduce to only one requirement (the recoverability condition) as a consequence of the no-cloning principle.

Multiparty quantum-state sharing of an arbitrary two-particle state with Einstein-Podolsky-Rosen pairs (4 pages)

A scheme for multiparty quantum state sharing of an arbitrary two-particle state is presented with Einstein-Podolsky-Rosen pairs. Any one of the N agents has the access to regenerate the original

Quantum Secure Communication via a W State

W states of multipartite systems are pair-wisely entangled, belonging to a dual class from Greenberger, Horne, and Zeilinger states, and three variant protocols for quantum secure communication are proposed.

Decoy state quantum key distribution.

The method is to use decoy states to detect eavesdropping attacks and has the best of both worlds--enjoying unconditional security guaranteed by the fundamental laws of physics and yet dramatically surpassing some of the best experimental performances reported in the literature.

Three qubits can be entangled in two inequivalent ways

Invertible local transformations of a multipartite system are used to define equivalence classes in the set of entangled states. This classification concerns the entanglement properties of a single

Quantum cryptography using any two nonorthogonal states.

  • Bennett
  • Physics
    Physical review letters
  • 1992
It is shown that in principle any two nonorthogonal quantum states suffice, and a practical interferometric realization using low-intensity coherent light pulses is described.

Teleportation of entangled states and dense coding using a multiparticle quantum channel

It has shown, that for dense coding schemes enhancement of the classical capacity of the channel due from entanglement is N/N-1, and if N>2 there is no one - to -one correspondence between teleportation and dense coding scheme in comparison with the EPR channel is exploited.