Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

How do topological quantum error-correcting codes fare under non-Markovian noise

Muhammad Ahsan

Published Aug 7, 2023• 0 citations
Publisher

Abstract

We simulate the performance of toplogical error-correcting codes when all the encoding qubits share same non-Markovian bath. We find that scalable and reliable quantum computing may still be possible if error-rates decline as $\sqrt{n}$ where $n$ is the codeword size.

DOI
10.36227/techrxiv.23805498.v1

Related papers

How do topological quantum error-correcting codes fare under non-Markovian noise

Muhammad Ahsan

We simulate the performance of toplogical error-correcting codes when all the encoding qubits share same non-Markovian bath. We find that scalable and reliable quantum computing may still be possible if error-rates decline as $\sqrt{n}$ where $n$ is the codeword size.

•Aug 7, 2023•0 citations

Performance of topological quantum error correction in the presence of correlated noise

Muhammad Ahsan, Syed Abbas Zilqurnain Naqvi

We investigate the efficacy of topological quantum error-correction in correlated noise model which permits collective coupling of all the codeword qubits to the same non-Markovian environment. In this noise model, the probability distribution over set of phase-flipped qubits, decays sub-exponentially in the size of the set and carries non-trivial likelihood of the occurring large numbers of qubits errors. We find that in the presence of noise correlation, one cannot guarantee arbitrary high computational accuracy simply by incrementing the codeword size while retaining constant noise level per qubit operation. However, if instead, per-operation qubit error probability in an n-qubits long codeword is reduced O(\sqrt{n}) times below the accuracy threshold, arbitrarily accurate quantum computation becomes feasible with acceptable scaling of the codeword size. Our results suggest that progressively reducing noise level in qubits and gates is as important as continuously integrating more qubits to realize scalable and reliable quantum computer.

Quantum Information and Computation•Aug 1, 2018•3 citations

Topological Quantum Computing Based Fault-Tolerant Error Correction Codes

Jincheng Zhang

This paper investigates the design and implementation of a fault-tolerant error correction coding scheme for quantum computing, leveraging the inherent robustness of topological quantum computing. The core concept involves constructing a quantum circuit with topological correction properties, employing an error-correcting code to detect and rectify errors within qubits, and utilizing topological quantum entanglement for redundant encoding, thereby enhancing the stability of quantum states. Unlike conventional quantum computing approaches that rely on multiple measurements for error correction, this method offers a more efficient solution by exploiting the topological protection afforded by exotic states of matter. The proposed scheme aims to significantly improve the reliability and scalability of quantum computation. We present a framework for designing such codes and discuss key challenges and potential advancements in this field. The theoretical analysis focuses on the encoding and decoding processes, quantifying the overhead associated with redundancy and evaluating the performance of the scheme in mitigating various types of quantum errors. ---

•Aug 29, 2026•0 citations

Continuous quantum error correction for non-Markovian decoherence

Ognyan Oreshkov, Todd A. Brun

We study the effect of continuous quantum error correction in the case where each qubit in a codeword is subject to a general Hamiltonian interaction with an independent bath. We first consider the scheme in the case of a trivial single-qubit code, which provides useful insights into the workings of continuous error correction and the difference between Markovian and non-Markovian decoherence. We then study the model of a bit-flip code with each qubit coupled to an independent bath qubit and subject to continuous correction, and find its solution. We show that for sufficiently large error-correction rates, the encoded state approximately follows an evolution of the type of a single decohering qubit, but with an effectively decreased coupling constant. The factor by which the coupling constant is decreased scales quadratically with the error-correction rate. This is compared to the case of Markovian noise, where the decoherence rate is effectively decreased by a factor which scales only linearly with the rate of error correction. The quadratic enhancement depends on the existence of a Zeno regime in the Hamiltonian evolution which is absent in purely Markovian dynamics. We analyze the range of validity of this result and identify two relevant time scales. Finally, we extend the result to more general codes and argue that the performance of continuous error correction will exhibit the same qualitative characteristics.

arXiv:0705.2342•Physical Review A•Aug 20, 2007•47 citations

