Solving systems of linear equations with quantum mechanics

June 9, 2017 by Lisa Zyga, Phys.org feature

(Left) False color photomicrograph and (right) simplified circuit diagram of the superconducting quantum circuit for solving 2 × 2 linear equations. The method uses four qubits, marked Q1 to Q4, with four corresponding readout resonators, marked R1 to R4. Credit: Zheng et al. © 2017 American Physical Society
(Phys.org)—Physicists have experimentally demonstrated a purely quantum method for solving systems of linear equations that has the potential to work exponentially faster than the best classical methods. The results show that quantum computing may eventually have far-reaching practical applications, since solving linear systems is commonly done throughout science and engineering.

The physicists, led by Haohua Wang at Zhejiang University and Chao-Yang Lu and Xiaobo Zhu at the University of Science and Technology of China, along with their coauthors from various institutions in China, have published their paper on what they refer to as a "quantum linear solver" in a recent issue of Physical Review Letters.

"For the first time, we have demonstrated a for solving systems of on a superconducting quantum circuit," Lu told Phys.org. "[This is] one of the best solid-state platforms with excellent scalability and remarkable high fidelity."

The quantum algorithm they implemented is called the Harrow, Hassidim, and Lloyd (HHL) algorithm, which was previously shown to have the ability, in principle, to lead to an exponential quantum speedup over classical algorithms. However, so far this has not been experimentally demonstrated.

In the new study, the scientists showed that a superconducting quantum circuit running the HHL algorithm can solve the simplest type of linear system, which has two equations with two variables. The method uses just four qubits: one ancilla qubit (a universal component of most quantum computing systems), and three qubits that correspond to the input vector b and the two solutions represented by the solution vector x in the standard linear system Ax = b, where A is a 2 x 2 matrix.

By performing a series of rotations, swappings of states, and binary conversions, the HHL algorithm determines the solutions to this system, which can then be read out by a quantum nondemolition measurement. The researchers demonstrated the method using 18 different input vectors and the same matrix, generating different solutions for different inputs. As the researchers explain, it is too soon to tell how much faster this quantum method might work since these problems are easily solved by classical methods.

"The whole calculation process takes about one second," Zhu said. "It is hard to directly compare the current version to the classical methods now. In this work, we showed how to solve the simplest 2 x 2 linear system, which can be solved by classical methods in a very short time. The key power of the HHL quantum is that, when solving an 's-sparse' system matrix of a very large size, it can gain an exponential speed-up compared to the best classical . Therefore, it would be much more interesting to show such a comparison when the size of the linear equation is scaled to a very large system."

The researchers expect that, in the future, this could be scaled up to solve larger . They also plan to further improve the system's performance by making some straightforward adjustments to the device fabrication to reduce some of the error in its implementation. In addition, the researchers want to investigate how the circuit could be used to implement other quantum algorithms for a variety of large-scale applications.

"Our future research will focus on improving the hardware performance, including longer coherence times, higher precision logic gates, larger numbers of qubits, lower crosstalk, better readout fidelity, etc.," Wang said. "Based on the improvement of the hardware, we will demonstrate and optimize more quantum algorithms to really show the power of the superconducting processor."

Explore further: Physicists uncover similarities between classical and quantum machine learning

More information: Yarui Zheng et al. "Solving Systems of Linear Equations with a Superconducting Quantum Processor." Physical Review Letters. DOI: 10.1103/PhysRevLett.118.210504. Also at arXiv:1703.06613 [quant-ph]

Related Stories

Quantum algorithm breakthrough

February 24, 2013

An international research group led by scientists from the University of Bristol, UK, and the University of Queensland, Australia, has demonstrated a quantum algorithm that performs a true calculation for the first time. ...

Recommended for you

Scientists produce 3-D chemical maps of single bacteria

November 16, 2018

Scientists at the National Synchrotron Light Source II (NSLS-II)—a U.S. Department of Energy (DOE) Office of Science User Facility at DOE's Brookhaven National Laboratory—have used ultrabright x-rays to image single bacteria ...

Bursting bubbles launch bacteria from water to air

November 15, 2018

Wherever there's water, there's bound to be bubbles floating at the surface. From standing puddles, lakes, and streams, to swimming pools, hot tubs, public fountains, and toilets, bubbles are ubiquitous, indoors and out.

Terahertz laser pulses amplify optical phonons in solids

November 15, 2018

A study led by scientists of the Max Planck Institute for the Structure and Dynamics of Matter (MPSD) at the Center for Free-Electron Laser Science in Hamburg/Germany presents evidence of the amplification of optical phonons ...

4 comments

Adjust slider to filter visible comments by rank

Display comments: newest first

EmceeSquared
4 / 5 (4) Jun 09, 2017
I don't know why people say there are no quantum computers. And this one executes not a niche function like simulated annealing but the highly applicable system of linear equations. It really is a breakthrough.
Mimath224
Jun 09, 2017
This comment has been removed by a moderator.
Da Schneib
5 / 5 (1) Jun 09, 2017
Interesting but not much advanced beyond analog computers of the 1970s.
lostfreeman
not rated yet Jun 11, 2017
Wait, I though linear systems can be solved in n^3. Ho can there be an exponential improvement over that?

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more

Click here to reset your password.
Sign in to get notified via email when new comments are made.