Related papers: Nested Cluster Algorithm for Frustrated Quantum An…
We propose a framework based on the concept of the semigroup to understand the fermion sign problem. By using properties of contraction semigroups, we obtain sufficient conditions for quantum lattice fermion models to be sign-problem-free.…
A quantum algorithm is known that solves an unstructured search problem in a number of iterations of order $\sqrt{d}$, where $d$ is the dimension of the search space, whereas any classical algorithm necessarily scales as $O(d)$. It is shown…
Geometrically frustrated spin-chain compounds such as Ca3Co2O6 exhibit extremely slow relaxation under a changing magnetic field. Consequently, both low-temperature laboratory experiments and Monte Carlo simulations have shown peculiar…
Ab-initio Monte Carlo simulations of strongly-interacting fermionic systems are plagued by the fermion sign problem, making the non-perturbative study of many interesting regimes of dense quantum matter, or of theories of odd numbers of…
We study quantum antiferromagnets on two-dimensional bipartite lattices. We focus on local variations in the properties of the ordered phase which arise due to the presence of inequivalent sites or bonds in the lattice structure, using…
Quantum corrections of the biquadratic interaction in the 1D spin-1/2 frustrated ferromagnetic Heisenberg model are studied. The biquadratic interaction for spin-1/2 chains is eliminated and transformed to the quadratic interaction. Doing a…
We investigate the quantum phases of a frustrated antiferromagnetic Heisenberg spin-1/2 model Hamiltonian on a Kagome-strip chain (KSC), a one-dimensional analogue of the Kagome lattice, and construct its phase diagram in an extended…
This paper discusses the ground state of quantum spins interacting via Heisenberg antiferromagnetic exchange, in two dimensional lattices having several different local environments. In unfrustrated lattices, when a N\'eel type order…
We examine the $S=1/2$ Heisenberg magnet on four three-dimensional lattices - simple-cubic, diamond, pyrochlore, and hyperkagome ones - for ferromagnetic and antiferromagnetic signs of the exchange interaction in order to illustrate the…
There is growing evidence from both experiment and numerical studies that low half-odd integer quantum spins on a kagome lattice with predominant antiferromagnetic near neighbor interactions do not order magnetically or break lattice…
We present variational results for the ground state of the antiferromagnetic quantum Heisenberg model with frustrating next-nearest-neighbour interactions. The trial wave functions employed are of resonating-valence-bond type, elaborated to…
The use of artificial neural networks to represent quantum wave-functions has recently attracted interest as a way to solve complex many-body problems. The potential of these variational parameterizations has been supported by analytical…
Atom-like emitters in solids are promising platforms for quantum sensing and information processing, but inhomogeneities in the emitter fine structure complicate quantum control. We present a framework that leverages this diversity to…
We illustrate the application of Quantum Computing techniques to the investigation of the thermodynamical properties of a simple system, made up of three quantum spins with frustrated pair interactions and affected by a hard sign problem…
In the fermion loop formulation the contributions to the partition function naturally separate into topological equivalence classes with a definite sign. This separation forms the basis for an efficient fermion simulation algorithm using a…
Problems in realization of silicon-based solid-state NMR quantum computer with ensemble addressing to qubits are considered. It is presented the extension of Kane's scheme to ensemble approach version with strip gates. For the…
Quantum phase transition at the saturation field is studied for a class of frustrated quantum antiferromagnets. The considered models include (i) the $J_1$-$J_2$ frustrated square-lattice antiferromagnet with $J_2={1/2}J_1$ and (ii) the…
With the aggressive scaling of VLSI technology, the explosion of layout patterns creates a critical bottleneck for DFM applications like OPC. Pattern clustering is essential to reduce data complexity, yet existing methods struggle with…
Many fascinating systems suffer from a severe (complex action) sign problem preventing us from calculating them with Markov Chain Monte Carlo simulations. One promising method to alleviate the sign problem is the transformation of the…
Quantum computers, with parallel computing and entanglement effects, excel in cryptography analysis and big data processing. However, they are not fully developed yet, and their performance needs further evaluation. Traditional computer…