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

Science

Quantum Problem Solvers

I. S. Osborne

Published Oct 29, 2009• 0 citations
Publisher

Abstract

Applied Physics Quantum computers, when they become available, will harness the power of quantum mechanics to perform calculations and searches, outperforming classical computers at certain tasks. The development of quantum computers is two-pronged: Both hardware and software must be devised. The focus in the software realm is on which problems can be solved and how to do so. Solving a set of linear equations is a generic and important problem in many fields of science, engineering, and mathematics. On a classical computer the computational cost of extracting a solution grows linearly with the size of the system. Harrow et al. have developed a quantum algorithm that will solve the problem much more rapidly (scaling as the logarithm of the system size), requiring exponentially less time. Now we wait for the machinery to arrive. Phys. Rev. Lett. 103 , 150502 (2009).

DOI
10.1126/science.326_645b

Related papers

Quantum Computing: Computing of the Future Made Reality

Janelle Mathis, Bryson R. Payne

Quantum computing is an emerging new area focused on technology consisting of quantum theory aspects such as electrons, sub-atomic particles, and other materials engineered using quantum mechanics. Through quantum mechanics, these computers can solve problems that classical computers deem too complex. Today the closest computing technology compared to quantum computers are supercomputers, but similarly to classical computers, supercomputers also have faults. With supercomputers, when a problem is deemed too complex, it is due to the classical machinery components within the computer, thus causing a halt in solving the task or problem. In contrast, these problems could be solved with a quantum computer due to the advancements in engineered materials based on quantum mechanics. Apart from the hardware that enables a quantum computer to function more intelligently, the software developed for these computers can also show tremendous improvements in certain aspects, such as cryptography. This research examines quantum computing from its origins and details how the computer runs, its faults and limitations, ways to protect from quantum computing attacks, and demonstrates what programming a quantum computer would entail.

Proceedings on cybersecurity education, research and practice•Nov 1, 2023•2 citations

Quantum Computing: Unleashing the Power of Efficient Problem Solving

Sadaquat Ali Ruk, Maham Shahid, Areeba Raees +1 more

Quantum computing aims to outperform classical computers for some specific calculations. It relies on the additional resources given by the qubit superposition states, which can be used to design more efficiently. Reversibility of quantum computation may help in solving NP problems, which are easy in one direction but hard in the opposite sense. Quantum computers can enhance data processing and analysis tasks. The potential impact of quantum algorithms on optimization problems, simulation of quantum systems, and machine learning tasks such as clustering and classification. It also includes efforts to standardize quantum hardware and software interfaces, enabling interoperability and accelerating the adoption of quantum computing. The barriers we face while adopting Quantum computing are the accuracy of the information, lack of technical experts, and organizational interest in adopting the new process. We find one more critical barrier is the lack of standards of secure communication techniques while adopting quantum computing. While numerous challenges lie ahead, the promise of quantum computing in solving complex problems and driving innovation is too significant to ignore. We will examine the existing quantum algorithms and applications that have demonstrated quantum advantage or potential utility in various domains. The quantum computing field is expected to transition from physical qubits to error-corrected logical qubits. AI is likely to be unleashed by quantum computing for formidable progress advances in speed, cost, and algorithm learning function. Quantum computing solves one or two problems, with little practical use, and costs a fortune to run. Additionally, we will assess the challenges associated with scaling up quantum systems, addressing the issues of quantum coherence, error correction, and noise reduction.

Journal of Interdisciplinary Innovational Letters•Dec 31, 2024•0 citations

Solving Systems of Linear Equations with a Superconducting Quantum Processor

Yarui Zheng, Chao Song, Ming-Cheng Chen +15 more

Superconducting quantum circuits are a promising candidate for building scalable quantum computers. Here, we use a four-qubit superconducting quantum processor to solve a two-dimensional system of linear equations based on a quantum algorithm proposed by Harrow, Hassidim, and Lloyd [Phys. Rev. Lett. 103, 150502 (2009)PRLTAO0031-900710.1103/PhysRevLett.103.150502], which promises an exponential speedup over classical algorithms under certain circumstances. We benchmark the solver with quantum inputs and outputs, and characterize it by nontrace-preserving quantum process tomography, which yields a process fidelity of 0.837±0.006. Our results highlight the potential of superconducting quantum circuits for applications in solving large-scale linear systems, a ubiquitous task in science and engineering.

arXiv:1703.06613•Physical Review Letters•May 26, 2017•99 citations

Quantum Computing

G. Kaushik Raj G. Kaushik Raj

Quantum computing performs computations by tapping the very laws that govern quantum mechanics, thereby making those computations far more efficient than does a classical computer. Quantum computers, through qubits and quantum phenomena like superposition, entanglement, and interference, will be able to solve some complex problems in cryptography, chemistry, optimization, and others. This paper discusses core principles and historical development, theoretical foundations of quantum computing, practical implications, and current challenges. However, as research progresses, quantum computing would change the face of technology, science, and industry.

