Quantum algorithm design using dynamic learning

2008 ◽  
Vol 8 (1&2) ◽  
pp. 12-29
Author(s):  
E.C. Behrman ◽  
J.E. Steck ◽  
P. Kumar ◽  
K.A. Walsh
Keyword(s):  
Quantum Interference ◽  
Quantum Computer ◽  
Learning Algorithm ◽  
Algorithm Design ◽  
Quantum Algorithm ◽  
Initial Time ◽  
Dynamic Learning ◽  
Final Time ◽  
Quantum Neural Network ◽  
Qubit System

We present a dynamic learning paradigm for ``programming'' a general quantum computer. A learning algorithm is used to find the control parameters for a coupled qubit system, such that the system at an initial time evolves to a state in which a given measurement corresponds to the desired operation. This can be thought of as a quantum neural network. We first apply the method to a system of two coupled superconducting quantum interference devices (SQUIDs), and demonstrate learning of both the classical gates XOR and XNOR. Training of the phase produces a gate similar to the CNOT. Striking out for somewhat more interesting territory, we attempt learning of an entanglement witness for a two qubit system. Simulation shows a reasonably successful mapping of the entanglement at the initial time onto the correlation function at the final time for both pure and mixed states. For pure states this mapping requires knowledge of the phase relation between the two parts; however, given that knowledge, this method can be used to measure the entanglement of an otherwise unknown state. The method is easily extended to multiple qubits or to quNits.

scholarly journals Experimental pairwise entanglement estimation for an N-qubit system

2019 ◽  
Author(s):  
Elizabeth Behrman ◽  
Nathan Thompson ◽  
Nam Nguyen ◽  
James Steck
Keyword(s):  
Large Scale ◽  
Quantum Computer ◽  
Algorithm Design ◽  
Machine Learning Techniques ◽  
Quantum Computers ◽  
Entanglement Witness ◽  
Physical Computation ◽  
Learning Techniques ◽  
Qubit System ◽  
Computer Simulators

Designing and implementing algorithms for medium and large scale quantum computers is not easy. In previous work we have suggested, and developed, the idea of using machine learning techniques to train a quantum system such that the desired process is ``learned,'' thus obviating the algorithm design difficulty. This works quite well for small systems. But the goal is macroscopic physical computation. Here, we implement our learned pairwise entanglement witness on Microsoft's Q\#, one of the commercially available gate model quantum computer simulators; we perform statistical analysis to determine reliability and reproducibility; and we show that after training the system in stages for an incrementing number of qubits (2, 3, 4, \ldots) we can infer the pattern for mesoscopic $N$ from simulation results for three-, four-, five-, six-, and seven-qubit systems. Our results suggest a fruitful pathway for general quantum computer algorithm design and for practical computation on noisy intermediate scale quantum devices.

scholarly journals Experimental pairwise entanglement estimation for an N-qubit system

2019 ◽  
Author(s):  
Elizabeth Behrman ◽  
Nathan Thompson ◽  
Nam Nguyen ◽  
James Steck
Keyword(s):  
Large Scale ◽  
Quantum Computer ◽  
Algorithm Design ◽  
Machine Learning Techniques ◽  
Quantum Computers ◽  
Entanglement Witness ◽  
Physical Computation ◽  
Learning Techniques ◽  
Qubit System ◽  
Computer Simulators

Designing and implementing algorithms for medium and large scale quantum computers is not easy. In previous work we have suggested, and developed, the idea of using machine learning techniques to train a quantum system such that the desired process is ``learned,'' thus obviating the algorithm design difficulty. This works quite well for small systems. But the goal is macroscopic physical computation. Here, we implement our learned pairwise entanglement witness on Microsoft's Q\#, one of the commercially available gate model quantum computer simulators; we perform statistical analysis to determine reliability and reproducibility; and we show that after training the system in stages for an incrementing number of qubits (2, 3, 4, \ldots) we can infer the pattern for mesoscopic $N$ from simulation results for three-, four-, five-, six-, and seven-qubit systems. Our results suggest a fruitful pathway for general quantum computer algorithm design and for practical computation on noisy intermediate scale quantum devices.

scholarly journals A quantum machine learning algorithm based on generative models

2018 ◽  
Vol 4 (12) ◽  
pp. eaat9004 ◽  
Author(s):  
X. Gao ◽  
Z.-Y. Zhang ◽  
L.-M. Duan
Keyword(s):  
Artificial Intelligence ◽  
Machine Learning ◽  
Quantum Computer ◽  
Learning Algorithm ◽  
Probability Distributions ◽  
Quantum Algorithm ◽  
Generative Models ◽  
Proposed Model ◽  
Quantum Machine Learning ◽  
Future Technologies

Quantum computing and artificial intelligence, combined together, may revolutionize future technologies. A significant school of thought regarding artificial intelligence is based on generative models. Here, we propose a general quantum algorithm for machine learning based on a quantum generative model. We prove that our proposed model is more capable of representing probability distributions compared with classical generative models and has exponential speedup in learning and inference at least for some instances if a quantum computer cannot be efficiently simulated classically. Our result opens a new direction for quantum machine learning and offers a remarkable example where a quantum algorithm shows exponential improvement over classical algorithms in an important application field.

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 Practical Quantum Computing

