Related papers: Augmenting Density Matrix Renormalization Group wi…
In the circuit model, quantum computers rely on the availability of a universal quantum gate set. A particularly intriguing example is a set of two-qubit only gates: matchgates, along with SWAP (the exchange of two qubits). In this paper,…
The Gottesman-Knill theorem holds that operations from the Clifford group, when combined with preparation and detection of qubit states in the computational basis, are insufficient for universal quantum computation. Indeed, any measurement…
Matrix product states (MPS) are a central language for one-dimensional quantum matter and a practical target for near-term quantum simulators and variational algorithms. Yet, while substantial effort has focused on preparing MPS with…
Determining ground state energies of quantum systems by hybrid classical/quantum methods has emerged as a promising candidate application for near-term quantum computational resources. Short of large-scale fault-tolerant quantum computers,…
Learning an unknown quantum process is a central task for validation of the functioning of near-term devices. The task is generally hard, requiring exponentially many measurements if no prior assumptions are made on the process. However, an…
We show how to simulate numerically both the evolution of 1D quantum systems under dissipation as well as in thermal equilibrium. The method applies to both finite and inhomogeneous systems and it is based on two ideas: (a) a representation…
We develop the formalism of fermionic matrix product states (fMPS) and show how irreducible fMPS fall in two different classes, related to the different types of simple $\mathbb{Z}_2$ graded algebras, which are physically distinguished by…
Here we present an efficient and numerically stable procedure for compressing a correlation matrix into a set of local unitary single-particle gates, which leads to a very efficient way of forming the matrix product state (MPS)…
Quantum computing is arguably one of the most revolutionary and disruptive technologies of this century. Due to the ever-increasing number of potential applications as well as the continuing rise in complexity, the development, simulation,…
One learned from Gottesman-Knill theorem that the Clifford model of quantum computing \cite{Clark07} may be generated from a few quantum gates, the Hadamard, Phase and Controlled-Z gates, and efficiently simulated on a classical computer.…
We develop a general framework to calculate the many-body density of states (DOS) of isolated and interacting quantum systems. Based on the generalized coherent state formalism and the Simon-Lieb bounds for a quantum partition function, our…
We present an efficient strategy for controlling a vast range of non-integrable quantum many body one-dimensional systems that can be merged with state-of-the-art tensor network simulation methods like the density Matrix Renormalization…
Time-dependent density matrix renormalization group method with a matrix product ansatz is employed for explicit computation of non-equilibrium steady state density operators of several integrable and non-integrable quantum spin chains,…
Understanding quantum many-body states of correlated electrons is one main theme in modern condensed matter physics. Given that the Fermi-Hubbard model, the prototype of correlated electrons, has been recently realized in ultracold optical…
Understanding the limiting capabilities of classical methods in simulating complex quantum systems is of paramount importance for quantum technologies. Although many advanced approaches have been proposed and recently used to challenge…
We present a new wavefunction ansatz that combines the strengths of spin projection with the language of matrix product states (MPS) and matrix product operators (MPO) as used in the density matrix renormalization group (DMRG).…
Matrix-product states and their continuous analogues are variational classes of states that capture quantum many-body systems or quantum fields with low entanglement; they are at the basis of the density-matrix renormalization group method…
A key challenge for quantum computers is the efficient preparation of many-body entangled states across many qubits. In this work, we demonstrate the preparation of matrix product states (MPS) using a renormalization-group(RG)-based quantum…
We discuss techniques of the density matrix renormalization group and their application to interacting fermion systems in more than one dimension. We show numerical results for equal--time spin--spin and singlet pair field correlation…
Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result…