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 Quantum Computing Concepts with Deutsch Jozsa Algorithm

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Poornima Aradyamath ◽  
Naghabhushana N M ◽  
Rohitha Ujjinimatad
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Quantum Computation ◽  
Mathematical Description ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Quantum Fourier Transform ◽  
Basic Concepts ◽  
Classical Computer

In this paper, we briefly review the basic concepts of quantum computation,  entanglement,  quantum cryptography and quantum fourier  transform.   Quantum algorithms like Deutsch Jozsa, Shor’s   factorization and Grover’s data search are developed using fourier  transform  and quantum computation concepts to build quantum computers.  Researchers are finding a way to build quantum computer that works more efficiently than classical computer.  Among the  standard well known  algorithms  in the field of quantum computation  and communication we  describe  mathematically Deutsch Jozsa algorithm  in detail for  2  and 3 qubits.  Calculation of balanced and unbalanced states is shown in the mathematical description of the algorithm.

scholarly journals Quantum Computing in the NISQ era and beyond

Quantum ◽  
2018 ◽  
Vol 2 ◽  
pp. 79 ◽  
Author(s):  
John Preskill
Keyword(s):  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
Quantum Circuits ◽  
Quantum Gates ◽  
Quantum Computers ◽  
Many Body ◽  
Significant Step ◽  
Near Future

Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.

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.

scholarly journals An Extensible Computing Platform for Heavy Quantum Simulation Workloads

2021 ◽  
Author(s):  
Andrés García ◽  
José Ranilla ◽  
Raul Alonso Alvarez ◽  
Luis Meijueiro
Keyword(s):  
Quantum Computing ◽  
High Performance ◽  
Quantum Computer ◽  
General Purpose ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Computing Platform ◽  
Current State ◽  
Classical Computing ◽  
Computing Simulation

The shortage of quantum computers, and their current state of development, constraints research in many fields that could benefit from quantum computing. Although the work of a quantum computer can be simulated with classical computing, personal computers take so long to run quantum experiments that they are not very useful for the progress of research. This manuscript presents an open quantum computing simulation platform that enables quantum computing researchers to have access to high performance simulations. This platform, called QUTE, relies on a supercomputer powerful enough to simulate general purpose quantum circuits of up to 38 qubits, and even more under particular simulations. This manuscript describes in-depth the characteristics of the QUTE platform and the results achieved in certain classical experiments in this field, which would give readers an accurate idea of the system capabilities.

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.

Efficient reversible quantum design of sig-magnitude to two's complement converters

2020 ◽  
Vol 20 (9&10) ◽  
pp. 747-765
Author(s):  
F. Orts ◽  
G. Ortega ◽  
E.M. E.M. Garzon
Keyword(s):  
Quantum Computing ◽  
Scientific Community ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
State Of The Art ◽  
The Other ◽  
Quantum Computers ◽  
Binary Number ◽  
Quantum Cost ◽  
The One

Despite the great interest that the scientific community has in quantum computing, the scarcity and high cost of resources prevent to advance in this field. Specifically, qubits are very expensive to build, causing the few available quantum computers are tremendously limited in their number of qubits and delaying their progress. This work presents new reversible circuits that optimize the necessary resources for the conversion of a sign binary number into two's complement of N digits. The benefits of our work are two: on the one hand, the proposed two's complement converters are fault tolerant circuits and also are more efficient in terms of resources (essentially, quantum cost, number of qubits, and T-count) than the described in the literature. On the other hand, valuable information about available converters and, what is more, quantum adders, is summarized in tables for interested researchers. The converters have been measured using robust metrics and have been compared with the state-of-the-art circuits. The code to build them in a real quantum computer is given.

scholarly journals Undecidable, Unrecognizable, and Quantum Computing

2020 ◽  
Vol 2 (3) ◽  
pp. 337-342
Author(s):  
Michael Siomau
Keyword(s):  
Quantum Computing ◽  
Turing Machine ◽  
Quantum Computer ◽  
Practical Realization ◽  
Real Numbers ◽  
Theoretical Limit ◽  
Halting Problem ◽  
The Real ◽  
Computing Model ◽  
Successful Design

Quantum computing allows us to solve some problems much faster than existing classical algorithms. Yet, the quantum computer has been believed to be no more powerful than the most general computing model—the Turing machine. Undecidable problems, such as the halting problem, and unrecognizable inputs, such as the real numbers, are beyond the theoretical limit of the Turing machine. I suggest a model for a quantum computer, which is less general than the Turing machine, but may solve the halting problem for any task programmable on it. Moreover, inputs unrecognizable by the Turing machine can be recognized by the model, thus breaking the theoretical limit for a computational task. A quantum computer is not just a successful design of the Turing machine as it is widely perceived now, but is a different, less general but more powerful model for computing, the practical realization of which may need different strategies than those in use now.

scholarly journals Elucidating reaction mechanisms on quantum computers

2017 ◽  
Vol 114 (29) ◽  
pp. 7555-7560 ◽  
Author(s):  
Markus Reiher ◽  
Nathan Wiebe ◽  
Krysta M. Svore ◽  
Dave Wecker ◽  
Matthias Troyer
Keyword(s):  
Reaction Mechanisms ◽  
Quantum Computer ◽  
Quantum Error Correction ◽  
Quantum Computers ◽  
Chemical Systems ◽  
Small Quantum ◽  
Quantum Technology ◽  
Classical Computer ◽  
Quantum Error ◽  
Biological Nitrogen

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.

scholarly journals Application of Quantum Computing to Biochemical Systems: A Look to the Future

2020 ◽  
Vol 8 ◽  
Author(s):  
Hai-Ping Cheng ◽  
Erik Deumens ◽  
James K. Freericks ◽  
Chenglong Li ◽  
Beverly A. Sanders
Keyword(s):  
Quantum Computing ◽  
Physical System ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Active Regions ◽  
Quantum Computers ◽  
The Future ◽  
Biochemical Systems ◽  
Near Term ◽  
Different Levels

Chemistry is considered as one of the more promising applications to science of near-term quantum computing. Recent work in transitioning classical algorithms to a quantum computer has led to great strides in improving quantum algorithms and illustrating their quantum advantage. Because of the limitations of near-term quantum computers, the most effective strategies split the work over classical and quantum computers. There is a proven set of methods in computational chemistry and materials physics that has used this same idea of splitting a complex physical system into parts that are treated at different levels of theory to obtain solutions for the complete physical system for which a brute force solution with a single method is not feasible. These methods are variously known as embedding, multi-scale, and fragment techniques and methods. We review these methods and then propose the embedding approach as a method for describing complex biochemical systems, with the parts not only treated with different levels of theory, but computed with hybrid classical and quantum algorithms. Such strategies are critical if one wants to expand the focus to biochemical molecules that contain active regions that cannot be properly explained with traditional algorithms on classical computers. While we do not solve this problem here, we provide an overview of where the field is going to enable such problems to be tackled in the future.

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.

Sign in / Sign up

Export Citation Format

Share Document