An Automatic Approach for Combinational Problems on a Hybrid Quantum Architecture

SPIN ◽  
2021 ◽  
Author(s):  
Guoqiang Shu ◽  
Junchao Wang ◽  
Zheng Shan ◽  
Fudong Liu ◽  
Zhongyun Liu ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Quantum Physics ◽  
Optimization Problem ◽  
Integer Factorization ◽  
Professional Background ◽  
Computing Device ◽  
Quantum Architecture ◽  
Classical Computing ◽  
Approximation Optimization ◽  
Quantum Framework

Quantum computing has shown great potential and advantages in solving integer factorization and disordered database search. However, it is not easy to solve specific problems with quantum computing device efficiently and widely, because a lot of professional background knowledge is required. In order to solve this problem, we propose an optimization problem’s automatic hybird quantum framework (OpAQ) for solving user-specified problems on a hybrid computing architecture including both quantum and classical computing resources. Such a solver can allow nonprofessionals who are not familiar with quantum physics and quantum computing to use quantum computing device to solve some classically difficult problems easily. Combinatorial optimization problem is one of the most important problems in both academic and industry. In this paper, we mainly focus on these problems and solve them with OpAQ, which is based on quantum approximation optimization algorithm (QAOA). We evaluate the performance of our approach in solving Graph Coloring, Max-cut, Traveling Salesman and Knapsack Problem. The experimental results show that quantum solver can achieve almost the same optimal solutions with the classical.

scholarly journals Past, Present and Future of Quantum Computing: A Systematic Study

2021 ◽  
pp. 351-363
Author(s):  
Palash Dutta Banik ◽  
Asoke Nath
Keyword(s):  
Quantum Computing ◽  
Low Temperature ◽  
Systematic Study ◽  
Quantum Physics ◽  
Quantum Computer ◽  
Quantum Computers ◽  
Huge Number ◽  
Classical Computing ◽  
Probabilistic Nature ◽  
Near Future

Quantum Computing is relatively new and it's kind of a special type of computing that uses the laws of quantum physics. In classical computing, we have some limitations and we can overcome those with the help of Quantum Computing as it uses qubits, but we need to keep those qubits at low temperature. Quantum Computing uses the probabilistic nature of electrons. The power of a quantum computer increases exponentially with the number of qubits linked tougher. Quantum computers are very difficult to make but there are a huge number of calculations that can be done easily with the use of a quantum computer. Quantum computers are way better and faster than classical computers. So, we can say that quantum computers rather than quantum computing will be used in the near future to replace classical computing.

The Essence of Quantum Computing

2018 ◽  
Author(s):  
Rajendra K. Bera
Keyword(s):  
Hilbert Space ◽  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Turing Machines ◽  
Classical Physics ◽  
Core Set ◽  
The World ◽  
Subordinate Role

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.

The Realization of New Computing Model and System Research Related to Quantum Computer

2014 ◽  
Vol 1078 ◽  
pp. 413-416
Author(s):  
Hai Yan Liu
Keyword(s):  
Quantum Computing ◽  
High Performance ◽  
Quantum Physics ◽  
Quantum Computer ◽  
Quantum Computers ◽  
Information Coding ◽  
Computing Model ◽  
Mechanics Model ◽  
Electronic Spin ◽  
Classical Computer

The ultimate goal of quantum calculation is to build high performance practical quantum computers. With quantum mechanics model of computer information coding and computational principle, it is proved in theory to be able to simulate the classical computer is currently completely, and with more classical computer, quantum computation is one of the most popular fields in physics research in recent ten years, has formed a set of quantum physics, mathematics. This paper to electronic spin doped fullerene quantum aided calculation scheme, we through the comprehensive use of logic based network and based on the overall control of the two kinds of quantum computing model, solve the addressing problem of nuclear spin, avoids the technical difficulties of pre-existing. We expect the final realization of the quantum computer will depend on the integrated use of in a variety of quantum computing model and physical realization system, and our primary work shows this feature..

