Related papers: Interacting boson problems are QMA-hard
Ab initio path integral Monte Carlo (PIMC) simulations constitute the gold standard for the estimation of a broad range of equilibrium properties of a host of interacting quantum many-body systems spanning conditions from ultracold atoms to…
While universal quantum computers ideally solve problems such as factoring integers exponentially more efficiently than classical machines, the formidable challenges in building such devices motivate the demonstration of simpler,…
The similarity of the commutation relations for bosons and quasibosons (fermion pairs) suggests the possibility that all integral spin particles presently considered to be bosons could be quasibosons. The boson commutation relations for…
We discuss thermodynamic stability of neutral real (quantum) matter from the point of view of a computer experiment at finite, non-zero, temperature. We perform (restricted) path integral Monte Carlo simulations of the two component plasma…
Simulating many-body fermionic systems in conventional qubit-based quantum computers poses significant challenges due to the overheads associated with the encoding of fermionic statistics in qubits, leading to the proposal of native…
Given a specific interacting quantum Hamiltonian in a general spatial dimension, can one access its entanglement properties, such as, the entanglement entropy corresponding to the ground state wavefunction? Even though progress has been…
Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the…
The conventional second-order Path Integral Monte Carlo method is plagued with the sign problem in solving many-fermion systems. This is due to the large number of anti-symmetric free fermion propagators that are needed to extract the…
In this work we solve the sign problem of a frustrated quantum impurity model consisting of three quantum spin-half chains interacting through an anti-ferromagnetic Heisenberg interaction at one end. We first map the model into a repulsive…
The interaction energy of the two-dimensional electron system in the region of fractional quantum Hall effect is considered within the Chern-Simons composite fermion approach. In the limit when Coulomb interaction is very small comparing to…
Quantum field theories describe a wide variety of fundamental phenomena in physics. However, their study often involves cumbersome numerical simulations. Quantum simulators, on the other hand, may outperform classical computational…
We formulate a quantum Monte Carlo (QMC) method for calculating the ground state of many-boson systems. The method is based on a field-theoretical approach, and is closely related to existing fermion auxiliary-field QMC methods which are…
Boson-sampling has been presented as a simplified model for linear optical quantum computing. In the boson-sampling model, Fock states are passed through a linear optics network and sampled via number-resolved photodetection. It has been…
Supersymmetric models are grounded in the intriguing concept of a hypothetical symmetry that relates bosonic and fermionic particles. This symmetry has profound implications, offering valuable extensions to the Standard Model of particle…
Building on recent solutions of the fermion sign problem for specific models we present two continuous-time quantum Monte Carlo methods for efficient simulation of mass-imbalanced Hubbard models on bipartite lattices at half-filling. For…
We compare different versions of a bosonic description for systems of interacting fermions, with particular emphasis on the free energy functional. The bosonic effective action makes the issue of symmetries particularly transparent and we…
Due to the intrinsic complexity of the quantum many-body problem, quantum Monte Carlo algorithms and their corresponding Monte Carlo configurations can be defined in various ways. Configurations corresponding to few Feynman diagrams often…
Recently developed quantum algorithms suggest that in principle, quantum computers can solve problems such as simulation of physical systems more efficiently than classical computers. Much remains to be done to implement these conceptual…
The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the…
We investigate the quantum equation of motion (qEOM), a hybrid quantum-classical algorithm for computing excitation properties of a fermionic many-body system, with a particular emphasis on the strong-coupling regime. The method is designed…