Beyond Boson Sampling: Higher Spin Sampling as a Practical Path to Quantum Supremacy

• URL: http://arxiv.org/abs/2505.07312v1
• Date: Mon, 12 May 2025 07:57:21 GMT
• Title: Beyond Boson Sampling: Higher Spin Sampling as a Practical Path to Quantum Supremacy
• Authors: Chon-Fai Kam, En-Jui Kuo,
• Abstract summary: We introduce spin sampling for arbitrary spin-$S$ states as a practical path to quantum supremacy.<n>We identify a quasi-linear scaling relation between the number of sites $m$ and the number of spins $n$ as $msim n1+epsilon$.<n>This suggests that, within a spin system, an equivalent Fock-state boson sampling task in the linear mode region is experimentally feasible with reduced resource requirements.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Since the dawn of quantum computation science, a range of quantum algorithms have been proposed, yet few have experimentally demonstrated a definitive quantum advantage. Shor's algorithm, while renowned, has not been realized at a scale to outperform classical methods. In contrast, Fock-state boson sampling has been theoretically established as a means of achieving quantum supremacy. However, most existing experimental realizations of boson sampling to date have been based on Gaussian boson sampling, in which the input states consist of squeezed states of light. In this work, we first introduce spin sampling for arbitrary spin-$S$ states as a practical path to quantum supremacy. We identified a quasi-linear scaling relation between the number of sites $m$ and the number of spins $n$ as $m\sim n^{1+\epsilon}$, where $\epsilon=3/(2S)$ is inversely proportional to the spin quantum number. This suggests that, within a spin system, an equivalent Fock-state boson sampling task in the linear mode region, characterized by $m\sim \Omega(n^{1+\epsilon})$, is experimentally feasible with reduced resource requirements.

Related papers

• Operator-Level Quantum Acceleration of Non-Logconcave Sampling [4.711981119026701]
  Langevin dynamics encodes target Gibbs into the amplitudes of a quantum state.<n>This connection enables Gibbs sampling via the first provable quantum diffusion factor setting.
  arXiv  Detail & Related papers  (2025-05-08T14:43:17Z)
• 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)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Concurrent spin squeezing and light squeezing in an atomic ensemble [1.5467049683274625]
  We propose a novel protocol based on judiciously engineered symmetric atom-light interaction. We report results of concurrent spin squeezing of $0.61pm0.09mathrmdB$ and light squeezing of $0.65+0.11_-0.10mathrmdB$ in a hot atomic ensemble. Our method can be extended to other quantum platforms such as optomechanics, cold atom and trapped ions.
  arXiv  Detail & Related papers  (2023-10-03T23:47:30Z)
• Simulating Gaussian boson sampling quantum computers [68.8204255655161]
  We briefly review recent theoretical methods to simulate experimental Gaussian boson sampling networks. We focus mostly on methods that use phase-space representations of quantum mechanics. A brief overview of the theory of GBS, recent experiments and other types of methods are also presented.
  arXiv  Detail & Related papers  (2023-08-02T02:03:31Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Cracking the Quantum Advantage threshold for Gaussian Boson Sampling [0.0]
  We propose the approximate algorithm to obtain the probability of any specific measurement outcome. For a 70-mode device on a laptop, our approximation achieves accuracy competitive with the experimental one.
  arXiv  Detail & Related papers  (2021-06-02T20:05:46Z)
• Heisenberg-Limited Waveform Estimation with Solid-State Spins in Diamond [15.419555338671772]
  Heisenberg limit in arbitrary waveform estimation is quite different with parameter estimation. It is still a non-trivial challenge to generate a large number of exotic quantum entangled states to achieve this quantum limit. This work provides an essential step towards realizing quantum-enhanced structure recognition in a continuous space and time.
  arXiv  Detail & Related papers  (2021-05-13T01:52: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.