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

College Physics

The principles and problems in quantum computer

Zhao Hong

Published Jan 1, 2001• 0 citations
OpenAlex

Abstract

The principles and characteristic of the quantum computer are discussed,the problems met in realizing it as well as the solutions are especially studied.

Related papers

Introduction to Quantum Computation

Chatterjee, Ashok

This is an introductory review on the basic principles of quantum computation. Various important quantum logic gates and algorithms based on them are introduced. Quantum teleportation and decoherence are discussed briefly. Some problems, without solutions, are included.

arXiv:quant-ph/0312111•Dec 12, 2003•69 citations

Quantum Computers

Megha Roy, Soumen Santra, Sarasij Majumdar

Computers have become an indispensible part of our life. Advancements in the field of technology have led to smaller and more compact computers, while their processing power has increased. However, with parts getting smaller and more compact, quantum physics are making things a bit problematic. Transistors act like switches, either allowing electrons to pass through or blocking their passage. Transistors are already almost as small as atoms. Electrons will eventually be able to transfer themselves to the other side of the blocked passage via a process called quantum tunneling, making transistors useless. Classical computers and the way it works stop making sense in the quantum realm. A possible solution to this problem could be quantum computers, which takes advantage of quantum principles to work. In this paper, an overview of quantum computers, their working principles and the basics of the math behind such computers have been discussed. The future scope of such a computer, problems associated with implementing it as well as the problems to be dealt with in case a scalable quantum computer is built is also provided.

International Journal of Computer Sciences and Engineering•Nov 24, 2025•0 citations

Quantum Approximate Optimization with Hard and Soft Constraints

Stuart Hadfield, Zhihui Wang, Eleanor Gilbert Rieffel +3 more

Challenging computational problems arising in the practical world are frequently tackled by heuristic algorithms. Small universal quantum computers will emerge in the next year or two, enabling a substantial broadening of the types of quantum heuristics that can be investigated beyond quantum annealing. The immediate question is: what experiments should we prioritize that will give us insight into quantum heuristics? One leading candidate is the quantum approximate optimization algorithm (QAOA) metaheuristic. In this work, we provide a framework for designing QAOA circuits for a variety of combinatorial optimization problems with both hard constraints that must be met and soft constraints whose violation we wish to minimize. We work through a number of examples, and discuss design principles.

•Nov 3, 2017•51 citations

Quantum computers: principles of operation and prospects for application

I. M. Melnikov, M. P. Miatselitsa

This article is devoted to quantum computers. At the beginning, the reasons for their introduction are noted. Then much attention is given to the working principles of quantum computers. After that it is pointed out some examples of quantum algorithms. Next it is spoken about engineering challenges. At the end the future of quantum computing is emphasized.

•Jan 1, 2026•0 citations

Models of Computer Calculations

V. K. Zadiraka, Олександр Миколайович Хіміч, Інна Віталіївна Швідченко

Introduction. The complexity of computational algorithms for solving typical problems of computational, applied, and discrete mathematics is analyzed from the perspective of the theory of computation, depending on the computer architecture and the used computing model: single-processor, multiprocessor, and quantum. The following classes of problems are considered: systems of linear algebraic equations, the Cauchy problem for systems of ordinary differential equations, numerical integration, boundary value problems for ordinary differential equations, factorization of numbers, finding the discrete logarithm of a number in multiplicative integer groups, searching for the necessary record in an unordered database, etc. The purposes of the paper are: 1. To investigate how the computational complexity depends on the computer architecture and the computational model. 2. To show that the construction of the computational process under the given conditions of calculations is related to the solution of the following problems: – the existence ε-solution to the problem; – the existence of T-effective computing algorithms; – the possibility of building a real computing process under the given computing conditions. 3. To investigate the effect of rounding numbers on computational complexity (especially when solving problems of transcomputational complexity). 4. To give the complexity estimates and total error of the computational algorithm for a number of typical problems of computational, applied, and discrete mathematics. The results. The complexity estimates of computational algorithms of the listed classes of problems for single-processor, multiprocessor and quantum computing models are given. The main focus is on high-performance computing: using the principles of parallel data processing and quantum mechanics. Conclusions. The connection of complexity estimates of computational algorithms with the architecture of computers and models of calculations is demonstrated. The characteristics of the first quantum computers (2016 – 2022), which have gone beyond laboratory research, are given. Keywords: computer technologies, rounding error, sequential, parallel and quantum computing models, complexity estimate.

