相关论文: Unraveling Rodeo Algorithm Through the Zeeman Mode…

We provide a protocol for Hamiltonian parameter estimation which relies only on the Zeeman effect. No time-dependent quantities need to be measured, it fully suffices to observe spectral shifts induced by fields applied to local `markers'.…

The required precision to perform quantum simulations beyond the capabilities of classical computers imposes major experimental and theoretical challenges. The key to solving these issues are precise means of characterizing analog quantum…

Identifying an accurate model for the dynamics of a quantum system is a vexing problem that underlies a range of problems in experimental physics and quantum information theory. Recently, a method called quantum Hamiltonian learning has…

Quantum simulation elucidates properties of quantum many-body systems by mapping its Hamiltonian to a better-controlled system. Being less stringent than a universal quantum computer, noisy small- and intermediate-scale quantum simulators…

Learning the structure of the entanglement Hamiltonian (EH) is central to characterizing quantum many-body states in analog quantum simulation. We describe a protocol where spatial deformations of the many-body Hamiltonian, physically…

We investigate the performance and accuracy of digital quantum algorithms for the study of static and dynamic properties of the fermionic Hubbard model at half-filling with next-nearest neighbour hopping terms. We provide quantum circuits…

We show that the subregion entanglement Hamiltonians of excited eigenstates of a quantum many-body system are approximately linear combinations of subregionally (quasi)local approximate conserved quantities, with relative commutation errors…

We present an empirical strategy to determine the Hamiltonian dynamics of a two-qubit system using only initialization and measurement in a single fixed basis. Signal parameters are estimated from measurement data using Bayesian methods…

A quantum eigensolver is designed under a multi-layer cluster mean-field (CMF) algorithm by partitioning a quantum system into spatially-separated clusters. For each cluster, a reduced Hamiltonian is obtained after a partial average over…

We investigate the quantum Zeno effect as a framework for designing and analyzing quantum algorithms for Hamiltonian simulation. We show that frequent projective measurements of an ancilla qubit register can be used to simulate quantum…

We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations (ODEs), which may be generated from partial differential equations in plasma physics. We map a…

We introduce an iterative method to search for time-optimal Hamiltonians that drive a quantum system between two arbitrary, and in general mixed, quantum states. The method is based on the idea of progressively improving the efficiency of…

We describe an algorithm that computes the ground state energy and correlation functions for 2-local Hamiltonians in which interactions between qubits are weak compared to single-qubit terms. The running time of the algorithm is polynomial…

There is widespread interest in calculating the energy spectrum of a Hamiltonian, for example to analyze optical spectra and energy deposition by ions in materials. In this study, we propose a quantum algorithm that samples the set of…

Projective measurements of a single two-level quantum mechanical system (a qubit) evolving under a time-independent Hamiltonian produce a probability distribution that is periodic in the evolution time. The period of this distribution is an…

We propose a quantum algorithm for projecting a quantum system to eigenstates of any Hermitian operator, provided one can access the associated control-unitary evolution for the ancilla and the system, as well as the measurement of the…

Key properties of physical systems can be described by the eigenvalues of matrices that represent the system. Computational algorithms that determine the eigenvalues of these matrices exist, but they generally suffer from a loss of…

Finding eigenstates of a given many-body Hamiltonian is a long-standing challenge due to the perceived computational complexity. Leveraging on the hardware of a quantum computer accommodating the exponential growth of the Hilbert space size…

We show that the general Heisenberg Hamiltonian with non-uniform couplings can be characterised by mapping the entanglement it generates as a function of time. Identification of the Hamiltonian in this way is possible as the coefficients of…

Call a spectrum of Hamiltonian sparse if each eigenvalue can be quickly restored with accuracy $\epsilon$ from its rough approximation in within $\epsilon_1$ by means of some classical algorithm. It is shown how a behavior of system with…