• Title/Summary/Keyword: Quantum Codes

Search Result 27, Processing Time 0.019 seconds

Novel Class of Entanglement-Assisted Quantum Codes with Minimal Ebits

  • Dong, Cao;Yaoliang, Song
    • Journal of Communications and Networks
    • /
    • v.15 no.2
    • /
    • pp.217-221
    • /
    • 2013
  • Quantum low-density parity-check (LDPC) codes based on the Calderbank-Shor-Steane construction have low encoding and decoding complexity. The sum-product algorithm(SPA) can be used to decode quantum LDPC codes; however, the decoding performance may be significantly decreased by the many four-cycles required by this type of quantum codes. All four-cycles can be eliminated using the entanglement-assisted formalism with maximally entangled states (ebits). The proposed entanglement-assisted quantum error-correcting code based on Euclidean geometry outperform differently structured quantum codes. However, the large number of ebits required to construct the entanglement-assisted formalism is a substantial obstacle to practical application. In this paper, we propose a novel class of entanglement-assisted quantum LDPC codes constructed using classical Euclidean geometry LDPC codes. Notably, the new codes require one copy of the ebit. Furthermore, we propose a construction scheme for a corresponding zigzag matrix and show that the algebraic structure of the codes could easily be expanded. A large class of quantum codes with various code lengths and code rates can be constructed. Our methods significantly improve the possibility of practical implementation of quantum error-correcting codes. Simulation results show that the entanglement-assisted quantum LDPC codes described in this study perform very well over a depolarizing channel with iterative decoding based on the SPA and that these codes outperform other quantum codes based on Euclidean geometries.

QUANTUM CODES WITH IMPROVED MINIMUM DISTANCE

  • Kolotoglu, Emre;Sari, Mustafa
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.3
    • /
    • pp.609-619
    • /
    • 2019
  • The methods for constructing quantum codes is not always sufficient by itself. Also, the constructed quantum codes as in the classical coding theory have to enjoy a quality of its parameters that play a very important role in recovering data efficiently. In a very recent study quantum construction and examples of quantum codes over a finite field of order q are presented by La Garcia in [14]. Being inspired by La Garcia's the paper, here we extend the results over a finite field with $q^2$ elements by studying necessary and sufficient conditions for constructions quantum codes over this field. We determine a criteria for the existence of $q^2$-cyclotomic cosets containing at least three elements and present a construction method for quantum maximum-distance separable (MDS) codes. Moreover, we derive a way to construct quantum codes and show that this construction method leads to quantum codes with better parameters than the ones in [14].

A Class of Check Matrices Constructed from Euclidean Geometry and Their Application to Quantum LDPC Codes

  • Dong, Cao;Yaoliang, Song
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.71-76
    • /
    • 2013
  • A new class of quantum low-density parity-check (LDPC) codes whose parity-check matrices are dual-containing matrices constructed based on lines of Euclidean geometries (EGs) is presented. The parity-check matrices of our quantum codes contain one and only one 4-cycle in every two rows and have better distance properties. However, the classical parity-check matrix constructed from EGs does not satisfy the condition of dual-containing. In some parameter conditions, parts of the rows in the matrix maybe have not any nonzero element in common. Notably, we propose four families of fascinating structure according to changes in all the parameters, and the parity-check matrices are adopted to satisfy the requirement of dual-containing. Series of matrix properties are proved. Construction methods of the parity-check matrices with dual-containing property are given. The simulation results show that the quantum LDPC codes constructed by this method perform very well over the depolarizing channel when decoded with iterative decoding based on the sum-product algorithm. Also, the quantum codes constructed in this paper outperform other quantum codes based on EGs.

