اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum Algorithms for Estimating Physical Quantities using Block-Encodings
369
0
0.0
(
0
)
تأليف
Patrick Rall
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique for the manipulation of arbitrary non-unitary matrices on a quantum computer. We describe how to sketch these quantities via the kernel polynomial method which is a standard strategy in numerical condensed matter physics. These algorithms use amplitude estimation to obtain a quadratic speedup in the accuracy over previous results, can capture any observables and Hamiltonians presented as linear combinations of Pauli matrices, and are modular enough to leverage future advances in Hamiltonian simulation and state preparation.
قيم البحث
اقرأ أيضاً
Despite extensive research efforts, few quantum algorithms for classical optimization demonstrate realizable advantage. The utility of many quantum algorithms is limited by high requisite circuit depth and nonconvex optimization landscapes. We tackle
these challenges to quantum advantage with two new variational quantum algorithms, which utilize multi-basis graph encodings and nonlinear activation functions to outperform existing methods with shallow quantum circuits. Additionally, both algorithms provide a polynomial reduction in measurement complexity and either a factor of two speedup textit{or} a factor of two reduction in quantum resources. Typically, the classical simulation of such algorithms with many qubits is impossible due to the exponential scaling of traditional quantum formalism and the limitations of tensor networks. Nonetheless, the shallow circuits and moderate entanglement of our algorithms, combined with efficient tensor method-based simulation, enable us to successfully optimize the MaxCut of high-connectivity graphs with up to $512$ nodes (qubits) on a single GPU.
Simulation of fermionic many-body systems on a quantum computer requires a suitable encoding of fermionic degrees of freedom into qubits. Here we revisit the Superfast Encoding introduced by Kitaev and one of the authors. This encoding maps a target
fermionic Hamiltonian with two-body interactions on a graph of degree $d$ to a qubit simulator Hamiltonian composed of Pauli operators of weight $O(d)$. A system of $m$ fermi modes gets mapped to $n=O(md)$ qubits. We propose Generalized Superfast Encodings (GSE) which require the same number of qubits as the original one but have more favorable properties. First, we describe a GSE such that the corresponding quantum code corrects any single-qubit error provided that the interaction graph has degree $dge 6$. In contrast, we prove that the original Superfast Encoding lacks the error correction property for $dle 6$. Secondly, we describe a GSE that reduces the Pauli weight of the simulator Hamiltonian from $O(d)$ to $O(log{d})$. The robustness against errors and a simplified structure of the simulator Hamiltonian offered by GSEs can make simulation of fermionic systems within the reach of near-term quantum devices. As an example, we apply the new encoding to the fermionic Hubbard model on a 2D lattice.
We study quantum information properties of a seven-level system realized by a particle in an one-dimensional square-well trap. Features of encodings of seven-level systems in a form of three-qubit or qubit-qutrit systems are discussed. We use the thr
ee-qubit encoding of the system in order to investigate subadditivity and strong subadditivity conditions for the thermal state of the particle. The qubit-qutrit encoding is employed to suggest a single qudit algorithm for calculation of parity of a bit string. Obtained results indicate on the potential resource of multilevel systems for realization of quantum information processing.
Conserved quantities are crucial in quantum physics. Here we discuss a general scenario of Hamiltonians. All the Hamiltonians within this scenario share a common conserved quantity form. For unitary parametrization processes, the characteristic opera
tor of this scenario is analytically provided, as well as the corresponding quantum Fisher information (QFI). As the application of this scenario, we focus on two classes of Hamiltonians: su(2) category and canonical category. Several specific physical systems in these two categories are discussed in detail. Besides, we also calculate an alternative form of QFI in this scenario.
Variational quantum algorithms are a leading candidate for early applications on noisy intermediate-scale quantum computers. These algorithms depend on a classical optimization outer-loop that minimizes some function of a parameterized quantum circui
t. In practice, finite sampling error and gate errors make this a stochastic optimization with unique challenges that must be addressed at the level of the optimizer. The sharp trade-off between precision and sampling time in conjunction with experimental constraints necessitates the development of new optimization strategies to minimize overall wall clock time in this setting. In this work, we introduce two optimization methods and numerically compare their performance with common methods in use today. The methods are surrogate model-based algorithms designed to improve reuse of collected data. They do so by utilizing a least-squares quadratic fit of sampled function values within a moving trusted region to estimate the gradient or a policy gradient. To make fair comparisons between optimization methods, we develop experimentally relevant cost models designed to balance efficiency in testing and accuracy with respect to cloud quantum computing systems. The results here underscore the need to both use relevant cost models and optimize hyperparameters of existing optimization methods for competitive performance. The methods introduced here have several practical advantages in realistic experimental settings, and we have used one of them successfully in a separately published experiment on Googles Sycamore device.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
