A learning theory for quantum photonic processors and beyond

• URL: http://arxiv.org/abs/2209.03075v4
• Date: Wed, 31 Jul 2024 07:39:48 GMT
• Title: A learning theory for quantum photonic processors and beyond
• Authors: Matteo Rosati,
• Abstract summary: We consider the tasks of learning quantum states, measurements and channels generated by continuous-variable (CV) quantum circuits. We define classes of functions that map classical variables, encoded into the CV circuit parameters, to outcome probabilities evaluated on those circuits. Our results show that CV circuits can be trained efficiently using a number of training samples that, unlike their finite-dimensional counterpart, does not scale with the circuit depth.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: We consider the tasks of learning quantum states, measurements and channels generated by continuous-variable (CV) quantum circuits. This family of circuits is suited to describe optical quantum technologies and in particular it includes state-of-the-art photonic processors capable of showing quantum advantage. We define classes of functions that map classical variables, encoded into the CV circuit parameters, to outcome probabilities evaluated on those circuits. We then establish efficient learnability guarantees for such classes, by computing bounds on their pseudo-dimension or covering numbers, showing that CV quantum circuits can be learned with a sample complexity that scales polynomially with the circuit's size, i.e., the number of modes. Our results show that CV circuits can be trained efficiently using a number of training samples that, unlike their finite-dimensional counterpart, does not scale with the circuit depth.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Continuous-variable quantum kernel method on a programmable photonic quantum processor [0.0]
  We experimentally prove that the CV quantum kernel method successfully classifies several datasets robustly even under the experimental imperfections. This demonstration sheds light on the utility of CV quantum systems for QML and should stimulate further study in other CV QML algorithms.
  arXiv  Detail & Related papers  (2024-05-02T08:33:31Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Circuit Width Estimation via Effect Typing and Linear Dependency (Long Version) [1.3597551064547502]
  We present Proto-Quipper-R, a circuit description language endowed with a linear dependent type-and-effect system. We show that our approach is expressive enough to verify realistic quantum algorithms.
  arXiv  Detail & Related papers  (2023-10-29T18:10:31Z)
• Data compression for quantum machine learning [2.119778346188635]
  We address the problem of efficiently compressing and loading classical data for use on a quantum computer. Our proposed methods allow both the required number of qubits and depth of the quantum circuit to be tuned.
  arXiv  Detail & Related papers  (2022-04-24T03:03:14Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Efficient realization of quantum algorithms with qudits [0.70224924046445]
  We propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits) Our method uses a transpilation of a circuit in the standard qubit form, which depends on the parameters of a qudit-based processor. We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set.
  arXiv  Detail & Related papers  (2021-11-08T11:09:37Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• Capacity and quantum geometry of parametrized quantum circuits [0.0]
  Parametrized quantum circuits can be effectively implemented on current devices. We evaluate the capacity and trainability of these circuits using the geometric structure of the parameter space. Our results enhance the understanding of parametrized quantum circuits for improving variational quantum algorithms.
  arXiv  Detail & Related papers  (2021-02-02T18:16:57Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)

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.