English
Related papers

Related papers: Solving systems of linear equations on a quantum c…

200 papers

Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…

Recently, it is shown that quantum computers can be used for obtaining certain information about the solution of a linear system Ax=b exponentially faster than what is possible with classical computation. Here we first review some key…

Quantum Physics · Physics 2015-05-30 Yudong Cao , Anmer Daskin , Steven Frankel , Sabre Kais

Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $N\times{N}$…

Quantum Physics · Physics 2014-02-19 Jian Pan , Yudong Cao , Xiwei Yao , Zhaokai Li , Chenyong Ju , Xinhua Peng , Sabre Kais , Jiangfeng Du

Scalable quantum computation with linear optics was considered to be impossible due to the lack of efficient two-qubit logic gates, despite its ease of implementation of one-qubit gates. Two-qubit gates necessarily need a nonlinear…

Quantum Physics · Physics 2007-05-23 Jonathan P. Dowling , James D. Franson , Hwang Lee , Gerald J. Milburn

A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…

Quantum Physics · Physics 2017-04-19 Johannes Borregaard , Anders S. Sørensen , Ignacio Cirac , Mikhail D. Lukin

Quantum computing has brought a paradigm change in computer science, where non-classical technologies have promised to outperform their classical counterpart. Such an advantage was only demonstrated for tasks without practical applications,…

Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…

Quantum Physics · Physics 2007-05-23 Rolando D. Somma

Quantum computers are expected to be able to solve mathematical problems that cannot be solved using conventional computers. Many of these problems are of practical importance, especially in the areas of cryptography and secure…

Quantum Physics · Physics 2007-05-23 T. B. Pittman , B. C. Jacobs , J. D. Franson

Aiming the construction of quantum computers and quantum communication systems based on optical devices, in this work we present possible implementations of quantum and classical CNOTs gates, as well an optical setup for generation and…

Quantum Physics · Physics 2007-05-23 Joao Batista Rosa Silva , Rubens Viana Ramos

Superconducting quantum circuits are 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…

Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed.…

Other Condensed Matter · Physics 2008-01-08 Almut Beige

Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…

The quantum computing paradigm in photonics currently relies on the multi-port interference in linear optical devices, which is intrinsically based on probabilistic measurements outcome and thus non-deterministic. Devising a fully…

Quantum Physics · Physics 2024-05-10 Francesco Scala , Davide Nigro , Dario Gerace

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding…

Quantum Physics · Physics 2023-05-23 Daan Camps , Lin Lin , Roel Van Beeumen , Chao Yang

Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations. Using the "Sender-Receiver" model, we propose quantum algorithms for matrix operations such as matrix-vector product,…

Quantum Physics · Physics 2024-03-11 Wentao Qi , Alexandr I. Zenchuk , Asutosh Kumar , Junde Wu

Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we…

Quantum Physics · Physics 2019-01-23 Jingwei Wen , Xiangyu Kong , Shijie Wei , Bixue Wang , Tao Xin , Guilu Long

Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…

Systems and Control · Electrical Eng. & Systems 2025-12-23 Jan Schneider , Julian Berberich

We report the first experimental demonstration of a quantum controlled-NOT gate for different photons, which is classically feed-forwardable. In the experiment, we achieved this goal with the use only of linear optics, an entangled…

Quantum Physics · Physics 2009-11-10 Sara Gasparoni , Jian-Wei Pan , Philip Walther , Terry Rudolph , Anton Zeilinger

Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…

Quantum Physics · Physics 2018-01-24 He-Liang Huang , Ashutosh K. Goswami , Wan-Su Bao , Prasanta K. Panigrahi

We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…

Quantum Physics · Physics 2019-03-15 Peng Qian , Wei-Cong Huang , Gui-Lu Long
‹ Prev 1 2 3 10 Next ›