Related papers: Deterministic quantum one-time pad via Fibonacci a…
Quantum communication is based on the generation of quantum states and exploitation of quantum resources for communication protocols. Currently, photons are considered as the optimal carrier of information, because they enable long-distance…
A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented…
Quantum networks are the ultimate target in quantum communication, where many connected users can share information carried by quantum systems. The keystones of such structures are the reliable generation, transmission and manipulation of…
We propose the use of Rydberg interactions and ensembles of cold atoms in mixed state for the implementation of a protocol for deterministic quantum computation with one quantum bit (DQC1) that can be readily operated in high dimensional…
We show that chains of interacting Fibonacci anyons can support a wide variety of collective ground states ranging from extended critical, gapless phases to gapped phases with ground-state degeneracy and quasiparticle excitations. In…
Superposition of two or more states is one of the fundamental concepts of quantum mechanics and provides the basis for several advantages quantum information processing offers. In this work, we experimentally demonstrate that quantum…
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…
Reliable encoding of information in quantum systems is crucial to all approaches to quantum information processing or communication. This applies in particular to photons used in linear optics quantum computing (LOQC), which is scalable…
A set of $n$ pure quantum states is called antidististinguishable if there exists an $n$-outcome measurement that never outputs the outcome `$k$' on the $k$-th quantum state. We describe sets of quantum states for which any subset of three…
We examine how best to design qubits for use in topological quantum computation. These qubits are topological Hilbert spaces associated with small groups of anyons. Op- erations are performed on these by exchanging the anyons. One might…
We present a protocol for sending a message over a quantum channel with different layers of security that will prevent an eavesdropper from deciphering the message without being detected. The protocol has two versions where the bits are…
Fractional statistics give rise to quantum behaviors that differ fundamentally from those of bosons and fermions. While two-dimensional anyons play a major role in strongly correlated systems and topological quantum computing, the nature of…
Quantum communication employs the counter-intuitive features of quantum physics to perform tasks that are im- possible in the classical world. It is crucial for testing the foundations of quantum theory and promises to rev- olutionize our…
Topological quantum computers provide a fault-tolerant method for performing quantum computation. Topological quantum computers manipulate topological defects with exotic exchange statistics called anyons. The simplest anyon model for…
Quantum teleportation allows for the transfer of arbitrary, in principle, unknown quantum states from a sender to a spatially distant receiver, who share an entangled state and can communicate classically. It is the essence of many…
The role of the off-diagonal density matrix elements of the entangled pair is investigated in quantum teleportation of a qbit. The dependence between them and the off-diagonal elements of the teleported density matrix is shown to be linear.…
We propose a scheme for scalable and universal quantum computation using diatomic bits with conditional dipole-dipole interaction, trapped within an optical lattice. The qubit states are encoded by the scattering state and the bound…
Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two…
We investigate quantum information masking for arbitrary dimensional quantum states. We show that mutually orthogonal quantum states can always be served for deterministic masking of quantum information. We further construct a probabilistic…
Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accessed. This paper shows in three settings that quantum messages have only…