An official website of the United States government
In the present work, a relativistic relation that connects the difference of interacting and noninteracting integrated two-particle correlation functions in finite volume to infinite volume scattering phase shift through an integral is derived. We show that the difference of integrated finite volume correlation functions converges rapidly to its infinite volume limit as the size of the periodic box is increased. The fast convergence of our proposed formalism is illustrated by analytic solutions of a contact interaction model, the perturbation theory calculation, and also the Monte Carlo simulation of a complex lattice field theory model. Published by the American Physical Society2024
more »
« less
This content will become publicly available on August 1, 2025
Denoising of imaginary time response functions with Hankel projections
Imaginary-time response functions of finite-temperature quantum systems are often obtained with methods that exhibit stochastic or systematic errors. Reducing these errors comes at a large computational cost—in quantum Monte Carlo simulations, the reduction of noise by a factor of two incurs a simulation cost of a factor of four. In this paper, we relate certain imaginary-time response functions to an inner product on the space of linear operators on Fock space. We then show that data with noise typically does not respect the positive definiteness of its associated Gramian. The Gramian has the structure of a Hankel matrix. As a method for denoising noisy data, we introduce an alternating projection algorithm that finds the closest positive definite Hankel matrix consistent with noisy data. We test our methodology at the example of fermion Green's functions for continuous-time quantum Monte Carlo data and show remarkable improvements of the error, reducing noise by a factor of up to 20 in practical examples. We argue that Hankel projections should be used whenever finite-temperature imaginary-time data of response functions with errors is analyzed, be it in the context of quantum Monte Carlo, quantum computing, or in approximate semianalytic methodologies. Published by the American Physical Society2024
more »
« less
- Award ID(s):
- 2310182
- PAR ID:
- 10538870
- Publisher / Repository:
- American Physical Society
- Date Published:
- Journal Name:
- Physical Review Research
- Volume:
- 6
- Issue:
- 3
- ISSN:
- 2643-1564
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The formalism developed in the preceding papers that connects integrated correlation function of a trapped two-particle system to infinite volume scattering phase shift is further extended to coupled-channel systems in the present work. Using a trapped nonrelativistic two-channel system as an example, a new relation is derived that retains the same structure as in the single channel, and has explicit dependence on the phase shifts in both channels but not on the inelasticity. The relation is illustrated by a exactly solvable coupled-channel quantum mechanical model with contact interactions. It is further validated by path integral Monte Carlo simulation of a quasi-one-dimensional model that can admit general interaction potentials. In all cases, we found rapid convergence to the infinite volume limit as the trap size is increased, even at short times, making it potentially a good candidate to overcome signal-to-noise issues in Monte Carlo applications. Published by the American Physical Society2025more » « less
-
We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this Lindbladian is algorithmic and should not be seen as a specific approximation to some weakly coupled system-bath dynamics in nature. Our algorithm can be implemented using just one ancilla qubit and efficiently simulated on a quantum computer. It can prepare the ground state even when the initial state has zero overlap with the ground state, bypassing the most significant limitation of methods like quantum phase estimation. As a variant, we also propose a discrete-time algorithm, demonstrating even better efficiency and providing a near-optimal simulation cost depending on the desired evolution time and precision. Numerical simulations using Ising and Hubbard models demonstrate the efficacy and applicability of our method. Published by the American Physical Society2024more » « less
-
Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings. Published by the American Physical Society2024more » « less
-
Quantum memory devices with high storage efficiency and bandwidth are essential elements for future quantum networks. Solid-state quantum memories can provide broadband storage, but they primarily suffer from low storage efficiency. We use passive optimization and algorithmic optimization techniques to demonstrate nearly a sixfold enhancement in quantum memory efficiency. In this regime, we demonstrate coherent and single-photon-level storage with a high signal-to-noise ratio. The optimization technique presented here can be applied to most solid-state quantum memories to significantly improve the storage efficiency without compromising the memory bandwidth. Published by the American Physical Society2024more » « less
