Average Rényi Entanglement Entropy in Gaussian Boson Sampling

• URL: http://arxiv.org/abs/2403.18890v1
• Date: Wed, 27 Mar 2024 18:00:01 GMT
• Title: Average Rényi Entanglement Entropy in Gaussian Boson Sampling
• Authors: Jason Youm, Joseph T. Iosue, Adam Ehrenberg, Yu-Xin Wang, Alexey V. Gorshkov,
• Abstract summary: We study the modal entanglement of the output states in a framework for quantum computing. We derive formulas for $alpha = 1$, and, more generally, for all integers $alpha$ in the limit of modes and for input states that are composed of single-mode-squeezed-vacuum state with equal squeezing strength.
• Score: 17.695669245980124
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recently, many experiments have been conducted with the goal of demonstrating a quantum advantage over classical computation. One popular framework for these experiments is Gaussian Boson Sampling, where quadratic photonic input states are interfered via a linear optical unitary and subsequently measured in the Fock basis. In this work, we study the modal entanglement of the output states in this framework just before the measurement stage. Specifically, we compute Page curves as measured by various R\'enyi-$\alpha$ entropies, where the Page curve describes the entanglement between two partitioned groups of output modes averaged over all linear optical unitaries. We derive these formulas for $\alpha = 1$ (i.e. the von Neumann entropy), and, more generally, for all positive integer $\alpha$, in the asymptotic limit of infinite number of modes and for input states that are composed of single-mode-squeezed-vacuum state with equal squeezing strength. We then analyze the limiting behaviors when the squeezing is small and large. Having determined the averages, we then explicitly calculate the R\'enyi-$\alpha$ variance for integers $\alpha > 1$, and we are able to show that these entropies are weakly typical.

Related papers

• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• Photon-number moments and cumulants of Gaussian states [0.0]
  We develop expressions for the moments and cumulants of Gaussian states when measured in the photon-number basis. We show that the calculation of photon-number moments and cumulants are #P-hard.
  arXiv  Detail & Related papers  (2022-12-12T17:34:10Z)
• Neural Inference of Gaussian Processes for Time Series Data of Quasars [72.79083473275742]
  We introduce a new model that enables it to describe quasar spectra completely. We also introduce a new method of inference of Gaussian process parameters, which we call $textitNeural Inference$. The combination of both the CDRW model and Neural Inference significantly outperforms the baseline DRW and MLE.
  arXiv  Detail & Related papers  (2022-11-17T13:01:26Z)
• Entanglement in the full state vector of boson sampling [2.294014185517203]
  We investigate Renyi entanglement entropies for moderate particle and huge mode numbers. The maximum entanglement is reached surprisingly early before the mode population is distributed over the whole system.
  arXiv  Detail & Related papers  (2022-10-18T14:59:23Z)
• Page curves and typical entanglement in linear optics [0.0]
  We study entanglement within a set of squeezed modes that have been evolved by a random linear optical unitary. We prove various results on the typicality of entanglement as measured by the R'enyi-2 entropy. Our main make use of a symmetry property obeyed by the average and the variance of the entropy that dramatically simplifies the averaging over unitaries.
  arXiv  Detail & Related papers  (2022-09-14T18:00:03Z)
• Hessian Averaging in Stochastic Newton Methods Achieves Superlinear Convergence [69.65563161962245]
  We consider a smooth and strongly convex objective function using a Newton method. We show that there exists a universal weighted averaging scheme that transitions to local convergence at an optimal stage.
  arXiv  Detail & Related papers  (2022-04-20T07:14:21Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)
• Quantitative Analysis of the Stochastic Approach to Quantum Tunneling [10.675149822083915]
  Recently there has been increasing interest in alternate methods to compute quantum tunneling in field theory. Previous work showed parametric agreement between the tunneling rate in this approach and the usual instanton approximation. Here we show that this approach does not in fact match precisely; the method tends to overpredict the instanton tunneling rate.
  arXiv  Detail & Related papers  (2020-08-31T18:00:03Z)
• On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and Non-Asymptotic Concentration [115.1954841020189]
  We study the inequality and non-asymptotic properties of approximation procedures with Polyak-Ruppert averaging. We prove a central limit theorem (CLT) for the averaged iterates with fixed step size and number of iterations going to infinity.
  arXiv  Detail & Related papers  (2020-04-09T17:54:18Z)

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.