Related papers: Entropy scaling and simulability by Matrix Product…
Efficient encoding of classical information plays a fundamental role in numerous practical quantum algorithms. However, the preparation of an arbitrary amplitude-encoded state has been proven to be time-consuming, and its deployment on…
Clifford circuits Augmented Matrix Product States (CAMPS) was recently proposed to leverage the advantages of both Clifford circuits and Matrix Product States (MPS). Clifford circuits can support large entanglement and can be efficiently…
Physical interactions in quantum many-body systems are typically local: Individual constituents interact mainly with their few nearest neighbors. This locality of interactions is inherited by a decay of correlation functions, but also…
The Von Neumann entropy of reduced states is a measure of bipartite entanglement. Despite its name, the entanglement entropy cannot by itself be used as a resource for creating thermodynamic heat flows. In order to extract heat from an…
This paper introduces a Heisenberg picture approach to Matrix Product States (MPS), offering a rigorous yet intuitive framework to explore their structure and classification. MPS efficiently represent ground states of quantum many-body…
Modeling open quantum systems -- quantum systems coupled to a bath -- is of value in condensed matter theory, cavity quantum electrodynamics, nanosciences and biophysics. The real-time simulation of open quantum systems was advanced…
Efficiency of time-evolution of quantum observables, and thermal states of quenched hamiltonians, is studied using time-dependent density matrix renormalization group method in a family of generic quantum spin chains which undergo a…
Given a large real symmetric, positive semidefinite m-by-m matrix, the goal of this paper is to show how a numerical approximation of the entropy, given by the sum of the entropies of the individual eigenvalues, can be computed in an…
Recently, we introduced a solution to the quantum marginal problem relevant to two-dimensional quantum many-body systems [I. H. Kim, Phys. Rev. X, 11, 021039]. One of the conditions was that the marginals are internally translationally…
Simulating quantum many-body systems (QMBS) is one of the long-standing, highly non-trivial challenges in condensed matter physics and quantum information due to the exponentially growing size of the system's Hilbert space. To date, tensor…
In this work, we investigate the universal representation capacity of the Matrix Product States (MPS) from the perspective of boolean functions and continuous functions. We show that MPS can accurately realize arbitrary boolean functions by…
It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones. Perfect quantum computers are unarguably…
We explore the relation between the von Neumann entropy and the Renyi entropies of integer orders for shift-invariant quasi-free Fermionic lattice systems. We investigate approximating the von Neumann entropy by a combination of…
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…
Consider an arbitrary local quantum field theory with a gap or an arbitrary gapless free theory. We consider states in such a theory, that describe two entangled particles localized in disjoint regions of space. We show that in such a…
Variational optimization of neural-network representations of quantum states has been successfully applied to solve interacting fermionic problems. Despite rapid developments, significant scalability challenges arise when considering…
Quantum computing is finding promising applications in optimization, machine learning and physics, leading to the development of various models for representing quantum information. Because these representations are often studied in…
The study of conditional $q$-entropies in composite quantum systems has recently been the focus of considerable interest, particularly in connection with the problem of separability. The $q$-entropies depend on the density matrix $\rho$…
It is observed that the entropy reduction (the information gain in the initial terminology) of an efficient (ideal or pure) quantum measurement coincides with the generalized quantum mutual information of a q-c channel mapping an a priori…
Evaluating quantum algorithms at utility-scale - involving more than 100 qubits - is a key step toward advancing real-world applications of quantum computing. In this study, we benchmark seven state-of-the-art quantum emulators employing…