相关论文: A simple nearest-neighbor two-body Hamiltonian sys…

We present a simple and stable numerical method to approximate the ground state of a quantum many-body system by multiple determinant states. This method searches these determinant states one by one according to the matching pursuit…

Finding the ground state of a quantum many-body system is a fundamental problem in quantum physics. In this work, we give a classical machine learning (ML) algorithm for predicting ground state properties with an inductive bias encoding…

We estimate the resources required to prepare the ground state of a quantum many-body system on a quantum computer of intermediate size. This estimate is made possible using a combination of quantum many-body methods and analytic upper…

The scattering and bound states of the many-body systems, related to the short-range Dyson model, are studied. First, we show that the scattering states can be realized as coherent states and the scattering Hamiltonian can be connected to a…

We propose a method to construct universal order parameters for quantum phase transitions in many-body lattice systems. The method exploits the $H$-orthogonality of a few near-degenerate lowest states of the Hamiltonian describing a given…

Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…

The quantum many-body bound-state problem in its computationally successful coupled cluster method (CCM) representation is reconsidered. In conventional practice one factorizes the ground-state wave functions $|\Psi\rangle= e^S…

We prove that quantum many-body systems on a one-dimensional lattice locally relax to Gaussian states under non-equilibrium dynamics generated by a bosonic quadratic Hamiltonian. This is true for a large class of initial states - pure or…

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit…

Quantum metrology offers a quadratic advantage over classical approaches to parameter estimation problems by utilizing entanglement and nonclassicality. However, the hurdle of actually implementing the necessary quantum probe states and…

This work explores the use of a tree tensor network ansatz to simulate the ground state of a local Hamiltonian on a two-dimensional lattice. By exploiting the entropic area law, the tree tensor network ansatz seems to produce quasi-exact…

We introduce novel schemes for quantum computing based on local measurements on entangled resource states. This work elaborates on the framework established in [Phys. Rev. Lett. 98, 220503 (2007), quant-ph/0609149]. Our method makes use of…

We present a method to calculate many-body states of interacting carriers in million atom quantum nanostructures based on atomistic tight-binding calculations and a combination of iterative selection of configurations and perturbation…

We present an extensive numerical study of the Sherrington-Kirkpatrick model in transverse field. Recent numerical studies of quantum spin-glasses have focused on exact diagonalization of the full Hamiltonian for small systems ($\approx$ 20…

Determining the energy gap in a quantum many-body system is critical to understanding its behavior and is important in quantum chemistry and condensed matter physics. The challenge of determining the energy gap requires identifying both the…

Quantum complexity is emerging as a key property of many-body systems, including black holes, topological materials, and early quantum computers. A state's complexity quantifies the number of computational gates required to prepare the…

Application of the adiabatic model of quantum computation requires efficient encoding of the solution to computational problems into the lowest eigenstate of a Hamiltonian that supports universal adiabatic quantum computation. Experimental…

We prove that universal quantum computation is possible using only (i) the physically natural measurement on two qubits which distinguishes the singlet from the triplet subspace, and (ii) qubits prepared in almost any three different…

Under suitable assumptions, the algorithms in [Lin, Tong, Quantum 2020] can estimate the ground state energy and prepare the ground state of a quantum Hamiltonian with near-optimal query complexities. However, this is based on a block…

We investigate a Hamiltonian lattice version of the two-dimensional Wess-Zumino model by Quantum Monte Carlo simulations. In order to study the pattern of supersymmetry breaking, we measure the ground state energy and the correlation length…