相关论文: Augmenting Density Matrix Renormalization Group wi…
Systems of correlated quantum matter can be a steep challenge to any would-be method of solution. Matrix-product state (MPS)-based methods can describe 1D systems quasiexactly, but often struggle to retain sufficient bipartite entanglement…
In unitary circuit games, two competing parties, an "entangler" and a "disentangler", can induce an entanglement phase transition in a quantum many-body system. The transition occurs at a certain rate at which the disentangler acts. We…
Clifford gates and transformations, which map products of elementary Pauli or Majorana operators to other such products, are foundational in quantum computing, underpinning the stabilizer formalism, error-correcting codes, magic state…
We present a construction of a matrix product state (MPS) that approximates the largest-eigenvalue eigenvector of a transfer matrix T, for the purpose of rapidly performing the infinite system density matrix renormalization group (DMRG)…
We present a method to apply the well-known matrix product state (MPS) formalism to partially separable states in solid state systems. The computational effort of our method is equal to the effort of the standard density matrix…
By combining the continuous matrix product state (cMPS) representation for quantum fields in the continuum with standard optimization techniques for matrix product states (MPS) on the lattice, we obtain an approximation $|\Psi\rangle$,…
Common wisdom says that the entanglement of fermionic systems can be low in the second quantization formalism but is extremely large in the first quantization. Hence Matrix Product State (MPS) methods based on moderate entanglement have…
As quantum devices scale up, many-body quantum gates and algorithms begin to surpass what is possible to simulate classically. Validation methods which rely on such classical simulation, such as process tomography and randomized…
Simulating quantum circuits classically is an important area of research in quantum information, with applications in computational complexity and validation of quantum devices. One of the state-of-the-art simulators, that of Bravyi et al,…
We propose a new scheme to implement the self-consistent optimization of the trial wave-function in constrained path auxiliary field Quantum Monte Carlo (CP-AFQMC) in the framewok of natural orbitals. In this scheme, a new trial…
We apply two ab initio many-body methods based on Gutzwiller wave functions, i.e., correlation matrix renormalization theory (CMRT) and Gutzwiller conjugate gradient minimization (GCGM), to the study of crystalline phases of atomic…
The Density Matrix Renormalization Group (DMRG) method has become a prominent tool for simulating strongly correlated electronic systems characterized by dominant static correlation effects. However, capturing the full scope of electronic…
A way of constructing continuous matrix product states (cMPS) for coupled fields is presented here. The cMPS is a variational \emph{ansatz} for the ground state of quantum field theories in one dimension. Our proposed scheme is based in the…
Wilson's numerical renormalization group (NRG) method for solving quantum impurity models yields a set of energy eigenstates that have the form of matrix product states (MPS). White's density matrix renormalization group (DMRG) for treating…
The Gottesman-Knill theorem says that a stabilizer circuit -- that is, a quantum circuit consisting solely of CNOT, Hadamard, and phase gates -- can be simulated efficiently on a classical computer. This paper improves that theorem in…
The massive Schwinger model is studied, using a density matrix renormalisation group approach to the staggered lattice Hamiltonian version of the model. Lattice sizes up to 256 sites are calculated, and the estimates in the continuum limit…
While general quantum many-body systems require exponential resources to be simulated on a classical computer, systems of non-interacting fermions can be simulated exactly using polynomially scaling resources. Such systems may be of…
Tensor networks, which are originally developed for characterizing complex quantum many-body systems, have recently emerged as a powerful framework for capturing high-dimensional probability distributions with strong physical…
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…
Ground-state preparation is a fundamental task in quantum simulation, because the overlap of the prepared state with the true ground state significantly affects the overall cost of subsequent quantum algorithms. We propose a three-stage…