Related papers: Bang-bang algorithms for quantum many-body ground …
Neural Quantum States (NQS) have demonstrated significant potential in approximating ground states of many-body quantum systems, though their performance can be inconsistent across different models. This study investigates the performance…
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…
Near-term quantum computers provide a promising platform for finding ground states of quantum systems, which is an essential task in physics, chemistry, and materials science. Near-term approaches, however, are constrained by the effects of…
Quantum simulations of molecular systems on quantum computers often employ minimal basis sets of Gaussian orbitals. In comparison with more realistic basis sets, quantum simulations employing minimal basis sets require fewer qubits and…
Solving quantum many-body systems is one of the most significant regimes where quantum computing applies. Currently, as a hardware-friendly computational paradigms, variational algorithms are often used for finding the ground energy of…
Quantum state tomography is an essential tool for the characterization and verification of quantum states. However, as it cannot be directly applied to systems with more than a few qubits, efficient tomography of larger states on mid-sized…
We introduce a quantum approximate optimization algorithm (QAOA) for continuous optimization. The algorithm is based on the dynamics of a quantum system moving in an energy potential which encodes the objective function. By approximating…
Quantum algorithms on the noisy intermediate-scale quantum (NISQ) devices are expected to simulate quantum systems that are classically intractable to demonstrate quantum advantages. However, the non-negligible gate error on the NISQ…
Most non-relativistic interacting quantum many-body systems, such as atomic and molecular ensembles or materials, are naturally described in terms of continuous-space Hamiltonians. The simulation of their ground-state properties on digital…
Understanding quantum phase transitions in physical systems is fundamental to characterize their behavior at low temperatures. Achieving this requires both accessing good approximations to the ground state and identifying order parameters…
Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we consider the application of quantum computers to scientific computing and…
Quantum dynamics can be analyzed via the structure of energy eigenstates. However, in the many-body setting, preparing eigenstates associated with finite temperatures requires time scaling exponentially with system size. In this work we…
Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating…
The Quantum Approximate Optimisation Algorithm (QAOA) is a hybrid quantum-classical algorithm for solving combinatorial optimisation problems. QAOA encodes solutions into the ground state of a Hamiltonian, approximated by a $p$-level…
We propose an environment recycling scheme to speed up a class of tensor network algorithms that produce an approximation to the ground state of a local Hamiltonian by simulating an evolution in imaginary time. Specifically, we consider the…
A generic method to investigate many-body continuous-variable systems is pedagogically presented. It is based on the notion of matrix product states (so-called MPS) and the algorithms thereof. The method is quite versatile and can be…
A prerequisite to the successful development of quantum computers and simulators is precise understanding of physical processes occurring therein, which can be achieved by measuring the quantum states they produce. However, the resources…
For any local Hamiltonian H, I construct a local CPT map and stopping condition which converges to the ground state subspace of H. Like any ground state preparation algorithm, this algorithm necessarily has exponential run-time in general…
We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state $\vert x \rangle$ that is proportional to the solution of the system of linear equations $A…
The exact ground state of a strongly interacting quantum many-body system can be obtained by evolving a trial state with finite overlap with the ground state to infinite imaginary time. In this work, we use a newly discovered fourth order…