Quantum supremacy with spin squeezed atomic ensembles

• URL: http://arxiv.org/abs/2204.11772v1
• Date: Mon, 25 Apr 2022 16:42:37 GMT
• Title: Quantum supremacy with spin squeezed atomic ensembles
• Authors: Yueheng Shi, Junheng Shi, Tim Byrnes
• Abstract summary: We propose a method to achieve quantum supremacy using ensembles of qubits. Each ensemble is assumed to be controllable only with its total spin. We show that the probability distribution of the final measurements quickly approaches a Porter-Thomas distribution.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a method to achieve quantum supremacy using ensembles of qubits, using only spin squeezing, basis rotations, and Fock state measurements. Each ensemble is assumed to be controllable only with its total spin. Using a repeated sequence of random basis rotations followed by squeezing, we show that the probability distribution of the final measurements quickly approaches a Porter-Thomas distribution. We show that the sampling probability can be related to a #P-hard problem with a complexity scaling as $(N+1)^M$, where $N$ is the number of qubits in an ensemble and $ M $ is the number of ensembles. The scheme can be implemented with hot or cold atomic ensembles. Due to the large number of atoms in typical atomic ensembles, this allows access to the quantum supremacy regime with a modest number of ensembles or gate depth.

Related papers

• 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)
• Robust spectral $\pi$ pairing in the random-field Floquet quantum Ising model [44.84660857803376]
  We study level pairings in the many-body spectrum of the random-field Floquet quantum Ising model. The robustness of $pi$ pairings against longitudinal disorder may be useful for quantum information processing.
  arXiv  Detail & Related papers  (2024-01-09T20:37:48Z)
• Quantum Gates Between Mesoscopic Spin Ensembles [0.0]
  We show that in the limit where the size of the ensembles is small, it is possible to treat them as qubits with an effective coupling strength that scales with the number of spins. One- and two-qubit gate operations can be implemented with high fidelities.
  arXiv  Detail & Related papers  (2023-03-04T02:49:26Z)
• Sampled Transformer for Point Sets [80.66097006145999]
  sparse transformer can reduce the computational complexity of the self-attention layers to $O(n)$, whilst still being a universal approximator of continuous sequence-to-sequence functions. We propose an $O(n)$ complexity sampled transformer that can process point set elements directly without any additional inductive bias.
  arXiv  Detail & Related papers  (2023-02-28T06:38:05Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Deterministic preparation of supersinglets with collective spin projections [4.403241928718266]
  We introduce a procedure to generate supersinglets, the multipartite generalization of angular momentum singlet states. A supersinglet is defined as a total spin zero state consisting of $ N $ spin-$ j $ particles.
  arXiv  Detail & Related papers  (2022-04-15T16:33:04Z)
• Quantum Approximate Counting for Markov Chains and Application to Collision Counting [0.0]
  We show how to generalize the quantum approximate counting technique developed by Brassard, Hoyer and Tapp [ICALP 1998] to estimating the number of marked states of a Markov chain. This makes it possible to construct quantum approximate counting algorithms from quantum search algorithms based on the powerful "quantum walk based search" framework established by Magniez, Nayak, Roland and Santha.
  arXiv  Detail & Related papers  (2022-04-06T03:04:42Z)
• Probing quantum entanglement from magnetic-sublevels populations: beyond spin squeezing inequalities [0.0]
  Spin squeezing inequalities (SSI) represent a major tool to probe quantum entanglement among a collection of few-level atoms. Many experiments can image the populations in all Zeeman sublevels $s=-j, -j+1, dots, j$, potentially revealing finer features of quantum entanglement not captured by SSI. Here we present a systematic approach which exploits Zeeman-sublevel population measurements in order to construct novel entanglement criteria.
  arXiv  Detail & Related papers  (2022-03-25T10:09:46Z)
• Filtering states with total spin on a quantum computer [0.0]
  The method plays the role of total spin projection and gives access to the amplitudes of the initial state on a total spin basis. After each measurement, the state collapses to one of the spin eigenstates that could be used for post-processing.
  arXiv  Detail & Related papers  (2021-06-21T05:52:50Z)
• Partitioning dysprosium's electronic spin to reveal entanglement in non-classical states [55.41644538483948]
  We report on an experimental study of entanglement in dysprosium's electronic spin. Our findings open up the possibility to engineer novel types of entangled atomic ensembles.
  arXiv  Detail & Related papers  (2021-04-29T15:02:22Z)
• Quantum Coupon Collector [62.58209964224025]
  We study how efficiently a $k$-element set $Ssubseteq[n]$ can be learned from a uniform superposition $|Srangle of its elements. We give tight bounds on the number of quantum samples needed for every $k$ and $n$, and we give efficient quantum learning algorithms.
  arXiv  Detail & Related papers  (2020-02-18T16:14:55Z)

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.