相关论文: Kinetic Factors in Affine Quantization and Their R…
We introduce an exact Monte Carlo approach to the statistics of discrete quantum systems which does not rely on the standard fragmentation of the imaginary time, or any small parameter. The method deals with discrete objects, kinks,…
We introduce an efficient lattice regularization scheme for quantum Monte Carlo calculations of realistic electronic systems. The kinetic term is discretized by a finite difference Laplacian with two mesh sizes, a and a', where a'/a is an…
Quantum computing was so far mainly concerned with discrete problems. Recently, E. Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, which advantages quantum computing can bring…
Quantum Monte Carlo (QMC) methods are one of the most important tools for studying interacting quantum many-body systems. The vast majority of QMC calculations in interacting fermion systems require a constraint to control the sign problem.…
We describe an efficient algorithm to compute forces in quantum Monte Carlo using adjoint algorithmic differentiation. This allows us to apply the space warp coordinate transformation in differential form, and compute all the 3M force…
The nature of the classical canonical phase-space variables for gravity suggests that the associated quantum field operators should obey affine commutation relations rather than canonical commutation relations. Prior to the introduction of…
We simulate the spin-1/2 Heisenberg model with a spatially staggered anisotropy using first principles Monte Carlo method. In particular, the critical exponents $\beta/\nu$ and $\omega$ associated with the quantum phase transition induced…
Quantum Monte Carlo is one of the most promising approaches for dealing with large-scale quantum many-body systems. It has played an extremely important role in understanding strongly correlated physics. However, two fundamental problems,…
Monte Carlo simulations are performed in classical phase space for a one-dimensional quantum harmonic crystal. Symmetrization effects for spinless bosons and fermions are quantified. The algorithm is tested for a range of parameters against…
Quantum Monte Carlo method is applied to fractional quantum Hall systems. The use of the linear programming method enables us to avoid the negative-sign problem in the Quantum Monte Carlo calculations. The formulation of this method and the…
Quantum Monte Carlo methods are used to calculate various ground state properties of charged bosons in two dimensions, throughout the whole density range where the fluid phase is stable. Wigner crystallization is predicted at $r_s\simeq…
We present a continuous-time Monte Carlo method for quantum impurity models, which combines a weak-coupling expansion with an auxiliary-field decomposition. The method is considerably more efficient than Hirsch-Fye and free of time…
When a system undergoes a quantum phase transition, the ground-state wave-function shows a change of nature, which can be monitored using the fidelity concept. We introduce two Quantum Monte Carlo schemes that allow the computation of…
Contemporary scientific studies often rely on the understanding of complex quantum systems via computer simulation. This paper initiates the statistical study of quantum simulation and proposes a Monte Carlo method for estimating…
Quantum annealing is a generic name of quantum algorithms to use quantum-mechanical fluctuations to search for the solution of optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum…
The transformation of a classical system into its quantum counterpart is usually done through the well known procedure of canonical quantization. However, on non-Cartesian domains, or on bounded Cartesian domains, this procedure can be…
Classical mechanics involves position and momentum variables that must be special coordinates chosen to promote to suitable quantum operators. Since classical variables may be broadly chosen, only unique variables should be chosen. We will…
The well-known theory of "rational canonical form of an operator" describes the invariant factors, or elementary divisors, as a complete set of invariants of a similarity class of an operator on a finite-dimensional vector space $\V$ over a…
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. The first one is a hybrid quantum algorithm that, given an efficiently preparable state, computes expectation values in a…
Affine quantum gravity involves (i) affine commutation relations to ensure metric positivity, (ii) a regularized projection operator procedure to accomodate first- and second-class quantum constraints, and (iii) a hard-core interpretation…