Journal of Software Engineering and Simulation•May 1, 2025•0 citations

Classical and quantum resource analysis for the quantum linear systems

Jon Inouye

Recently (2009) a quantum algorithm for solving a system of linear equations\nhas been proposed. The algorithm by Harrow, Hassidim, and Lloyd has attracted\nconsiderable attention in the quantum algorithms community, due to the broad\npotential applications of a rapid linear equations solver. The contribution of this\nthesis is to analyze the classical and quantum resources required for implementation.\nThe thesis has two major tasks. We first survey the field of quantum\nalgorithms. The papers which established this field (e.g., Feynman and Deutsch) to\nrecent works are reviewed. Different classes of quantum algorithms are examined,\nincluding those based on the Fourier transform, quantum searching, and quantum\nwalk.\nFor the second task, we focus on the algorithm by Harrow, Hassidim, and\nLloyd. The advantages of the algorithm are an exponential performance gain over\nclassical algorithms (under conditions of sparse operator matrices and few selected\nmeasurements from the solution set), and fewer data registers.\nIn the second part of the thesis, we study the classical resources required for\nimplementation of the algorithm. Since classical resources can determine the ultimate\nefficiency of the quantum algorithm, the optimal use of classical resources is\nmandatory.\nWe demonstrate how a classical computer may handle certain computations\n(e.g., time evolution) and feed these into the quantum circuit implementing the\nalgorithm. Thus, the classical and quantum resources for implementing the algorithm\nare described. Through a detailed analysis of the classical resources, we hope to\nunderstand how these resources may be optimized. This work can therefore\ncontribute to the design of efficient quantum algorithms.

•Jul 22, 2010•0 citations

Quantum Computing Solution of DC Power Flow

Rozhin Eskandarpour, Kumar Ghosh, Amin Khodaei +3 more

In this paper, we model and solve a fundamental power system problem, i.e., DC power flow, using a practical quantum computer. The Harrow-Hassidim-Lloyd (HHL) quantum algorithm is used to solve the DC power flow problem. The HHL algorithm for the solution of a system of linear equations (SLE) offers an exponential speedup over the classical computers. The speedup advantage is more significant when the size and the frequency of solving the power flow problem become more substantial. Verified quantum computing applications to power systems are merely nonexistent at this point. Through this paper, we plan to (1) provide a proof-of-concept that practical power system problems can be solved using quantum technology, (2) build a quantum-grid foundation by solving a fundamental power system problem with applications in many other critical grid problems, and (3) apply HHL to solve an SLE which has broad applications in many power system problems. A small 3-bus system is used for testing and demonstration purposes, considering the limitations of the available quantum computing hardware and software. The proposed method's merits and effectiveness are demonstrated using IBM open-source quantum computer and reported through proof-of-concept experimental demonstration using a 4-qubit quantum information processor.

