Filtering states with total spin on a quantum computer

• URL: http://arxiv.org/abs/2106.10867v1
• Date: Mon, 21 Jun 2021 05:52:50 GMT
• Title: Filtering states with total spin on a quantum computer
• Authors: Pooja Siwach and Denis Lacroix
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Starting from a general wave function described on a set of spins/qubits, we propose several quantum algorithms to extract the components of this state on eigenstates of the total spin ${\bf S}^2$ and its azimuthal projection $S_z$. The method plays the role of total spin projection and gives access to the amplitudes of the initial state on a total spin basis. The different algorithms have various degrees of sophistication depending on the requested tasks. They can either solely project onto the subspace with good total spin or completely uplift the degeneracy in this subspace. After each measurement, the state collapses to one of the spin eigenstates that could be used for post-processing. For this reason, we call the method Total Quantum Spin filtering (TQSf). Possible applications ranging from many-body physics to random number generators are discussed.

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)
• Individual solid-state nuclear spin qubits with coherence exceeding seconds [32.074397322439324]
  We present a new platform for quantum information processing consisting of $183$W nuclear spin qubits adjacent to an Er$3+$ crystal. We demonstrate quantum non-demolition readout of each nuclear spin qubit using the Er$3+$ spin as an ancilla. We introduce a new scheme for all-microwave single- and two-qubit gates, based on stimulated Raman driving of the coupled electron-nuclear spin system.
  arXiv  Detail & Related papers  (2024-10-14T12:25:39Z)
• Certifying the quantumness of a nuclear spin qudit through its uniform precession [28.4073170440133]
  We certify the quantumness of exotic states of a nuclear spin through its uniform precession. The experiment is performed on a single spin-7/2 $123$Sb nucleus implanted in a silicon nanoelectronic device.
  arXiv  Detail & Related papers  (2024-10-10T06:20:41Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• Quantum supremacy with spin squeezed atomic ensembles [0.0]
  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.
  arXiv  Detail & Related papers  (2022-04-25T16:42:37Z)
• 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)
• 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)
• Nuclear Magnetic Resonance for Arbitrary Spin Values in the Rotating Wave Approximation [1.6240577699741112]
  The time dependence of the probability of finding the nucleus in each of the substates has not previously been published. We present an elementary method to solve this problem.
  arXiv  Detail & Related papers  (2022-03-16T17:12:40Z)
• Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ans\"atze [13.651587339535961]
  We develop a framework for convolutional quantum circuits with SU$(d)$symmetry. We prove Harrow's statement on equivalence between $nameSU(d)$ and $S_n$ irrep bases.
  arXiv  Detail & Related papers  (2021-12-14T18:03:43Z)
• Preparing exact eigenstates of the open XXZ chain on a quantum computer [0.0]
  We formulate a quantum algorithm for preparing Bethe states of this model, corresponding to real solutions of the Bethe equations. The algorithm is probabilistic, with a success probability that decreases with the number of down spins.
  arXiv  Detail & Related papers  (2021-09-12T20:29:43Z)

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.