Proof of Hiding Conjecture in Gaussian Boson Sampling

• URL: http://arxiv.org/abs/2508.00983v1
• Date: Fri, 01 Aug 2025 18:00:01 GMT
• Title: Proof of Hiding Conjecture in Gaussian Boson Sampling
• Authors: Laura Shou, Sarah H. Miller, Victor Galitski,
• Abstract summary: We prove the hiding conjecture'' for a complex Gaussian matrix in total variation distance.<n>This is the first rigorous proof of the property for GBS in experimentally relevant regime.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Gaussian boson sampling (GBS) is a promising protocol for demonstrating quantum computational advantage. One of the key steps for proving classical hardness of GBS is the so-called ``hiding conjecture'', which asserts that one can ``hide'' a complex Gaussian matrix as a submatrix of the outer product of Haar unitary submatrices in total variation distance. In this paper, we prove the hiding conjecture for input states with the maximal number of squeezed states, which is a setup that has recently been realized experimentally [Madsen et al., Nature 606, 75 (2022)]. In this setting, the hiding conjecture states that a $o(\sqrt{M})\times o(\sqrt{M})$ submatrix of an $M\times M$ circular orthogonal ensemble (COE) random matrix can be well-approximated by a complex Gaussian matrix in total variation distance as $M\to\infty$. This is the first rigorous proof of the hiding property for GBS in the experimentally relevant regime, and puts the argument for hardness of classically simulating GBS with a maximal number of squeezed states on a comparable level to that of the conventional boson sampling of [Aaronson and Arkhipov, Theory Comput. 9, 143 (2013)].

Related papers

• The symplectic rank of non-Gaussian quantum states [0.0]
  Non-Gaussianity is a key resource for achieving quantum advantages in bosonic platforms.<n>Here, we investigate the symplectic rank: a novel non-Gaussianity monotone that satisfies remarkable operational and resource-theoretic properties.<n>We show that the symplectic rank is a robust non-Gaussian measure, explaining how to witness it in experiments and how to exploit it to meaningfully benchmark different bosonic platforms.
  arXiv  Detail & Related papers  (2025-04-27T18:00:31Z)
• Private Low-Rank Approximation for Covariance Matrices, Dyson Brownian Motion, and Eigenvalue-Gap Bounds for Gaussian Perturbations [29.212403229351253]
  We analyze a complex variant of the Gaussian mechanism and obtain upper bounds on the Frobenius norm of the difference between the matrix output by this mechanism and the best rank-$k$ approximation to $M$.<n>We show that the eigenvalues of the matrix $M$ perturbed by Gaussian noise have large gaps with high probability.
  arXiv  Detail & Related papers  (2025-02-11T15:46:03Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states.<n>It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems.<n>The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• Efficient unitary designs and pseudorandom unitaries from permutations [35.66857288673615]
  We show that products exponentiated sums of $S(N)$ permutations with random phases match the first $2Omega(n)$ moments of the Haar measure. The heart of our proof is a conceptual connection between the large dimension (large-$N$) expansion in random matrix theory and the method.
  arXiv  Detail & Related papers  (2024-04-25T17:08:34Z)
• Approximate orthogonality of permutation operators, with application to quantum information [0.9790236766474201]
  Consider the $n!$ different unitary matrices that permute $n$ $d$-dimensional quantum systems. If $dgeq n$ then they are linearly independent. This simple point has several applications in quantum information and random matrix theory.
  arXiv  Detail & Related papers  (2023-09-01T19:45:30Z)
• Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states [0.0]
  It is known that computing the permanent computation of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations in the matrix size. I extend this result to a generalization of the matrix permanent: an expectation value in a product of a large number of identical bosonic states with a bounded number of bosons.
  arXiv  Detail & Related papers  (2022-10-20T20:09:28Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• The Complexity of Bipartite Gaussian Boson Sampling [0.0]
  We show that under the standard Anti-Concentration and Permanent-of-Gaussians conjectures, there is no efficient algorithm to sample from ideal GBS unless the hierarchy collapses. We also make progress towards the goal of proving hardness in the regime where there are fewer than quadratically more modes than photons.
  arXiv  Detail & Related papers  (2021-10-13T18:08:37Z)
• Tight High Probability Bounds for Linear Stochastic Approximation with Fixed Stepsize [41.38162218102825]
  This paper provides a non-asymptotic analysis of linear approximation (LSA) algorithms with fixed stepsize. We derive high probability bounds on the performance of LSA under weaker conditions on the sequence $(bf A_n, bf b_n): n in mathbbN*$. We show that our conclusions cannot be improved without additional assumptions on the sequence $bf A_n: n in mathbbN*$.
  arXiv  Detail & Related papers  (2021-06-02T16:10:37Z)
• Can Single-Shuffle SGD be Better than Reshuffling SGD and GD? [77.82009268160053]
  We conjecture that the means of matrix products corresponding to with- and without-replacement variants of SGD satisfy a series of spectral norm inequalities. We present theorems that support our conjecture by proving several special cases.
  arXiv  Detail & Related papers  (2021-03-12T04:34:45Z)
• A Concentration of Measure and Random Matrix Approach to Large Dimensional Robust Statistics [45.24358490877106]
  This article studies the emphrobust covariance matrix estimation of a data collection $X = (x_1,ldots,x_n)$ with $x_i = sqrt tau_i z_i + m$. We exploit this semi-metric along with concentration of measure arguments to prove the existence and uniqueness of the robust estimator as well as evaluate its limiting spectral distribution.
  arXiv  Detail & Related papers  (2020-06-17T09:02:26Z)

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.