• Proceedings of the Korean Vacuum Society Conference
• /
• 2004.08a
• /
• pp.116-116
• /
• 2004

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.9-12
• /
• 2019

본 논문에서는 IBM사의 Q를 이용하여 몇 가지 양자 컴퓨팅 개념을 구현해보고 검증한다. Superdense coding과 Quantum teleportation, Bell's Inequailty를 python 기반의 코드로 구현하고 실제 ibmqx4 양자 컴퓨터로 실행한 결과, Superdense coding은 약 85%의 정확도, Quantum teleportation은 96.7%의 정확도를 보이고 Bell's Inequailty가 성립하지 않는 것을 확인하였다.

• Electronics and Telecommunications Trends
• /
• v.34 no.5
• /
• pp.99-112
• /
• 2019

A quantum light source is an essential element for quantum information technology, including quantum communication, quantum sensor, and quantum computer. Quantum light sources including photon number state, entangled state, and squeezed state can be divided into two types according to the generation mechanism, namely single emitter and non-linear based systems. The single emitter platform contains atom/ion trap, solid-state defect/color center, two-dimensional material, and semiconductor quantum dot, which can emit deterministic photons. The non-linear based platform contains spontaneous parametric down-conversion and spontaneous four-wave mixing, which can emit probabilistic photon pairs. For each platform, we give an overview of the recent research trends of the generation, manipulation, and integration of single photon and entangled photon sources. The characteristics of quantum light sources are investigated for each platform. In addition, we briefly introduce quantum sensing, quantum communication, and quantum computing applications based on quantum light sources. We discuss the challenges and prospects of quantum light sources for quantum information technology.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1083-1097
• /
• 2018

This paper presents a novel range-free localization algorithm based on quantum particle swarm optimization. The proposed algorithm is capable of estimating the distance between two non-neighboring sensors for multi-hop heterogeneous wireless sensor networks where all nodes' communication ranges are different. Firstly, we construct a new cumulative distribution function of expected hop progress for sensor nodes with different transmission capability. Then, the distance between any two nodes can be computed accurately and effectively by deriving the mathematical expectation of cumulative distribution function. Finally, quantum particle swarm optimization algorithm is used to improve the positioning accuracy. Simulation results show that the proposed algorithm is superior in the localization accuracy and efficiency when used in random and uniform placement of nodes for heterogeneous wireless sensor networks.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.6
• /
• pp.181-188
• /
• 2023

Block cipher is not expected to be safe for quantum computer, as Grover's algorithm reduces the security strength by accelerating brute-force attacks on symmetric key ciphers. So it is necessary to check the post-quantum security strength by implementing quantum circuit for the target cipher. In this paper, we propose the optimal quantum circuit implementation result designed as a technique to minimize the use of quantum resources (qubits, quantum gates) for SIMECK lightweight cryptography, and explain the operation of each quantum circuit. The implemented SIMECK quantum circuit is used to check the estimation result of quantum resources and calculate the Grover attack cost. Finally, the post-quantum strength of SIMECK lightweight cryptography is evaluated. As a result of post-quantum security strength evaluation, all SIMECK family cipher failed to reach NIST security strength. Therefore, it is expected that the safety of SIMECK cipher is unclear when large-scale quantum computers appear. About this, it is judged that it would be appropriate to increase the block size, the number of rounds, and the key length to increase the security strength.

• International Journal of Contents
• /
• v.7 no.4
• /
• pp.56-63
• /
• 2011

Quantum mechanics is a branch of physics for a mathematical description of the particle wave, and it is applied to information technology such as quantum computer, quantum information, quantum network and quantum cryptography, etc. In 1936, Garrett Birkhoff and John von Neumann introduced the logic of quantum mechanics (quantum logic) in order to investigate projections on a Hilbert space. As another type of quantum logic, orthomodular implication algebra was introduced by Chajda et al. This algebra has the logical implication as a binary operation. In pure mathematics, there are many algebras such as Hilbert algebras, implicative models, implication algebras and dual BCK-algebras (DBCK-algebras), which have the logical implication as a binary operation. In this paper, we introduce the definitions and some properties of those algebras and clarify the relations between those algebras. Also, we define the implicative poset which is a generalization of orthomodular implication algebras and DBCK-algebras, and research properties of this algebraic structure.

• Proceedings of the Materials Research Society of Korea Conference
• /
• 1998.08a
• /
• pp.111.2-111
• /
• 1998

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

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.941-950
• /
• 2017

The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.