scholarly journals Benchmarking an 11-qubit quantum computer

2019 ◽  
Vol 10 (1) ◽  
Author(s):  
K. Wright ◽  
K. M. Beck ◽  
S. Debnath ◽  
J. M. Amini ◽  
Y. Nam ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Computer ◽  
Success Rates ◽  
Single Qubit ◽  
The Past ◽  
Large Numbers ◽  
Universal Quantum ◽  
Qubit Gate ◽  
Fully Connected

AbstractThe field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large numbers, searching databases, simulating intractable models from quantum physics, and optimizing complex cost functions. Here, we present an 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 171Yb+ ions. We demonstrate average single-qubit gate fidelities of 99.5$$\%$$%, average two-qubit-gate fidelities of 97.5$$\%$$%, and SPAM errors of 0.7$$\%$$%. To illustrate the capabilities of this universal platform and provide a basis for comparison with similarly-sized devices, we compile the Bernstein-Vazirani and Hidden Shift algorithms into our native gates and execute them on the hardware with average success rates of 78$$\%$$% and 35$$\%$$%, respectively. These algorithms serve as excellent benchmarks for any type of quantum hardware, and show that our system outperforms all other currently available hardware.

scholarly journals Machine Learning: A Quantum Perspective

2021 ◽  
Author(s):  
Aishwarya Jhanwar ◽  
Manisha J. Nene
Keyword(s):  
Machine Learning ◽  
Quantum Mechanics ◽  
Quantum Computing ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Quantum Computers ◽  
Learning Tasks ◽  
Current Scenario ◽  
Chip Fabrication ◽  
Classical Computing

Recently, increased availability of the data has led to advances in the field of machine learning. Despite of the growth in the domain of machine learning, the proximity to the physical limits of chip fabrication in classical computing is motivating researchers to explore the properties of quantum computing. Since quantum computers leverages the properties of quantum mechanics, it carries the ability to surpass classical computers in machine learning tasks. The study in this paper contributes in enabling researchers to understand how quantum computers can bring a paradigm shift in the field of machine learning. This paper addresses the concepts of quantum computing which influences machine learning in a quantum world. It also states the speedup observed in different machine learning algorithms when executed on quantum computers. The paper towards the end advocates the use of quantum application software and throw light on the existing challenges faced by quantum computers in the current scenario.

scholarly journals Era of Quantum Computing- An Intelligent and Evaluation based on Quantum Computers

2019 ◽  
Vol 8 (3S) ◽  
pp. 615-619
Keyword(s):  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Computers ◽  
Newtonian Mechanics ◽  
Short Span ◽  
Area Unit ◽  
Enormous Quantity ◽  
Game Changer ◽  
The Way

In today's world, the necessity for prime speed computing is extremely high that the classic computers area unit undoubtedly not sufficient. Because of the limitation of Newtonian mechanics, quantum technicalities are taking the position of game-changer in competition of calculation. Quantum computing is the study of quantum pc that works underneath the laws of quantum physics like tunneling, annealing, web, and superposition to complete tasks that take an enormous quantity of your time. During this paper we'll concisely see however quantum computers work and the way it will be employed in decrypting personal keys that the classic computers cannot reach during a short span of your time. One in all the most blessings of victimization quantum computers area unit that the work with efficiency and area unit 1000X times quicker than our classic computers.

Quantum Lattice Boltzmann (QLB)

2018 ◽  
Author(s):  
Sauro Succi
Keyword(s):  
Quantum Mechanics ◽  
Quantum Computing ◽  
Lattice Boltzmann ◽  
Quantum Physics ◽  
Newtonian Mechanics ◽  
Quantum Lattice ◽  
Recent Developments