Quantum topological error correction codes for quantum computation and communication

Daryus Chandra

The employment of quantum error correction codes (QECCs) within quantum computers potentially offers a reliability improvement for both quantum computation and communications tasks. However, the laws of quantum mechanics prevent us from directly invoking the mature family of classical error correction codes in the quantum domain. In order to circumvent the associated problems, the notion of quantum stabilizer codes (QSCs) was proposed in conjunction with syndrome-based decoding in the quantum regime. However, most of the powerful QSC schemes require long codewords for achieving a high performance, which potentially imposes additional challenges for implementation concerning their implementation, since their decoding may require longer than the quantum circuit's coherence time. Hence at the time of writing, QSCs exhibiting short to moderate codeword lengths are preferable. We commence by describing the pivotal problem encountered by classical error-correction codes, which also emerges when designing the QSCs, namely the intrinsic trade-off between the minimum distance versus coding rate. The complete formulation of this particular trade-off does not exist, but several lower and upper bounds can be found in the literature. It has been shown that a substantial gap can be observed between the upper and lower bound of the minimum distance, given the codeword length and the quantum coding rate. Hence, we propose an appealingly simple and invertible analytical approximation, for characterizing the trade-off between the quantum coding rate and the minimum distance of QSCs as well as their corresponding quantum bit error rate (QBER) performance upper-bound. For example, for a half-rate QSC having a codeword length of n = 128, the minimum distance is bounded by 11 < d < 22, while our approximation yields a minimum distance of d = 17 for the above-mentioned code. Next, we link this parametric study of the minimum distance versus quantum coding rate to the popular QSCs, namely to the family of quantum topological error correction codes (QTECCs). In order to construct the classical-to-quantum isomorphism, we conceive and investigate the family of classical topological error correction codes (TECCs), assuming that the bits of a codeword can be arranged in a lattice structure. We then present the classical-to-quantum isomorphism to pave the way for constructing their dual pairs in the quantum domain, which are the QTECCs. Finally, we characterize the performance of QTECCs in the face of the quantum depolarizing channel in terms of both their QBER and fidelity. Specifically, we demonstrate that for quantum coding rate rQ ~ 0, the threshold probability of the QBER below which the colour, rotated-surface, surface, and toric codes become capable of improving the uncoded QBER are given by 1.8 ×10-2, 1.3 ×10-2, 6.3 ×10-2 and 6.8 ×10-2, respectively. Furthermore, we also demonstrate that we can achieve beneficial fidelity improvements above the minimum fidelity of 0.94, 0.97 and 0.99 by employing the rQ = 1/7 colour code, the rQ = 1/9 rotated-surface code, and the rQ = 1/13 surface code, respectively. However, QSCs require additional quantum gates for their employment. Incorporating more quantum gates for performing error correction potentially introduces further sources of quantum decoherence into quantum computers. In this scenario, the primary challenge is to find the sufficient condition required by each of the quantum gates for beneficially employing QECCs in order to yield reliability improvements, given that the quantum gates utilized by the QECCs also introduce quantum decoherence. In this treatise, we approach this problem by firstly presenting the general framework of protecting quantum gates by the amalgamation of the transversal configuration of quantum gates and QSCs, which can be viewed as syndrome-based QECCs. Secondly, we provide examples of the advocated framework by invoking QTECCs for protecting both transversal Hadamard gates and controlled (CNOT) gates. Both our simulation and analytical results explicitly show that by utilizing QTECCs, the fidelity of the quantum gates can be beneficially improved, provided that quantum gates satisfying a certain minimum depolarization fidelity threshold (Fth) are available. For instance, for protecting transversal Hadamard gates, the minimum fidelity values required for each of the gates in order to attain fidelity improvements are 99.74%, 99.73%, 99.87%, and 99.86%, when they are protected by colour, rotated-surface, surface, and toric codes, respectively. Unfortunately, these specific Fth values can only be obtained for a very large number of physical qubits (n → ∞), when the quantum coding rate of the QTECCs approaches zero (rQ → 0). Finally, in order to conceive QSCs exhibiting a high quantum coding rate, we modify the construction of QTECCs for conceiving a low-complexity concatenated quantum turbocode (QTC). The above-mentioned high quantum coding rate is obtained by combining the quantum-domain version of short-block codes (SBCs) also known as single parity-check (SPC) codes as the outer codes and quantum unity-rate codes (QURCs) as the inner codes. Despite its design simplicity, the proposed QTC yields a near-hashing-bound error correction performance. For instance, compared to the best half-rate QTC known in the literature, namely the quantum irregular convolutional codes (QIrCCs) combined with the QURC scheme, which operates at the distance of D = 0.037 from the quantum hashing bound, our novel QSBC-QURC scheme can operate at the lower distance of D = 0:029. It is also worth mentioning that this is the first instantiation of QTCs capable of adjusting the quantum encoders according to the quantum coding rate required for mitigating the Pauli errors imposed by the time-variant depolarizing probabilities of the quantum channel.

