1.9k citations · 3k across the 38 of their papers we have counts for
39 papers
Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states
Dmitri A. Ivanov
It is known that computing the permanent of the matrix , where is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the bos…
Staggered-flux state for rectangular-lattice spin 1/2 Heisenberg antiferromagnet
N. E. Shaik, B. Dalla Piazza, D. A. Ivanov +1
We investigate the spin-1/2 Heisenberg model on a rectangular lattice, using the Gutzwiller projected variational wave function known as the staggered flux state. Using Monte Carlo…
Complexity of full counting statistics of free quantum particles in product states
Dmitri A. Ivanov, Leonid Gurvits
We study the computational complexity of quantum-mechanical expectation values of single-particle operators in bosonic and fermionic multi-particle product states. Such expectation…
Atomtronics with a spin: statistics of spin transport and non-equilibrium orthogonality catastrophe in cold quantum gases
Jhih-Shih You, Richard Schmidt, Dmitri A. Ivanov +2
We propose to investigate the full counting statistics of nonequilibrium spin transport with an ultracold atomic quantum gas. The setup makes use of the spin control available in a…
Computational complexity of exterior products and multi-particle amplitudes of non-interacting fermions in entangled states
Dmitri A. Ivanov
Noninteracting bosons were proposed to be used for a demonstration of quantum-computing supremacy in a boson-sampling setup. A similar demonstration with fermions would require tha…
Fermionic full counting statistics with smooth boundaries: from discrete particles to bosonization
Dmitri A. Ivanov, Ivan P. Levkivskyi
We revisit the problem of full counting statistics of particles on a segment of a one-dimensional gas of free fermions. Using a combination of analytical and numerical methods, we…