Related papers: Efficient Eigenstate Preparation in an Integrable …
Local Hamiltonians of fermionic systems on a lattice can be mapped onto local qubit Hamiltonians. Maintaining the locality of the operators comes at the expense of increasing the Hilbert space with auxiliary degrees of freedom. In order to…
Gaussian states hold a fundamental place in quantum mechanics, quantum information, and quantum computing. Many subfields, including quantum simulation of continuous-variable systems, quantum chemistry, and quantum machine learning, rely on…
We conducted a thorough evaluation of various state-of-the-art strategies to prepare the ground state wavefunction of a system on a quantum computer, specifically within the framework of variational quantum eigensolver (VQE). Despite the…
We investigate the fidelity of the quantum state transfer (QST) of two qubits by means of an arbitrary spin-1/2 network, on a lattice of any dimensionality. Under the assumptions that the network Hamiltonian preserves the magnetization and…
Compared to general quantum states, the sparse states arise more frequently in the field of quantum computation. In this work, we consider the preparation for $n$-qubit sparse quantum states with $s$ non-zero amplitudes and propose two…
The production of quantum states required for use in quantum protocols & technologies is studied by developing the tools to re-engineer a perfect state transfer spin chain so that a separable input excitation is output over multiple sites.…
Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to…
Entanglement is the quintessential quantum phenomenon and a key enabler of quantum algorithms. The ability to faithfully entangle many distinct particles is often used as a benchmark for the quality of hardware and control in a quantum…
The exact number of CNOT and single qubit gates needed to implement a Quantum Algorithm in a given architecture is one of the central problems of Quantum Computation. In this work we study the importance of concise realizations of Partially…
We consider a quantum fully packed loop model on the square lattice with a frustration-free projector Hamiltonian and ring-exchange interactions acting on plaquettes. A boundary Hamiltonian is added to favour domain-wall boundary conditions…
Recently, the one dimensional model of $N$ spins with $S=\frac{1}{2}$ on a circle, interacting with an exchange that falls off with the inverse square of the separation: $H_{\rm ISE} =\sum_{i\neq j} \frac{1}{[\frac{N}{\pi}…
Computing the vacuum and energy spectrum in non-Abelian, interacting lattice gauge theories remains an open challenge, in part because approximating the continuum limit requires large lattices and huge Hilbert spaces. To address this…
The effective spin Hamiltonian is constructed in the framework of the almost half-filled Hubbard model on the Cayley tree by means of functional integral technique with the use of static approximation. The system in the ground state appears…
It is shown that at low densities, quantum dots with few electrons may be mapped onto effective charge-spin models for the low-energy eigenstates. This is justified by defining a lattice model based on a many-electron pocket-state basis in…
In this paper, we show the integrability of spin-1/2 XXZ Heisenberg chain with two arbitrary spin boundary Impurities. By using the fusion method, we generalize it to the spin-1 XXZ chain. Then the eigenvalues of Hamiltonians of these…
We demonstrate that it is possible to construct operators that stabilize the constraint-satisfying subspaces of computational problems in their Ising representations. We provide an explicit recipe to construct unitaries and associated…
The preparation of $n$-qubit quantum states is a cross-cutting subroutine for many quantum algorithms, and the effort to reduce its circuit complexity is a significant challenge. In the literature, the quantum state preparation algorithm by…
Quantum simulators offer the potential to utilize the quantum nature of a physical system to study another physical system. In contrast to conventional simulation, which experiences an exponential increase in computational complexity,…
We propose a method for constructing $\texttt{PREPARE}$ circuits for quantum phase estimation of a molecular Hamiltonian in quantum chemistry by using variational optimization of quantum circuits solely on classical computers. The…
Preparing arbitrary logical states is a central primitive for universal fault-tolerant quantum computation and the cost of encoded-state preparation contributes directly to the overall resource overhead. This makes the synthesis of…