The Lattice Boltzmann concepts and applications described so far refer to classical, i.e., non-quantum physics. However, the LB formalism is not restricted to classical Newtonian mechanics and indeed an LB formulation of quantum mechanics, going by the name of quantum LB (QLB) has been in existence for more than two decades. Even though it would far-fetched to say that QLB represents a mainstream, in the recent years it has captured some revived interest, mostly on account of recent developments in quantum-computing research. This chapter provides an account of the QLB formulation: stay tuned, LBE goes quantum!

Quantum Physics Takes Free Will into Account

2017 ◽  
Author(s):  
Ignacio Cirac ◽  
Adolfo Plasencia
Keyword(s):  
Quantum Theory ◽  
Free Will ◽  
Quantum Physics ◽  
Quantum Computer ◽  
Theoretical Description ◽  
Trapped Ions ◽  
Theory Of Relativity ◽  
Max Planck ◽  
Quantum Architecture ◽  
To Come

In this dialogue, the physicist Ignacio Cirac, director of the Theoretical Division of the Max Planck Institute for Quantum Optics, outlines why quantum physics has brought about a much greater change than that caused by Einstein’s theory of relativity, how quantum physics takes free will into account and how it combines with philosophy. He describes why quantum theory defines “everything else,” yet is unable to define itself. Explaining how, together with Peter Zoller, he developed and presented the first theoretical description of a quantum computing architecture based on trapped ions, and, how this quantum architecture will be viable and capable of performing calculations we cannot perform at present. Their quantum computer calculates in qubits, which would require at least 100,000 qubits to function, rising to 1,000,000 if error correction is implemented. It will be able to perform calculations previously unachievable and create encrypted messages impossible to decipher. Building a functional quantum computer still requires a huge technological change, which has yet to come about. Lastly, Cirac explains the differences between European and American visions of science and why mathematicians are even more conservative than physicists.

Qubits and the Framework of Quantum Mechanics

2006 ◽  
Author(s):  
Phillip Kaye ◽  
Raymond Laflamme ◽  
Michele Mosca
Keyword(s):  
Hilbert Space ◽  
Quantum Mechanics ◽  
Quantum Computing ◽  
Quantum Information ◽  
State Space ◽  
Quantum Physics ◽  
Complex Hilbert Space ◽  
The State ◽  
Mathematical Framework ◽  
Infinite Dimensional

In this section we introduce the framework of quantum mechanics as it pertains to the types of systems we will consider for quantum computing. Here we also introduce the notion of a quantum bit or ‘qubit’, which is a fundamental concept for quantum computing. At the beginning of the twentieth century, it was believed by most that the laws of Newton and Maxwell were the correct laws of physics. By the 1930s, however, it had become apparent that these classical theories faced serious problems in trying to account for the observed results of certain experiments. As a result, a new mathematical framework for physics called quantum mechanics was formulated, and new theories of physics called quantum physics were developed in this framework. Quantum physics includes the physical theories of quantum electrodynamics and quantum field theory, but we do not need to know these physical theories in order to learn about quantum information. Quantum information is the result of reformulating information theory in this quantum framework. We saw in Section 1.6 an example of a two-state quantum system: a photon that is constrained to follow one of two distinguishable paths. We identified the two distinguishable paths with the 2-dimensional basis vectors and then noted that a general ‘path state’ of the photon can be described by a complex vector with |α0|2 +|α1|2 = 1. This simple example captures the essence of the first postulate, which tells us how physical states are represented in quantum mechanics. Depending on the degree of freedom (i.e. the type of state) of the system being considered, H may be infinite-dimensional. For example, if the state refers to the position of a particle that is free to occupy any point in some region of space, the associated Hilbert space is usually taken to be a continuous (and thus infinite-dimensional) space. It is worth noting that in practice, with finite resources, we cannot distinguish a continuous state space from one with a discrete state space having a sufficiently small minimum spacing between adjacent locations. For describing realistic models of quantum computation, we will typically only be interested in degrees of freedom for which the state is described by a vector in a finite-dimensional (complex) Hilbert space.

Sign in / Sign up

Export Citation Format

Share Document