QUANTUM CODES FROM CYCLIC CODES OVER F4 + vF4

  • OZEN, MEHMET;ERTUNC, FAIK CEM;INCE, HALIT
    • Journal of applied mathematics & informatics
    • /
    • v.34 no.5_6
    • /
    • pp.397-404
    • /
    • 2016
  • In this work, a method is given to construct quantum codes from cyclic codes over F4 + vF4 which will be denoted as R throughout the paper, where v2 = v and a Gray map is defined between R and where F4 is the field with 4 elements. Some optimal quantum code parameters and others will be presented at the end of the paper.

ON QUANTUM CODES FROM CYCLIC CODES OVER A CLASS OF NONCHAIN RINGS

  • Sari, Mustafa;Siap, Irfan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.6
    • /
    • pp.1617-1628
    • /
    • 2016
  • In this paper, we extend the results given in [3] to a nonchain ring $R_p={\mathbb{F}}_p+v{\mathbb{F}}_p+{\cdots}+v^{p-1}{\mathbb{F}}_p$, where $v^p=v$ and p is a prime. We determine the structure of the cyclic codes of arbitrary length over the ring $R_p$ and study the structure of their duals. We classify cyclic codes containing their duals over $R_p$ by giving necessary and sufficient conditions. Further, by taking advantage of the Gray map ${\pi}$ defined in [4], we give the parameters of the quantum codes of length pn over ${\mathbb{F}}_p$ which are obtained from cyclic codes over $R_p$. Finally, we illustrate the results by giving some examples.

Technology Trends of Fault-tolerant Quantum Computing (결함허용 양자컴퓨팅 시스템 기술 연구개발 동향)

  • Hwang, Y.;Kim, T.W.;Baek, C.H.;Cho, S.U.;Kim, H.S.;Choi, B.S.
    • Electronics and Telecommunications Trends
    • /
    • v.37 no.2
    • /
    • pp.1-10
    • /
    • 2022
  • Similar to present computers, quantum computers comprise quantum bits (qubits) and an operating system. However, because the quantum states are fragile, we need to correct quantum errors using entangled physical qubits with quantum error correction (QEC) codes. The combination of entangled physical qubits with a QEC protocol and its computational model are called a logical qubit and fault-tolerant quantum computation, respectively. Thus, QEC is the heart of fault-tolerant quantum computing and overcomes the limitations of noisy intermediate-scale quantum computing. Therefore, in this study, we briefly survey the status of QEC codes and the physical implementation of logical qubit over various qubit technologies. In summary, we emphasize 1) the error threshold value of a quantum system depends on the configurations and 2) therefore, we cannot set only any specific theoretical and/or physical experiment suggestion.

R&D Status of Quantum Computing Technology (양자컴퓨팅 기술 연구개발 동향)

  • Baek, C.H.;Hwang, Y.S.;Kim, T.W.;Choi, B.S.
    • Electronics and Telecommunications Trends
    • /
    • v.33 no.1
    • /
    • pp.20-33
    • /
    • 2018
  • The calculation speed of quantum computing is expected to outperform that of existing supercomputers with regard to certain problems such as secure computing, optimization problems, searching, and quantum chemistry. Many companies such as Google and IBM have been trying to make 50 superconducting qubits, which is expected to demonstrate quantum supremacy and those quantum computers are more advantageous in computing power than classical computers. However, quantum computers are expected to be applicable to solving real-world problems with superior computing power. This will require large scale quantum computing with many more qubits than the current 50 qubits available. To realize this, first, quantum error correction codes are required to be capable of computing within a sufficient amount of time with tolerable accuracy. Next, a compiler is required for the qubits encoded by quantum error correction codes to perform quantum operations. A large-scale quantum computer is therefore predicted to be composed of three essential components: a programming environment, layout mapping of qubits, and quantum processors. These components analyze how many numbers of qubits are needed, how accurate the qubit operations are, and where they are placed and operated. In this paper, recent progress on large-scale quantum computing and the relation of their components will be introduced.

