Related papers: Efficient Eigenstate Preparation in an Integrable …
Quantum computers have the potential to efficiently simulate large-scale quantum systems for which classical approaches are bound to fail. Even though several existing quantum devices now feature total qubit numbers of more than one…
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 formulate a deterministic algorithm for preparing a general $U(1)$-eigenstate of a spin-$s$ chain of length $n$. These states consist of linear combinations of computational basis states $|\vec{m}\rangle$ of $n$ qudits, each with…
Many-body ground state preparation is an important subroutine used in the simulation of physical systems. In this paper, we introduce a flexible and efficient framework for obtaining a state preparation circuit for a large class of…
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of $N$ spin-orbitals into an $N$-qubit system, but many of the fermionic…
Recent quantum simulation by Google [Nature 612, 240 (2022)] has demonstrated the formation of bound states of interacting photons in a quantum-circuit version of the XXZ spin chain. While such bound states are protected by integrability in…
Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is…
Hybrid quantum-classical algorithms provide ways to use noisy intermediate-scale quantum computers for practical applications. Expanding the portfolio of such techniques, we propose a quantum circuit learning algorithm that can be used to…
The numerical simulation of quantum many-body dynamics is typically limited by the linear growth of entanglement with time. Recently numerical studies have shown, however, that for 1D Bethe-integrable models the simulation of local…
A probabilistic algorithm for preparing Bethe eigenstates of the spin-1/2 Heisenberg spin chain on a quantum computer has recently been found. We derive an exact formula for the success probability of this algorithm in terms of the Gaudin…
We introduce a method called resolution refinement that allows one to bootstrap eigenstate preparation on a quantum computer. We first prepare an eigenstate of a low-resolution Hamiltonian using any method of choice. The eigenstate is then…
In loop quantum gravity approach to Planck scale physics, quantum geometry is represented by superposition of the so-called spin network states. In the recent literature, a class of spin networks promising from the perspective of quantum…
We consider spin chain models with local Hamiltonians that display weak ergodicity breaking. In these models, the majority of the eigenstates are thermal, but there is a distinguished subspace of the Hilbert space in which ergodicity is…
We introduce a one-dimensional (1D) extended quantum breakdown model comprising a fermionic and a spin degree of freedom per site, and featuring a spatially asymmetric breakdown-type interaction between the fermions and spins. We…
Quantum simulations of non-Abelian gauge theories require efficient mappings onto quantum computers and practical state preparation and measurement procedures. A truncation of the Hilbert space of non-Abelian lattice gauge theories with…
A novel Bethe Ansatz scheme is proposed to calculate physical properties of quantum integrable systems without $U(1)$ symmetry. As an example, the anti-periodic XXZ spin chain, a typical correlated many-body system embedded in a topological…
Estimating the eigenstate properties of quantum systems is a long-standing, challenging problem for both classical and quantum computing. Existing universal quantum algorithms typically rely on ideal and efficient query models (e.g. time…
We present an efficient protocol leveraging classical computation to support Initial State Preparation for strongly correlated fermionic systems, a critical bottleneck for fault-tolerant quantum simulation. Focusing on nuclear shell model…
We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function. Unlike existing approaches, our method does not require handcrafted reversible arithmetic circuits, or quantum table reads, to…
Many quantum states arising in algorithms and physical systems occupy only a small, structured subset of the exponentially large Hilbert space, yet standard quantum state tomography fails to exploit this structure. We present an efficient…