Quantum supremacy is demonstrated by some groups. Quantum computer is a hot topic in both the scientific community and the general public. At first, let's summarize the history of a computer to understand a meaning of quantum computing. A Turing machine is an epoch making innovation in calculation by machine. Human being has gotten a powerful tool not only in numerical calculation but also in logical tools.However, Turing machine has a limitation on some problems such as NP complete and so on. Quantum computer may be one of the solutions that is a key of breakthrough of the limitation in modern computing. In this paper, I will discuss why engineering students should study a quantum computer
Quantum supremacy is demonstrated by some groups. Quantum computer is a hot topic in both the scientific community and the general public. At first, let's summarize the history of a computer to understand a meaning of quantum computing. A Turing machine is an epoch making innovation in calculation by machine. Human being has gotten a powerful tool not only in numerical calculation but also in logical tools.However, Turing machine has a limitation on some problems such as NP complete and so on. Quantum computer may be one of the solutions that is a key of breakthrough of the limitation in modern computing. In this paper, I will discuss why engineering students should study a quantum computer
Abstract: Computers have significantly changed the human life, the existing computers are evolved on Turing machine model. Scientific advancements and requirements of human life are progressing rapidly and the existing computers and computational models are unable to meet the actual requirements due to their constraints. Many researchers have studied on computational models for improving its efficiency; quantum computational model has shown promising results. This paper discusses various topics related to quantum computation and quantum computers. Keywords: Quantum Computers, Classical Computers.
Modern technologies and innovations are making an impact on all areas of our lives. Among them, quantum computing stands out as one of the most advanced and promising fields. While traditional computers have certain limitations, quantum computing offers the ability to reach new heights. Quantum computers can solve complex problems quickly and efficiently. The ability to perform multiple calculations simultaneously using qubits is increasing the demand for quantum technologies. Today's students have the opportunity to become future specialists who will develop and manage these technologies. For students studying English, mathematics, computer science, and physics, learning quantum computing technologies will not be difficult and will further enhance and deepen their understanding of these subjects. This article discusses the basic concepts of quantum computing, the opportunities it offers students in education and research, and its impact on society.
Quantum computing operates by manipulating the quantum state of a system to solve problems intractable for classical computing. These problems, previously considered limitations of classical algorithms, have solutions through quantum approaches. Therefore, quantum computing suggests that the complexity of such problems lies in the current epistemic state rather than the objective state of the problem. Computational complexity can be classified into objective and epistemic complexity. Some classical problems exhibiting exponential complexity fall into the epistemic category, as their solutions depend on the current state of human knowledge and available tools. Quantum computing suggests that even mathematics isn’t entirely objective, and mathematics, in one sense, is human-made and a kind of technology, which reflects our intention and planning. Computational complexity, therefore, bridges the objective and subjective. Overcoming classical complexity necessitates advancements in scientific theories, algorithms, and quantum technology, all of which rely on the development of human cognitive abilities. Quantum computing is not just a mathematical construct, but also has physical meaning. If it were purely mathematical, classical physics and systems could potentially achieve the same results. What makes the quantum world special is its empirical nature—the physical reality of quantum chips, quantum algorithms, and quantum evolution. Quantum supremacy, or quantum advantage, refers to the potential superiority of quantum computers over classical ones. Controllable quantum systems offer an overwhelming advantage in terms of manipulation and dominance compared to classical systems. Essentially, quantum computing has the potential to significantly outperform classical computing. Many experts, including Shor, have proposed that quantum computing’s power stems from its ability to perform multiple computations simultaneously—a concept often referred to as the Quantum parallelism thesis. Rather, some argue that the true source of quantum computing acceleration lies in the fundamental differences between classical and quantum logic. However, it’s important to note that quantum logic, while providing a new perspective, does not directly address the core principle of quantum parallelism. This dominance stems from quantum physics’ unique properties: Exponential storage capacity, parallel computing inherent to its nature (ontological), and the ability to perform calculations with exponential speedup through quantum algorithms.
Abstract: Quantum computing is a new type of computing that uses the principles of quantum physics to perform calculations in ways that are not possible with traditional computers. Unlike classical computers, which process information using bits that are either 0 or 1, quantum computers use quantum bits (qubits) that can exist in multiple states at the same time. This ability allows quantum systems to solve certain complex problems much faster than classical machines. This paper presents a simple and human-centered explanation of quantum computing, focusing on how it works, why it matters, and how it can be applied in real-world situations. The study discusses key concepts such as superposition, entanglement, and quantum gates using easy-to-understand language. It also explores practical applications including cryptography, optimization, drug discovery, and material simulation. In addition, this paper examines the current challenges in quantum computing, such as hardware instability, error correction, limited qubit scalability, and high implementation cost. A conceptual hybrid classical–quantum system model is proposed to show how quantum and classical computers can work together to solve complex problems more efficiently. The goal of this research is to make quantum computing more understandable to students, educators, and decision-makers, and to encourage early awareness and responsible development of this powerful technology. Keywords — quantum computing, qubit, superposition, entanglement, quantum gate, error correction, hybrid computing
Why quantum computing? As we all know very well, conventional (electronic) computers have enormous power which, moreover, is constantly increasing. With their help gigantic quantities of data can be handled and evaluated. This is of crucial importance, for instance, in modern high energy physics experiments. On the other hand, computers can be used to model very complex systems with the aim of predicting, for example, future developments in our environment, notably climatic changes. Thanks to their incredible speed computers are, of course, destined to treat mathematical problems for which specific algorithms exist very efficiently. To mention a simple example, the digits of π are readily evaluated up to a very high order. Last, but not least, their potential to solve differential equations numerically, even when they are nonlinear, makes computers indispensable in modern research. So, one might ask, is there any reason to look for fundamentally new ways of computing as they are seemingly offered by quantum processes? What advantages can be expected when the laws of quantum mechanics, rather than those of classical physics, are exploited for computation? Two answers were given: first, the simulation of complex quantum systems on classical computers meets serious difficulties that might be overcome with the help of quantum computers. This idea was suggested in 1982 by R. Feynman, and in the 1990s it was indeed shown by several groups of researchers that quantum mechanical systems for which no efficient simulation on a classical computer is known can be efficiently simulated on a quantum computer.
Ohya and Volovich found the quantum algorithm with a chaos dynamics, called the OV SAT algorithm which enabled to solve NP-Complete problem in polynomial time. It is proved that the unitary operator of the quantum algorithm can be constructed by a product of so called fundamental gates. To discuss the computational complexity rigorously, we introduced a generalized quantum Turing machine(GQTM) where the computational process is given by quantum channels including a dispative dynamics and the configuration is represented by density operators. In this paper, we explain the GQTM and the OV SAT algorithm, then we discuss the computational complexity of OV SAT algorithm. Finally, we introduce some resent results and topics by use of GQTM.