• 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.

• Journal of the Korean Physical Society
• /
• v.73 no.10
• /
• pp.1596-1602
• /
• 2018

We suggest that the dark matter in the universe has quantum entanglement if the dark matter is a Bose-Einstein condensation of ultra-light scalar particles. In this theory, any two regions of a galaxy are quantum entangled due to the quantum nature of the condensate. We calculate the entanglement entropy of a typical galactic halo, which turns out to be at least O(ln(M/m)), where M is the mass of the halo and m is the mass of a dark matter particle. The entanglement can be inferred from the rotation curves of the galaxy or the interference patterns of the dark matter density.

• Journal of the Korean Magnetics Society
• /
• v.16 no.1
• /
• pp.88-91
• /
• 2006

We present a method describing the quantum entanglement. We knows the criterion which can determine entanglement in a bipartite system. It is difficult in mixed states. Even though the entanglement criterion for multipartite systems is difficult, we offer a criterion for multiqubits and discuss entanglement of the mixed state.

• Journal of the Korean Magnetics Society
• /
• v.17 no.1
• /
• pp.6-9
• /
• 2007

The generation of entanglement is a very important subject in the quantum computer. Here we suggest the method that generates entanglement between two spin-1/2 particles by using the third moving spin-1/2 particle. We use the $F\"{o}rster$ interaction and the exchange interaction to make the entangled state.

• Journal of the Korean Magnetics Society
• /
• v.16 no.1
• /
• pp.84-87
• /
• 2006

We suggest a procedure entangling two spin-1/2 particles at distant positions such that they cannot be directly entangled via local interaction. An already entangled pair is used to transfer the entanglement to another pair of particles by way of interaction. This scheme of nonlocal generation of entanglement can be used in the construction of a two-qubit universal gate.

• Korean Journal of Optics and Photonics
• /
• v.29 no.2
• /
• pp.64-69
• /
• 2018

In this work, we derive a general lower bound to concurrence of an arbitrary mixture of two pure states, that is, rank-two multipartite quantum states. We show that the lower bound can tightly detect entanglement of rank-two states, and also can be implemented experimentally with present-day technologies, i.e. single-copy level measurement and classical post-processing.

• Proceedings of the Optical Society of Korea Conference
• /
• 2004.07a
• /
• pp.216-217
• /
• 2004

• Electronics and Telecommunications Trends
• /
• v.36 no.3
• /
• pp.87-96
• /
• 2021

Quantum computers will be a game-changer in various fields, such as cryptography and new materials. Quantum computer is quite different from the classical computer by using quantum-mechanical phenomena, such as superposition, entanglement, and interference. The main components of a quantum computer can be divided into quantum-algorithm, quantum-classical control interface, and quantum processor. Universal quantum computing, which can be applied in various industries, is expected to have more than millions of qubits with high enough gate accuracy. Currently, It uses general-purpose electronic equipment, which is placed in a rack, at room temperature to make electronic signals that control qubits. However, implementing a universal quantum computer with a low error rate requires a lot of qubits demands the change of the current control system to be an integrated and miniaturized system that can be operated at low temperatures. In this study, we explore the fundamental units of the control system, describe the problems and alternatives of the current control system, and discuss a future quantum control system.

• Proceedings of the Optical Society of Korea Conference
• /
• 2009.02a
• /
• pp.315-316
• /
• 2009

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.611-613
• /
• 2021

Recently, research and development of quantum computers, which exceed the limits of classical computers, have been actively carried out in various fields. Quantum computers, which use quantum mechanics principles in a way different from the electrical signal processing of classical computers, have various quantum mechanical phenomena such as quantum superposition and quantum entanglement. It goes through a very complicated calculation process compared to the calculation of a classical computer for performing an operation using its characteristics. In order to utilize each element efficiently and accurately, it is necessary to visualize the data before driving the actual quantum computer and perform error verification, optimization, reliability, and verification. However, when visualizing all the data of various elements configured inside the quantum computer, it is difficult to intuitively grasp the necessary data, so it is necessary to visualize the data selectively. In this paper, we visualize the data of various elements that make up a quantum computer, and hierarchically visualize the internal circuit components of a quantum computer that are complicatedly configured so that the data can be observed and utilized intuitively.