On the Principles of Differentiable Quantum Programming Languages
- URL: http://arxiv.org/abs/2004.01122v1
- Date: Thu, 2 Apr 2020 16:46:13 GMT
- Title: On the Principles of Differentiable Quantum Programming Languages
- Authors: Shaopeng Zhu, Shih-Han Hung, Shouvanik Chakrabarti, and Xiaodi Wu
- Abstract summary: Variational Quantum Circuits (VQCs) are predicted to be one of the most important near-term quantum applications.
We propose the first formalization of auto-differentiation techniques for quantum circuits.
- Score: 13.070557640180004
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Variational Quantum Circuits (VQCs), or the so-called quantum
neural-networks, are predicted to be one of the most important near-term
quantum applications, not only because of their similar promises as classical
neural-networks, but also because of their feasibility on near-term noisy
intermediate-size quantum (NISQ) machines. The need for gradient information in
the training procedure of VQC applications has stimulated the development of
auto-differentiation techniques for quantum circuits. We propose the first
formalization of this technique, not only in the context of quantum circuits
but also for imperative quantum programs (e.g., with controls), inspired by the
success of differentiable programming languages in classical machine learning.
In particular, we overcome a few unique difficulties caused by exotic quantum
features (such as quantum no-cloning) and provide a rigorous formulation of
differentiation applied to bounded-loop imperative quantum programs, its
code-transformation rules, as well as a sound logic to reason about their
correctness. Moreover, we have implemented our code transformation in OCaml and
demonstrated the resource-efficiency of our scheme both analytically and
empirically. We also conduct a case study of training a VQC instance with
controls, which shows the advantage of our scheme over existing
auto-differentiation for quantum circuits without controls.
Related papers
- A Case for Synthesis of Recursive Quantum Unitary Programs [9.287571320531457]
Quantum programs are notoriously difficult to code and verify due to unintuitive quantum knowledge associated with quantum programming.
We present Q Synth, the first quantum program synthesis framework, including a new inductive quantum programming language.
Q Synth successfully synthesizes ten quantum unitary programs including quantum adder circuits, quantum eigenvalue inversion circuits and Quantum Fourier Transformation.
arXiv Detail & Related papers (2023-11-20T03:01:36Z) - Expressive Quantum Supervised Machine Learning using Kerr-nonlinear
Parametric Oscillators [0.0]
Quantum machine learning with variational quantum algorithms (VQA) has been actively investigated as a practical algorithm in the noisy intermediate-scale quantum (NISQ) era.
Recent researches reveal that the data reuploading, which repeatedly encode classical data into quantum circuit, is necessary for obtaining the expressive quantum machine learning model.
We propose quantum machine learning with Kerrnon Parametric Hilberts (KPOs) as another promising quantum computing device.
arXiv Detail & Related papers (2023-05-01T07:01:45Z) - Quantum Imitation Learning [74.15588381240795]
We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL.
We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL)
Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
arXiv Detail & Related papers (2023-04-04T12:47:35Z) - TeD-Q: a tensor network enhanced distributed hybrid quantum machine
learning framework [59.07246314484875]
TeD-Q is an open-source software framework for quantum machine learning.
It seamlessly integrates classical machine learning libraries with quantum simulators.
It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
arXiv Detail & Related papers (2023-01-13T09:35:05Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - Recent Advances for Quantum Neural Networks in Generative Learning [98.88205308106778]
Quantum generative learning models (QGLMs) may surpass their classical counterparts.
We review the current progress of QGLMs from the perspective of machine learning.
We discuss the potential applications of QGLMs in both conventional machine learning tasks and quantum physics.
arXiv Detail & Related papers (2022-06-07T07:32:57Z) - An Introduction to Quantum Machine Learning for Engineers [36.18344598412261]
Quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers.
This book provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra.
arXiv Detail & Related papers (2022-05-11T12:10:52Z) - Fundamental limitations on optimization in variational quantum
algorithms [7.165356904023871]
A leading paradigm to establish such near-term quantum applications is variational quantum algorithms (VQAs)
We prove that for a broad class of such random circuits, the variation range of the cost function vanishes exponentially in the number of qubits with a high probability.
This result can unify the restrictions on gradient-based and gradient-free optimizations in a natural manner and reveal extra harsh constraints on the training landscapes of VQAs.
arXiv Detail & Related papers (2022-05-10T17:14:57Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.