Related papers: Modifying method of constructing quantum codes fro…
Quantum computing is an emerging technology that has the potential to achieve exponential speedups over their classical counterparts. To achieve quantum advantage, quantum principles are being applied to fields such as communications,…
Entanglement distillation is a well-studied problem in quantum information, where one typically starts with $n$ noisy Bell pairs and distills $k$ Bell pairs of higher fidelity. While distilling Bell pairs is the canonical setting, it is…
We introduce several classes of quantum combinatorial designs, namely quantum Latin squares, cubes, hypercubes and a notion of orthogonality between them. A further introduced notion, quantum orthogonal arrays, generalizes all previous…
Entanglement-assisted quantum error-correcting (EAQEC) codes are a subclass of quantum error-correcting codes which use entanglement as a resource. These codes can provide error correction capability higher than the codes derived from the…
Utilizing a quantum system for reservoir computing has recently received a lot of attention. Key challenges are related to how on can optimally en- and decode classical information, as well as what constitutes a good reservoir. Our main…
We demonstrate that absolutely maximally entangled (AME) states consisting of $N=4n$ qudits with $n\in\{1,2,3,...\}$, each of even local dimension, cannot be realized as graph states. This result imposes strong constraints on AME states in…
Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum…
Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of preexisting entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code,…
Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit…
The stabilizer code is the most general algebraic construction of quantum error-correcting codes proposed so far. A stabilizer code can be constructed from a self-orthogonal subspace of a symplectic space over a finite field. We propose a…
Errors are inevitable during all kinds quantum informational tasks and quantum error-correcting codes (QECCs) are powerful tools to fight various quantum noises. For standard QECCs physical systems have the same number of energy levels.…
We present a method for multipartite entanglement purification of any stabilizer state shared by several parties. In our protocol each party measures the stabilizer operators of a quantum error-correcting code on his or her qubits. The…
We present a construction of highly entangled states defined on the topology of a platonic solid using tensor networks based on ancillary Absolute Maximally Entangled (AME) states. We illustrate the idea using the example of a quantum state…
Recently, entanglement-assisted quantum error correcting codes (EAQECCs) have been constructed by cyclic codes and negacyclic codes. In this paper, by analyzing the cyclotomic cosets in the defining set of constacyclic codes, we constructed…
Entanglement-assisted quantum (QUENTA) codes are a subclass of quantum error-correcting codes which use entanglement as a resource. These codes can provide error correction capability higher than the codes derived from the traditional…
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…
We consider the explicit construction of resource states for measurement-based quantum information processing. We concentrate on special-purpose resource states that are capable to perform a certain operation or task, where we consider…
We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state $\vert \Psi \rangle$ onto an optimal quantum circuit $\hat{\mathcal{C}}$ with a finite number of single- and two-qubit quantum gates. The proposed…
We show a simple example of a secret sharing scheme encoding classical secret to quantum shares that can realize an access structure impossible by classical information processing with limitation on the size of each share. The example is…
Though the no-cloning theorem [1] prohibits exact replication of arbitrary quantum states, there are many instances in quantum information processing and entanglement measurement in which a weaker form of cloning may be useful. Here, I…