Quantum state transfer on qubit lattices is a crucial step in a panoply of quantum information processing tasks. Understanding its fundamental limits in the presence of practical imperfections remains a pressing open question. In particular, it is unclear how thermal noise in the intermediate ancilla sites impedes transfer. In this work, we derive tight lower bounds on the necessary growth of commutator norms to achieve approximate state transfer. Specializing to 1D power-law systems with thermal ancilla states, we demonstrate that state transfer runtimes depend sensitively on the scaling of temperature with system size, improving logarithmic bounds to algebraic ones. Our work extends previous results on exact state transfer to the qualitatively different and more practically relevant regime of approximate state transfer.
Quantum state transfer on qubit lattices is a crucial step in a panoply of quantum information processing tasks. Understanding its fundamental limits in the presence of practical imperfections remains a pressing open question. In particular, it is unclear how thermal noise in the intermediate ancilla sites impedes transfer. In this work, we derive tight lower bounds on the necessary growth of commutator norms to achieve approximate state transfer. Specializing to 1D power-law systems with thermal ancilla states, we demonstrate that state transfer runtimes depend sensitively on the scaling of temperature with system size, improving logarithmic bounds to algebraic ones. Our work extends previous results on exact state transfer to the qualitatively different and more practically relevant regime of approximate state transfer.
Quantum state transfer is the primitive of transporting an unknown state on one site of a lattice to another. Using power-law interactions, recent state transfer protocols achieve speedup by utilizing the intermediate ancilla sites. However, these protocols require the ancillas to be in a perfectly initialized state, which, due to noise or imperfect control, may not be the case. In this work we introduce the robustness of a state transfer protocol, which quantifies the protocol's tolerance to error in the initial ancilla state. In the Heisenberg picture, state transfer grows operators supported on the final site such that they no longer commute with all operators on the starting site. We prove that this robustness tightly bounds the Schatten p-norms of these commutators between initial and final-site operators. This generalizes the known cases of p=∞ and p=2, which govern completely state-dependent and state-independent state transfer respectively, demonstrating that intermediate values of p govern partially state-dependent state transfer. In conjunction with existing power-law light cones, our result gives new minimum runtimes for partially state-dependent protocols which, in certain regimes, are parametrically better than existing bounds. We introduce new robust state transfer protocols, charting the landscape between complete state-dependence and state-independence.
Efficient thermalization of one-dimensional noncommuting Hamiltonians via system-bath interactions with Θ(n) ancilla qubits
We prove rapid convergence of a system-bath interaction algorithm for preparing Gibbs states of one-dimensional noncommuting Hamiltonians at every fixed positive temperature. For a chain of n qudits of local dimension 2q with bounded nearest-neighbor interactions, the algorithm prepares the Gibbs state from any initial state to trace-norm error 0<ε≤1/2 in expected total Hamiltonian evolution time O(n/ε). This improves the previously proved O(n6/ε) bound for single-ancilla system-bath Gibbs samplers, up to logarithmic factors. The proposed algorithm couples 4q−1 resettable bath qubits to each site in parallel and randomizes the interaction time. Our analysis bounds both the one-round approximation error and the stationarity defect of an approximate stationary state in Gibbs-weighted L2 norms, with only linear dependence on the system size. It also uses the dephasing induced by randomized evolution to control the extensive Lamb shift without treating it as a small perturbation of the dissipative dynamics.
Preparing the thermal density matrix ρ β ∝ e − β H corresponding to a given Hamiltonian H is a task of central interest across quantum many-body physics, and is particularly salient when attempting to study it with quantum computers. Although solved in principle by recent constructions of efficiently simulable Lindblad master equations—that provably have ρ β as a steady state [C.-F. Chen , ]—the implementation of these “exact Gibbs samplers” requires large-scale quantum computing resources and is hence challenging in practice on current or even near-term quantum devices. Here, we propose a scheme for approximately simulating an exact Gibbs sampler up to a rigorously bounded error that only requires the (repeated) implementation of three readily available ingredients: (a) analog simulation of H ; (b) strictly local but time-dependent couplings to ancilla qubits; and (c) reset of the ancillas. We give rigorous guarantees on the difference between the fixed point reached by our protocol and the exact thermal state, which only depend on parameters of the protocol and its . The procedure is efficiently implementable on near-term devices if H is local and the mixing time scales mildly with both system size and protocol parameters. While guaranteeing the latter for Hamiltonians of interest remains an important problem for future work, here we lay the groundwork for developing fully efficient thermal state preparation protocols on quantum simulators.
Abstract We present quantitative predictions for quantum simulator experiments on Ising models from trapped ions to Rydberg chains and show how the thermalization, and thus decoherence times, can be controlled by considering common, independent, and end-cap couplings to the bath. We find (i) independent baths enable more rapid thermalization in comparison to a common one; (ii) the thermalization timescale depends strongly on the position in the Ising phase diagram; (iii) for a common bath larger system sizes show a significant slow down in the thermalization process; and (iv) finite-size scaling indicates a subradiance effect slowing thermalization rates toward the infinite spin chain limit. We find it is necessary to treat the full multi-channel Lindblad master equation rather than the commonly used single-channel local Lindblad approximation to make accurate predictions on a classical computer. This method reduces the number of qubits one can practically classical simulate by at least a factor of 4, in turn showing a quantum advantage for such thermalization problems at a factor of 4 smaller qubit number for open quantum systems as opposed to closed ones. Thus, our results encourage open quantum system exploration in noisy intermediate-scale quantum technologies.
Many physical phenomena, including thermalization in open quantum systems and quantum Gibbs sampling, are modeled by Lindbladians approximating a system weakly coupled to a bath. Understanding the convergence speed of these Lindbladians to their steady states is crucial for bounding algorithmic runtimes and thermalization timescales. We study two such families of processes: one characterizing a repeated-interaction Gibbs sampling algorithm, and another modeling open many-body quantum thermalization. We prove that both converge in polynomial time for several non-commuting systems, including high-temperature local lattices, weakly interacting fermions, and 1D spin chains. These results demonstrate that simple dissipative quantum algorithms can prepare complex Gibbs states and that Lindblad dynamics accurately capture thermal relaxation. Our proofs rely on a novel technical result that extrapolates spectral gap lower bounds from quasi-local Lindbladians to the non-local generators governing these dynamics.
Preparing thermal states on a quantum computer can have a variety of applications, from simulating many-body quantum systems to training machine learning models. Variational circuits have been proposed for this task on near-term quantum computers, but several challenges remain, such as finding a scalable cost-function, avoiding the need of purification, and mitigating noise effects. We propose a new algorithm for thermal state preparation that tackles those three challenges by exploiting the noise of quantum circuits. We consider a variational architecture containing a depolarizing channel after each unitary layer, with the ability to directly control the level of noise. We derive a closed-form approximation for the free-energy of such circuit and use it as a cost function for our variational algorithm. By evaluating our method on a variety of Hamiltonians and system sizes, we find several systems for which the thermal state can be approximated with a high fidelity. However, we also show that the ability for our algorithm to learn the thermal state strongly depends on the temperature: while a high fidelity can be obtained for high and low temperatures, we identify a specific range for which the problem becomes more challenging. We hope that this first study on noise-assisted thermal state preparation will inspire future research on exploiting noise in variational algorithms.