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.
Transferring the information stored in the expansion coefficients of a multi-qubit state to the coefficients of a continuous-variable state is an important protocol for communicating quantum information. It was shown in previous work how to transfer an n-qubit state to a single qumode in O(2n) time. We show that by transferring this state to m qumodes, the runtime can be improved to O(2n/m). Furthermore, we demonstrate how multi-qumode state transfer can be used as a subroutine for approximately realizing the n-qubits quantum Fourier transform on m-qumode with runtime scaling O(m2n/m/ε+m2), accelerating qubit quantum Fourier transform using qumodes. This work presents a scalable approach to convert discrete and continuous quantum information between an arbitrary number of qubits and qumodes. It represents a crucial step forward in mixed analog-digital quantum signal processing for computing, sensing, and communication.
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.
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.
In this thesis I study optimal strategies to estimate or characterize quantum states and processes (quantum channels). I consider the problem of estimating a phase encoded on a gaussian state. Phase estimation is at the heart of many quantum metrology applications, such as gravitational wave detectors or clock synchronization. I address the problem to the phase estimation fidelity for pure and mixed gaussian states and study how temperature affects the precision of estimation. Although the case of pure states has been studied before, very little is known about estimation in mixed states. The interest in mixed gaussian states relies on the fact that these are the states one has in real experiments with light due to the unavoidable presence of noise. Displaced and squeezed thermal states are studied. For the case of displaced states, I find that fidelity estimation gets worse when the temperature increases. On the contrary, for squeezed thermal states I find the surprising result that a larger temperature yields better estimation. This apparently paradoxical feature, also appears when I derive the estimation accuracy that can be obtained when an asymptotically large number of copies of the state is available. I also study quantum benchmarks that can be applied to a wide variety of protocols, such us quantum storage or quantum teleportation. A very important question in QIT is to know whether a particular quantum protocol can be realized by classical means with the same efficiency. After all, QIT lives from the promise of this quantum advantage. This question becomes specially relevant in experimental (real) implementations of quantum schemes. In real experiments there are always losses and the ideal quantum protocols become imperfect. It is then necessary to assess whether the same experimental result could be obtained by classical (less costly) means. So, for example, in a particular teleportation experiment -which involves generation of entanglement, complicated Bell measurements, fighting decoherence, etc.- one might ask whether one could achieve the same (i.e. mapping the state of a system to a second system located in a different place or time) by measuring the system, transmitting the collected information to the other location, and finally preparing the system accordingly. It is hence of paramount importance to give bounds on the efficiency of these measure and prepare (or entanglement breaking) channels. For this purpose we propose a threshold based on a phase-covariant family of states. Besides of being a family with a straightforward group-theoretical structure, which gives obvious computational advantages, this family is interesting because it can be tested experimentally also in a straightforward way. A crucial feature for the practical use of our benchmark is that it does not require pure (ideal) input states. I finally consider the problem of estimating the parameter of the amplification channel. The amplification channel is interesting by itself but also by the fact that the Hawking-Unruh effect can be formally modeled by it. The Unruh-Hawking effect is a relativistic effect and as such it is hard to measure and detect in current experiments. I investigate whether quantum strategies can provide an improvement over classical protocols in the estimation of the amplification parameter. If the field is inertially prepared in the vacuum one could measure its temperature as detected by a noninertial observer and extract information about the parameter. But I would like to know if the vacuum state is the optimal probe state in an inertial frame for such a task or a better sensitivity could be achieved if the field were in a state of nonzero energy (mean photon number) from an inertial perspective. The aim is to determine the optimal input states, so that, by optimally measuring the output, one can construct an estimator for amplification channel parameter which is unbiased and has the minimum possible variance.