arXiv:2010.02442•Oct 6, 2020•19 citations
Applied Physics
Quantum computers, when they become available, will harness the power of quantum mechanics to perform calculations and searches, outperforming classical computers at certain tasks. The development of quantum computers is two-pronged: Both hardware and software must be devised. The focus in the software realm is on which problems can be solved and how to do so. Solving a set of linear equations is a generic and important problem in many fields of science, engineering, and mathematics. On a classical computer the computational cost of extracting a solution grows linearly with the size of the system. Harrow et al. have developed a quantum algorithm that will solve the problem much more rapidly (scaling as the logarithm of the system size), requiring exponentially less time. Now we wait for the machinery to arrive.
Phys. Rev. Lett. 103 , 150502 (2009).
Quantum computing is an emerging new area focused on technology consisting of quantum theory aspects such as electrons, sub-atomic particles, and other materials engineered using quantum mechanics. Through quantum mechanics, these computers can solve problems that classical computers deem too complex. Today the closest computing technology compared to quantum computers are supercomputers, but similarly to classical computers, supercomputers also have faults. With supercomputers, when a problem is deemed too complex, it is due to the classical machinery components within the computer, thus causing a halt in solving the task or problem. In contrast, these problems could be solved with a quantum computer due to the advancements in engineered materials based on quantum mechanics. Apart from the hardware that enables a quantum computer to function more intelligently, the software developed for these computers can also show tremendous improvements in certain aspects, such as cryptography. This research examines quantum computing from its origins and details how the computer runs, its faults and limitations, ways to protect from quantum computing attacks, and demonstrates what programming a quantum computer would entail.
Quantum computing aims to outperform classical computers for some specific calculations. It relies on the additional resources given by the qubit superposition states, which can be used to design more efficiently. Reversibility of quantum computation may help in solving NP problems, which are easy in one direction but hard in the opposite sense. Quantum computers can enhance data processing and analysis tasks. The potential impact of quantum algorithms on optimization problems, simulation of quantum systems, and machine learning tasks such as clustering and classification. It also includes efforts to standardize quantum hardware and software interfaces, enabling interoperability and accelerating the adoption of quantum computing. The barriers we face while adopting Quantum computing are the accuracy of the information, lack of technical experts, and organizational interest in adopting the new process. We find one more critical barrier is the lack of standards of secure communication techniques while adopting quantum computing. While numerous challenges lie ahead, the promise of quantum computing in solving complex problems and driving innovation is too significant to ignore. We will examine the existing quantum algorithms and applications that have demonstrated quantum advantage or potential utility in various domains. The quantum computing field is expected to transition from physical qubits to error-corrected logical qubits. AI is likely to be unleashed by quantum computing for formidable progress advances in speed, cost, and algorithm learning function. Quantum computing solves one or two problems, with little practical use, and costs a fortune to run. Additionally, we will assess the challenges associated with scaling up quantum systems, addressing the issues of quantum coherence, error correction, and noise reduction.
Superconducting quantum circuits are a promising candidate for building scalable quantum computers. Here, we use a four-qubit superconducting quantum processor to solve a two-dimensional system of linear equations based on a quantum algorithm proposed by Harrow, Hassidim, and Lloyd [Phys. Rev. Lett. 103, 150502 (2009)PRLTAO0031-900710.1103/PhysRevLett.103.150502], which promises an exponential speedup over classical algorithms under certain circumstances. We benchmark the solver with quantum inputs and outputs, and characterize it by nontrace-preserving quantum process tomography, which yields a process fidelity of 0.837±0.006. Our results highlight the potential of superconducting quantum circuits for applications in solving large-scale linear systems, a ubiquitous task in science and engineering.
Quantum computing performs computations by tapping the very laws that govern quantum mechanics, thereby making those computations far more efficient than does a classical computer. Quantum computers, through qubits and quantum phenomena like superposition, entanglement, and interference, will be able to solve some complex problems in cryptography, chemistry, optimization, and others. This paper discusses core principles and historical development, theoretical foundations of quantum computing, practical implications, and current challenges. However, as research progresses, quantum computing would change the face of technology, science, and industry.
Recently (2009) a quantum algorithm for solving a system of linear equations\nhas been proposed. The algorithm by Harrow, Hassidim, and Lloyd has attracted\nconsiderable attention in the quantum algorithms community, due to the broad\npotential applications of a rapid linear equations solver. The contribution of this\nthesis is to analyze the classical and quantum resources required for implementation.\nThe thesis has two major tasks. We first survey the field of quantum\nalgorithms. The papers which established this field (e.g., Feynman and Deutsch) to\nrecent works are reviewed. Different classes of quantum algorithms are examined,\nincluding those based on the Fourier transform, quantum searching, and quantum\nwalk.\nFor the second task, we focus on the algorithm by Harrow, Hassidim, and\nLloyd. The advantages of the algorithm are an exponential performance gain over\nclassical algorithms (under conditions of sparse operator matrices and few selected\nmeasurements from the solution set), and fewer data registers.\nIn the second part of the thesis, we study the classical resources required for\nimplementation of the algorithm. Since classical resources can determine the ultimate\nefficiency of the quantum algorithm, the optimal use of classical resources is\nmandatory.\nWe demonstrate how a classical computer may handle certain computations\n(e.g., time evolution) and feed these into the quantum circuit implementing the\nalgorithm. Thus, the classical and quantum resources for implementing the algorithm\nare described. Through a detailed analysis of the classical resources, we hope to\nunderstand how these resources may be optimized. This work can therefore\ncontribute to the design of efficient quantum algorithms.
In this paper, we model and solve a fundamental power system problem, i.e., DC power flow, using a practical quantum computer. The Harrow-Hassidim-Lloyd (HHL) quantum algorithm is used to solve the DC power flow problem. The HHL algorithm for the solution of a system of linear equations (SLE) offers an exponential speedup over the classical computers. The speedup advantage is more significant when the size and the frequency of solving the power flow problem become more substantial. Verified quantum computing applications to power systems are merely nonexistent at this point. Through this paper, we plan to (1) provide a proof-of-concept that practical power system problems can be solved using quantum technology, (2) build a quantum-grid foundation by solving a fundamental power system problem with applications in many other critical grid problems, and (3) apply HHL to solve an SLE which has broad applications in many power system problems. A small 3-bus system is used for testing and demonstration purposes, considering the limitations of the available quantum computing hardware and software. The proposed method's merits and effectiveness are demonstrated using IBM open-source quantum computer and reported through proof-of-concept experimental demonstration using a 4-qubit quantum information processor.