Related papers: Spin-$s$ $U(1)$-eigenstate preparation
This thesis presents an efficient quantum algorithm and explicit circuits for generating eigenstates of arbitrary SU(2) and SU(3) representations. These include a wide variety of highly entangled states. The algorithm uses Schur transform…
We demonstrate a simple technique to prepare and determine the desired internal quantum states in multi-Zeeman-sublevel atoms. By choosing appropriate coupling and pumping laser beams, atoms can be easily prepared in a desired Zeeman…
The preparation of quantum Gibbs state is an essential part of quantum computation and has wide-ranging applications in various areas, including quantum simulation, quantum optimization, and quantum machine learning. In this paper, we…
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…
A uniformly coupled double quantum Hamiltonian for a spin chain has recently been implemented experimentally. We propose a method for the determination of initial quantum states that will provide perfect or near-perfect state transmission…
Consider a spin s prepared in a pure state. It is shown that, generically, the moduli of the (2s+1) spin components along three directions in space determine the state unambiguously. These probabilities are accessible experimentally by…
We propose a method to prepare the spin singlet in an ensemble of integer-spin atoms confined within a high-finesse optical cavity. Using a cavity-assisted Raman transition to produce an effective Tavis-Cummings model, we show that a high…
Total spin eigenstates can be used to intrinsically encode a direction, which can later be decoded by means of a quantum measurement. We study the optimal strategy that can be adopted if, as is likely in practical applications, only product…
We design a quasi-one dimensional spin chain with engineered coupling strengths such that the natural dynamics of the spin chain evolves a single excitation localized at the left hand site to any specified single particle state on the whole…
We present a protocol to store a polynomial number of arbitrary bit strings, encoded as spin configurations, in the approximately degenerate low-energy manifold of an all-to-all connected Ising spin glass. The iterative protocol is inspired…
Efficient state preparation is a challenging and important problem in quantum computing. In this work, we present a recursive state preparation algorithm that combines logarithmic-depth Dicke state circuits with Hamming weight encoders for…
We propose a general method for preparing stabilizer states with reduced two-qubit gate count and depth compared to the state of the art. The method starts from a graph state representation of the stabilizer state and iteratively reduces…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
We propose an optical lattice setup to investigate spin chains and ladders. Electric and magnetic fields allow us to vary at will the coupling constants, producing a variety of quantum phases including the Haldane phase, critical phases,…
Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We…
The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to…
This paper constructs coherent states for spin networks with planar symmetry. After gauge-fixing, the full SU(2) symmetry is broken to U(1), but one cannot simply use the U(1) limit of SU(2) coherent states, because the planar states…
We propose a quantum algorithm for many-body state preparation. It is especially suited for injective PEPS and thermal states of local commuting Hamiltonians on a lattice. We show that for a uniform gap and sufficiently smooth paths, an…
We propose a scheme for the construction of one-particle Green's function (GF) of an interacting electronic system via statistical sampling on a quantum computer. Although the non-unitarity of creation and annihilation operators for the…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…