Related papers: Holographic quantum algorithms for simulating corr…
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hubbard ground state for large instances may be beyond the…
Multimode Gaussian states are a versatile resource for quantum information technologies and have been realized across a wide range of physical platforms. Recent progress in the large-scale generation of such states provides a key ingredient…
Solving the electronic Schrodinger equation for strongly correlated ground states is a long-standing challenge. We present quantum algorithms for the variational optimization of wavefunctions correlated by products of unitary operators,…
One-way quantum computing achieves the full power of quantum computation by performing single particle measurements on some many-body entangled state, known as the resource state. As single particle measurements are relatively easy to…
Under suitable assumptions, the algorithms in [Lin, Tong, Quantum 2020] can estimate the ground state energy and prepare the ground state of a quantum Hamiltonian with near-optimal query complexities. However, this is based on a block…
Within the framework of imaginary-time evolution for matrix product states, we introduce a cluster version of the infinite time-evolving block decimation algorithm for simulating quantum many-body systems, addressing the computational…
The procedure for simulating the nuclear magnetic resonance spectrum linked to the spin system of a molecule for a certain nucleus entails diagonalizing the associated Hamiltonian matrix. As the dimensions of said matrix grow exponentially…
A new basis adaptive algorithm for hybrid quantum-classical platforms is introduced to efficiently find the ground-state (gs) properties of quantum many-body systems. The method addresses limitations of many algorithms, such as Variational…
Quantum-mechanical correlations of interacting fermions result in the emergence of exotic phases. Magnetic phases naturally arise in the Mott-insulator regime of the Fermi-Hubbard model, where charges are localized and the spin degree of…
In the context of real-space renormalization group methods, we propose a novel scheme for quantum systems defined on a D-dimensional lattice. It is based on a coarse-graining transformation that attempts to reduce the amount of entanglement…
The fundamental question of how to best simulate quantum systems using conventional computational resources lies at the forefront of condensed matter and quantum computation. It impacts both our understanding of quantum materials and our…
Quantum computation offers significant potential for accelerating the simulation of molecules and materials through algorithms such as quantum phase estimation (QPE). However, the expected speedup in ground-state energy estimation depends…
Quantum-classical hybrid algorithms are emerging as promising candidates for near-term practical applications of quantum information processors in a wide variety of fields ranging from chemistry to physics and materials science. We report…
Considering recent advancements and successes in the development of efficient quantum algorithms for electronic structure calculations --- alongside impressive results using machine learning techniques for computation --- hybridizing…
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…
A new method of preparing the pseudo-pure state of a spin system for quantum computation in liquid nuclear magnetic resonance (NMR) was put forward and demonstrated experimentally. Applying appropriately connected line-selective pulses…
Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy…
We study a matrix product state (MPS) algorithm to approximate excited states of translationally invariant quantum spin systems with periodic boundary conditions. By means of a momentum eigenstate ansatz generalizing the one of \"Ostlund…
Ground-state properties are central to our understanding of quantum many-body systems. At first glance, it seems natural and essential to obtain the ground state before analyzing its properties; however, its exponentially large Hilbert…
The field of quantum computing has grown fast in recent years, both in theoretical advancements and the practical construction of quantum computers. These computers were initially proposed, among other reasons, to efficiently simulate and…