177 citations · 983 across the 32 of their papers we have counts for
32 papers
The Cost of Improving the Precision of the Variational Quantum Eigensolver for Quantum Chemistry
Ivana Miháliková, Matej Pivoluska, Martin Plesch +3
Quantum computing brings a promise of new approaches into computational quantum chemistry. While universal, fault-tolerant quantum computers are still not available, we want to uti…
Pinned QMA: The power of fixing a few qubits in proofs
Daniel Nagaj, Dominik Hangleiter, Jens Eisert +1
What could happen if we pinned a single qubit of a system and fixed it in a particular state? First, we show that this can greatly increase the complexity of static questions -- gr…
Easing the Monte Carlo sign problem
Dominik Hangleiter, Ingo Roth, Daniel Nagaj +1
Quantum Monte Carlo (QMC) methods are the gold standard for studying equilibrium properties of quantum many-body systems -- their phase transitions, ground and thermal state proper…
The pair-flip model: a very entangled translationally invariant spin chain
Libor Caha, Daniel Nagaj
Investigating translationally invariant qudit spin chains with a low local dimension, we ask what is the best possible tradeoff between the scaling of the entanglement entropy of a…
Shorter unentangled proofs for Ground State Connectivity
Libor Caha, Daniel Nagaj, Martin Schwarz
Can one considerably shorten a proof for a quantum problem by using a protocol with a constant number of unentangled provers? We consider a frustration-free variant of the QCMA-com…
The Feynman-Kitaev computer's clock: bias, gaps, idling and pulse tuning
Libor Caha, Zeph Landau, Daniel Nagaj
We present a collection of results about the clock in Feynman's computer construction and Kitaev's Local Hamiltonian problem. First, by analyzing the spectra of quantum walks on a…