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

Bulletin of the American Physical Society

Density Matrix Simulation of 3 Qubit Quantum Error Correction Code

Chungheon Baek, Yongsoo Hwang, Taewan Kim, Byung-Soo Choi

Published Mar 9, 2018• 0 citations
OpenAlex

Related papers

Quantum error correction beyond qubits

Takao Aoki, Go Takahashi, Tadashi Kajiya +4 more

arXiv:0811.3734•Nature Physics•Jun 28, 2009•147 citations

Density matrix simulation of quantum error correction codes for near-term quantum devices

Chungheon Baek, Tomohiro Ostuka, Seigo Tarucha +1 more

Abstract Fault-tolerant quantum computing requires many qubits with long lifetimes and accurate quantum gate operations. However, external noise limits the computing time and hampers accurate quantum gate operations. Quantum error correction (QEC) codes may extend such limits, but imperfect gate operations during QEC cause errors, which could cancel out QEC. We used density matrix simulations to examine the performance of QEC codes with five qubits. In current quantum devices, less than ten qubits are needed to conduct sufficient gate operations within their lifetime so that it is feasible to implement QEC codes. We analyzed the maximum tolerable error rate and error correction effect of individual QEC codes according to the qubit arrangement and gate accuracy. Assuming a 0.1% gate error probability, a logical ∣ 1 〉 state encoded by a five-qubit QEC code is expected to have a 0.25 higher fidelity than its physical counterpart.

arXiv:1810.01029•Quantum Science and Technology•Nov 18, 2019•12 citations

Fault-Tolerance Testing on Small Quantum Error-Correcting Codes

Yaoling Yang

Quantum computers hold the promise to solve some hard problems that are intractable for even the most powerful current supercomputers. One of the most famous examples is Shor's algorithm for factorizing large numbers, which has exponential speedup compared to its best classical counterparts. However, running such an algorithm will require to build a large-scale quantum computer consisting of thousands or even millions of qubits that include quantum error correction (QEC) and fault-tolerant (FT) mechanisms. Quantum computing is already a reality with the so-called Noisy Intermediate-Scale Quantum (NISQ) processors, some of them available in the cloud. Noisy refers to the imperfect control over the qubits and intermediate-scale to the relatively low number of quits (from fifty to a few hundred). Although current and near-term quantum devices will not have enough qubits for implementing large and fully corrected quantum computations, the use of small quantum error correction codes may extend the computation lifetime of NISQ devices. In this context and as a first step, it is important to test and demonstrate the fault-tolerance of these QEC codes. In this thesis, we explore the fault-tolerance of two small quantum correction codes that are good candidates to be applied to NISQ processors, the [[4,2,2]] code and the [[7,1,3]] Steane code. To this purpose, by following the FT criterion prosed by Daniel Gottesman in 2016, we tested both codes using two simulators, the stabilizer formalism simulator that includes quite simple error models and a full density matrix simulator called quantumsim, which includes more realistic noise. The simulations are performed under reasonable noise parameter values. For the [[4,2,2]] code, 235 circuits are tested based on the two simulators. The results show that in the stabilizer formalism simulation, the FT criterion is satised for all circuits, while not fully satisfied in the full density matrix simulation. For the [[7,1,3]] Steane code, we use a parallel-flag error correction implementation which is tested using the full density matrix simulator. Our results show that without applying any QEC cycle, for all circuits (84 circuits for 1 logical qubit simulation and 452 circuits for 2 logical qubits simulation), the error rate of the encoded circuits is lower than the unencoded ones. Adding a quantum error correction (QEC) cycle will in general increase the error rate of the computation.

•Jan 1, 2019•0 citations

Signal processing in continuous syndrome of the three qubit quantum error correction code

Jing Yang, Areeya Chantasri, Justin Dressel +2 more

Bulletin of the American Physical Society•Mar 7, 2018•0 citations

Quantum Error-Correction for Fermionic Qubits

Sagar Vijay

Bulletin of the American Physical Society•Mar 4, 2019•0 citations

Density Matrix Simulation of Quantum Error Correction

Arvid Rolander

