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

Journal of International Crisis and Risk Communication Research

Studies Of A Quantum Scheduling Algorithm And On Quantum Error Correction

Feng Lu

Published Jan 1, 2007• 1 citation
OpenAlex

Abstract

Quantum computation has been a rich field of study for decades because it promises possible spectacular advances, some of which may run counter to our classically rooted intuitions. At the same time, quantum computation is still in its infancy in both theoretical and practical areas. Efficient quantum algorithms are very limited in number and scope; no real breakthrough has yet been achieved in physical implementations. Grover's search algorithm can be applied to a wide range of problems; even problems not generally regarded as searching problems can be reformulated to take advantage of quantum parallelism and entanglement leading to algorithms which show a square root speedup over their classical counterparts. This dissertation discusses a systematic way to formulate such problems and gives as an example a quantum scheduling algorithm for an R||C_max problem. This thesis shows that quantum solution to such problems is not only feasible but in some cases advantageous. The complexity of the error correction circuitry forces us to design quantum error correction codes capable of correcting only a single error per error correction cycle. Yet, time-correlated errors are common for physical implementations of quantum systems; an error corrected during a certain cycle may reoccur in a later cycle due to physical processes specific to each physical implementation of the qubits. This dissertation discusses quantum error correction for a restricted class of time-correlated errors in a spin-boson model. The algorithm proposed allows the correction of two errors per error correction cycle, provided that one of them is time-correlated. The algorithm can be applied to any stabilizer code, perfect or non-perfect, and simplified the circuit complexity significantly comparing to the classic quantum error correction codes.

Related papers

RESEARCH AND DEVELOPMENT OF A QUANTUM CODE FOR ERROR CORRECTION

S. M. Gushanskiy, V.S. Potapov, Божич Владимир Иванович

Quantum error correction (QEC) is required in quantum computers to mitigate the impact of errorson physical qubits. The goal is to optimize the neural network for high decoding performance whilemaintaining a minimalistic hardware implementation. The errors associated with decoherence can bereduced by adopting QEC schemes that encode multiple imperfect physical qubits into a logical quantumstate, similar to classical error correction. The relevance of these studies lies in the mathematicaland software modeling and implementation of corrective codes to correct several types of quantumerrors in the development and implementation of quantum algorithms for solving classes of problems ofa classical nature. The scientific novelty of this direction is expressed in the elimination of one of theshortcomings of the quantum computing process. The development of the theory and principles for constructingmodeling systems that are resistant to external interference (dependence of data distortion onnoise, dependence of the error of a quantum computing process on the measure and purity of entanglement)for modeling quantum computing is a dynamic area, as evidenced by a large number of existingmodels reflecting certain quantum computational processes and phenomena (quantum teleportation,parallelism, entanglement of quantum states) and scientific papers. Although quantum computing is notyet ready to move from theory to practice, it is nevertheless possible to reasonably guess what form aquantum computer might take, or, more importantly for programming language design, what interface itwould be possible to interact with such a quantum computer. It is natural to apply the lessons learnedfrom the programming of classical computing to quantum computing. The analysis of works in this areashowed that a new qualitative level has now been reached, which opens up promising opportunities forthe implementation of multi-qubit quantum computing. Prospects for implementation and developmentare associated not only with technological capabilities, but also with the solution of issues of buildingeffective quantum systems for solving actual mathematical problems, cryptography problems and control(optimization) problems.

Известия Южного федерального университета. Технические науки•Aug 10, 2022•1 citation

Quantum algorithms and quantum error correction with neutral atoms

Madelyn Cain

