This work uses the Weyl variable and the exact Hermite moments and quantum singular value transformation to treat the polynomial and Fourier components of the potential, resulting in a quantum algorithm efficient for all ranges of wavelengths.
Abstract
One of the main challenges in quantum simulation is the prohibitive cost of computing its solutions in the semi-classical regime, in which the de Broglie wavelength is small compared with the characteristic length scale and the solution is highly oscillatory. This difficulty is overcome by using the Weyl variable, under which the solution is not oscillatory. Furthermore, we use the exact Hermite moments and quantum singular value transformation to treat the polynomial and Fourier components of the potential, resulting in a quantum algorithm efficient for {\it all} ranges of wavelengths. Specifically, it has a {\it polynomial} complexity in spatial dimension, and discretization and query bounds {\it without} negative powers of possibly small wavelength, thus enabling it to capture the correct physical observables even if the spatial grid does not resolve the frequency, hence defying the Nyquist-Shannon sampling theorem.
A quantum algorithm efficient for ranges of wave lengths, with complexity in the spatial dimension and discretization and query bounds containing {\it no} negative powers of the small wavelength, which can capture the correct physical observables even if the spatial grid does not resolve the frequency, hence defying th...
Quantum computing promises to outperform classical computing for certain computational tasks. One of the key concepts underlying this potential is universality. Universality has been extensively studied not only for qubits but also for higher-dimensional quantum systems, such as qutrits and qudits, which span Hilbert s...
This work establishes a framework for the representation of quantum dynamics in molecular and condensed matter systems, designed for execution on topological quantum hardware, by leveraging the non-Abelian braiding statistics of Fibonacci and Ising anyons and the Solovay-Kitaev algorithm to approximate unitary propagat...
A hybrid split-step solver is proposed in which the field is measured, updated classically, and reloaded at every step, with all shots and gates accounted for in a single cost-and-error model.
Zi-Qing Guo, Viraj Dsouza, Alex Khan et al.· 0 citations
This lecture presents the original algorithm for solving a linear system in a quantum setting [Harrow-Hassidim-Lloyd ’09], which combines quantum rejection sampling with eigenvalue estimation, and develops an improved algorithm that approximate matrix inversion in the block encoding framework.
Quantum simulation is a rapidly advancing field poised to revolutionize our understanding of complex quantum systems by harnessing the unique capabilities of quantum computers. In this review, we present a concise overview of key developments in quantum simulation algorithms, with a focus on time-independent digital Ha...
Yue Wang, Wen-Jun Yu, Tian-Feng Feng et al.· Frontiers of Computer Scienc...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.