A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Motivated from the theory of quantum error correcting codes, we investigate a combinatorial problem that involves a symmetric n-vertices colourable graph and a group of operations (colouring rules) on ... We provide an explicit algorithm for computing the solution of our problem, which in turn is directly related to computing the distance (performance) of an underlying quantum error correcting code. ... Most known quantum error correcting codes belong to the class of stabilizer codes, which in turn are equivalent  to the so-called graph codes. ...doi:10.1142/s1793830914500542 fatcat:ogilimz7djgzflcbln4vxfgv4a
Correlated quantum errors occur with a lower probability than uncorrelated ones; the probability of system crashes when we use either traditional quantum error-correcting codes, or codes specially designed ... the [[7, 1, 3]] single-error correcting Hamming code and 22 non-failing error states per code block requires 1 GB of memory while a simulation of the [[23, 1, 5]] double-error correcting Golay code and ... Correlated quantum errors occur with a lower probability than uncorrelated ones; the probability of system crashes when we use either traditional quantum error-correcting codes, or codes specially designed ...doi:10.1109/pads.2008.34 dblp:conf/pads/MarinescuM08 fatcat:vlcxvhbi7reuznaxisz5kez2jm
We present a series of structured LDPC codes suitable for use in quantum error correction. Those codes belong to the class of dual-containing Calderbank-Shor-Steane (CSS) codes. ... The component CSS code is designed using the combinatorial object known as balanced incomplete block design (BIBD) with an even index. The quantum LDPC codes have the rate around 0.9. ... Decoherence introduces the errors, and someone has to rely on quantum error-correction. ...doi:10.1109/lcomm.2008.080083 fatcat:35bcv3yiefeh5bxptnygomh65q
As in classical coding theory, quantum analogues of low-density parity-check (LDPC) codes have offered good error correction performance and low decoding complexity by employing the Calderbank-Shor-Steane ... While the entanglement-assisted stabilizer formalism overcomes this limitation by exploiting maximally entangled states (ebits), excessive reliance on ebits is a substantial obstacle to implementation. ... ACKNOWLEDGMENT The authors would like to thank Mark M. Wilde, the anonymous referee and Associate Editor Jean-Pierre Tillich for their insightful comments and valuable suggestions. ...doi:10.1109/tit.2013.2247461 fatcat:2husqunu6rfzvidtpcmhvpga2q
Our approach to designing high-rate quantum error-correcting codes also allows for making direct use of other major syndrome decoding methods for linear codes, making it possible to deal with a situation ... A typical obstacle to constructing a variety of strong quantum error-correcting codes is the complicated restrictions imposed on the structure of a code. ... ACKNOWLEDGMENT The authors would like to thank the anonymous referees and Associate Editor Alexei Ashikhmin for their careful reading of the manuscript and valuable suggestions. ...doi:10.1109/tit.2015.2398436 fatcat:h4kpezzcznh4zpxgkcqi6gqu44
The quantum device possesses its own potential internal quantum state (IQS), which is maintained for a prolonged time via reflective error-correction. ... codes into a single reflective set. ... program of error-correcting codes. ...doi:10.1016/j.biosystems.2004.04.001 pmid:15527945 fatcat:4wzpon3cdjel7ntaxlrqzpe2ye
Quantum computers (QCs) must implement quantum error correcting codes (QECCs) to protect their logical qubits from errors, and modeling the effectiveness of QECCs on QCs is an important problem for evaluating ... The previously developed Monte Carlo (MC) error models may take days or weeks of execution to produce an accurate result due to their random sampling approach. ... For example, the ͓͓7,1,3͔͔ quantum error correction code ͑QECC͒ encodes one logical qubit into a block of seven physical qubits. ...doi:10.1103/physreva.77.052315 fatcat:iobmkcbl65huzn5qqudq3z3ymq
8049 94B Theory of error-correcting codes and error-detecting codes 99-110; MR 2002f:94073] presented a combinatorial construction for such codes and proved that a 7*(2,6,v)-code exists for all positive ... ) Yet another approach to the extended ternary Golay code. ...
To avoid a collapse of the quantum information in the process of correcting errors, it is possible to make a partial measurement that extracts only the error-information and leaves the encoded state untouched ... codes into a single reflective set. ... The decoherence-free state is maintained by the error-correcting code from the quantum computer. Error-correcting code is concatenated by the encoding in genome. ...doi:10.3390/e5020076 fatcat:6hdjz755yvevbds36upoi6otnu
9831 94B Theory of error-correcting codes and error-detecting codes merators of linear codes over F) + uF) with u* = 1, whose images under a Gray map are Type I and Type II binary codes. ... This paper analyzes surface codes, which are topological error- correcting codes introduced by Kitaev [in Quantum communication, computing, and measurement, 181-188, Plenum, New York, 1997]. ...
Vazirani, A survey of quantum complexity theory (193-217). Quantum error correcting codes and quantum cryptography: Daniel Gottesman, An introduction to quantum error correction (221-235); Samuel J. ... Since there’s a whole two-sphere of values for a qubit state, not just two possible values, there’s going to be a whole new toolkit of error-correction required if reliable quantum computing devices are ...
The second part of the paper illustrates how a cluster state preparation procedure can aid in quantum error correction. ... Summary: “We establish a further connection between one-way communication where a sender conveys information to a receiver who has related information, and error-correction coding where a sender attempts ...
A new class of error-correcting quantum codes is introduced capable of stabilizing qubits against spontaneous decay arising from couplings to statistically independent reservoirs. ... These quantum codes are based on the idea of using an embedded quantum code and exploiting the classical information available about which qubit has been affected by the environment. ...  have presented a one-error correcting embedded quantum code which applies to the important special case of equal decay rates of all the qubits. ...doi:10.1103/physrevlett.86.4402 pmid:11328185 fatcat:rra22sevrfgltjxcj4tyklabny
The basics of quantum error correction codes, which I will briefly review, have not significantly changed since their introduction fifteen years ago. ... It is now understood that two dimensional surface codes, close relatives of the original toric code of Kitaev, can be adapted to effectively perform logical gate operations in a very simple planar architecture ... It definitely takes a lot more effort to correct one quantum error than it does to correct one classical error! Fig. 2 . ...doi:10.1088/0031-8949/2009/t137/014020 fatcat:qcetjsu6uffqbgw2alu4p5xggu
The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach. ... Therefore, our modeling approach with hybrid quantum algorithms can be applicable for combinatorial problems in various fields to find an optimal solution in polynomial time. ... These hybrid approaches require no error correction techniques in order to run quantum circuits on the NISQ devices. ...arXiv:1911.00595v2 fatcat:yfqrqd73pfgwrfllfykbd7rgwu
« Previous Showing results 1 — 15 out of 6,539 results