Cybernetics and Computer Technologies•Sep 30, 2022•5 citations

DISCUSSION ON QUANTUM COMPUTER

GU Guo-tai

This paper first introduces the concept of quantum computer and some basic applications,then looks back the general research situation of quantum computer theory,explaining the basic quantum computer theory,the differences between quantum computer and classic computer,and at last points out the situations to realize quantum computer and the present difficulties.

Journal of Henan University of Technology•Jan 1, 2006•0 citations
Computers have become an indispensible part of our life. Advancements in the field of technology have led to smaller and more compact computers, while their processing power has increased. However, with parts getting smaller and more compact, quantum physics are making things a bit problematic. Transistors act like switches, either allowing electrons to pass through or blocking their passage. Transistors are already almost as small as atoms. Electrons will eventually be able to transfer themselves to the other side of the blocked passage via a process called quantum tunneling, making transistors useless. Classical computers and the way it works stop making sense in the quantum realm. A possible solution to this problem could be quantum computers, which takes advantage of quantum principles to work. In this paper, an overview of quantum computers, their working principles and the basics of the math behind such computers have been discussed. The future scope of such a computer, problems associated with implementing it as well as the problems to be dealt with in case a scalable quantum computer is built is also provided.
Challenging computational problems arising in the practical world are frequently tackled by heuristic algorithms. Small universal quantum computers will emerge in the next year or two, enabling a substantial broadening of the types of quantum heuristics that can be investigated beyond quantum annealing. The immediate question is: what experiments should we prioritize that will give us insight into quantum heuristics? One leading candidate is the quantum approximate optimization algorithm (QAOA) metaheuristic. In this work, we provide a framework for designing QAOA circuits for a variety of combinatorial optimization problems with both hard constraints that must be met and soft constraints whose violation we wish to minimize. We work through a number of examples, and discuss design principles.
Introduction. The complexity of computational algorithms for solving typical problems of computational, applied, and discrete mathematics is analyzed from the perspective of the theory of computation, depending on the computer architecture and the used computing model: single-processor, multiprocessor, and quantum. The following classes of problems are considered: systems of linear algebraic equations, the Cauchy problem for systems of ordinary differential equations, numerical integration, boundary value problems for ordinary differential equations, factorization of numbers, finding the discrete logarithm of a number in multiplicative integer groups, searching for the necessary record in an unordered database, etc. The purposes of the paper are: 1. To investigate how the computational complexity depends on the computer architecture and the computational model. 2. To show that the construction of the computational process under the given conditions of calculations is related to the solution of the following problems: – the existence ε-solution to the problem; – the existence of T-effective computing algorithms; – the possibility of building a real computing process under the given computing conditions. 3. To investigate the effect of rounding numbers on computational complexity (especially when solving problems of transcomputational complexity). 4. To give the complexity estimates and total error of the computational algorithm for a number of typical problems of computational, applied, and discrete mathematics. The results. The complexity estimates of computational algorithms of the listed classes of problems for single-processor, multiprocessor and quantum computing models are given. The main focus is on high-performance computing: using the principles of parallel data processing and quantum mechanics. Conclusions. The connection of complexity estimates of computational algorithms with the architecture of computers and models of calculations is demonstrated. The characteristics of the first quantum computers (2016 – 2022), which have gone beyond laboratory research, are given. Keywords: computer technologies, rounding error, sequential, parallel and quantum computing models, complexity estimate.