Related papers: Efficient Eigenstate Preparation in an Integrable …
Quantum data loading plays a central role in quantum algorithms and quantum information processing. Many quantum algorithms hinge on the ability to prepare arbitrary superposition states as a subroutine, with claims of exponential speedups…
Quantum computing holds immense promise for simulating quantum systems, a critical task for advancing our understanding of complex quantum phenomena. One of the primary goals in this domain is to accurately approximate the ground state of…
We present a suite of "holographic" quantum algorithms for efficient ground-state preparation and dynamical evolution of correlated spin-systems, which require far-fewer qubits than the number of spins being simulated. The algorithms…
Highly entangled quantum states are an ingredient in numerous applications in quantum computing. However, preparing these highly entangled quantum states on currently available quantum computers at high fidelity is limited by ubiquitous…
Quantum state preparation plays an equally important role with quantum operations and measurements in quantum information processing. The previous methods of preparing initial state for bulk quantum computation all have inevitable…
The efficient calculation of Hamiltonian spectra, a problem often intractable on classical machines, can find application in many fields, from physics to chemistry. Here, we introduce the concept of an "eigenstate witness" and through it…
In this work, based on the Fredkin spin chain, we introduce a family of spin-$1/2$ many-body Hamiltonians with a three-site interaction featuring a fragmented Hilbert space with coexisting quantum many-body scars. The fragmentation results…
The exploration of neural network quantum states has become widespread in the studies of complicated quantum many-body systems. However, achieving high precision remains challenging due to the exponential growth of Hilbert space size and…
The physics of interacting integer-spin chains has been a topic of intense theoretical interest, particularly in the context of symmetry-protected topological phases. However, there has not been a controllable model system to study this…
We calculate the correlation functions of strings of spin operators for integrable quantum circuits exactly. These observables can be used for calibration of quantum simulation platforms. We use algebraic Bethe Ansatz, in combination with…
Exact solutions of quantum lattice models serve as useful guides for interpreting physical phenomena in condensed matter systems. Prominent examples of integrability appear in one dimension, including the Heisenberg chain, where the Bethe…
We consider a 2D quantum spin model with ring-exchange interaction that has subsystem symmetries associated to conserved magnetization along rows and columns of a square lattice, which implies the conservation of the global dipole moment.…
In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when…
The preparation of Hamiltonian eigenstates is essential for many applications in quantum computing; the efficiency with which this can be done is of key interest. A canonical approach exploits the quantum phase estimation (QPE) algorithm.…
We present a protocol for quantum state transfer and remote state preparation across spin chains which operate in their anti-ferromagnetic mode. The proposed mechanism harnesses the inherent entanglement of the ground state of the strongly…
Quantum simulations are bound to be one of the main applications of near-term quantum computers. Quantum chemistry and condensed matter physics are expected to benefit from these technological developments. Several quantum simulation…
Exploiting inherent symmetries is a common and effective approach to speed up the simulation of quantum systems. However, efficiently accounting for non-Abelian symmetries, such as the $SU(2)$ total-spin symmetry, remains a major challenge.…
Near-term quantum computers will be limited in the number of qubits on which they can process information as well as the depth of the circuits that they can coherently carry out. To-date, experimental demonstrations of algorithms such as…
We demonstrate coherent manipulation of the nuclear degrees of freedom of ultracold ground-state strontium 87 atoms, thus providing a toolkit for fully exploiting the corresponding large Hilbert space as a quantum resource and for quantum…
We present a deterministic framework for preparing an arbitrary three-qubit pure state. To leverage entanglement structure in the state-preparation task, we classify three-qubit pure states into five types with respect to a $1|2$…