Quantum Computer Systems: Research for Noisy Intermediate-Scale Quantum Computers

2020 ◽  
Vol 15 (2) ◽  
pp. 1-227 ◽  
Author(s):  
Yongshan Ding ◽  
Frederic T. Chong
Keyword(s):  
Quantum Computer ◽  
Computer Systems ◽  
Quantum Computers ◽  
Intermediate Scale ◽  
Systems Research

scholarly journals Decoherence dynamics estimation for superconducting gate-model quantum computers

2020 ◽  
Vol 19 (10) ◽  
Author(s):  
Laszlo Gyongyosi
Keyword(s):  
Gaussian Noise ◽  
Quantum Computer ◽  
Computer Architectures ◽  
Quantum Circuits ◽  
Optimal Placement ◽  
Quantum Computers ◽  
Intermediate Scale ◽  
Layout Generation ◽  
Quantum Technology ◽  
Physical Layout

Abstract Superconducting gate-model quantum computer architectures provide an implementable model for practical quantum computations in the NISQ (noisy intermediate scale quantum) technology era. Due to hardware restrictions and decoherence, generating the physical layout of the quantum circuits of a gate-model quantum computer is a challenge. Here, we define a method for layout generation with a decoherence dynamics estimation in superconducting gate-model quantum computers. We propose an algorithm for the optimal placement of the quantum computational blocks of gate-model quantum circuits. We study the effects of capacitance interference on the distribution of the Gaussian noise in the Josephson energy.

scholarly journals Optimization of VQE-UCC Algorithm Based on Spin State Symmetry

2021 ◽  
Vol 9 ◽  
Author(s):  
Qing Guo ◽  
Ping-Xing Chen
Keyword(s):  
Energy Spectrum ◽  
Ground State ◽  
Quantum Chemical ◽  
Quantum Computer ◽  
Energy Spectra ◽  
Quantum Computers ◽  
Accurate Calculation ◽  
Excite State ◽  
Intermediate Scale ◽  
Applied Fields

The accurate calculation of molecular energy spectra, a very complicated work, is of importance in many applied fields. Relying on the VQE-UCC algorithm, it is very possible to calculate the molecular energy spectrum on a noisy intermediate scale quantum computer. However, due to the limitation of the number of qubits and coherent time in quantum computers, the complexity of VQE-UCC algorithm still needs to be reduced in the simulation of macromolecules. We develop a new VQE-UCC method to calculate the ground state of the molecule according to the symmetry of the system, the complexity of which is reduced. Using this method we get the ground and excite state of four kinds of molecules. The method and the results are of great significance for the promotion of quantum chemical simulations.

Replication of Quantum Computing towards an Unconventional Environment using QuIDE

2019 ◽  
Vol 8 (4) ◽  
pp. 9461-9464
Keyword(s):  
Quantum Computer ◽  
Source Code ◽  
Circuit Diagram ◽  
Quantum Computers ◽  
Coordinated Development ◽  
Development Environment ◽  
Integrated Development ◽  
Complexity Of Algorithms ◽  
Performance Results ◽  
Exponential Complexity

Current quantum computer simulation strategies are inefficient in simulation and their realizations are also failed to minimize those impacts of the exponential complexity for simulated quantum computations. We proposed a Quantum computer simulator model in this paper which is a coordinated Development Environment – QuIDE (Quantum Integrated Development Environment) to support the improvement of algorithm for future quantum computers. The development environment provides the circuit diagram of graphical building and flexibility of source code. Analyze the complexity of algorithms shows the performance results of the simulator and used for simulation as well as result of its deployment during simulation

scholarly journals Asset–liability modelling in the quantum era

2021 ◽  
Vol 26 ◽  
Author(s):  
T. Berry ◽  
J. Sharpe
Keyword(s):  
Quantum Mechanics ◽  
Quantum Computer ◽  
Quantum Algorithm ◽  
Capital Requirements ◽  
Quantum Computers ◽  
Investment Management ◽  
Asset Liability Management ◽  
Liability Management ◽  
Insight Into ◽  
Current Practices

Abstract This paper introduces and demonstrates the use of quantum computers for asset–liability management (ALM). A summary of historical and current practices in ALM used by actuaries is given showing how the challenges have previously been met. We give an insight into what ALM may be like in the immediate future demonstrating how quantum computers can be used for ALM. A quantum algorithm for optimising ALM calculations is presented and tested using a quantum computer. We conclude that the discovery of the strange world of quantum mechanics has the potential to create investment management efficiencies. This in turn may lead to lower capital requirements for shareholders and lower premiums and higher insured retirement incomes for policyholders.

scholarly journals Comparison of quantum-walk implementations on noisy intermediate-scale quantum computers

2021 ◽  
Vol 103 (2) ◽  
Author(s):  
Konstantinos Georgopoulos ◽  
Clive Emary ◽  
Paolo Zuliani
Keyword(s):  
Quantum Walk ◽  
Quantum Computers ◽  
Intermediate Scale

scholarly journals Demonstrating the power of quantum computers, certification of highly entangled measurements and scalable quantum nonlocality

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Elisa Bäumer ◽  
Nicolas Gisin ◽  
Armin Tavakoli
Keyword(s):  
Quantum Computer ◽  
Outcome Measurement ◽  
Bell State ◽  
Bell Inequalities ◽  
Quantum Correlations ◽  
Entanglement Swapping ◽  
Quantum Nonlocality ◽  
Quantum Computers ◽  
Classical Models ◽  
Quantum Phenomena

AbstractIncreasingly sophisticated quantum computers motivate the exploration of their abilities in certifying genuine quantum phenomena. Here, we demonstrate the power of state-of-the-art IBM quantum computers in correlation experiments inspired by quantum networks. Our experiments feature up to 12 qubits and require the implementation of paradigmatic Bell-State Measurements for scalable entanglement-swapping. First, we demonstrate quantum correlations that defy classical models in up to nine-qubit systems while only assuming that the quantum computer operates on qubits. Harvesting these quantum advantages, we are able to certify 82 basis elements as entangled in a 512-outcome measurement. Then, we relax the qubit assumption and consider quantum nonlocality in a scenario with multiple independent entangled states arranged in a star configuration. We report quantum violations of source-independent Bell inequalities for up to ten qubits. Our results demonstrate the ability of quantum computers to outperform classical limitations and certify scalable entangled measurements.

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.

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 Circuits for Dynamic Runtime Assertions in Quantum Computation

2019 ◽  
Author(s):  
Ji Liu ◽  
Greg Byrd ◽  
Huiyang Zhou
Keyword(s):  
Open Source ◽  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Circuits ◽  
Intermediate Scale

In this paper, we propose quantum circuits to enable dynamic assertions for classical values, entanglement, and superposition. This enables a dynamic debugging primitive, driven by a programmer’s understanding of the correct behavior of the quantum program. We show that besides generating assertion errors, the assertion logic may also force the qubits under test to be into the desired state. Besides debugging, our proposed assertion logic can also be used in noisy intermediate scale quantum (NISQ) systems to filter out erroneous results, as demonstrated on a 20-qubit IBM Q quantum computer. Our proposed assertion circuits have been implemented as functions in the open-source Qiskit tool.

Sign in / Sign up

Export Citation Format

Share Document