•Jan 1, 2019•0 citations

Topological quantum error correction and quantum algorithm simulations

David Wang

Quantum computers are machines that manipulate quantum information stored in the form of qubits, the quantum analogue to the classical bit.Unlike the bit, quantum mechanics allows a qubit to be in a linear superposition of both its basis states.Given the same number of bits and qubits, the latter stores exponentially more information.Quantum algorithms exploit these superposition states, allowing quantum computers to solve problems such as prime number factorisation and searches faster than classical computers.Realising a large-scale quantum computer is difficult because quantum information is highly susceptible to noise.Error correction may be employed to suppress the noise, so that the results of large quantum algorithms are valid.The overhead incurred from introducing error correction is neutralised if all elementary quantum operations are constructed with an error rate below some threshold error rate.Below threshold, arbitrary length quantum computation is possible.We investigate two topological quantum error correcting codes, the planar code and the 2D colour code.We find the threshold for the 2D colour code to be 0.1%, and improve the planar code threshold from 0.75% to 1.1%.Existing protocols for the transmission of quantum states are hindered by maximum communication distances and low communication rates.We adapt the planar code for use in quantum communication, and show that this allows the fault-tolerant transmission of quantum information over arbitrary distances at a rate limited only by local quantum gate speed.Error correction is an expensive investment and thus one seeks to employ as little as possible without compromising the integrity of the results.It is therefore important to study the robustness of algorithms to noise.We show that using the matrix product state representation allows one to simulate far larger instances of the quantum factoring algorithm than under the traditional amplitude formalism representation.We simulate systems with as many as 42 qubits on a single processor with 32GB RAM, comparable to amplitude formalism simulations performed on far larger computers.

