Related papers: Experimental Determination of Multi-Qubit Ground S…
Mean-field treatment (MFT) is frequently applied to approximately predict the dynamics of quantum optics systems, to simplify the system Hamiltonian through neglecting certain modes that are driven strongly or couple weakly with other…
We formulate a quantum embedding algorithm in real-space for the simultaneous theoretical treatment of nonlocal electronic correlations and disorder, the coherent cellular dynamical mean-field theory (C-CDMFT). This algorithm combines the…
Finding the ground state of complex quantum systems remains a central challenge in many-body physics, quantum chemistry, and combinatorial optimization, due to the exponential growth of the Hilbert-space dimension and the entangled…
We consider the problem of characterizing states of a multipartite quantum system from restricted, quasi-local information, with emphasis on uniquely determined pure states. By leveraging tools from dissipative quantum control theory, we…
Multiple quantum (MQ) NMR methods \cite{Baum} are applied to the analysis of various problems of quantum information processing. It is shown that the two-spin/two-quantum Hamiltonian \cite{Baum} describing MQ NMR dynamics is related to the…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…
Matrix product state has become the algorithm of choice when studying one-dimensional interacting quantum many-body systems, which demonstrates to be able to explore the most relevant portion of the exponentially large quantum Hilbert space…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally out-scaled qubit platforms by orders of magnitude. Room-temperature implementation of CV cluster states has been achieved with…
We describe a semidefinite relaxation method which finds lower bounds to the ground state energy of a quantum Hamiltonian subject to Hermitian linear constraints along with approximations of ground state expectation values. We show that…
Quantum computing offers potential solutions for finding ground states in condensed-matter physics and chemistry. However, achieving effective ground state preparation is also computationally hard for arbitrary Hamiltonians. It is necessary…
We present a quantum-classical hybrid algorithm for calculating the ground state and its energy of the quantum many-body Hamiltonian by proposing an adaptive construction of a quantum state for the quantum-selected configuration interaction…
The mean field (MF) composite Fermion (CF) picture successfully predicts low lying states of fractional quantum Hall systems. This success cannot be attributed to a cancellation between Coulomb and Chern-Simons interactions beyond the mean…
We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for…
Ground state counting plays an important role in several applications in science and engineering, from estimating residual entropy in physical systems, to bounding engineering reliability and solving combinatorial counting problems. While…
In a recent work [D. Malpetti and T. Roscilde, arXiv:1605.04223] we have shown that in quantum many-body systems at finite temperature, two-point correlations can be formally separated into a thermal part, and a quantum part -- and that…
We study a matrix product state (MPS) algorithm to approximate excited states of translationally invariant quantum spin systems with periodic boundary conditions. By means of a momentum eigenstate ansatz generalizing the one of \"Ostlund…
We present a new approach to compute low lying eigenvalues and corresponding eigenvectors for strongly correlated many-body systems. The method was inspired by the so-called Automated Multilevel Sub-structuring Method (AMLS). Originally, it…
A measurement-based quantum computer could consist of a local-gapped Hamiltonian system, whose thermal states --at sufficiently low temperature-- are universal resources for the computation. Initialization of the computer would correspond…
Variational quantum algorithms aim at harnessing the power of noisy intermediate-scale quantum computers, by using a classical optimizer to train a parameterized quantum circuit to solve tractable quantum problems. The variational quantum…