Related papers: Postponing the orthogonality catastrophe: efficien…
This paper starts by describing the dynamics of the electron-monopole system at both classical and quantum level by a suitable reduction procedure. This suggests, in order to realise the space of states for quantum systems which are…
The fast and faithful preparation of the ground state of quantum systems is a challenging task but crucial for several applications in the realm of quantum-based technologies. Decoherence poses a limit to the maximum time-window allowed to…
Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of…
Recently, Singh and Chandrasekharan showed that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. In a paper by the NuQS collaboration,…
We explore the preparation of specific nuclear states on gate-based quantum hardware using variational algorithms. Large scale classical diagonalization of the nuclear shell model have reached sizes of $10^9 - 10^{10}$ basis states, but are…
Determining ground state energies of quantum systems by hybrid classical/quantum methods has emerged as a promising candidate application for near-term quantum computational resources. Short of large-scale fault-tolerant quantum computers,…
Systems of particles interacting with "stealthy" pair potentials have been shown to possess infinitely degenerate disordered hyperuniform classical ground states with novel physical properties. Previous attempts to sample the infinitely…
Preparing quantum states is a fundamental task in various quantum algorithms. In particular, state preparation in quantum harmonic oscillators (HOs) is crucial for the creation of qudits and the implementation of high-dimensional…
We introduce protocols to prepare many-body quantum states with quantum circuits assisted by local operations and classical communication. We show that by lifting the requirement of exact preparation, one can substantially save resources.…
We provide explicit circuits implementing the Kitaev-Webb algorithm for the preparation of multi-dimensional Gaussian states on quantum computers. While asymptotically efficient due to its polynomial scaling, we find that the circuits…
The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver (VQE) algorithm aims to prepare the ground state of a…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…
The classification of the ground-state phases of complex one-dimensional electronic systems is considered in the context of a fixed-point strategy. Examples are multichain Hubbard models, the Kondo-Heisenberg model, and the one-dimensional…
Preparation of quantum states is of vital importance for performing quantum computations and quantum simulations. In this work, we propose a general framework for preparing ground states of many-body systems by combining the…
State resetting is a fundamental but often overlooked capability of simulators. It supports sample-based planning by allowing resets to previously encountered simulation states, and enables calibration of simulators using real data by…
Various auxiliary-particle approaches to treat electron correlations in many-electron models are analyzed. Applications to copper-oxide layered systems are discussed. The ground-state magnetic phase diagrams are considered within the…
The stabilizer ground state is defined is the lowest energy stabilizer state with respect to a given Hamiltonian. In many cases it is highly degenerate and does not give a unique stabilizer state. We define the optimal stabilizer ground…
We present an efficient protocol leveraging classical computation to support Initial State Preparation for strongly correlated fermionic systems, a critical bottleneck for fault-tolerant quantum simulation. Focusing on nuclear shell model…
Experimental studies of synthetic quantum matter are necessarily restricted to approximate ground states prepared on finite-size quantum simulators. In general, this limits their reliability for strongly correlated systems, for instance, in…
Quantum computing algorithms require that the quantum register be initially present in a superposition state. To achieve this, we consider the practical problem of creating a coherent superposition state of several qubits. Owing to…