Research Trends in Quantum Error Decoders for Fault-Tolerant Quantum Computing (결함허용 양자 컴퓨팅을 위한 양자 오류 복호기 연구 동향)

  • E.Y. Cho;J.H. On;C.Y. Kim;G. Cha
    • Electronics and Telecommunications Trends
    • /
    • v.38 no.5
    • /
    • pp.34-50
    • /
    • 2023
  • Quantum error correction is a key technology for achieving fault-tolerant quantum computation. Finding the best decoding solution to a single error syndrome pattern counteracting multiple errors is an NP-hard problem. Consequently, error decoding is one of the most expensive processes to protect the information in a logical qubit. Recent research on quantum error decoding has been focused on developing conventional and neural-network-based decoding algorithms to satisfy accuracy, speed, and scalability requirements. Although conventional decoding methods have notably improved accuracy in short codes, they face many challenges regarding speed and scalability in long codes. To overcome such problems, machine learning has been extensively applied to neural-network-based error decoding with meaningful results. Nevertheless, when using neural-network-based decoders alone, the learning cost grows exponentially with the code size. To prevent this problem, hierarchical error decoding has been devised by combining conventional and neural-network-based decoders. In addition, research on quantum error decoding is aimed at reducing the spacetime decoding cost and solving the backlog problem caused by decoding delays when using hardware-implemented decoders in cryogenic environments. We review the latest research trends in decoders for quantum error correction with high accuracy, neural-network-based quantum error decoders with high speed and scalability, and hardware-based quantum error decoders implemented in real qubit operating environments.

Quantum Error Correction Code Scheme used for Homomorphic Encryption like Quantum Computation (동형암호적 양자계산이 가능한 양자오류정정부호 기법)

  • Sohn, Il Kwon;Lee, Jonghyun;Lee, Wonhyuk;Seok, Woojin;Heo, Jun
    • Convergence Security Journal
    • /
    • v.19 no.3
    • /
    • pp.61-70
    • /
    • 2019
  • Recently, developments on quantum computers and cloud computing have been actively conducted. Quantum computers have been known to show tremendous computing power and Cloud computing has high accessibility for information and low cost. For quantum computers, quantum error correcting codes are essential. Similarly, cloud computing requires homomorphic encryption to ensure security. These two techniques, which are used for different purposes, are based on similar assumptions. Then, there have been studies to construct quantum homomorphic encryption based on quantum error correction code. Therefore, in this paper, we propose a scheme which can process the homomorphic encryption like quantum computation by modifying the QECCs. Conventional quantum homomorphic encryption schemes based on quantum error correcting codes does not have error correction capability. However, using the proposed scheme, it is possible to process the homomorphic encryption like quantum computation and correct the errors during computation and storage of quantum information unlike the homogeneous encryption scheme with quantum error correction code.

Comparative study of constitutive relations implemented in RELAP5 and TRACE - Part II: Wall boiling heat transfer

  • Shin, Sung Gil;Lee, Jeong Ik
    • Nuclear Engineering and Technology
    • /
    • v.54 no.5
    • /
    • pp.1860-1873
    • /
    • 2022
  • Nuclear thermal-hydraulic system analysis codes have been developed to comprehensively model nuclear reactor systems to evaluate the safety of a nuclear reactor system. For analyzing complex systems with finite computational resources, system codes usually solve simplified fluid equations for coarsely discretized control volumes with one-dimensional assumptions and replace source terms in the governing equations with constitutive relations. Wall boiling heat transfer models are regarded as essential models in nuclear safety evaluation among many constitutive relations. The wall boiling heat transfer models of two widely used nuclear system codes, RELAP5 and TRACE, are analyzed in this study. It is first described how wall heat transfer models are composed in the two codes. By utilizing the same method described in Part 1 paper, heat fluxes from the two codes are compared under the same thermal-hydraulic conditions. The significant factors for the differences are identified as well as at which conditions the non-negligible difference occurs. Steady-state simulations with both codes are also conducted to confirm how the difference in wall heat transfer models impacts the simulation results.