Entanglement-enabled advantage for learning a bosonic random displacement channel

• URL: http://arxiv.org/abs/2402.18809v2
• Date: Wed, 16 Oct 2024 05:07:24 GMT
• Title: Entanglement-enabled advantage for learning a bosonic random displacement channel
• Authors: Changhun Oh, Senrui Chen, Yat Wong, Sisi Zhou, Hsin-Yuan Huang, Jens A. H. Nielsen, Zheng-Hao Liu, Jonas S. Neergaard-Nielsen, Ulrik L. Andersen, Liang Jiang, John Preskill,
• Abstract summary: We show that quantum entanglement can provide an exponential advantage in learning properties of a bosonic continuous-variable system. We present a simple entanglement-assisted scheme that only requires a number of samples independent of $n$, given a sufficient amount of squeezing. Our work illuminates the role of entanglement in learning continuous-variable systems and points toward experimentally feasible demonstrations of provable entanglement-enabled advantage.
• Score: 6.354564715928202
• License:
• Abstract: We show that quantum entanglement can provide an exponential advantage in learning properties of a bosonic continuous-variable (CV) system. The task we consider is estimating a probabilistic mixture of displacement operators acting on $n$ bosonic modes, called a random displacement channel. We prove that if the $n$ modes are not entangled with an ancillary quantum memory, then the channel must be sampled a number of times exponential in $n$ in order to estimate its characteristic function to reasonable precision; this lower bound on sample complexity applies even if the channel inputs and measurements performed on channel outputs are chosen adaptively. On the other hand, we present a simple entanglement-assisted scheme that only requires a number of samples independent of $n$, given a sufficient amount of squeezing. This establishes an exponential separation in sample complexity. We then analyze the effect of photon loss and show that the entanglement-assisted scheme is still significantly more efficient than any lossless entanglement-free scheme under mild experimental conditions. Our work illuminates the role of entanglement in learning continuous-variable systems and points toward experimentally feasible demonstrations of provable entanglement-enabled advantage using CV quantum platforms.

Related papers

• Exponential advantage in continuous-variable quantum state learning [0.0]
  We consider the task of learning quantum states in bosonic continuous-variable (CV) systems. We present a experimentally feasible protocol that utilizes entangled measurements and reflected states. We establish a rigorous exponential advantage from entangled measurements and access to reflected states in learning CV quantum states.
  arXiv  Detail & Related papers  (2025-01-29T13:10:37Z)
• Sample space filling analysis for boson sampling validation [0.0]
  We show that due to the intrinsic nature of the boson sampling wave function, its filling behavior can be computationally efficiently distinguished from classically simulated cases. We propose a new validation protocol based on the sample space filling analysis and test it for problems of up to $20$ photons injected into a $400$-mode interferometer.
  arXiv  Detail & Related papers  (2024-11-21T12:39:37Z)
• Scalable approach to monitored quantum dynamics and entanglement phase transitions [0.0]
  Measurement-induced entanglement phase transitions in monitored quantum circuits have stimulated activity in a diverse research community. We present a solution by introducing a scalable protocol in $U(1)$ symmetric circuits.
  arXiv  Detail & Related papers  (2024-06-27T09:59:58Z)
• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows [1.366942647553326]
  We propose a robust protocol for characterizing quantum states on current quantum computing platforms. Our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity. This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol.
  arXiv  Detail & Related papers  (2024-02-27T21:53:32Z)
• Iterated Denoising Energy Matching for Sampling from Boltzmann Densities [109.23137009609519]
  Iterated Denoising Energy Matching (iDEM) iDEM alternates between (I) sampling regions of high model density from a diffusion-based sampler and (II) using these samples in our matching objective. We show that the proposed approach achieves state-of-the-art performance on all metrics and trains $2-5times$ faster.
  arXiv  Detail & Related papers  (2024-02-09T01:11:23Z)
• Value function estimation using conditional diffusion models for control [62.27184818047923]
  We propose a simple algorithm called Diffused Value Function (DVF) It learns a joint multi-step model of the environment-robot interaction dynamics using a diffusion model. We show how DVF can be used to efficiently capture the state visitation measure for multiple controllers.
  arXiv  Detail & Related papers  (2023-06-09T18:40:55Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Noise thresholds for classical simulability of non-linear Boson sampling [4.812718493682455]
  We introduce higher order non-linearities as a mean to enhance the computational complexity of the problem and the protocol's robustness against noise. Our results indicate that the addition of single-mode Kerr non-linearity at the input state preparation level, while retaining a linear-optical evolution, makes the Boson sampling protocol more robust against noise.
  arXiv  Detail & Related papers  (2022-02-24T12:17:28Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Assessment of weak-coupling approximations on a driven two-level system under dissipation [58.720142291102135]
  We study a driven qubit through the numerically exact and non-perturbative method known as the Liouville-von equation with dissipation. We propose a metric that may be used in experiments to map the regime of validity of the Lindblad equation in predicting the steady state of the driven qubit.
  arXiv  Detail & Related papers  (2020-11-11T22:45:57Z)

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.