Given a single copy of an unknown quantum state, the no-cloning theorem limits the amount of information that can be extracted from it. Given a gapped Hamiltonian, in most situations it is impractical to compute properties of its ground state, even though in principle all the information about the ground state is encoded in the Hamiltonian. We show in this Letter that if you know the Hamiltonian of a system and have a single copy of its ground state, you can use a quantum computer to efficiently compute its local properties. Specifically, in this scenario, we give efficient algorithms that copy small subsystems of the state and estimate the full statistics of any local measurement.
Given a single copy of an unknown quantum state, the no-cloning theorem limits the amount of information that can be extracted from it. Given a gapped Hamiltonian, in most situations it is impractical to compute properties of its ground state, even though in principle all the information about the ground state is encoded in the Hamiltonian. We show in this Letter that if you know the Hamiltonian of a system and have a single copy of its ground state, you can use a quantum computer to efficiently compute its local properties. Specifically, in this scenario, we give efficient algorithms that copy small subsystems of the state and estimate the full statistics of any local measurement.
We introduce a simple protocol for measuring properties of a gapped ground state with essentially no disturbance to the state. The required Hamiltonian evolution time scales inversely with the spectral gap and target precision (up to logarithmic factors), which is optimal. For local observables on geometrically local systems, the protocol only requires Hamiltonian evolution on a quasi-local patch of inverse-gap radius. Our results show that gapped ground states are algorithmically readable from a single copy without a recovery or rewinding procedure, which may drastically reduce tomography overhead in certain quantum simulation tasks.
Quantum state tomography is the problem of estimating a given quantum state. Usually, it is required to run the quantum experiment - state preparation, state evolution, measurement - several times to be able to estimate the output quantum state of the experiment, because an exponentially high number of copies of the state is required. In this work, we present an efficient algorithm to estimate with a small but nonzero probability of error the output state of the experiment using a single copy of the state, without knowing the evolution dynamics of the state. It also does not destroy the original state, which can be recovered easily for any further quantum processing. As an example, it is usually required to repeat a quantum image processing experiment many times, since many copies of the state of the output image are needed to extract the information from all its pixels. The information fromNpixels of the image can be inferred from a single run of the image processing experiment in our algorithm, to efficiently estimate the density matrix of the image state.
Modern quantum physics now enables control of quantum systems at the level of individual trajectories, opening a new frontier that links quantum information theory, quantum many-body physics, and quantum thermodynamics, and uncovers novel non-equilibrium phenomena such as deep thermalization and measurement-induced entanglement. However, a central challenge remains: their characterization relies on measuring nonlinear properties of individual quantum states, a task tantamount to fine-grained cloning of a quantum ensemble. Here, the fundamental laws governing the cloning of quantum ensembles are investigated. First, a general no-cloning theorem for arbitrary ensembles is established from an information-theoretic perspective, even assuming multiple copies of the ensemble's purification. It is then shown that this barrier can be unexpectedly circumvented for physical ensembles generated by finite-time evolutions. Nevertheless, these tasks are proven to remain computationally intractable, even when the full circuit description of state preparation is known. This stands in sharp contrast to the conventional no-cloning theorem, which relies on the state being unknown. Together, these results establish new fundamental principles of quantum mechanics, reveal intrinsic trade-offs among sample complexity, computational complexity, and quantum measurements, and highlight the necessity of problem-specific strategies for probing measurement-induced quantum phenomena.
Quantum tomography requires repeated measurements of many copies of the physical system, all prepared by a source in the unknown state. In the limit of very many copies measured, the often-used maximum-likelihood (ML) method for converting the gathered data into an estimate of the state works very well. For smaller data sets, however, it often suffers from problems of rank deficiency in the estimated state. For many systems of relevance for quantum information processing, the preparation of a very large number of copies of the same quantum state is still a technological challenge, which motivates us to look for estimation strategies that perform well even when there is not much data. After reviewing the concept of minimax state estimation, we use minimax ideas to construct a simple estimator for quantum states. We demonstrate that, for the case of tomography of a single qubit, our estimator significantly outperforms the ML estimator for small number of copies of the state measured. Our estimator is always full-rank, and furthermore, has a natural dependence on the number of copies measured, which is missing in the ML estimator.
Ground-state preparation, energy estimation, and property estimation are fundamental tasks in quantum simulation. Existing ground-state preparation algorithms achieve near-optimal complexity using block encodings or controlled Hamiltonian evolution, raising a natural question: is controlled Hamiltonian evolution necessary, or can the same scaling be attained in the weaker access model that provides access to only uncontrolled Hamiltonian evolution? We resolve this question by giving two algorithms that access the input Hamiltonian H only through queries to UH and its inverse UH†, where ∥H∥≤αH and τ=Θ(1/αH). Given an input state with ground-state weight at least η and a spectral gap of H of at least γ, our first algorithm uses fresh copies of the input state and requires O(αH/(γη)) queries to UH and UH†, while our second algorithm uses coherent access to the input-state preparation unitary and its inverse to improve this complexity to O(αH/(γη)). The latter bound matches the known lower bound up to logarithmic factors, showing that algorithms with additional access to controlled Hamiltonian evolution cannot improve the query complexity for ground-state preparation beyond logarithmic factors. Both algorithms are based on a simple mechanism that we call the spectral descent principle, in which the algorithm starts from the input state ∣ψ⟩ and progressively descends through the energy spectrum, moving closer to the ground state until the desired fidelity is reached. We also extend this framework to ground-state property and energy estimation and give explicit complexity guarantees for both tasks.
Shadow tomography addresses the task of efficiently predicting many expectation values of an unknown quantum state from randomized measurements on comparatively few copies. Existing analyses promise large scaling advantages, but the optimal strategies realizing these guarantees are not always known, and the required measurements are potentially challenging to implement on current hardware. We address this gap for Pauli observables by computing optimal sample-complexity parameters and constructing optimal measurement strategies under realistic resource constraints. We focus on memoryless protocols, where each copy is measured only once, and on measurements with bounded interaction range. Our approach reduces the problem to the analysis of graph parameters of the frustration graph encoding the Pauli anticommutation relations. We provide efficient numerical methods for the general case and analytically prove that Clifford measurements are optimal in many situations. This includes all perfect graphs, all single-qubit, all two-qubit measurement scenarios, and more. Applied to Hamiltonian energy estimation, our framework yields constructive strategies and improved variance bounds for molecular benchmarks.