304 research outputs found
Quantum Algorithm Implementations for Beginners
As quantum computers become available to the general public, the need has
arisen to train a cohort of quantum programmers, many of whom have been
developing classical computer programs for most of their careers. While
currently available quantum computers have less than 100 qubits, quantum
computing hardware is widely expected to grow in terms of qubit count, quality,
and connectivity. This review aims to explain the principles of quantum
programming, which are quite different from classical programming, with
straightforward algebra that makes understanding of the underlying fascinating
quantum mechanical principles optional. We give an introduction to quantum
computing algorithms and their implementation on real quantum hardware. We
survey 20 different quantum algorithms, attempting to describe each in a
succinct and self-contained fashion. We show how these algorithms can be
implemented on IBM's quantum computer, and in each case, we discuss the results
of the implementation with respect to differences between the simulator and the
actual hardware runs. This article introduces computer scientists, physicists,
and engineers to quantum algorithms and provides a blueprint for their
implementations
Recommended from our members
Quantum Algorithms for Matrix Problems and Machine Learning
This dissertation presents a study of quantum algorithms for problems that can be posed as matrix function tasks. In Chapter 1 we demonstrate a simple unifying framework for implementing of smooth functions of matrices on a quantum computer. This framework captures a variety of problems that can be solved by evaluating properties of some function of a matrix, and we identify speedups over classical algorithms for some problem classes. The analysis combines ideas from the classical theory of function approximation with the quantum algorithmic primitive of implementing linear combinations of unitary operators.
In Chapter 2 we continue this study by looking at the role of sparsity of input matrices in constructing efficient quantum algorithms. We show that classically pre-processing an input matrix by spectral sparsification can be profitable for quantum Hamiltonian simulation algorithms, without compromising the simulation error or complexity. Such preprocessing incurs a one time cost linear in the size of the matrix, but can be exploited to exponentially speed up subsequent subroutines such as inversion.
In Chapter 3, we give an application of this theory of matrix functions to the problem of estimating the Renyi entropy of an unknown quantum state. We combine matrix function techniques with mixed state quantum computation in the one-clean qubit model, and are able to bound of the expected runtime of our algorithm in terms of the unknown target quantity.
In addition to the theme of analysing the complexity of our algorithms, we also identify instances that are of practical relevance, leading us to some problems of machine learning. In Chapter 4 we investigate kernel based learning methods using random features. We work
with the QRAM input model suitable for big data, and show how matrix functions and the quantum Fourier transform can be used to devise a quantum algorithm for sampling random features that are optimised for given input data and choice of kernel. We obtain a potential exponential speedup over the best known classical algorithm even without explicit assumptions of sparsity or low rank.
Finally in Chapter 5 we consider the technique of beamsearch decoding used in natural language processing. We work in the query model, and show how quantum search with advice can be used to construct a quantum search decoder that can find the optimal parse (which may for instance be a best translation, or text-to-speech transcript) at least quadratically faster than the best known classical algorithms, and obtain super-quadratic speedups in the expected runtime.Science and Engineering Research Board (Department of Science and Technology), Government of Indi
Development of Soft Sensor Model Using Moving Window Approach
Soft sensors are used broadly in the industries to predict the process variables which
are not measurable by sensors. The objective of this project is to develop a datadriven
soft sensor using Moving Window approach with the selective regression
techniques and to evaluate and validate the advantages and performances of Moving
Window approach over the traditional soft sensor models. Time invariant and
stationary process conditions are those assumptions made in developing soft sensors,
and these assumptions causes degradations and limitations to the soft sensors in
estimating process variables. Degradations of soft sensors are caused by process
shift, catalyst performance lost and et cetera. Besides that, the restrictions of sensors
in estimating difficult-to-measure variables and the delays during the laboratory tests
have becomeone of the factors in developing soft sensor. This paper presents a study
regarding the multivariate statistical process control techniques that can be used in
developing soft sensors such as Least Square Regression method, Partial Least
Square Regression method and Principle Component Analysis. The scope of study
for the project includes understanding the concept andwhat are the adaptive schemes
available to construct the soft sensors. Besides that further research on Moving
Window approach together with MSPC techniques will be carried out which can be
adapted into the adaptive models to develop the soft sensors. Systematic approach
will be presented through this project in using Moving Window approach to
construct the soft sensors and this includes an analysis of an appropriate case study
where the approach can be implemented.
Keywords: Multivariate Statistical Process Control techniques, Least Square
Regression method, Partial Least Square Regression method and Principle
Component Analysi
Quantum number preserving ansätze and error mitigation studies for the variational quantum eigensolver
Computational chemistry has advanced rapidly in the last decade on the back of the progress of increased performance in CPU and GPU based computation.
The prediction of reaction properties of varying chemical compounds in silico promises to speed up development in, e.g., new catalytic processes to reduce energy demand of varying known industrial used reactions.
Theoretical chemistry has found ways to approximate the complexity of the underlying intractable quantum many-body problem to various degrees to achieve chemically accurate ab initio calculations for various, experimentally verified systems. Still, in theory limited by fundamental complexity theorems accurate and reliable predictions for large and/or highly correlated systems elude computational chemists today. As solving the Schrödinger equation is one of the main use cases of quantum computation, as originally envisioned by Feynman himself, computational chemistry has emerged as one of the applications of quantum computers in industry, originally motivated by potential exponential improvements in quantum phase estimation over classical counterparts.
As of today, most rigorous speed ups found in quantum algorithms are only applicable for so called error-corrected quantum computers, which are not limited by local qubit decoherence in the length of the algorithms possible. Over the last decade, the size of available quantum computing hardware has steadily increased and first proof of concepts of error-correction codes have been achieved in the last year, reducing error rates below the individual error rates of qubits comprising the code. Still, fully error-corrected quantum computers in sizes that overcome the constant factor in speed up separating classical and quantum algorithms in increasing system size are a decade or more away. Meanwhile, considerable efforts have been made to find potential quantum speed ups of non-error corrected quantum systems for various applications in the noisy intermediate-scale quantum (NISQ) era. In chemistry, the variational quantum eigensolver (VQE), a family of classical-quantum hybrid algorithms, has become a topic of interest as a way of potentially solving computational chemistry problems on current quantum hardware.
The main contributions of this work are: extending the VQE framework with two new potential ansätze, (1) a maximally dense first-order trotterized ansatz for the paired approximation of the electronic structure Hamiltonian, (2) a gate fabric with many favourable properties like conserving relevant quantum numbers, locality of individual operations and potential initialisation strategies mitigating plateaus of vanishing gradient during optimisation. (3) Contributions to one of largest and most complex VQE to date, including the aforementioned ansatz in paired approximation, benchmarking different error-mitigation techniques to achieve accurate results, extrapolating performance to give perspective on what is needed for NISQ devices having potential in competing with classical algorithms and (4) Simulations to find optimal ways of measuring Hamiltonians in this error-mitigated framework. (5) Furthermore a simulation of different purification error mitigation techniques and their combination under different noise models and a way of efficiently calibrating for coherent noise for one of them is part of this manuscript. We discuss the state of VQE after almost a decade after its introduction and give an outlook on computational chemistry on quantum computers in the near future
Intelligent Circuits and Systems
ICICS-2020 is the third conference initiated by the School of Electronics and Electrical Engineering at Lovely Professional University that explored recent innovations of researchers working for the development of smart and green technologies in the fields of Energy, Electronics, Communications, Computers, and Control. ICICS provides innovators to identify new opportunities for the social and economic benefits of society.  This conference bridges the gap between academics and R&D institutions, social visionaries, and experts from all strata of society to present their ongoing research activities and foster research relations between them. It provides opportunities for the exchange of new ideas, applications, and experiences in the field of smart technologies and finding global partners for future collaboration. The ICICS-2020 was conducted in two broad categories, Intelligent Circuits & Intelligent Systems and Emerging Technologies in Electrical Engineering
Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
Quantum computers offer an intriguing path for a paradigmatic change of
computing in the natural sciences and beyond, with the potential for achieving
a so-called quantum advantage, namely a significant (in some cases exponential)
speed-up of numerical simulations. The rapid development of hardware devices
with various realizations of qubits enables the execution of small scale but
representative applications on quantum computers. In particular, the
high-energy physics community plays a pivotal role in accessing the power of
quantum computing, since the field is a driving source for challenging
computational problems. This concerns, on the theoretical side, the exploration
of models which are very hard or even impossible to address with classical
techniques and, on the experimental side, the enormous data challenge of newly
emerging experiments, such as the upgrade of the Large Hadron Collider. In this
roadmap paper, led by CERN, DESY and IBM, we provide the status of high-energy
physics quantum computations and give examples for theoretical and experimental
target benchmark applications, which can be addressed in the near future.
Having the IBM 100 x 100 challenge in mind, where possible, we also provide
resource estimates for the examples given using error mitigated quantum
computing
- …