Related papers: Deterministic quantum one-time pad via Fibonacci a…

The construction of a perfectly secure private quantum channel in dimension d is known to require 2 log d shared random key bits between the sender and receiver. We show that if only near-perfect security is required, the size of the key…

Classically simulating the dynamics of anyonic excitations in two-dimensional quantum systems is likely intractable in general because such dynamics are sufficient to implement universal quantum computation. However, processes of interest…

We show that deterministic quantum computing with a single bit (DQC1) can determine whether the classical limit of a quantum system is chaotic or integrable using O(N) physical resources, where $N$ is the dimension of the Hilbert space of…

Rydberg atoms with principal quantum number n >> 1 have exaggerated atomic properties including dipole-dipole interactions that scale as n^4 and radiative lifetimes that scale as n^3. It was proposed a decade ago to take advantage of these…

The ability to realize high-fidelity quantum communication is one of the many facets required to build generic quantum computing devices. In addition to quantum processing, sensing, and storage, transferring the resulting quantum states…

Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we show that "for most practical purposes" one can learn a…

High-dimensional quantum key distribution (QKD) allows to achieve information-theoretic secure communications, providing high key generation rates which cannot in principle be obtained by QKD protocols with binary encoding. Nonetheless, the…

The operational formalism to quantum mechanics seeks to base the theory on a firm foundation of physically well-motivated axioms [1]. It has succeeded in deriving the Feynman rules [2] for general quantum systems. Additional elaborations…

A qudit ($d$-level quantum systems) has a large Hilbert space and thus can be used to achieve many quantum information and communication tasks. Here, we propose a method to transfer arbitrary $d$-dimensional quantum states (known or…

We propose a multiple-range quantum communication channel to realize coherent two-way quantum state transport with high fidelity. In our scheme, an information carrier (a qubit) and its remote partner are both adiabatically coupled to the…

A quantum computer can perform exponentially faster than its classical counterpart. It works on the principle of superposition. But due to the decoherence effect, the superposition of a quantum state gets destroyed by the interaction with…

We present a two-step exact remote state preparation protocol of an arbitrary qubit with the aid of a three-particle Greenberger-Horne-Zeilinger state. Generalization of this protocol for higher-dimensional Hilbert space systems among three…

A theoretical framework is presented allowing the treatment of quantum messages with components of variable length. To this aim a many-letter space, similiar to the Fock space, is constructed, generalizing the standard quantum information…

A system of a two-level atom of an impurity (qubit) inserted into a periodic chain coupled to the continuum is studied with the use of the effective non-Hermitian Hamiltonian. Exact solutions are derived for the quasistationary eigenstates,…

A method is presented for producing analytical results applicable to the standard two-party deterministic dense coding protocol, wherein communication of K perfectly distinguishable messages is attainable with the aid of K selected local…

In [J.S. Shaari, M. Lucamarini, M.R.B. Wahiddin, Phys. Lett. A 358 (2006) 85-90] the deterministic six states protocol (6DP) for quantum communication has been developed. This protocol is based on three mutually unbiased bases and four…

Cluster states are useful in many quantum information processing applications. In particular, universal measurement-based quantum computation (MBQC) utilizes 2D cluster states, and topologically fault-tolerant MBQC requires cluster states…

Mixed state quantum computation can perform certain tasks which are believed to be efficiently intractable on a classical computer. For a specific model of mixed state quantum computation, namely, {\it deterministic quantum computation with…

Photonic quantum computing offers a promising platform for quantum information processing, benefiting from the long coherence times of photons and their ease of manipulation. This paper presents a scheme for implementing a deterministic…

We present a formula that determines the optimal number of qubits per message that allows asymptotically faithful compression of the quantum information carried by an ensemble of mixed states. The set of mixed states determines a…