相关论文: Infinite Families of Quantum-Classical Hybrid Code…
A hybrid code can simultaneously encode classical and quantum information into quantum digits such that the information is protected against errors when transmitted through a quantum channel. It is shown that a hybrid code has the…
Hybrid codes simultaneously encode both quantum and classical information, allowing for the transmission of both across a quantum channel. We construct a family of nonbinary error-detecting hybrid stabilizer codes that can detect one error…
We show how to construct hybrid quantum-classical codes from subsystem codes by encoding the classical information into the gauge qudits using gauge fixing. Unlike previous work on hybrid codes, we allow for two separate minimum distances,…
We consider the characterization as well as the construction of quantum codes that allow to transmit both quantum and classical information, which we refer to as `hybrid codes'. We construct hybrid codes $[\![n,k{: }m,d]\!]_q$ with length…
Quantum computers do not run in isolation; rather, they are embedded in quantum-classical hybrid architectures. In these setups, a quantum processing unit communicates with a classical device in near-real time. To enable efficient hybrid…
Hybrid quantum-classical algorithms are central to much of the current research in quantum computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era, with a number of experimental demonstrations having already…
There is an advantage in simultaneously transmitting both classical and quantum information over a quantum channel compared to sending independent transmissions. The successful implementation of simultaneous transmissions of quantum and…
As quantum computers mature, the applicability in practice becomes more important. Many uses of quantum computers will be hybrid, with classical computers still playing an important role in operating and using the quantum computer. The term…
It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be…
We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both…
Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that in principle such a…
We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear…
Recent improvements in control of quantum systems make it seem feasible to finally build a quantum computer within a decade. While it has been shown that such a quantum computer can in principle solve certain small electronic structure…
Quantum computing exhibits the unique capability to natively and efficiently encode various natural phenomena, promising theoretical speedups of several orders of magnitude. However, not all computational tasks can be efficiently executed…
Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…
Standard approaches to quantum error correction for fault-tolerant quantum computing are based on encoding a single logical qubit into many physical ones, resulting in asymptotically zero encoding rates and therefore huge resource…
We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived…
New infinite families of quantum symmetric and asymmetric codes are constructed. Several of these are MDS. The codes obtained are shown to have parameters which are better than previously known. A number of known codes are special cases of…
Most known quantum codes are additive, meaning the codespace can be described as the simultaneous eigenspace of an abelian subgroup of the Pauli group. While in some scenarios such codes are strictly suboptimal, very little is understood…
Quantum computers use quantum mechanical phenomena to perform conventionally intractable calculations for specific problems. Despite being universal machines, quantum computers are not expected to replace classical computers, but rather, to…