Related papers: Local minima in quantum systems
Quantum computing provides a new way for approaching problem solving, enabling efficient solutions for problems that are hard on classical computers. It is based on leveraging how quantum particles behave. With researchers around the world…
Designing cooling protocols is believed to require knowledge of the system spectrum. In contrast, cooling in nature occurs whenever the system is coupled to a cold bath. How does nature know how to cool? A natural cold bath can be mimicked…
Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this…
We propose a quantum algorithm to obtain the lowest eigenstate of any Hamiltonian simulated by a quantum computer. The proposed algorithm begins with an arbitrary initial state of the simulated system. A finite series of transforms is…
Predicting observables in equilibrium states is a central yet notoriously hard question in quantum many-body systems. In the physically relevant thermodynamic limit, certain mathematical formulations of this task have even been shown to…
The locality of thermal quantum states has emerged as a key input for applications to thermalization, response theory, and efficient simulability. Locality is either captured by the decay of correlations or by local indistinguishability,…
The simulation of low-temperature properties of many-body systems remains one of the major challenges in theoretical and experimental quantum information science. We present, and demonstrate experimentally, a universal cooling method which…
We consider the problem of finding the energy minimum of a complex quantum Hamiltonian by employing a non-Markovian bath prepared in a low energy state. The energy minimization problem is thus turned into a thermodynamic cooling protocol in…
The computational complexity of simulating quantum many-body systems generally scales exponentially with the number of particles. This enormous computational cost prohibits first principles simulations of many important problems throughout…
Many-body fermionic quantum calculations performed on analog quantum computers are restricted by the presence of k-local terms, which represent interactions among more than two qubits. These originate from the fermion-to-qubit mapping…
Variational Quantum Algorithms have emerged as a leading paradigm for near-term quantum computation. In such algorithms, a parameterized quantum circuit is controlled via a classical optimization method that seeks to minimize a…
We introduce a type of quantum dissipation -- local quantum friction -- by adding to the Hamiltonian a local potential that breaks time-reversal invariance so as to cool the system. Unlike the Kossakowski-Lindblad master equation, local…
Determining properties of ground states of spin Hamiltonians remains a topic of central relevance connecting disciplines of mathematical, theoretical and applied physics. In the last few decades, ground state properties of physical systems…
The quantum-classical correspondence between local minima on the classical energy landscape and excited eigenstates in the energy spectrum is studied within the context of many-body quantum spin systems. In mean-field approximations of a…
The low-temperature physics of quantum many-body systems is largely governed by the structure of their ground states. Minimizing the energy of local interactions, ground states often reflect strong properties of locality such as the area…
The problem of sampling outputs of quantum circuits has been proposed as a candidate for demonstrating a quantum computational advantage (sometimes referred to as quantum "supremacy"). In this work, we investigate whether quantum advantage…
We propose a quantum algorithm, inspired by ADAPT-VQE, to variationally prepare the ground state of a quantum Hamiltonian, with the desirable property that if it fails to find the ground state, it still yields a physically meaningful…
Modularity dissipation identifies how locally-implemented computation entails costs beyond those required by Landauer's bound on thermodynamic computing. We establish a general theorem for efficient local computation, giving the necessary…
The simulation of the dynamics of a system coupled to a low-temperature environment is a promising application of quantum computers to determine ground-state properties of physical systems. However, this approach requires not only the…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…