Year: 2020
Type: conference-paper
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.
Institution: University of Maryland, College Park
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funders: National Science Foundation, U.S. Department of Energy, Innovative Research Group Project of the National Natural Science Foundation of China, Office of Science, U.S. Air Force, Multidisciplinary University Research Initiative, Advanced Scientific Computing Research, Air Force Office of Scientific Research
Awards: G1965873410, G2127201742, G2239261210, CAREER: On the Foundations of End-to-End Quantum Applications, AF: Small: Provable Quantum Advantages in Optimization, EFFICIENT AND RELIABLE MAPPING OF QUANTUM COMPUTATIONS ONTO REALISTIC ARCHITECTURES, G6671297155, G6984992067, G7090116110, EFFICIENT AND RELIABLE MAPPING OF QUANTUM COMPUTATIONS ONTO REALISTIC ARCHITECTURES, CRII: AF: Theoretical Problems in Quantum Computation, G8729776176
OpenAlex ID: W3014094173
