Preparing angular momentum eigenstates using engineered quantum walks

• URL: http://arxiv.org/abs/2408.14684v1
• Date: Mon, 26 Aug 2024 23:20:00 GMT
• Title: Preparing angular momentum eigenstates using engineered quantum walks
• Authors: Yuan Shi, Kristin M. Beck, Veronika Anneliese Kruse, Stephen B. Libby,
• Abstract summary: We develop a quantum-walk scheme that does not require inputting $O(j)$ nonzero Clebsch-Gordan (CG) coefficients classically. Our scheme prepares angular momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states. We test our state preparation scheme on classical computers, reproducing CG coefficients, and implement small test problems on current quantum hardware.
• Score: 1.0232954388448414
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Coupled angular momentum eigenstates are widely used in atomic and nuclear physics calculations, and are building blocks for spin networks and the Schur transform. To combine two angular momenta $\mathbf{J}_1$ and $\mathbf{J}_2$, forming eigenstates of their total angular momentum $\mathbf{J}=\mathbf{J}_1+\mathbf{J}_2$, we develop a quantum-walk scheme that does not require inputting $O(j^3)$ nonzero Clebsch-Gordan (CG) coefficients classically. In fact, our scheme may be regarded as a unitary method for computing CG coefficients on quantum computers with a typical complexity of $O(j)$ and a worst-case complexity of $O(j^3)$. Equivalently, our scheme provides decompositions of the dense CG unitary into sparser unitary operations. Our scheme prepares angular momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states, which are usually highly entangled states in the computational basis. In contrast to usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in $\mathfrak{su}(2)\times \mathfrak{su}(2)$, which are inspired by, but different from, Hamiltonians that govern magnetic resonances and dipole interactions. To achieve a deterministic preparation of both ket and bra states, we use projection and destructive interference to double pinch the quantum walks, such that each step is a unit-probability population transfer within a two-level system. We test our state preparation scheme on classical computers, reproducing CG coefficients. We also implement small test problems on current quantum hardware.

Related papers

• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles. Even with sublinear barriers, we use Feynman-Kac techniques to lift classical to quantum ones establishing tight lower bound $T_mathrmmix = 2Omega(nalpha)$.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Systematic input scheme of many-boson Hamiltonians with applications to the two-dimensional $φ^4$ theory [0.0]
  We present our discussion of this input scheme based on the light-front Hamiltonian of the two-dimensional $phi 4$ theory. In our input scheme, we employ a set of quantum registers, where each register encodes the occupation of a distinct boson mode as binaries. We present the spectral calculations of the Hamiltonian utilizing the hybrid quantum-classical symmetry-adapted quantum Krylov subspace diagonalization algorithm.
  arXiv  Detail & Related papers  (2024-07-18T16:47:53Z)
• Spin coupling is all you need: Encoding strong electron correlation on quantum computers [0.0]
  We show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states. Our work paves the way towards scalable quantum simulation of electronic structure for classically challenging systems.
  arXiv  Detail & Related papers  (2024-04-29T17:14:21Z)
• A polynomial-time dissipation-based quantum algorithm for solving the ground states of a class of classically hard Hamiltonians [4.500918096201963]
  We give a quantum algorithm for solving the ground states of a class of Hamiltonians. The mechanism of the exponential speedup that appeared in our algorithm comes from dissipation in open quantum systems.
  arXiv  Detail & Related papers  (2024-01-25T05:01:02Z)
• An efficient and exact noncommutative quantum Gibbs sampler [0.0]
  We construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary noncommutative Hamiltonians. Our construction can also be regarded as a continuous-time quantum analog of the Metropolis-Hastings algorithm.
  arXiv  Detail & Related papers  (2023-11-15T18:51:24Z)
• 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)
• Tensor Factorized Recursive Hamiltonian Downfolding To Optimize The Scaling Complexity Of The Electronic Correlations Problem on Classical and Quantum Computers [0.15833270109954137]
  We present a new variant of post-Hartree-Fock Hamiltonian downfolding-based quantum chemistry methods with optimized scaling for high-cost simulations. We demonstrate super-quadratic speedups of expensive quantum chemistry algorithms on both classical and quantum computers.
  arXiv  Detail & Related papers  (2023-03-13T12:15:54Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05: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.