Related papers: Non-binary Entanglement-assisted Stabilizer Quantu…
Entanglement is essential for quantum information processing, but is limited by noise. We address this by developing high-yield entanglement distillation protocols with several advancements. (1) We extend the 2-to-1 recurrence entanglement…
Up to now every good quantum error-correcting code discovered has had the structure of an eigenspace of an Abelian group generated by tensor products of Pauli matrices; such codes are known as stabilizer or additive codes. In this letter we…
The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is the code resulting from exchanging the original code's information qubits with its ebits. To introduce this notion, we show how entanglement-assisted (EA)…
We address the task of verifying whether a quantum computer, designed to be protected by a specific stabilizer code, correctly encodes the corresponding logical qubits. To achieve this, we develop a general framework for subspace…
We demonstrate that a necessary precondition for unconditionally secure quantum key distribution is that sender and receiver can use the available measurement results to prove the presence of entanglement in a quantum state that is…
In this paper, we propose how to simply construct a pair of linear codes for the BB84 quantum key distribution protocol. This protocol allows unconditional security in the presence of an eavesdropper, and the pair of linear codes is used…
Quantum error correction and the use of quantum error correction codes is likely to be essential for the realisation of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes which are tailored…
Absolutely maximally entangled (AME) states of multipartite quantum systems exhibit maximal entanglement across all possible bipartitions. These states lead to teleportation protocols that surpass standard teleportation schemes, determine…
Recent advancements in quantum annealing hardware and numerous studies in this area suggests that quantum annealers have the potential to be effective in solving unconstrained binary quadratic programming problems. Naturally, one may desire…
Quantum error correction is an important ingredient for scalable quantum computing. Stabilizer codes are one of the most promising and straightforward ways to correct quantum errors, are convenient for logical operations, and improve…
Robust implementation of quantum key distribution requires precise state generation and measurements, as well as a transmission that is resistant to channel disturbances. However, the choice of the optimal encoding scheme is not trivial and…
We introduce quantum pin codes: a class of quantum CSS codes. Quantum pin codes are a generalization of quantum color codes and Reed-Muller codes and share a lot of their structure and properties. Pin codes have gauge operators, an…
In this paper, we prove how to extend a subset of quantum stabilizer codes into a qudit hybrid code storing $\log_2 p$ classical bits over a qudit space with dimension $p$, with $p$ prime. Our proof also gives an explicit procedure for…
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be represented by graphical models which possess a structure…
After analysing the main quantum secret sharing protocol based on the entanglement states, we propose an idea to directly encode the qubit of quantum key distributions, and then present a quantum secret sharing scheme where only product…
Quantum convolutional code was introduced recently as an alternative way to protect vital quantum information. To complete the analysis of quantum convolutional code, I report a way to decode certain quantum convolutional codes based on the…
Entanglement appears under two different forms in quantum theory, namely as a property of states of joint systems and as a property of measurement eigenstates in joint measurements. By combining these two aspects of entanglement, it is…
In this paper, we introduce a construction of quantum convolutional codes (QCCs) based on difference triangle sets (DTSs). To construct QCCs, one must determine polynomial stabilizers $X(D)$ and $Z(D)$ that commute (symplectic…
The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is central for building scalable quantum information systems. In most state-of-the-art approaches, qubits interact locally,…
Demonstrating how long-range entangled states are born from product states has gained much attention, which is not only important for quantum technology but also provides an unconventional tool in characterizing and classifying exotic…