Advances in quantum learning theory with bosonic systems

• URL: http://arxiv.org/abs/2605.08082v1
• Date: Fri, 08 May 2026 17:59:40 GMT
• Title: Advances in quantum learning theory with bosonic systems
• Abstract summary: This paper reviews recent advances in quantum learning theory for continuous-variable (CV) systems.<n>CV systems are ubiquitous in nature and in quantum technologies, as they describe bosonic and quantum-optical systems.
• Score: 1.0152838128195467
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper reviews recent advances in quantum learning theory for continuous-variable (CV) systems. Quantum learning theory investigates how to extract classical information from quantum systems as efficiently as possible. CV systems are ubiquitous in nature and in quantum technologies, as they describe bosonic and quantum-optical systems. While quantum learning theory for finite-dimensional systems has been extensively studied, the corresponding theory for CV systems has only recently begun to develop; here we provide a concise review. We focus on the following questions: what is the minimum number of copies (the sample complexity) required to learn a non-Gaussian state, possibly under energy constraints? What is the sample complexity for learning Gaussian states? How does the performance of CV state learning depend on non-Gaussianity? How can one test whether a state is Gaussian or far from the set of Gaussian states? And how can Gaussian processes be learned efficiently? Central to these topics, we also review several bounds on the trace distance between CV states in terms of their covariance matrices, which may be of independent interest. Overall, this work summarises selected developments in tomography of CV systems and highlights a selection of open problems.

Related papers

• Learning Gaussian optical states with quantum computers [1.2366208723499548]
  Recent results have established dramatic advantages in learning properties of quantum states when a quantum computer is available.<n>These results motivate the application of quantum computers to imaging and sensing of weak electromagnetic fields.
  arXiv  Detail & Related papers  (2026-05-06T18:01:04Z)
• Is it Gaussian? Testing bosonic quantum states [1.7340190329759613]
  We show that a constant number of copies is sufficient to decide whether a state is exactly Gaussian.<n>We also establish that testing Gaussianity of general mixed states necessarily requires exponentially many copies.<n>Our approach relies on rotation-invariant symmetries of Gaussian states together with the recently introduced toolbox of CV trace-distance bounds.
  arXiv  Detail & Related papers  (2025-10-08T17:56:34Z)
• Efficient Gaussian State Preparation in Quantum Circuits [4.930778301847907]
  We propose and analyze a circuit-based approach that starts with single-qubit rotations to form an exponential amplitude profile.<n>We demonstrate that this procedure achieves high fidelity with the target Gaussian state.<n>We conclude that the proposed technique is a promising route to make Gaussian states accessible on noisy quantum hardware.
  arXiv  Detail & Related papers  (2025-07-27T15:15:20Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• Classical shadow tomography for continuous variables quantum systems [13.286165491120467]
  We introduce two experimentally realisable schemes for obtaining classical shadows of CV quantum states. We are able to overcome new mathematical challenges due to the infinite-dimensionality of CV systems. We provide a scheme to learn nonlinear functionals of the state, such as entropies over any small number of modes.
  arXiv  Detail & Related papers  (2022-11-14T17:56:29Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Non-Gaussian Quantum States and Where to Find Them [0.0]
  We show how non-Gaussian states can be created by performing measurements on a subset of modes in a Gaussian state. We demonstrate that Wigner negativity is a requirement to violate Bell inequalities and to achieve a quantum computational advantage.
  arXiv  Detail & Related papers  (2021-04-26T13:59:41Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• Machine learning transfer efficiencies for noisy quantum walks [62.997667081978825]
  We show that the process of finding requirements on both a graph type and a quantum system coherence can be automated. The automation is done by using a convolutional neural network of a particular type that learns to understand with which network and under which coherence requirements quantum advantage is possible. Our results are of importance for demonstration of advantage in quantum experiments and pave the way towards automating scientific research and discoveries.
  arXiv  Detail & Related papers  (2020-01-15T18:36:53Z)

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.