Quantum computers have the potential to solve certain problems exponentially faster than classical computers. However, realizing this potential in practice is a major challenge, as it requires precise control over large-scale quantum systems operating at extremely low error rates. Quantum error correction (QEC) provides a path to achieving such error rates, but its substantial resource overhead poses a significant practical barrier. In addition, identifying which computational problems offer a provable quantum advantage—and which remain fundamentally intractable—remains an open question. This thesis presents progress towards addressing both of these challenges. The first part of this thesis describes advances that substantially reduce the resource overhead of QEC. We begin by presenting realizations of logical circuits in dynamically reconfigurable arrays of neutral atoms. By jointly decoding the logical qubits, we reduce the cost of implementing such transversal Clifford circuits by a factor proportional to the code distance. We then develop new theories of fault tolerance to extend these savings to universal quantum computation with magic state inputs. Finally, we introduce techniques for fast correlated decoding, enabling practical implementations of these improvements in experimental hardware. Collectively, these advances accelerate progress toward large-scale computation and reduce the cost of QEC by over an order of magnitude. The second part of the thesis explores the relative power of quantum and classical computation in combinatorial optimization, a class of problems that is ubiquitous in science and engineering and foundational to the theory of computational complexity. We experimentally implement the optimized quantum adiabatic algorithm (QAA) in neutral atom arrays and observe evidence of a superlinear speedup over classical simulated annealing on certain hard problem instances. To interpret these results, we develop a theoretical framework to compare the performance of QAA with a broad class of classical Markov chain Monte Carlo algorithms. We identify conditions under which a quantum quadratic speedup is achievable and propose modifications to the QAA to reliably realize this advantage. Together, these contributions advance both the practical implementation and theoretical understanding of quantum algorithms.

•Jan 1, 2025•0 citations

Practical error correction codes and near-term algorithms for quantum computation

Xiaosi Xu

