Related papers: Efficient preparation of the AKLT State with Measu…
Scalable quantum algorithms for the simulation of quantum many-body systems in thermal equilibrium are important for predicting properties of quantum matter at finite temperatures. Here we describe and benchmark a quantum computing version…
Estimation of physical observables for unknown quantum states is an important problem that underlies a wide range of fields, including quantum information processing, quantum physics, and quantum chemistry. In the context of quantum…
Conventional methods for computing maximum-likelihood estimators (MLE) often converge slowly in practical situations, leading to a search for simplifying methods that rely on additional assumptions for their validity. In this work, we…
In this paper, we explore an efficient online algorithm for quantum state estimation based on a matrix-exponentiated gradient method previously used in the context of machine learning. The state update is governed by a learning rate that…
Numerous methodologies have been proposed to implement imaginary time evolution (ITE) on quantum computers. Among these, variational ITE (VITE) methods for noisy intermediate-scale quantum (NISQ) computers have attracted much attention,…
We study the angular-time evolution that is a parameter-time evolution defined by the entanglement Hamiltonian for the bipartitioned ground state of the Affleck-Kennedy-Lieb-Tasaki (AKLT) chain with the open boundary. In particular, we…
This paper reconsiders the method of adaptive measurement for qubit state preparation developed by Jacobs and shows an alternative scheme that works even under unknown unitary evolution of the state. The key idea is that the measurement is…
We introduce an extension of the time-dependent variational Monte Carlo (tVMC) method that adaptively controls the expressivity of the variational quantum state during the simulation of the dynamics. This adaptive tVMC (atVMC) approach is…
Standing as one of the most significant barriers to reaching quantum advantage, state-preparation fidelities on noisy intermediate-scale quantum processors suffer from quantum-gate errors, which accumulate over time. A potential remedy is…
Quantum computers attract much attention as they promise to outperform their classical counterparts in solving certain type of problems. One of them with practical applications in quantum chemistry is simulation of complex quantum systems.…
We introduce a constructive method for mapping non-unitary dynamics to a weighted set of unitary operations. We utilize this construction to derive a new correspondence between real and imaginary time, which we term Imaginary Time Quantum…
Nuclear lattice effective field theory (NLEFT) is an efficient \textit{ab initio} tool for solving nuclear many-body systems using the imaginary-time projection technique, where the preparation of trial states is essential for substantially…
Quantum state preparation is a fundamental primitive in quantum algorithms for encoding classical data into quantum amplitudes. We compare the cost of preparing general $n$-qubit states with real amplitudes using two common paradigms:…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
Error mitigation has enabled quantum computing applications with over one hundred qubits and deep circuits. The most general error mitigation methods rely on a faithful characterization of the noise channels of the hardware. However,…
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…
Measurement-based quantum computation is different from other approaches for quantum computation, in that everything needs to be done is only local measurement on a certain entangled state. It thus uses entanglement as the resource that…
Quantum state preparation is an important class of quantum algorithms that is employed as a black-box subroutine in many algorithms, or used by itself to generate arbitrary probability distributions. We present a novel state preparation…
We investigate how the stabilizer formalism, in particular highly-entangled stabilizer states, can be used to describe the emergence of many-body shape collectivity from individual constituents, in a symmetry-preserving and classically…
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the…