Related papers: Overcoming the Matrix-Product-State Encoding Barri…
We show that the formalism of tensor-network states, such as the matrix product states (MPS), can be used as a basis for variational quantum Monte Carlo simulations. Using a stochastic optimization method, we demonstrate the potential of…
Lattice models consisting of high-dimensional local degrees of freedom without global particle-number conservation constitute an important problem class in the field of strongly correlated quantum many-body systems. For instance, they are…
In the era of noisy intermediate scale quantum (NISQ) hardware, digital quantum computers are limited to shallow circuits on the order of a thousand layers due to system noise and qubit decoherence. Thus, every step of a simulation must be…
We introduce and systematically investigate a novel approach combining the Uhlmann gauge bundle with Density Matrix Renormalization Group (DMRG) and Matrix Product State (MPS) techniques to enhance the representation and preservation of…
Out-of-equilibrium dynamics of non-integrable Hamiltonian many-body quantum systems are characterized by highly entangled wave functions. Near-maximal entanglement arises in systems exhibiting thermalization or pre-thermalization, where the…
Quantum machine learning (QML) is a rapidly expanding field that merges the principles of quantum computing with the techniques of machine learning. One of the powerful mathematical frameworks in this domain is tensor networks. These…
Imaginary-time evolution, an important technique in tensor network and quantum Monte Carlo algorithms on classical computers, has recently been adapted to quantum computing. In this study, we focus on probabilistic imaginary-time evolution…
Matrix product state (MPS) offers a framework for encoding classical data into quantum states, enabling the efficient utilization of quantum resources for data representation and processing. This research paper investigates techniques to…
We study the second-order quantum phase-transition of massive real scalar field theory with a quartic interaction ($\phi^4$ theory) in (1+1) dimensions on an infinite spatial lattice using matrix product states (MPS). We introduce and apply…
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…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
We present an extension of the Evolving density matrices on Qubits (E$\rho$OQ) framework that enables efficient fault-tolerant preparation of fermionic quantum states. The original method circumvents state preparation by stochastic…
We present an implementation of an efficient algorithm for the calculation of the spectrum of one-dimensional quantum systems with periodic boundary conditions. This algorithm is based on a matrix product representation for quantum states…
Matrix Product Operators (MPOs) are at the heart of the second-generation Density Matrix Renormalisation Group (DMRG) algorithm formulated in Matrix Product State language. We first summarise the widely known facts on MPO arithmetic and…
Lattice Boltzmann (LB) on quantum devices must reconcile unitary gate evolution with the dissipative \emph{collision} step. In the multiple-relaxation-time (MRT) class, we work in the common setting of \emph{modewise diagonal} moment…
Density matrix exponentiation (DME) is a general procedure that converts an unknown quantum state into the Hamiltonian evolution. This enables state-dependent operations and can reveal nontrivial properties of the state, among other…
A generalization of matrix product states (MPS) is introduced which is suitable for describing interacting quantum systems in two and three dimensions. These scale-renormalized matrix-product states (SR-MPS) are based on a course-graining…
We use the finite-entanglement scaling of infinite matrix product states (iMPS) to explore supposedly infinite order transitions. This universal method may have lower computational costs than finite-size scaling. To this end, we study…
Decoherence-free subspace (DFS) provides a crucial mechanism for passive error mitigation in quantum computation by encoding information within symmetry-protected subspaces of the Hilbert space, which are immune from collective decoherence.…
As quantum computing hardware advances, the need for algorithms that facilitate the loading of classical data into the quantum states of these devices has become increasingly important. This study presents a method for producing scalable…