The development of quantum computers requires not only experimental advances, but also theoretical efforts to tackle the bottlenecks and identify potential applications. This thesis addresses some essential elements in each stage of the development of quantum computers, from the currently available hardware to the long-term devices. The critical factor that hinders the quantum hardware from performing perfect operations is the presence of noise, however, it can be overcome by error correction codes. We first consider a large-scale quantum processor with asymmetrical noise and preferably a modular structure. By concatenating the surface code with an error-detecting code, and utilising the information from detection with a customised decoder, we find very high thresholds for the designed devices. The second topic is small error correction codes which are more realistic to be implemented in the near future. A measure `integrity' is introduced to benchmark the performance of quantum memories to demonstrate beneficial error correction, associated with four milestones. We show integrity is closely related with other commonly-used measures and can be easily assessed by experimentalists. This framework is then studied in detail in the context of an ion-trap quantum device implemented with the seven qubit code. We present a protocol based on detailed sequences of crystal-reconfiguration operations and stabiliser mappings to perform a full error correction cycle. Realistic error models and parameters from reported works are also given. While experimental efforts continue to battle against the noise, some hybrid quantum-classical algorithms have been developed to be implemented on the near-term noisy devices. The variational algorithm is one of the hybrid algorithms that have been widely applied to simulations of condensed matter physics and quantum chemistry. In the next chapter, we introduce a variational quantum compiler to automatically search for the encoding circuits of small error correction codes. By tailoring the ansatz to optimise the circuit for particular hardware systems, we show some novel circuits discovered with the compiler. The final chapter applies the variational algorithm to solve linear algebra problems including linear systems of equations and matrix-vector multiplications. We show that the linear algebra problems can be solved with near-term devices, with circuit depth linear to the condition number and super-linear to the number of qubits.

•Jan 1, 2020•0 citations

Codeword Stabilized Quantum Codes and Their Error Correction

Yunfan Li

Quantum decoherence and errors represent some of the major challenges arising in quantum computations. Quantum error correcting codes protect quantum states against these errors and make quantum computing more reliable. One of the main problems of quantum error correction is the design of feasible decoding algorithms that can simplify error-correction for general quantum codes. The dissertation addresses decoding of general Codeword Stabilized (CWS) codes. This class of quantum codes also includes some other important classes such as additive Stabilizer codes and non-additive Union Stabilizer (USt) codes.We first design a generic error-correcting algorithm for CWS codes and analyze the number of decoding measurements and quantum gates. This algorithm performs exhaustive screening of different error patterns, similar to decoding of classical non-linear codes. For an n-qubit quantum code correcting up to t erroneous qubits, this brute-force approach consecutively tests all correctable error patterns and employs a separate n-qubit measurement in each test.The main result is a new error grouping technique that enables simultaneous testing of large groups of errors in a single measurement. To achieve this reduction, we first proceed with a new error-correction algorithm for the USt codes. Secondly, we design an algorithm that converts generic non-linear CWS codes into the simpler quasi-linear USt codes. Each decoding measurement can then either locate the actual error in a given group of errors or entirely eliminate this group. This technique yields a much simpler algorithm that exponentially reduces the number of measurements about 3^t times in any t-error-correcting CWS code.

•Jan 1, 2010•0 citations

Quantum Error Correcting Codes

Mikio Nakahara

Quantum computing is a new and exciting field of research that, using the properties of quantum mechanics, has the potential to be a disruptive technology, being able to per form certain computations faster than any classical computer, such as Shor’s factorization algorithm and Grover’s algorithm. Although there are several quantum computer with different underlying technologies, one of the main challenges of quantum computation is the occurence of errors, destroying the information and making computation impossible. Errors may have several different sources namely, thermal noise, faulty gates or incorrect measurements. The present dissertation aims to study and employ methods for reducing the effects of errors during quantum computation and correct them using Stabilizer Codes, which are a very powerful tool to produce circuit encoding networks that can, in theory, protect quantum systems from errors during transmission. A proof of concept algorithm was implemented using Qiskit, a Python based program development language for the IBM Q machines, and tested on both simulators and real systems. The algorithm is capable of, given any stabilizer in standard form, generate the circuit encoding network. Due to technological limitations associated with current quantum computers the results obtained in ibmq_guadalupe fail to show the efficacy of Stabilizer Codes.

CRC Press eBooks•Mar 11, 2008•0 citations

New quantum algorithms and quantum lower bounds

Andrew Chi-Chih Yao, Shengyu Zhang

The last decade witnessed a great surge of fruitful studies in the new paradigm of quantum computing. Remarkable progress has been made in all the areas including quantum algorithms, quantum complexity theory, quantum error-correcting code, quantum information theory, quantum cryptography and physical implementations of quantum computers. However, quantum algorithm design, probably the most important task in quantum computing, did not make as much progress as people expected. This thesis aims at both designing new quantum algorithms and studying why efficient quantum algorithms are so hard to design by proving many lower bounds on quantum query complexity for various problems. We first review (and generalize) known techniques for designing quantum algorithms and for proving quantum lower bounds. Using these techniques, we then study the quantum query complexity for many problems, including some specific problems such as Graph Matching and other natural graph properties, the general tuple search, and local search. We also study the lowest possible quantum query complexity for a class of functions as a whole, such as graph properties, circular functions, and functions invariant of a transitive permutation group, where tight results are given in all these cases. Finally for the quantum lower bounds techniques themselves, we study the main two techniques and show that they are incomparable in power. For the most widely used one, which has a lot of parameters to choose, we show limitations for it in terms of certificate complexity. This implies that we cannot use the method to prove better lower bounds for almost all known open problems in this area.

•Jan 1, 2006•3 citations
Quantum computation has been a rich field of study for decades because it promises possible spectacular advances, some of which may run counter to our classically rooted intuitions. At the same time, quantum computation is still in its infancy in both theoretical and practical areas. Efficient quantum algorithms are very limited in number and scope; no real breakthrough has yet been achieved in physical implementations. Grover's search algorithm can be applied to a wide range of problems; even problems not generally regarded as searching problems can be reformulated to take advantage of quantum parallelism and entanglement leading to algorithms which show a square root speedup over their classical counterparts. This dissertation discusses a systematic way to formulate such problems and gives as an example a quantum scheduling algorithm for an R||C_max problem. This thesis shows that quantum solution to such problems is not only feasible but in some cases advantageous. The complexity of the error correction circuitry forces us to design quantum error correction codes capable of correcting only a single error per error correction cycle. Yet, time-correlated errors are common for physical implementations of quantum systems; an error corrected during a certain cycle may reoccur in a later cycle due to physical processes specific to each physical implementation of the qubits. This dissertation discusses quantum error correction for a restricted class of time-correlated errors in a spin-boson model. The algorithm proposed allows the correction of two errors per error correction cycle, provided that one of them is time-correlated. The algorithm can be applied to any stabilizer code, perfect or non-perfect, and simplified the circuit complexity significantly comparing to the classic quantum error correction codes.
Quantum error correction (QEC) is required in quantum computers to mitigate the impact of errorson physical qubits. The goal is to optimize the neural network for high decoding performance whilemaintaining a minimalistic hardware implementation. The errors associated with decoherence can bereduced by adopting QEC schemes that encode multiple imperfect physical qubits into a logical quantumstate, similar to classical error correction. The relevance of these studies lies in the mathematicaland software modeling and implementation of corrective codes to correct several types of quantumerrors in the development and implementation of quantum algorithms for solving classes of problems ofa classical nature. The scientific novelty of this direction is expressed in the elimination of one of theshortcomings of the quantum computing process. The development of the theory and principles for constructingmodeling systems that are resistant to external interference (dependence of data distortion onnoise, dependence of the error of a quantum computing process on the measure and purity of entanglement)for modeling quantum computing is a dynamic area, as evidenced by a large number of existingmodels reflecting certain quantum computational processes and phenomena (quantum teleportation,parallelism, entanglement of quantum states) and scientific papers. Although quantum computing is notyet ready to move from theory to practice, it is nevertheless possible to reasonably guess what form aquantum computer might take, or, more importantly for programming language design, what interface itwould be possible to interact with such a quantum computer. It is natural to apply the lessons learnedfrom the programming of classical computing to quantum computing. The analysis of works in this areashowed that a new qualitative level has now been reached, which opens up promising opportunities forthe implementation of multi-qubit quantum computing. Prospects for implementation and developmentare associated not only with technological capabilities, but also with the solution of issues of buildingeffective quantum systems for solving actual mathematical problems, cryptography problems and control(optimization) problems.
Quantum computers have the potential to solve certain problems exponentially faster than classical computers. However, realizing this potential in practice is a major challenge, as it requires precise control over large-scale quantum systems operating at extremely low error rates. Quantum error correction (QEC) provides a path to achieving such error rates, but its substantial resource overhead poses a significant practical barrier. In addition, identifying which computational problems offer a provable quantum advantage—and which remain fundamentally intractable—remains an open question. This thesis presents progress towards addressing both of these challenges. The first part of this thesis describes advances that substantially reduce the resource overhead of QEC. We begin by presenting realizations of logical circuits in dynamically reconfigurable arrays of neutral atoms. By jointly decoding the logical qubits, we reduce the cost of implementing such transversal Clifford circuits by a factor proportional to the code distance. We then develop new theories of fault tolerance to extend these savings to universal quantum computation with magic state inputs. Finally, we introduce techniques for fast correlated decoding, enabling practical implementations of these improvements in experimental hardware. Collectively, these advances accelerate progress toward large-scale computation and reduce the cost of QEC by over an order of magnitude. The second part of the thesis explores the relative power of quantum and classical computation in combinatorial optimization, a class of problems that is ubiquitous in science and engineering and foundational to the theory of computational complexity. We experimentally implement the optimized quantum adiabatic algorithm (QAA) in neutral atom arrays and observe evidence of a superlinear speedup over classical simulated annealing on certain hard problem instances. To interpret these results, we develop a theoretical framework to compare the performance of QAA with a broad class of classical Markov chain Monte Carlo algorithms. We identify conditions under which a quantum quadratic speedup is achievable and propose modifications to the QAA to reliably realize this advantage. Together, these contributions advance both the practical implementation and theoretical understanding of quantum algorithms.
The development of quantum computers requires not only experimental advances, but also theoretical efforts to tackle the bottlenecks and identify potential applications. This thesis addresses some essential elements in each stage of the development of quantum computers, from the currently available hardware to the long-term devices. The critical factor that hinders the quantum hardware from performing perfect operations is the presence of noise, however, it can be overcome by error correction codes. We first consider a large-scale quantum processor with asymmetrical noise and preferably a modular structure. By concatenating the surface code with an error-detecting code, and utilising the information from detection with a customised decoder, we find very high thresholds for the designed devices. The second topic is small error correction codes which are more realistic to be implemented in the near future. A measure `integrity' is introduced to benchmark the performance of quantum memories to demonstrate beneficial error correction, associated with four milestones. We show integrity is closely related with other commonly-used measures and can be easily assessed by experimentalists. This framework is then studied in detail in the context of an ion-trap quantum device implemented with the seven qubit code. We present a protocol based on detailed sequences of crystal-reconfiguration operations and stabiliser mappings to perform a full error correction cycle. Realistic error models and parameters from reported works are also given. While experimental efforts continue to battle against the noise, some hybrid quantum-classical algorithms have been developed to be implemented on the near-term noisy devices. The variational algorithm is one of the hybrid algorithms that have been widely applied to simulations of condensed matter physics and quantum chemistry. In the next chapter, we introduce a variational quantum compiler to automatically search for the encoding circuits of small error correction codes. By tailoring the ansatz to optimise the circuit for particular hardware systems, we show some novel circuits discovered with the compiler. The final chapter applies the variational algorithm to solve linear algebra problems including linear systems of equations and matrix-vector multiplications. We show that the linear algebra problems can be solved with near-term devices, with circuit depth linear to the condition number and super-linear to the number of qubits.
Quantum decoherence and errors represent some of the major challenges arising in quantum computations. Quantum error correcting codes protect quantum states against these errors and make quantum computing more reliable. One of the main problems of quantum error correction is the design of feasible decoding algorithms that can simplify error-correction for general quantum codes. The dissertation addresses decoding of general Codeword Stabilized (CWS) codes. This class of quantum codes also includes some other important classes such as additive Stabilizer codes and non-additive Union Stabilizer (USt) codes.We first design a generic error-correcting algorithm for CWS codes and analyze the number of decoding measurements and quantum gates. This algorithm performs exhaustive screening of different error patterns, similar to decoding of classical non-linear codes. For an n-qubit quantum code correcting up to t erroneous qubits, this brute-force approach consecutively tests all correctable error patterns and employs a separate n-qubit measurement in each test.The main result is a new error grouping technique that enables simultaneous testing of large groups of errors in a single measurement. To achieve this reduction, we first proceed with a new error-correction algorithm for the USt codes. Secondly, we design an algorithm that converts generic non-linear CWS codes into the simpler quasi-linear USt codes. Each decoding measurement can then either locate the actual error in a given group of errors or entirely eliminate this group. This technique yields a much simpler algorithm that exponentially reduces the number of measurements about 3^t times in any t-error-correcting CWS code.
Quantum computing is a new and exciting field of research that, using the properties of quantum mechanics, has the potential to be a disruptive technology, being able to per form certain computations faster than any classical computer, such as Shor’s factorization algorithm and Grover’s algorithm. Although there are several quantum computer with different underlying technologies, one of the main challenges of quantum computation is the occurence of errors, destroying the information and making computation impossible. Errors may have several different sources namely, thermal noise, faulty gates or incorrect measurements. The present dissertation aims to study and employ methods for reducing the effects of errors during quantum computation and correct them using Stabilizer Codes, which are a very powerful tool to produce circuit encoding networks that can, in theory, protect quantum systems from errors during transmission. A proof of concept algorithm was implemented using Qiskit, a Python based program development language for the IBM Q machines, and tested on both simulators and real systems. The algorithm is capable of, given any stabilizer in standard form, generate the circuit encoding network. Due to technological limitations associated with current quantum computers the results obtained in ibmq_guadalupe fail to show the efficacy of Stabilizer Codes.
The last decade witnessed a great surge of fruitful studies in the new paradigm of quantum computing. Remarkable progress has been made in all the areas including quantum algorithms, quantum complexity theory, quantum error-correcting code, quantum information theory, quantum cryptography and physical implementations of quantum computers. However, quantum algorithm design, probably the most important task in quantum computing, did not make as much progress as people expected. This thesis aims at both designing new quantum algorithms and studying why efficient quantum algorithms are so hard to design by proving many lower bounds on quantum query complexity for various problems. We first review (and generalize) known techniques for designing quantum algorithms and for proving quantum lower bounds. Using these techniques, we then study the quantum query complexity for many problems, including some specific problems such as Graph Matching and other natural graph properties, the general tuple search, and local search. We also study the lowest possible quantum query complexity for a class of functions as a whole, such as graph properties, circular functions, and functions invariant of a transitive permutation group, where tight results are given in all these cases. Finally for the quantum lower bounds techniques themselves, we study the main two techniques and show that they are incomparable in power. For the most widely used one, which has a lot of parameters to choose, we show limitations for it in terms of certificate complexity. This implies that we cannot use the method to prove better lower bounds for almost all known open problems in this area.