Related papers: Improve Variational Quantum Eigensolver by Many-Bo…
Quantum computation represents an emerging framework to solve lattice gauge theories (LGT) with arbitrary gauge groups, a general and long-standing problem in computational physics. While quantum computers may encode LGT using only…
Variational quantum algorithms (VQAs) promise near-term quantum advantage, yet parametrized quantum states commonly built from the digital gate-based approach often suffer from scalability issues such as barren plateaus, where the loss…
Accelerating quantum dynamical simulations with quantum computing has received considerable attention but remains a significant challenge. In variational quantum algorithms for quantum dynamics, designing an expressive and shallow-depth…
We suggest an iterative quantum protocol, allowing to solve optimization problems with a glassy energy landscape. It is based on a periodic cycling around the tricritical point of the many-body localization transition. This ensures that…
In experimentally realistic situations, quantum systems are never perfectly isolated and the coupling to their environment needs to be taken into account. Often, the effect of the environment can be well approximated by a Markovian master…
Quantum many-body systems with sufficiently strong disorder can exhibit a non-equilibrium phenomenon, known as the many-body localization (MBL), which is distinct from conventional thermalization. While the MBL regime has been extensively…
The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to…
Characterizing nonequilibrium dynamics in quantum many-body systems is a challenging frontier of physics. In this Letter, we systematically construct solvable nonintegrable quantum circuits that exhibit exact hidden Markovian subsystem…
The nature of the dynamical quantum phase transition between the many-body localized (MBL) phase and the thermal phase remains an open question, and one line of attack on this problem is to explore this transition numerically in finite-size…
We present a novel quantum algorithm for approximating the ground-state in quantum many-body systems, particularly suited for Noisy Intermediate-Scale Quantum (NISQ) devices. Our approach integrates Variational Quantum Eigensolvers (VQE)…
The Variational Quantum Eigensolver (VQE) is a promising tool for simulating ground states of quantum many-body systems on noisy quantum computers. Its effectiveness relies heavily on the ansatz, which must be both hardware-efficient for…
This work studies the variational quantum eigensolver algorithm, designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware. Methods of reducing the number of required qubit…
In this study, we utilize the many-body expansion (MBE) framework to decompose electronic structures into fragments by incrementing the virtual orbitals. Our work aims to accurately solve the ground and excited state energies of each…
We present and analyze large-scale simulation results of a hybrid quantum-classical variational method to calculate the ground state energy of the anti-ferromagnetic Heisenberg model. Using a massively parallel universal quantum computer…
Ground state preparation is classically intractable for general Hamiltonians. On quantum devices, shallow parameterized circuits can be effectively trained to obtain short-range entangled states under the paradigm of variational quantum…
We discuss how quantum jumps affect localized regimes in driven-dissipative disordered many-body systems featuring a localization transition. We introduce a deformation of the Lindblad master equation that interpolates between the standard…
Variational Quantum Algorithms (VQAs) have received considerable attention due to their potential for achieving near-term quantum advantage. However, more work is needed to understand their scalability. One known scaling result for VQAs is…
The Variational Quantum Eigensolver (VQE) is a fundamental algorithm in quantum computing, yet a coherent geometric characterization of VQE remains missing due to fragmented analyses across fixed-ansatz and adaptive-circuit formulations. In…
Variational quantum algorithms (VQAs) are widely applied in the noisy intermediate-scale quantum era and are expected to demonstrate quantum advantage. However, training VQAs faces difficulties, one of which is the so-called barren plateaus…
The emerging field of quantum simulation of many-body systems is widely recognized as a very important application of quantum computing. A crucial step towards its realization in the context of many-electron systems requires a rigorous…