2021 ◽  
Vol 2 (1) ◽  
pp. 1-35
Author(s):  
Adrien Suau ◽  
Gabriel Staffelbach ◽  
Henri Calandra
Keyword(s):  
Wave Equation ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Quantum Algorithm ◽  
Quantum Circuit ◽  
Equation Solving ◽  
Small Quantum ◽  
Quantum Wave ◽  
Variational Algorithms ◽  
The One

In the last few years, several quantum algorithms that try to address the problem of partial differential equation solving have been devised: on the one hand, “direct” quantum algorithms that aim at encoding the solution of the PDE by executing one large quantum circuit; on the other hand, variational algorithms that approximate the solution of the PDE by executing several small quantum circuits and making profit of classical optimisers. In this work, we propose an experimental study of the costs (in terms of gate number and execution time on a idealised hardware created from realistic gate data) associated with one of the “direct” quantum algorithm: the wave equation solver devised in [32]. We show that our implementation of the quantum wave equation solver agrees with the theoretical big-O complexity of the algorithm. We also explain in great detail the implementation steps and discuss some possibilities of improvements. Finally, our implementation proves experimentally that some PDE can be solved on a quantum computer, even if the direct quantum algorithm chosen will require error-corrected quantum chips, which are not believed to be available in the short-term.

Quantum algorithm for measuring the energy of n qubits with unknown pair-interactions

2002 ◽  
Vol 2 (3) ◽  
pp. 198-207
Author(s):  
D. Janzing
Keyword(s):  
Quantum State ◽  
Quantum Computer ◽  
Quantum Algorithm ◽  
Pair Interaction ◽  
Phase Estimation ◽  
Solid States ◽  
Energy Gaps ◽  
Large N ◽  
Conditional Transformation ◽  
Essential Assumption

The well-known algorithm for quantum phase estimation requires that the considered unitary is available as a conditional transformation depending on the quantum state of an ancilla register. We present an algorithm converting an unknown n-qubit pair-interaction Hamiltonian into a conditional one such that standard phase estimation can be applied to measure the energy. Our essential assumption is that the considered system can be brought into interaction with a quantum computer. For large n the algorithm could still be applicable for estimating the density of energy states and might therefore be useful for finding energy gaps in solid states.

A survey on prediction of diabetes using classification algorithms

2021 ◽  
Vol 2 (104) ◽  
pp. 77-84
Author(s):  
A. Khanwalkar ◽  
R. Soni
Keyword(s):  
Machine Learning ◽  
Data Collection ◽  
Learning Algorithm ◽  
Algorithm Design ◽  
Machine Learning Algorithms ◽  
Classification Algorithms ◽  
Machine Learning Algorithm ◽  
Collection Method ◽  
Data Collection Method ◽  
Diagnostic Center

Purpose: Diabetes is a chronic disease that pays for a large proportion of the nation's healthcare expenses when people with diabetes want medical care continuously. Several complications will occur if the polymer disorder is not treated and unrecognizable. The prescribed condition leads to a diagnostic center and a doctor's intention. One of the real-world subjects essential is to find the first phase of the polytechnic. In this work, basically a survey that has been analyzed in several parameters within the poly-infected disorder diagnosis. It resembles the classification algorithms of data collection that plays an important role in the data collection method. Automation of polygenic disorder analysis, as well as another machine learning algorithm. Design/methodology/approach: This paper provides extensive surveys of different analogies which have been used for the analysis of medical data, For the purpose of early detection of polygenic disorder. This paper takes into consideration methods such as J48, CART, SVMs and KNN square, this paper also conducts a formal surveying of all the studies, and provides a conclusion at the end. Findings: This surveying has been analyzed on several parameters within the poly-infected disorder diagnosis. It resembles that the classification algorithms of data collection plays an important role in the data collection method in Automation of polygenic disorder analysis, as well as another machine learning algorithm. Practical implications: This paper will help future researchers in the field of Healthcare, specifically in the domain of diabetes, to understand differences between classification algorithms. Originality/value: This paper will help in comparing machine learning algorithms by going through results and selecting the appropriate approach based on requirements.

TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT

2007 ◽  
Vol 05 (01n02) ◽  
pp. 223-228 ◽  
Author(s):  
ANNALISA MARZUOLI ◽  
MARIO RASETTI
Keyword(s):  
Field Theory ◽  
Quantum Field Theory ◽  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Algorithm ◽  
Topological Quantum Field Theory ◽  
Quantum Field ◽  
Topological Quantum

We resort to considerations based on topological quantum field theory to outline the development of a possible quantum algorithm for the evaluation of the permanent of a 0 - 1 matrix. Such an algorithm might represent a breakthrough for quantum computation, since computing the permanent is considered a "universal problem", namely, one among the hardest problems that a quantum computer can efficiently handle.

Sign in / Sign up

Export Citation Format

Share Document