Quantum error correction will be integral in developing full scale quantum computers, but as of yet beneficial quantum error correction has not been demonstrated experimentally. An important question is therefore what prerequisites need to be met to achieve this. Results of density matrix simulations of the performance of the seven qubit Steane code in a quantum computing setting are presented. The full density matrix was kept throughout the whole simulations, which means that all errors can be accounted for. In particular, the importance of the circuit depth, i.e. the number of gates in series before error correction is applied, for the overall performance was investigated. It was found that the depth of the circuit has a large impact on the threshold error rate for which error correction becomes beneficial. A gain parameter was defined, which describes the largest constant factor by which errors can be suppressed. It was shown that there is a trade-off between the threshold error and the gain; The highest threshold value was found to be around p_th~10^-4, which is in line with other estimates, but the maximum gain for this value was only 3. To achieve a gain of 100, an error rate of p_err~2x10^-9 is required. In addition, performance statistics such as run-time as a function of circuit depth and width for the matlab code used for simulations are presented.

•Jan 1, 2020•0 citations
Abstract Fault-tolerant quantum computing requires many qubits with long lifetimes and accurate quantum gate operations. However, external noise limits the computing time and hampers accurate quantum gate operations. Quantum error correction (QEC) codes may extend such limits, but imperfect gate operations during QEC cause errors, which could cancel out QEC. We used density matrix simulations to examine the performance of QEC codes with five qubits. In current quantum devices, less than ten qubits are needed to conduct sufficient gate operations within their lifetime so that it is feasible to implement QEC codes. We analyzed the maximum tolerable error rate and error correction effect of individual QEC codes according to the qubit arrangement and gate accuracy. Assuming a 0.1% gate error probability, a logical ∣ 1 〉 state encoded by a five-qubit QEC code is expected to have a 0.25 higher fidelity than its physical counterpart.
Quantum computers hold the promise to solve some hard problems that are intractable for even the most powerful current supercomputers. One of the most famous examples is Shor's algorithm for factorizing large numbers, which has exponential speedup compared to its best classical counterparts. However, running such an algorithm will require to build a large-scale quantum computer consisting of thousands or even millions of qubits that include quantum error correction (QEC) and fault-tolerant (FT) mechanisms. Quantum computing is already a reality with the so-called Noisy Intermediate-Scale Quantum (NISQ) processors, some of them available in the cloud. Noisy refers to the imperfect control over the qubits and intermediate-scale to the relatively low number of quits (from fifty to a few hundred). Although current and near-term quantum devices will not have enough qubits for implementing large and fully corrected quantum computations, the use of small quantum error correction codes may extend the computation lifetime of NISQ devices. In this context and as a first step, it is important to test and demonstrate the fault-tolerance of these QEC codes. In this thesis, we explore the fault-tolerance of two small quantum correction codes that are good candidates to be applied to NISQ processors, the [[4,2,2]] code and the [[7,1,3]] Steane code. To this purpose, by following the FT criterion prosed by Daniel Gottesman in 2016, we tested both codes using two simulators, the stabilizer formalism simulator that includes quite simple error models and a full density matrix simulator called quantumsim, which includes more realistic noise. The simulations are performed under reasonable noise parameter values. For the [[4,2,2]] code, 235 circuits are tested based on the two simulators. The results show that in the stabilizer formalism simulation, the FT criterion is satised for all circuits, while not fully satisfied in the full density matrix simulation. For the [[7,1,3]] Steane code, we use a parallel-flag error correction implementation which is tested using the full density matrix simulator. Our results show that without applying any QEC cycle, for all circuits (84 circuits for 1 logical qubit simulation and 452 circuits for 2 logical qubits simulation), the error rate of the encoded circuits is lower than the unencoded ones. Adding a quantum error correction (QEC) cycle will in general increase the error rate of the computation.
Quantum error correction will be integral in developing full scale quantum computers, but as of yet beneficial quantum error correction has not been demonstrated experimentally. An important question is therefore what prerequisites need to be met to achieve this. Results of density matrix simulations of the performance of the seven qubit Steane code in a quantum computing setting are presented. The full density matrix was kept throughout the whole simulations, which means that all errors can be accounted for. In particular, the importance of the circuit depth, i.e. the number of gates in series before error correction is applied, for the overall performance was investigated. It was found that the depth of the circuit has a large impact on the threshold error rate for which error correction becomes beneficial. A gain parameter was defined, which describes the largest constant factor by which errors can be suppressed. It was shown that there is a trade-off between the threshold error and the gain; The highest threshold value was found to be around p_th~10^-4, which is in line with other estimates, but the maximum gain for this value was only 3. To achieve a gain of 100, an error rate of p_err~2x10^-9 is required. In addition, performance statistics such as run-time as a function of circuit depth and width for the matlab code used for simulations are presented.