Universal compiling and (No-)Free-Lunch theorems for continuous variable
quantum learning
- URL: http://arxiv.org/abs/2105.01049v2
- Date: Tue, 9 Nov 2021 18:06:28 GMT
- Title: Universal compiling and (No-)Free-Lunch theorems for continuous variable
quantum learning
- Authors: Tyler Volkoff and Zo\"e Holmes and Andrew Sornborger
- Abstract summary: We motivate several, closely related, short depth continuous variable algorithms for quantum compilation.
We analyse the trainability of our proposed cost functions and demonstrate our algorithms by learning arbitrary numerically Gaussian operations.
We make connections between this framework and quantum learning theory in the continuous variable setting by deriving No-Free-Lunch theorems.
- Score: 1.2891210250935146
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum compiling, where a parameterized quantum circuit is trained to learn
a target unitary, is an important primitive for quantum computing that can be
used as a subroutine to obtain optimal circuits or as a tomographic tool to
study the dynamics of an experimental system. While much attention has been
paid to quantum compiling on discrete variable hardware, less has been paid to
compiling in the continuous variable paradigm. Here we motivate several,
closely related, short depth continuous variable algorithms for quantum
compilation. We analyse the trainability of our proposed cost functions and
numerically demonstrate our algorithms by learning arbitrary Gaussian
operations and Kerr non-linearities. We further make connections between this
framework and quantum learning theory in the continuous variable setting by
deriving No-Free-Lunch theorems. These generalization bounds demonstrate a
linear resource reduction for learning Gaussian unitaries using entangled
coherent-Fock states and an exponential resource reduction for learning
arbitrary unitaries using Two-Mode-Squeezed states.
Related papers
- Hybrid Quantum-Classical Machine Learning with String Diagrams [49.1574468325115]
This paper develops a formal framework for describing hybrid algorithms in terms of string diagrams.
A notable feature of our string diagrams is the use of functor boxes, which correspond to a quantum-classical interfaces.
arXiv Detail & Related papers (2024-07-04T06:37:16Z) - 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) - The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for
Deep Quantum Machine Learning [52.77024349608834]
Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing.
Key issue is how to address the inherent non-linearity of classical deep learning.
We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
arXiv Detail & Related papers (2022-12-22T16:06:24Z) - Variational Quantum Continuous Optimization: a Cornerstone of Quantum
Mathematical Analysis [0.0]
We show how universal quantum computers can handle mathematical analysis calculations for functions with continuous domains.
The basic building block of our approach is a variational quantum circuit where each qubit encodes up to three continuous variables.
By combining this encoding with quantum state tomography, a variational quantum circuit of $n$ qubits can optimize functions of up to $3n$ continuous variables.
arXiv Detail & Related papers (2022-10-06T18:00:04Z) - Representation Learning via Quantum Neural Tangent Kernels [10.168123455922249]
Variational quantum circuits are used in quantum machine learning and variational quantum simulation tasks.
Here we discuss these problems, analyzing variational quantum circuits using the theory of neural tangent kernels.
We analytically solve the dynamics in the frozen limit, or lazy training regime, where variational angles change slowly and a linear perturbation is good enough.
arXiv Detail & Related papers (2021-11-08T01:30:34Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Properties and Application of Gaussian Quantum Processes [0.0]
We show that generic coupler characterized by Gaussian unitary process can be transformed into a high-fidelity transducer.
We study the quantum noise theory for optical parameter sensing and its potential in providing great measurement precision enhancement.
All the analyses originated from the fundamental quantum commutation relations, and therefore are widely applicable.
arXiv Detail & Related papers (2021-07-03T18:01:34Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - A Unified Framework for Quantum Supervised Learning [0.7366405857677226]
We present an embedding-based framework for supervised learning with trainable quantum circuits.
The aim of these approaches is to map data from different classes to separated locations in the Hilbert space via the quantum feature map.
We establish an intrinsic connection between the explicit approach and other quantum supervised learning models.
arXiv Detail & Related papers (2020-10-25T18:43:13Z) - Topological Quantum Compiling with Reinforcement Learning [7.741584909637626]
We introduce an efficient algorithm that compiles an arbitrary single-qubit gate into a sequence of elementary gates from a finite universal set.
Our algorithm may carry over to other challenging quantum discrete problems, thus opening up a new avenue for intriguing applications of deep learning in quantum physics.
arXiv Detail & Related papers (2020-04-09T18:00:01Z)
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.