•Jan 1, 2011•0 citations
We simulate the performance of toplogical error-correcting codes when all the encoding qubits share same non-Markovian bath. We find that scalable and reliable quantum computing may still be possible if error-rates decline as n\sqrt{n}n​ where nnn is the codeword size.
We simulate the performance of toplogical error-correcting codes when all the encoding qubits share same non-Markovian bath. We find that scalable and reliable quantum computing may still be possible if error-rates decline as n\sqrt{n}n​ where nnn is the codeword size.
We investigate the efficacy of topological quantum error-correction in correlated noise model which permits collective coupling of all the codeword qubits to the same non-Markovian environment. In this noise model, the probability distribution over set of phase-flipped qubits, decays sub-exponentially in the size of the set and carries non-trivial likelihood of the occurring large numbers of qubits errors. We find that in the presence of noise correlation, one cannot guarantee arbitrary high computational accuracy simply by incrementing the codeword size while retaining constant noise level per qubit operation. However, if instead, per-operation qubit error probability in an n-qubits long codeword is reduced O(\sqrt{n}) times below the accuracy threshold, arbitrarily accurate quantum computation becomes feasible with acceptable scaling of the codeword size. Our results suggest that progressively reducing noise level in qubits and gates is as important as continuously integrating more qubits to realize scalable and reliable quantum computer.
This paper investigates the design and implementation of a fault-tolerant error correction coding scheme for quantum computing, leveraging the inherent robustness of topological quantum computing. The core concept involves constructing a quantum circuit with topological correction properties, employing an error-correcting code to detect and rectify errors within qubits, and utilizing topological quantum entanglement for redundant encoding, thereby enhancing the stability of quantum states. Unlike conventional quantum computing approaches that rely on multiple measurements for error correction, this method offers a more efficient solution by exploiting the topological protection afforded by exotic states of matter. The proposed scheme aims to significantly improve the reliability and scalability of quantum computation. We present a framework for designing such codes and discuss key challenges and potential advancements in this field. The theoretical analysis focuses on the encoding and decoding processes, quantifying the overhead associated with redundancy and evaluating the performance of the scheme in mitigating various types of quantum errors. ---
We study the effect of continuous quantum error correction in the case where each qubit in a codeword is subject to a general Hamiltonian interaction with an independent bath. We first consider the scheme in the case of a trivial single-qubit code, which provides useful insights into the workings of continuous error correction and the difference between Markovian and non-Markovian decoherence. We then study the model of a bit-flip code with each qubit coupled to an independent bath qubit and subject to continuous correction, and find its solution. We show that for sufficiently large error-correction rates, the encoded state approximately follows an evolution of the type of a single decohering qubit, but with an effectively decreased coupling constant. The factor by which the coupling constant is decreased scales quadratically with the error-correction rate. This is compared to the case of Markovian noise, where the decoherence rate is effectively decreased by a factor which scales only linearly with the rate of error correction. The quadratic enhancement depends on the existence of a Zeno regime in the Hamiltonian evolution which is absent in purely Markovian dynamics. We analyze the range of validity of this result and identify two relevant time scales. Finally, we extend the result to more general codes and argue that the performance of continuous error correction will exhibit the same qualitative characteristics.
The employment of quantum error correction codes (QECCs) within quantum computers potentially offers a reliability improvement for both quantum computation and communications tasks. However, the laws of quantum mechanics prevent us from directly invoking the mature family of classical error correction codes in the quantum domain. In order to circumvent the associated problems, the notion of quantum stabilizer codes (QSCs) was proposed in conjunction with syndrome-based decoding in the quantum regime. However, most of the powerful QSC schemes require long codewords for achieving a high performance, which potentially imposes additional challenges for implementation concerning their implementation, since their decoding may require longer than the quantum circuit's coherence time. Hence at the time of writing, QSCs exhibiting short to moderate codeword lengths are preferable. We commence by describing the pivotal problem encountered by classical error-correction codes, which also emerges when designing the QSCs, namely the intrinsic trade-off between the minimum distance versus coding rate. The complete formulation of this particular trade-off does not exist, but several lower and upper bounds can be found in the literature. It has been shown that a substantial gap can be observed between the upper and lower bound of the minimum distance, given the codeword length and the quantum coding rate. Hence, we propose an appealingly simple and invertible analytical approximation, for characterizing the trade-off between the quantum coding rate and the minimum distance of QSCs as well as their corresponding quantum bit error rate (QBER) performance upper-bound. For example, for a half-rate QSC having a codeword length of n = 128, the minimum distance is bounded by 11 < d < 22, while our approximation yields a minimum distance of d = 17 for the above-mentioned code. Next, we link this parametric study of the minimum distance versus quantum coding rate to the popular QSCs, namely to the family of quantum topological error correction codes (QTECCs). In order to construct the classical-to-quantum isomorphism, we conceive and investigate the family of classical topological error correction codes (TECCs), assuming that the bits of a codeword can be arranged in a lattice structure. We then present the classical-to-quantum isomorphism to pave the way for constructing their dual pairs in the quantum domain, which are the QTECCs. Finally, we characterize the performance of QTECCs in the face of the quantum depolarizing channel in terms of both their QBER and fidelity. Specifically, we demonstrate that for quantum coding rate rQ ~ 0, the threshold probability of the QBER below which the colour, rotated-surface, surface, and toric codes become capable of improving the uncoded QBER are given by 1.8 ×10-2, 1.3 ×10-2, 6.3 ×10-2 and 6.8 ×10-2, respectively. Furthermore, we also demonstrate that we can achieve beneficial fidelity improvements above the minimum fidelity of 0.94, 0.97 and 0.99 by employing the rQ = 1/7 colour code, the rQ = 1/9 rotated-surface code, and the rQ = 1/13 surface code, respectively. However, QSCs require additional quantum gates for their employment. Incorporating more quantum gates for performing error correction potentially introduces further sources of quantum decoherence into quantum computers. In this scenario, the primary challenge is to find the sufficient condition required by each of the quantum gates for beneficially employing QECCs in order to yield reliability improvements, given that the quantum gates utilized by the QECCs also introduce quantum decoherence. In this treatise, we approach this problem by firstly presenting the general framework of protecting quantum gates by the amalgamation of the transversal configuration of quantum gates and QSCs, which can be viewed as syndrome-based QECCs. Secondly, we provide examples of the advocated framework by invoking QTECCs for protecting both transversal Hadamard gates and controlled (CNOT) gates. Both our simulation and analytical results explicitly show that by utilizing QTECCs, the fidelity of the quantum gates can be beneficially improved, provided that quantum gates satisfying a certain minimum depolarization fidelity threshold (Fth) are available. For instance, for protecting transversal Hadamard gates, the minimum fidelity values required for each of the gates in order to attain fidelity improvements are 99.74%, 99.73%, 99.87%, and 99.86%, when they are protected by colour, rotated-surface, surface, and toric codes, respectively. Unfortunately, these specific Fth values can only be obtained for a very large number of physical qubits (n → ∞), when the quantum coding rate of the QTECCs approaches zero (rQ → 0). Finally, in order to conceive QSCs exhibiting a high quantum coding rate, we modify the construction of QTECCs for conceiving a low-complexity concatenated quantum turbocode (QTC). The above-mentioned high quantum coding rate is obtained by combining the quantum-domain version of short-block codes (SBCs) also known as single parity-check (SPC) codes as the outer codes and quantum unity-rate codes (QURCs) as the inner codes. Despite its design simplicity, the proposed QTC yields a near-hashing-bound error correction performance. For instance, compared to the best half-rate QTC known in the literature, namely the quantum irregular convolutional codes (QIrCCs) combined with the QURC scheme, which operates at the distance of D = 0.037 from the quantum hashing bound, our novel QSBC-QURC scheme can operate at the lower distance of D = 0:029. It is also worth mentioning that this is the first instantiation of QTCs capable of adjusting the quantum encoders according to the quantum coding rate required for mitigating the Pauli errors imposed by the time-variant depolarizing probabilities of the quantum channel.
Quantum computers are machines that manipulate quantum information stored in the form of qubits, the quantum analogue to the classical bit.Unlike the bit, quantum mechanics allows a qubit to be in a linear superposition of both its basis states.Given the same number of bits and qubits, the latter stores exponentially more information.Quantum algorithms exploit these superposition states, allowing quantum computers to solve problems such as prime number factorisation and searches faster than classical computers.Realising a large-scale quantum computer is difficult because quantum information is highly susceptible to noise.Error correction may be employed to suppress the noise, so that the results of large quantum algorithms are valid.The overhead incurred from introducing error correction is neutralised if all elementary quantum operations are constructed with an error rate below some threshold error rate.Below threshold, arbitrary length quantum computation is possible.We investigate two topological quantum error correcting codes, the planar code and the 2D colour code.We find the threshold for the 2D colour code to be 0.1%, and improve the planar code threshold from 0.75% to 1.1%.Existing protocols for the transmission of quantum states are hindered by maximum communication distances and low communication rates.We adapt the planar code for use in quantum communication, and show that this allows the fault-tolerant transmission of quantum information over arbitrary distances at a rate limited only by local quantum gate speed.Error correction is an expensive investment and thus one seeks to employ as little as possible without compromising the integrity of the results.It is therefore important to study the robustness of algorithms to noise.We show that using the matrix product state representation allows one to simulate far larger instances of the quantum factoring algorithm than under the traditional amplitude formalism representation.We simulate systems with as many as 42 qubits on a single processor with 32GB RAM, comparable to amplitude formalism simulations performed on far larger computers.