相关论文: Computational complexity and fundamental limitatio…
We analyze the accuracy and sample complexity of variational Monte Carlo approaches to simulate the dynamics of many-body quantum systems classically. By systematically studying the relevant stochastic estimators, we are able to: (i) prove…
We explore the sign problem in strongly coupled lattice QED with one flavor of Wilson fermions in four dimensions using the fermion bag formulation. We construct rules to compute the weight of a fermion bag and show that even though the…
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…
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…
The sign problem is the fundamental limitation to quantum Monte Carlo simulations of the statistical mechanics of interacting fermions. Determinant quantum Monte Carlo (DQMC) is one of the leading methods to study lattice models such as the…
Quantum nanosystems involve the coupled dynamics of fermions or bosons across multiple scales in space and time. Examples include quantum dots, superconducting or magnetic nanoparticles, molecular wires, and graphene nanoribbons. The number…
We propose a new approach to the fermion sign problem in systems where there is a coupling $U$ such that when it is infinite the fermions are paired into bosons and there is no fermion permutation sign to worry about. We argue that as $U$…
The quantum search problem is an important problem due to the fact that a general NP problem can be solved efficiently by an unsorted quantum search algorithm. Here it has been shown that the quantum search problem could be solved in…
Deriving the time evolution of a distribution of probability (or a probability density matrix) is a problem encountered frequently in a variety of situations: for physical time, it could be a kinetic reaction study, while identifying time…
We present numerically exact continuous-time Quantum Monte Carlo algorithm for fermions with a general non-local in space-time interaction. The new determinantal grand-canonical scheme is based on a stochastic series expansion for the…
Monte Carlo algorithms are barely considered in spin foam quantum gravity. Due to the quantum nature of spin foam amplitudes one cannot readily apply them, and the present sign problem is a threat to convergence and thus efficiency. Yet,…
The Abrikosov fermion representation of the spin-1/2 degree of freedom allows for auxiliary-field quantum Monte Carlo simulations of frustrated spin systems. This approach provides a manifold of equivalent actions over which the negative…
At nonzero quark chemical potential dynamical lattice simulations of QCD are hindered by the sign problem caused by the complex fermion determinant. The severity of the sign problem can be assessed by the average phase of the fermion…
The quantum Monte Carlo (QMC) is one of the most promising many-body electronic structure approaches. It employs stochastic techniques for solving the stationary Schr\" odinger equation and for evaluation of expectation values. The key…
This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts deterministic and probabilistic algorithms, propositions of…
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…
For some models of interacting fermions the known solution to the notorious sign-problem in Monte Carlo (MC) simulations is to work with macroscopic fermionic determinants; the price, however, is a macroscopic scaling of the numerical…
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's…
A two-dimensional lattice hard-core boson system with a small fraction of bosonic or fermionic impurity particles is studied. The impurities have the same hopping and interactions as the dominant bosons and their effects are solely due to…
Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational tasks. NP (nondeterministic-polynomial-time) is a complexity class containing many important but intractable problems like the…