24 January 2007 in Physical Review A
Experimental characterizations of a quantum system involve the measurement of expectation values of observables for a preparable state of the quantum system. Such expectation values can be measured by repeatedly preparing and coupling the system to an apparatus. For this method, the precision of the measured value scales as for repetitions of the experiment. For the problem of estimating the parameter in an evolution , it is possible to achieve precision [the quantum metrology limit; see Giovannetti et al., Phys. Rev. Lett. 96, 010401 (2006)] provided that sufficient information about and its spectrum is available. We consider the more general problem of estimating expectations of operators with minimal prior knowledge of . We give explicit algorithms that approach precision given a bound on the eigenvalues of or on their tail distribution. These algorithms are particularly useful for simulating quantum systems on quantum computers because they enable efficient measurement of observables and correlation functions. Our algorithms are based on a method for efficiently measuring the complex overlap of and , where is an implementable unitary operator. We explicitly consider the issue of confidence levels in measuring observables and overlaps and show that, as expected, confidence levels can be improved exponentially with linear overhead. We further show that the algorithms given here can typically be parallelized with minimal increase in resource usage.
1 December 2019 in New Journal of Physics
We present an efficient method for estimating the eigenvalues of a Hamiltonian H from the expectation values of the evolution operator for various times. For a given quantum state ρ, our method outputs a list of eigenvalue estimates and approximate probabilities. Each probability depends on the support of ρ in those eigenstates of H associated with eigenvalues within an arbitrarily small range. The complexity of our method is polynomial in the inverse of a given precision parameter ϵ, which is the gap between eigenvalue estimates. Unlike the well-known quantum phase estimation algorithm that uses the quantum Fourier transform, our method does not require large ancillary systems, large sequences of controlled operations, or preserving coherence between experiments, and is therefore more attractive for near-term applications. The output of our method can be used to estimate spectral properties of H and other expectation values efficiently, within additive error proportional to ϵ.
4 December 2023 in Physical Review X
We present a quantum algorithm for simulating the classical dynamics of coupled oscillators (e.g., masses coupled by springs). Our approach leverages a mapping between the Schrödinger equation and Newton’s equation for harmonic potentials such that the amplitudes of the evolved quantum state encode the momenta and displacements of the classical oscillators. When individual masses and spring constants can be efficiently queried, and when the initial state can be efficiently prepared, the complexity of our quantum algorithm is polynomial in , almost linear in the evolution time, and sublinear in the sparsity. As an example application, we apply our quantum algorithm to efficiently estimate the kinetic energy of an oscillator at any time. We show that any classical algorithm solving this same problem is inefficient and must make queries to the oracle, and when the oracles are instantiated by efficient quantum circuits, the problem is bounded-error quantum polynomial time complete. Thus, our approach solves a potentially practical application with an exponential speedup over classical computers. Finally, we show that under similar conditions our approach can efficiently simulate more general classical harmonic systems with modes.
18 October 2004 in Physical Review A
Characterizing and quantifying quantum correlations in states of many-particle systems is at the core of a full understanding of phase transitions in matter. In this work, we continue our investigation of the notion of generalized entanglement [Barnum et al., Phys. Rev. A 68, 032308 (2003)] by focusing on a simple Lie-algebraic measure of purity of a quantum state relative to an observable set. For the algebra of local observables on multi-qubit systems, the resulting local purity measure is equivalent to a recently introduced global entanglement measure [Meyer and Wallach, J. Math. Phys. 43, 4273 (2002)]. In the condensed-matter setting, the notion of Lie-algebraic purity is exploited to identify and characterize the quantum phase transitions present in two exactly solvable models, namely the Lipkin-Meshkov-Glick model and the spin- anisotropic model in a transverse magnetic field. For the latter, we argue that a natural fermionic observable set arising after the Jordan-Wigner transformation better characterizes the transition than alternative measures based on qubits. This illustrates the usefulness of going beyond the standard subsystem-based framework while providing a global disorder parameter for this model. Our results show how generalized entanglement leads to useful tools for distinguishing between the ordered and disordered phases in the case of broken symmetry quantum phase transitions. Additional implications and possible extensions of concepts to other systems of interest in condensed-matter physics are also discussed.
27 July 2021 in npj Quantum Information
We study the problem of simulating the dynamics of spin systems when the initial state is supported on a subspace of low energy of a HamiltonianH. This is a central problem in physics with vast applications in many-body systems and beyond, where the interesting physics takes place in the low-energy sector. We analyze error bounds induced by product formulas that approximate the evolution operator and show that these bounds depend on an effective low-energy norm ofH. We find improvements over the best previous complexities of product formulas that apply to the general case, and these improvements are more significant for long evolution times that scale with the system size and/or small approximation errors. To obtain these improvements, we prove exponentially decaying upper bounds on the leakage to high-energy subspaces due to the product formula. Our results provide a path to a systematic study of Hamiltonian simulation at low energies, which will be required to push quantum simulation closer to reality.
20 July 2007 in Physical Review Letters
We present a new approach to study the thermodynamic properties of -dimensional classical systems by reducing the problem to the computation of ground state properties of a -dimensional quantum model. This classical-to-quantum mapping allows us to extend the scope of standard optimization methods by unifying them under a general framework. The quantum annealing method is naturally extended to simulate classical systems at finite temperatures. We derive the rates to assure convergence to the optimal thermodynamic state using the adiabatic theorem of quantum mechanics. For simulated and quantum annealing, we obtain the asymptotic rates of and , for the temperature and magnetic field, respectively. Other annealing strategies are also discussed.